./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_two_p1.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_two_p1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash a615b663b5895b4b891110151ed37d2c5777d9e61c5a340653346e5f4d27eeef --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 22:48:59,539 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 22:48:59,594 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-03-16 22:48:59,598 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 22:48:59,598 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 22:48:59,618 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 22:48:59,619 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 22:48:59,619 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 22:48:59,620 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 22:48:59,620 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 22:48:59,620 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 22:48:59,620 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 22:48:59,621 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 22:48:59,621 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 22:48:59,621 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 22:48:59,621 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 22:48:59,621 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 22:48:59,621 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 22:48:59,622 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 22:48:59,622 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 22:48:59,622 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 22:48:59,622 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 22:48:59,622 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 22:48:59,622 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 22:48:59,622 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 22:48:59,622 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 22:48:59,622 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 22:48:59,622 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 22:48:59,622 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 22:48:59,623 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 22:48:59,623 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 22:48:59,623 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 22:48:59,623 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 22:48:59,623 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 22:48:59,623 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 22:48:59,623 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 22:48:59,624 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 22:48:59,624 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 22:48:59,624 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 22:48:59,624 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 22:48:59,624 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a615b663b5895b4b891110151ed37d2c5777d9e61c5a340653346e5f4d27eeef [2025-03-16 22:48:59,827 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 22:48:59,834 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 22:48:59,836 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 22:48:59,837 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 22:48:59,837 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 22:48:59,839 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_two_p1.c [2025-03-16 22:49:01,032 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/76ea25f66/1ed7cea5e0ed4541ba4fb9ddda7422b1/FLAG12307f7e8 [2025-03-16 22:49:01,392 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 22:49:01,393 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_two_p1.c [2025-03-16 22:49:01,402 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/76ea25f66/1ed7cea5e0ed4541ba4fb9ddda7422b1/FLAG12307f7e8 [2025-03-16 22:49:01,412 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/76ea25f66/1ed7cea5e0ed4541ba4fb9ddda7422b1 [2025-03-16 22:49:01,413 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 22:49:01,414 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 22:49:01,415 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 22:49:01,415 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 22:49:01,418 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 22:49:01,418 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 10:49:01" (1/1) ... [2025-03-16 22:49:01,419 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@51952da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:49:01, skipping insertion in model container [2025-03-16 22:49:01,419 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 10:49:01" (1/1) ... [2025-03-16 22:49:01,451 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 22:49:01,557 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_two_p1.c[1257,1270] [2025-03-16 22:49:01,735 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 22:49:01,742 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 22:49:01,749 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_two_p1.c[1257,1270] [2025-03-16 22:49:01,826 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 22:49:01,836 INFO L204 MainTranslator]: Completed translation [2025-03-16 22:49:01,836 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:49:01 WrapperNode [2025-03-16 22:49:01,837 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 22:49:01,837 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 22:49:01,837 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 22:49:01,837 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 22:49:01,841 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:49:01" (1/1) ... [2025-03-16 22:49:01,870 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:49:01" (1/1) ... [2025-03-16 22:49:02,116 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 2920 [2025-03-16 22:49:02,117 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 22:49:02,118 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 22:49:02,118 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 22:49:02,118 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 22:49:02,124 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:49:01" (1/1) ... [2025-03-16 22:49:02,125 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:49:01" (1/1) ... [2025-03-16 22:49:02,163 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:49:01" (1/1) ... [2025-03-16 22:49:02,250 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-16 22:49:02,250 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:49:01" (1/1) ... [2025-03-16 22:49:02,250 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:49:01" (1/1) ... [2025-03-16 22:49:02,303 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:49:01" (1/1) ... [2025-03-16 22:49:02,315 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:49:01" (1/1) ... [2025-03-16 22:49:02,329 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:49:01" (1/1) ... [2025-03-16 22:49:02,343 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:49:01" (1/1) ... [2025-03-16 22:49:02,382 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 22:49:02,383 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 22:49:02,383 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 22:49:02,384 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 22:49:02,384 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:49:01" (1/1) ... [2025-03-16 22:49:02,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 22:49:02,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 22:49:02,409 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-16 22:49:02,412 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-16 22:49:02,430 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 22:49:02,430 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 22:49:02,430 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 22:49:02,430 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 22:49:02,773 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 22:49:02,774 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 22:49:04,799 INFO L? ?]: Removed 1800 outVars from TransFormulas that were not future-live. [2025-03-16 22:49:04,799 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 22:49:04,908 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 22:49:04,908 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 22:49:04,908 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 10:49:04 BoogieIcfgContainer [2025-03-16 22:49:04,908 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 22:49:04,910 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 22:49:04,910 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 22:49:04,914 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 22:49:04,914 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 10:49:01" (1/3) ... [2025-03-16 22:49:04,914 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a7c66a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 10:49:04, skipping insertion in model container [2025-03-16 22:49:04,915 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:49:01" (2/3) ... [2025-03-16 22:49:04,915 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a7c66a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 10:49:04, skipping insertion in model container [2025-03-16 22:49:04,915 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 10:49:04" (3/3) ... [2025-03-16 22:49:04,916 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vis_arrays_two_p1.c [2025-03-16 22:49:04,928 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 22:49:04,929 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.vis_arrays_two_p1.c that has 1 procedures, 840 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 22:49:04,992 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 22:49:05,001 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@4c404a42, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 22:49:05,002 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 22:49:05,009 INFO L276 IsEmpty]: Start isEmpty. Operand has 840 states, 838 states have (on average 1.5) internal successors, (1257), 839 states have internal predecessors, (1257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:49:05,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-16 22:49:05,015 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:49:05,016 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 22:49:05,016 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:49:05,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:49:05,021 INFO L85 PathProgramCache]: Analyzing trace with hash -342620078, now seen corresponding path program 1 times [2025-03-16 22:49:05,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:49:05,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778942043] [2025-03-16 22:49:05,028 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:49:05,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:49:05,131 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-16 22:49:06,393 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-16 22:49:06,394 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:49:06,394 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:49:07,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:49:07,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:49:07,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778942043] [2025-03-16 22:49:07,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1778942043] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:49:07,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:49:07,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 22:49:07,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728025575] [2025-03-16 22:49:07,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:49:07,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 22:49:07,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:49:07,043 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 22:49:07,043 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 22:49:07,046 INFO L87 Difference]: Start difference. First operand has 840 states, 838 states have (on average 1.5) internal successors, (1257), 839 states have internal predecessors, (1257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:49:07,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:49:07,550 INFO L93 Difference]: Finished difference Result 1639 states and 2455 transitions. [2025-03-16 22:49:07,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 22:49:07,563 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2025-03-16 22:49:07,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:49:07,571 INFO L225 Difference]: With dead ends: 1639 [2025-03-16 22:49:07,571 INFO L226 Difference]: Without dead ends: 840 [2025-03-16 22:49:07,575 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 22:49:07,577 INFO L435 NwaCegarLoop]: 1044 mSDtfsCounter, 0 mSDsluCounter, 2083 mSDsCounter, 0 mSdLazyCounter, 634 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3127 SdHoareTripleChecker+Invalid, 634 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 634 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 22:49:07,577 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3127 Invalid, 634 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 634 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 22:49:07,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 840 states. [2025-03-16 22:49:07,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 840 to 840. [2025-03-16 22:49:07,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 840 states, 839 states have (on average 1.4970202622169249) internal successors, (1256), 839 states have internal predecessors, (1256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:49:07,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 840 states to 840 states and 1256 transitions. [2025-03-16 22:49:07,636 INFO L78 Accepts]: Start accepts. Automaton has 840 states and 1256 transitions. Word has length 58 [2025-03-16 22:49:07,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:49:07,638 INFO L471 AbstractCegarLoop]: Abstraction has 840 states and 1256 transitions. [2025-03-16 22:49:07,638 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:49:07,638 INFO L276 IsEmpty]: Start isEmpty. Operand 840 states and 1256 transitions. [2025-03-16 22:49:07,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-03-16 22:49:07,641 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:49:07,641 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 22:49:07,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 22:49:07,641 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:49:07,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:49:07,642 INFO L85 PathProgramCache]: Analyzing trace with hash -2026607416, now seen corresponding path program 1 times [2025-03-16 22:49:07,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:49:07,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070421594] [2025-03-16 22:49:07,642 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:49:07,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:49:07,682 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-16 22:49:07,720 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-16 22:49:07,721 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:49:07,721 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:49:08,019 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:49:08,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:49:08,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070421594] [2025-03-16 22:49:08,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1070421594] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:49:08,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:49:08,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 22:49:08,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025355814] [2025-03-16 22:49:08,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:49:08,021 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 22:49:08,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:49:08,021 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 22:49:08,021 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 22:49:08,021 INFO L87 Difference]: Start difference. First operand 840 states and 1256 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:49:08,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:49:08,357 INFO L93 Difference]: Finished difference Result 1641 states and 2454 transitions. [2025-03-16 22:49:08,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 22:49:08,357 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2025-03-16 22:49:08,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:49:08,362 INFO L225 Difference]: With dead ends: 1641 [2025-03-16 22:49:08,362 INFO L226 Difference]: Without dead ends: 842 [2025-03-16 22:49:08,364 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 22:49:08,364 INFO L435 NwaCegarLoop]: 1044 mSDtfsCounter, 0 mSDsluCounter, 2080 mSDsCounter, 0 mSdLazyCounter, 637 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3124 SdHoareTripleChecker+Invalid, 637 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 637 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 22:49:08,365 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3124 Invalid, 637 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 637 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 22:49:08,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 842 states. [2025-03-16 22:49:08,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 842 to 842. [2025-03-16 22:49:08,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 842 states, 841 states have (on average 1.4958382877526755) internal successors, (1258), 841 states have internal predecessors, (1258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:49:08,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 842 states to 842 states and 1258 transitions. [2025-03-16 22:49:08,393 INFO L78 Accepts]: Start accepts. Automaton has 842 states and 1258 transitions. Word has length 59 [2025-03-16 22:49:08,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:49:08,393 INFO L471 AbstractCegarLoop]: Abstraction has 842 states and 1258 transitions. [2025-03-16 22:49:08,393 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:49:08,394 INFO L276 IsEmpty]: Start isEmpty. Operand 842 states and 1258 transitions. [2025-03-16 22:49:08,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-03-16 22:49:08,394 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:49:08,394 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 22:49:08,395 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 22:49:08,395 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:49:08,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:49:08,395 INFO L85 PathProgramCache]: Analyzing trace with hash -763777267, now seen corresponding path program 1 times [2025-03-16 22:49:08,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:49:08,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76381278] [2025-03-16 22:49:08,395 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:49:08,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:49:08,443 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-16 22:49:08,771 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-16 22:49:08,772 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:49:08,772 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:49:09,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:49:09,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:49:09,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76381278] [2025-03-16 22:49:09,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [76381278] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:49:09,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:49:09,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 22:49:09,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880580912] [2025-03-16 22:49:09,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:49:09,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 22:49:09,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:49:09,130 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 22:49:09,130 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 22:49:09,130 INFO L87 Difference]: Start difference. First operand 842 states and 1258 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:49:09,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:49:09,487 INFO L93 Difference]: Finished difference Result 1645 states and 2458 transitions. [2025-03-16 22:49:09,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 22:49:09,488 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2025-03-16 22:49:09,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:49:09,492 INFO L225 Difference]: With dead ends: 1645 [2025-03-16 22:49:09,494 INFO L226 Difference]: Without dead ends: 844 [2025-03-16 22:49:09,496 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 22:49:09,496 INFO L435 NwaCegarLoop]: 1044 mSDtfsCounter, 0 mSDsluCounter, 2080 mSDsCounter, 0 mSdLazyCounter, 637 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3124 SdHoareTripleChecker+Invalid, 637 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 637 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 22:49:09,496 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3124 Invalid, 637 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 637 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 22:49:09,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 844 states. [2025-03-16 22:49:09,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 844 to 844. [2025-03-16 22:49:09,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 844 states, 843 states have (on average 1.4946619217081851) internal successors, (1260), 843 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:49:09,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 844 states to 844 states and 1260 transitions. [2025-03-16 22:49:09,514 INFO L78 Accepts]: Start accepts. Automaton has 844 states and 1260 transitions. Word has length 60 [2025-03-16 22:49:09,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:49:09,514 INFO L471 AbstractCegarLoop]: Abstraction has 844 states and 1260 transitions. [2025-03-16 22:49:09,514 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:49:09,514 INFO L276 IsEmpty]: Start isEmpty. Operand 844 states and 1260 transitions. [2025-03-16 22:49:09,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-03-16 22:49:09,519 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:49:09,519 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 22:49:09,519 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 22:49:09,519 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:49:09,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:49:09,520 INFO L85 PathProgramCache]: Analyzing trace with hash -313895027, now seen corresponding path program 1 times [2025-03-16 22:49:09,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:49:09,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891086457] [2025-03-16 22:49:09,520 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:49:09,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:49:09,561 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-16 22:49:09,593 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-16 22:49:09,593 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:49:09,593 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:49:09,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:49:09,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:49:09,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891086457] [2025-03-16 22:49:09,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891086457] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:49:09,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:49:09,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 22:49:09,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768276160] [2025-03-16 22:49:09,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:49:09,828 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 22:49:09,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:49:09,829 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 22:49:09,829 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 22:49:09,829 INFO L87 Difference]: Start difference. First operand 844 states and 1260 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:49:10,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:49:10,204 INFO L93 Difference]: Finished difference Result 1653 states and 2468 transitions. [2025-03-16 22:49:10,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 22:49:10,205 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2025-03-16 22:49:10,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:49:10,208 INFO L225 Difference]: With dead ends: 1653 [2025-03-16 22:49:10,208 INFO L226 Difference]: Without dead ends: 850 [2025-03-16 22:49:10,209 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 22:49:10,209 INFO L435 NwaCegarLoop]: 1043 mSDtfsCounter, 4 mSDsluCounter, 3119 mSDsCounter, 0 mSdLazyCounter, 853 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 4162 SdHoareTripleChecker+Invalid, 853 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 853 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 22:49:10,210 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 4162 Invalid, 853 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 853 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 22:49:10,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 850 states. [2025-03-16 22:49:10,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 850 to 850. [2025-03-16 22:49:10,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 850 states, 849 states have (on average 1.4935217903415783) internal successors, (1268), 849 states have internal predecessors, (1268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:49:10,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 850 states to 850 states and 1268 transitions. [2025-03-16 22:49:10,228 INFO L78 Accepts]: Start accepts. Automaton has 850 states and 1268 transitions. Word has length 61 [2025-03-16 22:49:10,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:49:10,228 INFO L471 AbstractCegarLoop]: Abstraction has 850 states and 1268 transitions. [2025-03-16 22:49:10,229 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:49:10,229 INFO L276 IsEmpty]: Start isEmpty. Operand 850 states and 1268 transitions. [2025-03-16 22:49:10,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-16 22:49:10,229 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:49:10,230 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 22:49:10,230 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 22:49:10,230 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:49:10,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:49:10,230 INFO L85 PathProgramCache]: Analyzing trace with hash -190735421, now seen corresponding path program 1 times [2025-03-16 22:49:10,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:49:10,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213961066] [2025-03-16 22:49:10,231 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:49:10,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:49:10,265 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-16 22:49:10,385 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-16 22:49:10,386 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:49:10,386 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:49:10,926 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:49:10,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:49:10,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213961066] [2025-03-16 22:49:10,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1213961066] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:49:10,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:49:10,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 22:49:10,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142715574] [2025-03-16 22:49:10,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:49:10,927 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 22:49:10,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:49:10,928 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 22:49:10,928 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-16 22:49:10,928 INFO L87 Difference]: Start difference. First operand 850 states and 1268 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 5 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:49:11,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:49:11,405 INFO L93 Difference]: Finished difference Result 1663 states and 2480 transitions. [2025-03-16 22:49:11,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 22:49:11,406 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 5 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2025-03-16 22:49:11,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:49:11,410 INFO L225 Difference]: With dead ends: 1663 [2025-03-16 22:49:11,410 INFO L226 Difference]: Without dead ends: 854 [2025-03-16 22:49:11,411 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-16 22:49:11,411 INFO L435 NwaCegarLoop]: 1041 mSDtfsCounter, 1206 mSDsluCounter, 3110 mSDsCounter, 0 mSdLazyCounter, 864 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1206 SdHoareTripleChecker+Valid, 4151 SdHoareTripleChecker+Invalid, 865 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 864 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 22:49:11,411 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1206 Valid, 4151 Invalid, 865 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 864 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 22:49:11,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 854 states. [2025-03-16 22:49:11,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 854 to 850. [2025-03-16 22:49:11,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 850 states, 849 states have (on average 1.4935217903415783) internal successors, (1268), 849 states have internal predecessors, (1268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:49:11,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 850 states to 850 states and 1268 transitions. [2025-03-16 22:49:11,426 INFO L78 Accepts]: Start accepts. Automaton has 850 states and 1268 transitions. Word has length 62 [2025-03-16 22:49:11,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:49:11,426 INFO L471 AbstractCegarLoop]: Abstraction has 850 states and 1268 transitions. [2025-03-16 22:49:11,426 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 5 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:49:11,426 INFO L276 IsEmpty]: Start isEmpty. Operand 850 states and 1268 transitions. [2025-03-16 22:49:11,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-16 22:49:11,427 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:49:11,427 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 22:49:11,427 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 22:49:11,427 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:49:11,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:49:11,427 INFO L85 PathProgramCache]: Analyzing trace with hash -918032046, now seen corresponding path program 1 times [2025-03-16 22:49:11,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:49:11,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958109186] [2025-03-16 22:49:11,428 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:49:11,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:49:11,466 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-16 22:49:11,488 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-16 22:49:11,489 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:49:11,489 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:49:11,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:49:11,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:49:11,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958109186] [2025-03-16 22:49:11,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1958109186] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:49:11,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:49:11,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 22:49:11,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359780170] [2025-03-16 22:49:11,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:49:11,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 22:49:11,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:49:11,681 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 22:49:11,681 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-16 22:49:11,681 INFO L87 Difference]: Start difference. First operand 850 states and 1268 transitions. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:49:12,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:49:12,088 INFO L93 Difference]: Finished difference Result 1665 states and 2484 transitions. [2025-03-16 22:49:12,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 22:49:12,089 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2025-03-16 22:49:12,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:49:12,092 INFO L225 Difference]: With dead ends: 1665 [2025-03-16 22:49:12,092 INFO L226 Difference]: Without dead ends: 856 [2025-03-16 22:49:12,093 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-16 22:49:12,093 INFO L435 NwaCegarLoop]: 1043 mSDtfsCounter, 4 mSDsluCounter, 3119 mSDsCounter, 0 mSdLazyCounter, 854 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 4162 SdHoareTripleChecker+Invalid, 855 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 854 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 22:49:12,094 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 4162 Invalid, 855 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 854 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 22:49:12,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 856 states. [2025-03-16 22:49:12,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 856 to 856. [2025-03-16 22:49:12,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 856 states, 855 states have (on average 1.4923976608187135) internal successors, (1276), 855 states have internal predecessors, (1276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:49:12,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 856 states to 856 states and 1276 transitions. [2025-03-16 22:49:12,109 INFO L78 Accepts]: Start accepts. Automaton has 856 states and 1276 transitions. Word has length 63 [2025-03-16 22:49:12,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:49:12,109 INFO L471 AbstractCegarLoop]: Abstraction has 856 states and 1276 transitions. [2025-03-16 22:49:12,109 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:49:12,109 INFO L276 IsEmpty]: Start isEmpty. Operand 856 states and 1276 transitions. [2025-03-16 22:49:12,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-16 22:49:12,110 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:49:12,110 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 22:49:12,110 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 22:49:12,110 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:49:12,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:49:12,111 INFO L85 PathProgramCache]: Analyzing trace with hash -1056244674, now seen corresponding path program 1 times [2025-03-16 22:49:12,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:49:12,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483057338] [2025-03-16 22:49:12,111 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:49:12,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:49:12,151 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-16 22:49:12,194 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-16 22:49:12,194 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:49:12,194 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:49:12,416 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:49:12,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:49:12,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483057338] [2025-03-16 22:49:12,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1483057338] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:49:12,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:49:12,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 22:49:12,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078803624] [2025-03-16 22:49:12,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:49:12,417 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 22:49:12,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:49:12,418 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 22:49:12,418 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-16 22:49:12,419 INFO L87 Difference]: Start difference. First operand 856 states and 1276 transitions. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:49:12,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:49:12,811 INFO L93 Difference]: Finished difference Result 1677 states and 2500 transitions. [2025-03-16 22:49:12,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 22:49:12,812 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2025-03-16 22:49:12,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:49:12,815 INFO L225 Difference]: With dead ends: 1677 [2025-03-16 22:49:12,815 INFO L226 Difference]: Without dead ends: 862 [2025-03-16 22:49:12,816 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-16 22:49:12,817 INFO L435 NwaCegarLoop]: 1043 mSDtfsCounter, 4 mSDsluCounter, 3119 mSDsCounter, 0 mSdLazyCounter, 854 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 4162 SdHoareTripleChecker+Invalid, 855 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 854 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 22:49:12,817 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 4162 Invalid, 855 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 854 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 22:49:12,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 862 states. [2025-03-16 22:49:12,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 862 to 862. [2025-03-16 22:49:12,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 862 states, 861 states have (on average 1.4912891986062717) internal successors, (1284), 861 states have internal predecessors, (1284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:49:12,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 862 states to 862 states and 1284 transitions. [2025-03-16 22:49:12,831 INFO L78 Accepts]: Start accepts. Automaton has 862 states and 1284 transitions. Word has length 64 [2025-03-16 22:49:12,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:49:12,831 INFO L471 AbstractCegarLoop]: Abstraction has 862 states and 1284 transitions. [2025-03-16 22:49:12,831 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:49:12,832 INFO L276 IsEmpty]: Start isEmpty. Operand 862 states and 1284 transitions. [2025-03-16 22:49:12,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-16 22:49:12,832 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:49:12,832 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 22:49:12,832 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 22:49:12,832 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:49:12,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:49:12,833 INFO L85 PathProgramCache]: Analyzing trace with hash -1128233892, now seen corresponding path program 1 times [2025-03-16 22:49:12,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:49:12,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590032491] [2025-03-16 22:49:12,834 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:49:12,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:49:12,869 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-16 22:49:12,988 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-16 22:49:12,989 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:49:12,989 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:49:13,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:49:13,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:49:13,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590032491] [2025-03-16 22:49:13,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1590032491] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:49:13,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:49:13,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-16 22:49:13,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701273] [2025-03-16 22:49:13,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:49:13,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-16 22:49:13,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:49:13,260 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-16 22:49:13,260 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-16 22:49:13,260 INFO L87 Difference]: Start difference. First operand 862 states and 1284 transitions. Second operand has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 9 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:49:14,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:49:14,012 INFO L93 Difference]: Finished difference Result 1689 states and 2516 transitions. [2025-03-16 22:49:14,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 22:49:14,013 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 9 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2025-03-16 22:49:14,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:49:14,016 INFO L225 Difference]: With dead ends: 1689 [2025-03-16 22:49:14,016 INFO L226 Difference]: Without dead ends: 868 [2025-03-16 22:49:14,017 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-16 22:49:14,017 INFO L435 NwaCegarLoop]: 1040 mSDtfsCounter, 8 mSDsluCounter, 7256 mSDsCounter, 0 mSdLazyCounter, 1734 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 8296 SdHoareTripleChecker+Invalid, 1737 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1734 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-16 22:49:14,018 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 8296 Invalid, 1737 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1734 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-16 22:49:14,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 868 states. [2025-03-16 22:49:14,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 868 to 868. [2025-03-16 22:49:14,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 868 states, 867 states have (on average 1.4901960784313726) internal successors, (1292), 867 states have internal predecessors, (1292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:49:14,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 868 states to 868 states and 1292 transitions. [2025-03-16 22:49:14,032 INFO L78 Accepts]: Start accepts. Automaton has 868 states and 1292 transitions. Word has length 65 [2025-03-16 22:49:14,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:49:14,032 INFO L471 AbstractCegarLoop]: Abstraction has 868 states and 1292 transitions. [2025-03-16 22:49:14,032 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 9 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:49:14,032 INFO L276 IsEmpty]: Start isEmpty. Operand 868 states and 1292 transitions. [2025-03-16 22:49:14,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-16 22:49:14,033 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:49:14,033 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 22:49:14,033 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 22:49:14,033 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:49:14,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:49:14,034 INFO L85 PathProgramCache]: Analyzing trace with hash -279269196, now seen corresponding path program 1 times [2025-03-16 22:49:14,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:49:14,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494248716] [2025-03-16 22:49:14,034 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:49:14,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:49:14,067 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-16 22:49:14,117 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-16 22:49:14,117 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:49:14,117 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:49:14,267 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:49:14,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:49:14,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494248716] [2025-03-16 22:49:14,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [494248716] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:49:14,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:49:14,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 22:49:14,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141669731] [2025-03-16 22:49:14,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:49:14,269 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 22:49:14,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:49:14,269 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 22:49:14,269 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 22:49:14,270 INFO L87 Difference]: Start difference. First operand 868 states and 1292 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:49:14,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:49:14,634 INFO L93 Difference]: Finished difference Result 1701 states and 2532 transitions. [2025-03-16 22:49:14,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 22:49:14,634 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2025-03-16 22:49:14,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:49:14,637 INFO L225 Difference]: With dead ends: 1701 [2025-03-16 22:49:14,637 INFO L226 Difference]: Without dead ends: 874 [2025-03-16 22:49:14,638 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 22:49:14,639 INFO L435 NwaCegarLoop]: 1043 mSDtfsCounter, 4 mSDsluCounter, 3119 mSDsCounter, 0 mSdLazyCounter, 853 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 4162 SdHoareTripleChecker+Invalid, 853 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 853 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 22:49:14,639 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 4162 Invalid, 853 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 853 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 22:49:14,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 874 states. [2025-03-16 22:49:14,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 874 to 874. [2025-03-16 22:49:14,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 874 states, 873 states have (on average 1.4891179839633448) internal successors, (1300), 873 states have internal predecessors, (1300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:49:14,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 874 states to 874 states and 1300 transitions. [2025-03-16 22:49:14,652 INFO L78 Accepts]: Start accepts. Automaton has 874 states and 1300 transitions. Word has length 66 [2025-03-16 22:49:14,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:49:14,653 INFO L471 AbstractCegarLoop]: Abstraction has 874 states and 1300 transitions. [2025-03-16 22:49:14,653 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:49:14,653 INFO L276 IsEmpty]: Start isEmpty. Operand 874 states and 1300 transitions. [2025-03-16 22:49:14,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-03-16 22:49:14,655 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:49:14,655 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 22:49:14,655 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 22:49:14,655 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:49:14,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:49:14,658 INFO L85 PathProgramCache]: Analyzing trace with hash -156802970, now seen corresponding path program 1 times [2025-03-16 22:49:14,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:49:14,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726289651] [2025-03-16 22:49:14,658 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:49:14,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:49:14,693 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-16 22:49:14,723 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-16 22:49:14,723 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:49:14,723 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:49:14,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:49:14,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:49:14,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726289651] [2025-03-16 22:49:14,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [726289651] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:49:14,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:49:14,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 22:49:14,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494729769] [2025-03-16 22:49:14,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:49:14,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 22:49:14,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:49:14,909 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 22:49:14,909 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 22:49:14,909 INFO L87 Difference]: Start difference. First operand 874 states and 1300 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:49:15,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:49:15,274 INFO L93 Difference]: Finished difference Result 1713 states and 2548 transitions. [2025-03-16 22:49:15,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 22:49:15,275 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2025-03-16 22:49:15,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:49:15,278 INFO L225 Difference]: With dead ends: 1713 [2025-03-16 22:49:15,278 INFO L226 Difference]: Without dead ends: 880 [2025-03-16 22:49:15,279 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 22:49:15,279 INFO L435 NwaCegarLoop]: 1043 mSDtfsCounter, 4 mSDsluCounter, 3119 mSDsCounter, 0 mSdLazyCounter, 853 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 4162 SdHoareTripleChecker+Invalid, 853 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 853 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 22:49:15,279 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 4162 Invalid, 853 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 853 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 22:49:15,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 880 states. [2025-03-16 22:49:15,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 880 to 880. [2025-03-16 22:49:15,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 880 states, 879 states have (on average 1.4880546075085324) internal successors, (1308), 879 states have internal predecessors, (1308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:49:15,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 880 states to 880 states and 1308 transitions. [2025-03-16 22:49:15,292 INFO L78 Accepts]: Start accepts. Automaton has 880 states and 1308 transitions. Word has length 67 [2025-03-16 22:49:15,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:49:15,292 INFO L471 AbstractCegarLoop]: Abstraction has 880 states and 1308 transitions. [2025-03-16 22:49:15,292 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:49:15,292 INFO L276 IsEmpty]: Start isEmpty. Operand 880 states and 1308 transitions. [2025-03-16 22:49:15,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-16 22:49:15,293 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:49:15,293 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 22:49:15,293 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 22:49:15,293 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:49:15,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:49:15,293 INFO L85 PathProgramCache]: Analyzing trace with hash 948595754, now seen corresponding path program 1 times [2025-03-16 22:49:15,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:49:15,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332441128] [2025-03-16 22:49:15,293 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:49:15,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:49:15,325 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-16 22:49:15,438 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-16 22:49:15,438 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:49:15,438 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:49:15,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:49:15,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:49:15,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332441128] [2025-03-16 22:49:15,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [332441128] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:49:15,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:49:15,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 22:49:15,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615734976] [2025-03-16 22:49:15,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:49:15,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 22:49:15,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:49:15,800 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 22:49:15,800 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 22:49:15,800 INFO L87 Difference]: Start difference. First operand 880 states and 1308 transitions. Second operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 4 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:49:16,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:49:16,163 INFO L93 Difference]: Finished difference Result 1721 states and 2558 transitions. [2025-03-16 22:49:16,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 22:49:16,163 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 4 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2025-03-16 22:49:16,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:49:16,166 INFO L225 Difference]: With dead ends: 1721 [2025-03-16 22:49:16,166 INFO L226 Difference]: Without dead ends: 882 [2025-03-16 22:49:16,168 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-16 22:49:16,169 INFO L435 NwaCegarLoop]: 1043 mSDtfsCounter, 1231 mSDsluCounter, 2078 mSDsCounter, 0 mSdLazyCounter, 640 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1231 SdHoareTripleChecker+Valid, 3121 SdHoareTripleChecker+Invalid, 640 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 640 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 22:49:16,169 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1231 Valid, 3121 Invalid, 640 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 640 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 22:49:16,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 882 states. [2025-03-16 22:49:16,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 882 to 882. [2025-03-16 22:49:16,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 882 states, 881 states have (on average 1.4869466515323495) internal successors, (1310), 881 states have internal predecessors, (1310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:49:16,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 882 states to 882 states and 1310 transitions. [2025-03-16 22:49:16,184 INFO L78 Accepts]: Start accepts. Automaton has 882 states and 1310 transitions. Word has length 68 [2025-03-16 22:49:16,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:49:16,184 INFO L471 AbstractCegarLoop]: Abstraction has 882 states and 1310 transitions. [2025-03-16 22:49:16,184 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 4 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:49:16,184 INFO L276 IsEmpty]: Start isEmpty. Operand 882 states and 1310 transitions. [2025-03-16 22:49:16,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-16 22:49:16,185 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:49:16,185 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 22:49:16,185 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-16 22:49:16,185 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:49:16,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:49:16,186 INFO L85 PathProgramCache]: Analyzing trace with hash -1679707701, now seen corresponding path program 1 times [2025-03-16 22:49:16,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:49:16,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112050060] [2025-03-16 22:49:16,186 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:49:16,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:49:16,226 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-16 22:49:16,345 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-16 22:49:16,346 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:49:16,346 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:49:16,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:49:16,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:49:16,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112050060] [2025-03-16 22:49:16,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [112050060] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:49:16,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:49:16,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 22:49:16,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144372335] [2025-03-16 22:49:16,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:49:16,680 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 22:49:16,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:49:16,680 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 22:49:16,680 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-16 22:49:16,681 INFO L87 Difference]: Start difference. First operand 882 states and 1310 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:49:17,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:49:17,113 INFO L93 Difference]: Finished difference Result 1727 states and 2564 transitions. [2025-03-16 22:49:17,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 22:49:17,114 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2025-03-16 22:49:17,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:49:17,116 INFO L225 Difference]: With dead ends: 1727 [2025-03-16 22:49:17,116 INFO L226 Difference]: Without dead ends: 886 [2025-03-16 22:49:17,117 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-16 22:49:17,118 INFO L435 NwaCegarLoop]: 1043 mSDtfsCounter, 1225 mSDsluCounter, 3116 mSDsCounter, 0 mSdLazyCounter, 856 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1225 SdHoareTripleChecker+Valid, 4159 SdHoareTripleChecker+Invalid, 857 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 856 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 22:49:17,118 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1225 Valid, 4159 Invalid, 857 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 856 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 22:49:17,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 886 states. [2025-03-16 22:49:17,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 886 to 882. [2025-03-16 22:49:17,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 882 states, 881 states have (on average 1.4869466515323495) internal successors, (1310), 881 states have internal predecessors, (1310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:49:17,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 882 states to 882 states and 1310 transitions. [2025-03-16 22:49:17,133 INFO L78 Accepts]: Start accepts. Automaton has 882 states and 1310 transitions. Word has length 69 [2025-03-16 22:49:17,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:49:17,133 INFO L471 AbstractCegarLoop]: Abstraction has 882 states and 1310 transitions. [2025-03-16 22:49:17,133 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:49:17,133 INFO L276 IsEmpty]: Start isEmpty. Operand 882 states and 1310 transitions. [2025-03-16 22:49:17,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-16 22:49:17,134 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:49:17,134 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 22:49:17,134 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-16 22:49:17,134 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:49:17,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:49:17,134 INFO L85 PathProgramCache]: Analyzing trace with hash 1849880106, now seen corresponding path program 1 times [2025-03-16 22:49:17,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:49:17,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918890888] [2025-03-16 22:49:17,134 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:49:17,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:49:17,166 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-16 22:49:17,277 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-16 22:49:17,277 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:49:17,278 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:49:17,597 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:49:17,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:49:17,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918890888] [2025-03-16 22:49:17,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [918890888] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:49:17,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:49:17,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 22:49:17,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704382331] [2025-03-16 22:49:17,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:49:17,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 22:49:17,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:49:17,598 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 22:49:17,598 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-16 22:49:17,598 INFO L87 Difference]: Start difference. First operand 882 states and 1310 transitions. Second operand has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 5 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:49:18,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:49:18,033 INFO L93 Difference]: Finished difference Result 1727 states and 2564 transitions. [2025-03-16 22:49:18,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 22:49:18,033 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 5 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2025-03-16 22:49:18,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:49:18,036 INFO L225 Difference]: With dead ends: 1727 [2025-03-16 22:49:18,036 INFO L226 Difference]: Without dead ends: 886 [2025-03-16 22:49:18,037 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-16 22:49:18,037 INFO L435 NwaCegarLoop]: 1043 mSDtfsCounter, 1214 mSDsluCounter, 3116 mSDsCounter, 0 mSdLazyCounter, 856 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1214 SdHoareTripleChecker+Valid, 4159 SdHoareTripleChecker+Invalid, 857 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 856 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 22:49:18,037 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1214 Valid, 4159 Invalid, 857 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 856 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 22:49:18,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 886 states. [2025-03-16 22:49:18,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 886 to 882. [2025-03-16 22:49:18,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 882 states, 881 states have (on average 1.4869466515323495) internal successors, (1310), 881 states have internal predecessors, (1310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:49:18,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 882 states to 882 states and 1310 transitions. [2025-03-16 22:49:18,048 INFO L78 Accepts]: Start accepts. Automaton has 882 states and 1310 transitions. Word has length 70 [2025-03-16 22:49:18,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:49:18,049 INFO L471 AbstractCegarLoop]: Abstraction has 882 states and 1310 transitions. [2025-03-16 22:49:18,049 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 5 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:49:18,049 INFO L276 IsEmpty]: Start isEmpty. Operand 882 states and 1310 transitions. [2025-03-16 22:49:18,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-03-16 22:49:18,049 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:49:18,049 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 22:49:18,050 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-16 22:49:18,050 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:49:18,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:49:18,050 INFO L85 PathProgramCache]: Analyzing trace with hash -1006245461, now seen corresponding path program 1 times [2025-03-16 22:49:18,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:49:18,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556488958] [2025-03-16 22:49:18,050 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:49:18,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:49:18,082 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-16 22:49:18,187 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-16 22:49:18,188 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:49:18,188 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:49:18,502 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:49:18,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:49:18,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556488958] [2025-03-16 22:49:18,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1556488958] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:49:18,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:49:18,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 22:49:18,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965194632] [2025-03-16 22:49:18,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:49:18,503 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 22:49:18,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:49:18,503 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 22:49:18,503 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-16 22:49:18,504 INFO L87 Difference]: Start difference. First operand 882 states and 1310 transitions. Second operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 5 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:49:18,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:49:18,919 INFO L93 Difference]: Finished difference Result 1727 states and 2564 transitions. [2025-03-16 22:49:18,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 22:49:18,919 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 5 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2025-03-16 22:49:18,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:49:18,922 INFO L225 Difference]: With dead ends: 1727 [2025-03-16 22:49:18,922 INFO L226 Difference]: Without dead ends: 886 [2025-03-16 22:49:18,923 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-16 22:49:18,923 INFO L435 NwaCegarLoop]: 1043 mSDtfsCounter, 1219 mSDsluCounter, 3116 mSDsCounter, 0 mSdLazyCounter, 856 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1219 SdHoareTripleChecker+Valid, 4159 SdHoareTripleChecker+Invalid, 857 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 856 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 22:49:18,923 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1219 Valid, 4159 Invalid, 857 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 856 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 22:49:18,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 886 states. [2025-03-16 22:49:18,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 886 to 882. [2025-03-16 22:49:18,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 882 states, 881 states have (on average 1.4869466515323495) internal successors, (1310), 881 states have internal predecessors, (1310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:49:18,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 882 states to 882 states and 1310 transitions. [2025-03-16 22:49:18,934 INFO L78 Accepts]: Start accepts. Automaton has 882 states and 1310 transitions. Word has length 71 [2025-03-16 22:49:18,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:49:18,934 INFO L471 AbstractCegarLoop]: Abstraction has 882 states and 1310 transitions. [2025-03-16 22:49:18,934 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 5 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:49:18,934 INFO L276 IsEmpty]: Start isEmpty. Operand 882 states and 1310 transitions. [2025-03-16 22:49:18,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-03-16 22:49:18,935 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:49:18,935 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 22:49:18,935 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-16 22:49:18,935 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:49:18,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:49:18,935 INFO L85 PathProgramCache]: Analyzing trace with hash -1834268630, now seen corresponding path program 1 times [2025-03-16 22:49:18,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:49:18,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520477582] [2025-03-16 22:49:18,936 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:49:18,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:49:18,966 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-16 22:49:19,095 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-16 22:49:19,095 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:49:19,095 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:49:19,415 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:49:19,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:49:19,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520477582] [2025-03-16 22:49:19,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [520477582] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:49:19,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:49:19,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 22:49:19,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973847768] [2025-03-16 22:49:19,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:49:19,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 22:49:19,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:49:19,416 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 22:49:19,417 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 22:49:19,417 INFO L87 Difference]: Start difference. First operand 882 states and 1310 transitions. Second operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:49:19,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:49:19,765 INFO L93 Difference]: Finished difference Result 1727 states and 2564 transitions. [2025-03-16 22:49:19,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 22:49:19,765 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2025-03-16 22:49:19,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:49:19,768 INFO L225 Difference]: With dead ends: 1727 [2025-03-16 22:49:19,768 INFO L226 Difference]: Without dead ends: 886 [2025-03-16 22:49:19,769 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-16 22:49:19,769 INFO L435 NwaCegarLoop]: 1043 mSDtfsCounter, 1202 mSDsluCounter, 2078 mSDsCounter, 0 mSdLazyCounter, 640 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1202 SdHoareTripleChecker+Valid, 3121 SdHoareTripleChecker+Invalid, 640 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 640 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 22:49:19,770 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1202 Valid, 3121 Invalid, 640 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 640 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 22:49:19,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 886 states. [2025-03-16 22:49:19,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 886 to 882. [2025-03-16 22:49:19,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 882 states, 881 states have (on average 1.4869466515323495) internal successors, (1310), 881 states have internal predecessors, (1310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:49:19,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 882 states to 882 states and 1310 transitions. [2025-03-16 22:49:19,780 INFO L78 Accepts]: Start accepts. Automaton has 882 states and 1310 transitions. Word has length 72 [2025-03-16 22:49:19,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:49:19,781 INFO L471 AbstractCegarLoop]: Abstraction has 882 states and 1310 transitions. [2025-03-16 22:49:19,782 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:49:19,782 INFO L276 IsEmpty]: Start isEmpty. Operand 882 states and 1310 transitions. [2025-03-16 22:49:19,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-03-16 22:49:19,783 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:49:19,783 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 22:49:19,784 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-16 22:49:19,784 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:49:19,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:49:19,784 INFO L85 PathProgramCache]: Analyzing trace with hash 1347189675, now seen corresponding path program 1 times [2025-03-16 22:49:19,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:49:19,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692773829] [2025-03-16 22:49:19,784 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:49:19,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:49:19,818 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-16 22:49:20,041 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-16 22:49:20,041 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:49:20,042 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:49:20,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:49:20,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:49:20,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692773829] [2025-03-16 22:49:20,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [692773829] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:49:20,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:49:20,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 22:49:20,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517471408] [2025-03-16 22:49:20,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:49:20,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 22:49:20,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:49:20,380 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 22:49:20,380 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 22:49:20,380 INFO L87 Difference]: Start difference. First operand 882 states and 1310 transitions. Second operand has 5 states, 5 states have (on average 14.6) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:49:20,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:49:20,809 INFO L93 Difference]: Finished difference Result 1725 states and 2562 transitions. [2025-03-16 22:49:20,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 22:49:20,809 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 73 [2025-03-16 22:49:20,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:49:20,812 INFO L225 Difference]: With dead ends: 1725 [2025-03-16 22:49:20,812 INFO L226 Difference]: Without dead ends: 884 [2025-03-16 22:49:20,813 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-16 22:49:20,813 INFO L435 NwaCegarLoop]: 968 mSDtfsCounter, 1229 mSDsluCounter, 1929 mSDsCounter, 0 mSdLazyCounter, 869 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1229 SdHoareTripleChecker+Valid, 2897 SdHoareTripleChecker+Invalid, 869 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 869 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 22:49:20,813 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1229 Valid, 2897 Invalid, 869 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 869 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 22:49:20,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 884 states. [2025-03-16 22:49:20,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 884 to 882. [2025-03-16 22:49:20,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 882 states, 881 states have (on average 1.4869466515323495) internal successors, (1310), 881 states have internal predecessors, (1310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:49:20,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 882 states to 882 states and 1310 transitions. [2025-03-16 22:49:20,823 INFO L78 Accepts]: Start accepts. Automaton has 882 states and 1310 transitions. Word has length 73 [2025-03-16 22:49:20,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:49:20,823 INFO L471 AbstractCegarLoop]: Abstraction has 882 states and 1310 transitions. [2025-03-16 22:49:20,823 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:49:20,823 INFO L276 IsEmpty]: Start isEmpty. Operand 882 states and 1310 transitions. [2025-03-16 22:49:20,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-03-16 22:49:20,824 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:49:20,824 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 22:49:20,824 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-16 22:49:20,824 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:49:20,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:49:20,825 INFO L85 PathProgramCache]: Analyzing trace with hash -842910262, now seen corresponding path program 1 times [2025-03-16 22:49:20,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:49:20,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42046148] [2025-03-16 22:49:20,826 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:49:20,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:49:20,860 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-16 22:49:20,967 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-16 22:49:20,967 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:49:20,967 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:49:21,350 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:49:21,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:49:21,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42046148] [2025-03-16 22:49:21,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [42046148] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:49:21,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:49:21,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 22:49:21,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533677424] [2025-03-16 22:49:21,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:49:21,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 22:49:21,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:49:21,352 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 22:49:21,352 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 22:49:21,352 INFO L87 Difference]: Start difference. First operand 882 states and 1310 transitions. Second operand has 5 states, 5 states have (on average 14.8) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:49:21,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:49:21,670 INFO L93 Difference]: Finished difference Result 1727 states and 2564 transitions. [2025-03-16 22:49:21,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 22:49:21,670 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2025-03-16 22:49:21,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:49:21,673 INFO L225 Difference]: With dead ends: 1727 [2025-03-16 22:49:21,673 INFO L226 Difference]: Without dead ends: 886 [2025-03-16 22:49:21,673 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-16 22:49:21,674 INFO L435 NwaCegarLoop]: 1043 mSDtfsCounter, 1206 mSDsluCounter, 2078 mSDsCounter, 0 mSdLazyCounter, 640 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1206 SdHoareTripleChecker+Valid, 3121 SdHoareTripleChecker+Invalid, 640 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 640 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 22:49:21,674 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1206 Valid, 3121 Invalid, 640 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 640 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 22:49:21,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 886 states. [2025-03-16 22:49:21,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 886 to 882. [2025-03-16 22:49:21,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 882 states, 881 states have (on average 1.4869466515323495) internal successors, (1310), 881 states have internal predecessors, (1310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:49:21,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 882 states to 882 states and 1310 transitions. [2025-03-16 22:49:21,684 INFO L78 Accepts]: Start accepts. Automaton has 882 states and 1310 transitions. Word has length 74 [2025-03-16 22:49:21,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:49:21,684 INFO L471 AbstractCegarLoop]: Abstraction has 882 states and 1310 transitions. [2025-03-16 22:49:21,685 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:49:21,685 INFO L276 IsEmpty]: Start isEmpty. Operand 882 states and 1310 transitions. [2025-03-16 22:49:21,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-03-16 22:49:21,685 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:49:21,685 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 22:49:21,685 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-16 22:49:21,685 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:49:21,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:49:21,686 INFO L85 PathProgramCache]: Analyzing trace with hash -528677909, now seen corresponding path program 1 times [2025-03-16 22:49:21,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:49:21,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982208624] [2025-03-16 22:49:21,686 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:49:21,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:49:21,719 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-16 22:49:21,945 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-16 22:49:21,946 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:49:21,946 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:49:22,314 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:49:22,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:49:22,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982208624] [2025-03-16 22:49:22,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [982208624] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:49:22,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:49:22,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 22:49:22,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364975258] [2025-03-16 22:49:22,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:49:22,315 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 22:49:22,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:49:22,315 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 22:49:22,315 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 22:49:22,316 INFO L87 Difference]: Start difference. First operand 882 states and 1310 transitions. Second operand has 6 states, 6 states have (on average 12.5) internal successors, (75), 5 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:49:22,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:49:22,822 INFO L93 Difference]: Finished difference Result 1727 states and 2564 transitions. [2025-03-16 22:49:22,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 22:49:22,822 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 5 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75 [2025-03-16 22:49:22,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:49:22,824 INFO L225 Difference]: With dead ends: 1727 [2025-03-16 22:49:22,824 INFO L226 Difference]: Without dead ends: 886 [2025-03-16 22:49:22,825 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-16 22:49:22,825 INFO L435 NwaCegarLoop]: 968 mSDtfsCounter, 1222 mSDsluCounter, 2891 mSDsCounter, 0 mSdLazyCounter, 1163 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1222 SdHoareTripleChecker+Valid, 3859 SdHoareTripleChecker+Invalid, 1164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 22:49:22,825 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1222 Valid, 3859 Invalid, 1164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1163 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 22:49:22,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 886 states. [2025-03-16 22:49:22,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 886 to 882. [2025-03-16 22:49:22,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 882 states, 881 states have (on average 1.4869466515323495) internal successors, (1310), 881 states have internal predecessors, (1310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:49:22,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 882 states to 882 states and 1310 transitions. [2025-03-16 22:49:22,835 INFO L78 Accepts]: Start accepts. Automaton has 882 states and 1310 transitions. Word has length 75 [2025-03-16 22:49:22,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:49:22,835 INFO L471 AbstractCegarLoop]: Abstraction has 882 states and 1310 transitions. [2025-03-16 22:49:22,835 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 5 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:49:22,835 INFO L276 IsEmpty]: Start isEmpty. Operand 882 states and 1310 transitions. [2025-03-16 22:49:22,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-16 22:49:22,835 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:49:22,836 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 22:49:22,836 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-16 22:49:22,836 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:49:22,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:49:22,836 INFO L85 PathProgramCache]: Analyzing trace with hash -1928044266, now seen corresponding path program 1 times [2025-03-16 22:49:22,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:49:22,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776999332] [2025-03-16 22:49:22,836 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:49:22,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:49:22,867 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-16 22:49:23,027 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-16 22:49:23,027 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:49:23,027 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:49:23,351 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:49:23,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:49:23,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776999332] [2025-03-16 22:49:23,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [776999332] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:49:23,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:49:23,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 22:49:23,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419484552] [2025-03-16 22:49:23,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:49:23,353 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 22:49:23,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:49:23,353 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 22:49:23,353 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 22:49:23,354 INFO L87 Difference]: Start difference. First operand 882 states and 1310 transitions. Second operand has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 5 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:49:23,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:49:23,913 INFO L93 Difference]: Finished difference Result 1727 states and 2564 transitions. [2025-03-16 22:49:23,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 22:49:23,913 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 5 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2025-03-16 22:49:23,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:49:23,916 INFO L225 Difference]: With dead ends: 1727 [2025-03-16 22:49:23,916 INFO L226 Difference]: Without dead ends: 886 [2025-03-16 22:49:23,917 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-16 22:49:23,917 INFO L435 NwaCegarLoop]: 968 mSDtfsCounter, 1209 mSDsluCounter, 2891 mSDsCounter, 0 mSdLazyCounter, 1163 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1209 SdHoareTripleChecker+Valid, 3859 SdHoareTripleChecker+Invalid, 1164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 22:49:23,917 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1209 Valid, 3859 Invalid, 1164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1163 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 22:49:23,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 886 states. [2025-03-16 22:49:23,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 886 to 882. [2025-03-16 22:49:23,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 882 states, 881 states have (on average 1.4869466515323495) internal successors, (1310), 881 states have internal predecessors, (1310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:49:23,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 882 states to 882 states and 1310 transitions. [2025-03-16 22:49:23,929 INFO L78 Accepts]: Start accepts. Automaton has 882 states and 1310 transitions. Word has length 76 [2025-03-16 22:49:23,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:49:23,929 INFO L471 AbstractCegarLoop]: Abstraction has 882 states and 1310 transitions. [2025-03-16 22:49:23,929 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 5 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:49:23,929 INFO L276 IsEmpty]: Start isEmpty. Operand 882 states and 1310 transitions. [2025-03-16 22:49:23,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-16 22:49:23,930 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:49:23,931 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 22:49:23,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-16 22:49:23,932 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:49:23,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:49:23,932 INFO L85 PathProgramCache]: Analyzing trace with hash 921076862, now seen corresponding path program 1 times [2025-03-16 22:49:23,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:49:23,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348171046] [2025-03-16 22:49:23,932 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:49:23,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:49:23,976 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-16 22:49:24,194 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-16 22:49:24,195 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:49:24,195 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:49:24,458 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:49:24,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:49:24,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348171046] [2025-03-16 22:49:24,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348171046] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:49:24,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:49:24,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 22:49:24,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908510857] [2025-03-16 22:49:24,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:49:24,459 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 22:49:24,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:49:24,459 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 22:49:24,459 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 22:49:24,459 INFO L87 Difference]: Start difference. First operand 882 states and 1310 transitions. Second operand has 5 states, 5 states have (on average 15.4) internal successors, (77), 4 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:49:24,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:49:24,848 INFO L93 Difference]: Finished difference Result 1727 states and 2564 transitions. [2025-03-16 22:49:24,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 22:49:24,849 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 4 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2025-03-16 22:49:24,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:49:24,851 INFO L225 Difference]: With dead ends: 1727 [2025-03-16 22:49:24,851 INFO L226 Difference]: Without dead ends: 886 [2025-03-16 22:49:24,851 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-16 22:49:24,852 INFO L435 NwaCegarLoop]: 968 mSDtfsCounter, 1202 mSDsluCounter, 1929 mSDsCounter, 0 mSdLazyCounter, 869 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1202 SdHoareTripleChecker+Valid, 2897 SdHoareTripleChecker+Invalid, 869 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 869 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 22:49:24,852 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1202 Valid, 2897 Invalid, 869 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 869 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 22:49:24,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 886 states. [2025-03-16 22:49:24,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 886 to 882. [2025-03-16 22:49:24,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 882 states, 881 states have (on average 1.4869466515323495) internal successors, (1310), 881 states have internal predecessors, (1310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:49:24,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 882 states to 882 states and 1310 transitions. [2025-03-16 22:49:24,860 INFO L78 Accepts]: Start accepts. Automaton has 882 states and 1310 transitions. Word has length 77 [2025-03-16 22:49:24,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:49:24,861 INFO L471 AbstractCegarLoop]: Abstraction has 882 states and 1310 transitions. [2025-03-16 22:49:24,861 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 4 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:49:24,861 INFO L276 IsEmpty]: Start isEmpty. Operand 882 states and 1310 transitions. [2025-03-16 22:49:24,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-16 22:49:24,862 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:49:24,862 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 22:49:24,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-16 22:49:24,862 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:49:24,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:49:24,862 INFO L85 PathProgramCache]: Analyzing trace with hash 1193359901, now seen corresponding path program 1 times [2025-03-16 22:49:24,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:49:24,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359842314] [2025-03-16 22:49:24,863 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:49:24,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:49:24,895 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-16 22:49:25,023 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-16 22:49:25,024 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:49:25,024 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:49:25,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:49:25,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:49:25,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359842314] [2025-03-16 22:49:25,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [359842314] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:49:25,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:49:25,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 22:49:25,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054200628] [2025-03-16 22:49:25,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:49:25,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 22:49:25,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:49:25,305 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 22:49:25,306 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 22:49:25,306 INFO L87 Difference]: Start difference. First operand 882 states and 1310 transitions. Second operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:49:25,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:49:25,689 INFO L93 Difference]: Finished difference Result 1727 states and 2564 transitions. [2025-03-16 22:49:25,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 22:49:25,689 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2025-03-16 22:49:25,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:49:25,691 INFO L225 Difference]: With dead ends: 1727 [2025-03-16 22:49:25,691 INFO L226 Difference]: Without dead ends: 886 [2025-03-16 22:49:25,692 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-16 22:49:25,692 INFO L435 NwaCegarLoop]: 968 mSDtfsCounter, 1195 mSDsluCounter, 1929 mSDsCounter, 0 mSdLazyCounter, 869 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1195 SdHoareTripleChecker+Valid, 2897 SdHoareTripleChecker+Invalid, 869 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 869 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 22:49:25,693 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1195 Valid, 2897 Invalid, 869 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 869 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 22:49:25,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 886 states. [2025-03-16 22:49:25,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 886 to 882. [2025-03-16 22:49:25,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 882 states, 881 states have (on average 1.4869466515323495) internal successors, (1310), 881 states have internal predecessors, (1310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:49:25,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 882 states to 882 states and 1310 transitions. [2025-03-16 22:49:25,702 INFO L78 Accepts]: Start accepts. Automaton has 882 states and 1310 transitions. Word has length 78 [2025-03-16 22:49:25,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:49:25,702 INFO L471 AbstractCegarLoop]: Abstraction has 882 states and 1310 transitions. [2025-03-16 22:49:25,702 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:49:25,703 INFO L276 IsEmpty]: Start isEmpty. Operand 882 states and 1310 transitions. [2025-03-16 22:49:25,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-16 22:49:25,703 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:49:25,703 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 22:49:25,703 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-16 22:49:25,703 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:49:25,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:49:25,704 INFO L85 PathProgramCache]: Analyzing trace with hash -1085080257, now seen corresponding path program 1 times [2025-03-16 22:49:25,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:49:25,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322869413] [2025-03-16 22:49:25,705 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:49:25,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:49:25,739 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-16 22:49:25,942 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-16 22:49:25,943 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:49:25,943 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:49:26,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:49:26,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:49:26,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322869413] [2025-03-16 22:49:26,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [322869413] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:49:26,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:49:26,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 22:49:26,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533420604] [2025-03-16 22:49:26,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:49:26,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 22:49:26,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:49:26,216 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 22:49:26,216 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 22:49:26,216 INFO L87 Difference]: Start difference. First operand 882 states and 1310 transitions. Second operand has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:49:26,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:49:26,715 INFO L93 Difference]: Finished difference Result 1727 states and 2564 transitions. [2025-03-16 22:49:26,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 22:49:26,717 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2025-03-16 22:49:26,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:49:26,719 INFO L225 Difference]: With dead ends: 1727 [2025-03-16 22:49:26,719 INFO L226 Difference]: Without dead ends: 886 [2025-03-16 22:49:26,720 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-16 22:49:26,721 INFO L435 NwaCegarLoop]: 968 mSDtfsCounter, 1215 mSDsluCounter, 2891 mSDsCounter, 0 mSdLazyCounter, 1163 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1215 SdHoareTripleChecker+Valid, 3859 SdHoareTripleChecker+Invalid, 1164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 22:49:26,721 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1215 Valid, 3859 Invalid, 1164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1163 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 22:49:26,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 886 states. [2025-03-16 22:49:26,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 886 to 882. [2025-03-16 22:49:26,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 882 states, 881 states have (on average 1.4869466515323495) internal successors, (1310), 881 states have internal predecessors, (1310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:49:26,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 882 states to 882 states and 1310 transitions. [2025-03-16 22:49:26,731 INFO L78 Accepts]: Start accepts. Automaton has 882 states and 1310 transitions. Word has length 79 [2025-03-16 22:49:26,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:49:26,731 INFO L471 AbstractCegarLoop]: Abstraction has 882 states and 1310 transitions. [2025-03-16 22:49:26,731 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:49:26,731 INFO L276 IsEmpty]: Start isEmpty. Operand 882 states and 1310 transitions. [2025-03-16 22:49:26,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-03-16 22:49:26,732 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:49:26,732 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 22:49:26,732 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-16 22:49:26,732 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:49:26,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:49:26,732 INFO L85 PathProgramCache]: Analyzing trace with hash 338072825, now seen corresponding path program 1 times [2025-03-16 22:49:26,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:49:26,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420814743] [2025-03-16 22:49:26,733 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:49:26,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:49:26,764 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-16 22:49:27,429 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-16 22:49:27,429 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:49:27,429 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:49:28,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:49:28,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:49:28,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420814743] [2025-03-16 22:49:28,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [420814743] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:49:28,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:49:28,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 22:49:28,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141713983] [2025-03-16 22:49:28,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:49:28,314 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 22:49:28,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:49:28,314 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 22:49:28,314 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-16 22:49:28,314 INFO L87 Difference]: Start difference. First operand 882 states and 1310 transitions. Second operand has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 6 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:49:29,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:49:29,200 INFO L93 Difference]: Finished difference Result 2456 states and 3647 transitions. [2025-03-16 22:49:29,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 22:49:29,201 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 6 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2025-03-16 22:49:29,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:49:29,204 INFO L225 Difference]: With dead ends: 2456 [2025-03-16 22:49:29,204 INFO L226 Difference]: Without dead ends: 1615 [2025-03-16 22:49:29,205 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2025-03-16 22:49:29,206 INFO L435 NwaCegarLoop]: 1008 mSDtfsCounter, 3284 mSDsluCounter, 4023 mSDsCounter, 0 mSdLazyCounter, 1237 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3284 SdHoareTripleChecker+Valid, 5031 SdHoareTripleChecker+Invalid, 1240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-16 22:49:29,206 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3284 Valid, 5031 Invalid, 1240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1237 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-16 22:49:29,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1615 states. [2025-03-16 22:49:29,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1615 to 926. [2025-03-16 22:49:29,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 926 states, 925 states have (on average 1.4875675675675675) internal successors, (1376), 925 states have internal predecessors, (1376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:49:29,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 926 states to 926 states and 1376 transitions. [2025-03-16 22:49:29,218 INFO L78 Accepts]: Start accepts. Automaton has 926 states and 1376 transitions. Word has length 80 [2025-03-16 22:49:29,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:49:29,219 INFO L471 AbstractCegarLoop]: Abstraction has 926 states and 1376 transitions. [2025-03-16 22:49:29,219 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 6 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:49:29,219 INFO L276 IsEmpty]: Start isEmpty. Operand 926 states and 1376 transitions. [2025-03-16 22:49:29,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 480 [2025-03-16 22:49:29,224 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:49:29,224 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 22:49:29,224 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-16 22:49:29,224 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:49:29,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:49:29,225 INFO L85 PathProgramCache]: Analyzing trace with hash -2034276437, now seen corresponding path program 1 times [2025-03-16 22:49:29,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:49:29,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575412339] [2025-03-16 22:49:29,225 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:49:29,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:49:29,347 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 479 statements into 1 equivalence classes. [2025-03-16 22:49:40,877 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 479 of 479 statements. [2025-03-16 22:49:40,877 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:49:40,877 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:49:43,079 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 2 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:49:43,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:49:43,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575412339] [2025-03-16 22:49:43,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [575412339] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 22:49:43,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [911581062] [2025-03-16 22:49:43,079 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:49:43,079 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 22:49:43,080 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 22:49:43,081 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 22:49:43,082 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-16 22:49:43,678 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 479 statements into 1 equivalence classes. [2025-03-16 22:49:45,764 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 479 of 479 statements. [2025-03-16 22:49:45,764 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:49:45,764 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:49:45,786 INFO L256 TraceCheckSpWp]: Trace formula consists of 3702 conjuncts, 54 conjuncts are in the unsatisfiable core [2025-03-16 22:49:45,808 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 22:49:47,580 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 32 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:49:47,580 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 22:49:49,288 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 32 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:49:49,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [911581062] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 22:49:49,289 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 22:49:49,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 7] total 22 [2025-03-16 22:49:49,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072938449] [2025-03-16 22:49:49,289 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 22:49:49,291 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-16 22:49:49,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:49:49,292 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-16 22:49:49,292 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=432, Unknown=0, NotChecked=0, Total=506 [2025-03-16 22:49:49,293 INFO L87 Difference]: Start difference. First operand 926 states and 1376 transitions. Second operand has 23 states, 23 states have (on average 59.91304347826087) internal successors, (1378), 22 states have internal predecessors, (1378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:49:52,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:49:52,716 INFO L93 Difference]: Finished difference Result 4839 states and 7204 transitions. [2025-03-16 22:49:52,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-03-16 22:49:52,717 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 59.91304347826087) internal successors, (1378), 22 states have internal predecessors, (1378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 479 [2025-03-16 22:49:52,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:49:52,721 INFO L225 Difference]: With dead ends: 4839 [2025-03-16 22:49:52,721 INFO L226 Difference]: Without dead ends: 1620 [2025-03-16 22:49:52,724 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 997 GetRequests, 943 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 661 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=620, Invalid=2460, Unknown=0, NotChecked=0, Total=3080 [2025-03-16 22:49:52,724 INFO L435 NwaCegarLoop]: 723 mSDtfsCounter, 18099 mSDsluCounter, 7147 mSDsCounter, 0 mSdLazyCounter, 6405 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18099 SdHoareTripleChecker+Valid, 7870 SdHoareTripleChecker+Invalid, 6428 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 6405 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-03-16 22:49:52,724 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18099 Valid, 7870 Invalid, 6428 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 6405 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-03-16 22:49:52,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1620 states. [2025-03-16 22:49:52,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1620 to 1221. [2025-03-16 22:49:52,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1221 states, 1220 states have (on average 1.480327868852459) internal successors, (1806), 1220 states have internal predecessors, (1806), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:49:52,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1221 states to 1221 states and 1806 transitions. [2025-03-16 22:49:52,739 INFO L78 Accepts]: Start accepts. Automaton has 1221 states and 1806 transitions. Word has length 479 [2025-03-16 22:49:52,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:49:52,740 INFO L471 AbstractCegarLoop]: Abstraction has 1221 states and 1806 transitions. [2025-03-16 22:49:52,740 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 59.91304347826087) internal successors, (1378), 22 states have internal predecessors, (1378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:49:52,740 INFO L276 IsEmpty]: Start isEmpty. Operand 1221 states and 1806 transitions. [2025-03-16 22:49:52,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 482 [2025-03-16 22:49:52,743 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:49:52,743 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 22:49:52,765 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-16 22:49:52,943 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2025-03-16 22:49:52,944 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:49:52,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:49:52,944 INFO L85 PathProgramCache]: Analyzing trace with hash 2041618620, now seen corresponding path program 1 times [2025-03-16 22:49:52,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:49:52,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939300687] [2025-03-16 22:49:52,944 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:49:52,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:49:53,044 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 481 statements into 1 equivalence classes. [2025-03-16 22:49:53,166 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 481 of 481 statements. [2025-03-16 22:49:53,166 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:49:53,166 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:49:53,914 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:49:53,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:49:53,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939300687] [2025-03-16 22:49:53,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [939300687] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:49:53,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:49:53,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 22:49:53,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222982901] [2025-03-16 22:49:53,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:49:53,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 22:49:53,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:49:53,916 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 22:49:53,916 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 22:49:53,916 INFO L87 Difference]: Start difference. First operand 1221 states and 1806 transitions. Second operand has 5 states, 5 states have (on average 96.2) internal successors, (481), 5 states have internal predecessors, (481), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:49:54,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:49:54,160 INFO L93 Difference]: Finished difference Result 2066 states and 3061 transitions. [2025-03-16 22:49:54,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 22:49:54,160 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 96.2) internal successors, (481), 5 states have internal predecessors, (481), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 481 [2025-03-16 22:49:54,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:49:54,163 INFO L225 Difference]: With dead ends: 2066 [2025-03-16 22:49:54,163 INFO L226 Difference]: Without dead ends: 1225 [2025-03-16 22:49:54,164 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 22:49:54,164 INFO L435 NwaCegarLoop]: 1044 mSDtfsCounter, 0 mSDsluCounter, 2080 mSDsCounter, 0 mSdLazyCounter, 638 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3124 SdHoareTripleChecker+Invalid, 639 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 638 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 22:49:54,165 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3124 Invalid, 639 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 638 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 22:49:54,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1225 states. [2025-03-16 22:49:54,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1225 to 1225. [2025-03-16 22:49:54,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1225 states, 1224 states have (on average 1.4787581699346406) internal successors, (1810), 1224 states have internal predecessors, (1810), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:49:54,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1225 states to 1225 states and 1810 transitions. [2025-03-16 22:49:54,177 INFO L78 Accepts]: Start accepts. Automaton has 1225 states and 1810 transitions. Word has length 481 [2025-03-16 22:49:54,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:49:54,177 INFO L471 AbstractCegarLoop]: Abstraction has 1225 states and 1810 transitions. [2025-03-16 22:49:54,177 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 96.2) internal successors, (481), 5 states have internal predecessors, (481), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:49:54,178 INFO L276 IsEmpty]: Start isEmpty. Operand 1225 states and 1810 transitions. [2025-03-16 22:49:54,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 482 [2025-03-16 22:49:54,180 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:49:54,180 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 22:49:54,180 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-16 22:49:54,180 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:49:54,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:49:54,181 INFO L85 PathProgramCache]: Analyzing trace with hash -819586318, now seen corresponding path program 1 times [2025-03-16 22:49:54,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:49:54,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021794238] [2025-03-16 22:49:54,181 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:49:54,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:49:54,266 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 481 statements into 1 equivalence classes. [2025-03-16 22:49:54,385 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 481 of 481 statements. [2025-03-16 22:49:54,385 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:49:54,385 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:49:55,111 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:49:55,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:49:55,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021794238] [2025-03-16 22:49:55,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1021794238] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:49:55,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:49:55,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 22:49:55,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750185771] [2025-03-16 22:49:55,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:49:55,112 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 22:49:55,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:49:55,112 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 22:49:55,112 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 22:49:55,113 INFO L87 Difference]: Start difference. First operand 1225 states and 1810 transitions. Second operand has 5 states, 5 states have (on average 96.2) internal successors, (481), 5 states have internal predecessors, (481), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:49:55,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:49:55,333 INFO L93 Difference]: Finished difference Result 2072 states and 3067 transitions. [2025-03-16 22:49:55,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 22:49:55,334 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 96.2) internal successors, (481), 5 states have internal predecessors, (481), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 481 [2025-03-16 22:49:55,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:49:55,336 INFO L225 Difference]: With dead ends: 2072 [2025-03-16 22:49:55,336 INFO L226 Difference]: Without dead ends: 1229 [2025-03-16 22:49:55,337 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 22:49:55,337 INFO L435 NwaCegarLoop]: 1044 mSDtfsCounter, 0 mSDsluCounter, 2078 mSDsCounter, 0 mSdLazyCounter, 640 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3122 SdHoareTripleChecker+Invalid, 641 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 640 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 22:49:55,338 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3122 Invalid, 641 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 640 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 22:49:55,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1229 states. [2025-03-16 22:49:55,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1229 to 1229. [2025-03-16 22:49:55,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1229 states, 1228 states have (on average 1.477198697068404) internal successors, (1814), 1228 states have internal predecessors, (1814), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:49:55,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1229 states to 1229 states and 1814 transitions. [2025-03-16 22:49:55,349 INFO L78 Accepts]: Start accepts. Automaton has 1229 states and 1814 transitions. Word has length 481 [2025-03-16 22:49:55,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:49:55,349 INFO L471 AbstractCegarLoop]: Abstraction has 1229 states and 1814 transitions. [2025-03-16 22:49:55,350 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 96.2) internal successors, (481), 5 states have internal predecessors, (481), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:49:55,350 INFO L276 IsEmpty]: Start isEmpty. Operand 1229 states and 1814 transitions. [2025-03-16 22:49:55,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 483 [2025-03-16 22:49:55,352 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:49:55,352 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 22:49:55,352 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-16 22:49:55,352 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:49:55,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:49:55,353 INFO L85 PathProgramCache]: Analyzing trace with hash 928426098, now seen corresponding path program 1 times [2025-03-16 22:49:55,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:49:55,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527842947] [2025-03-16 22:49:55,353 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:49:55,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:49:55,442 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 482 statements into 1 equivalence classes. [2025-03-16 22:49:59,154 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 482 of 482 statements. [2025-03-16 22:49:59,154 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:49:59,154 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:50:02,435 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:50:02,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:50:02,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527842947] [2025-03-16 22:50:02,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [527842947] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:50:02,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:50:02,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-16 22:50:02,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418176830] [2025-03-16 22:50:02,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:50:02,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-16 22:50:02,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:50:02,436 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-16 22:50:02,437 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2025-03-16 22:50:02,437 INFO L87 Difference]: Start difference. First operand 1229 states and 1814 transitions. Second operand has 10 states, 10 states have (on average 48.2) internal successors, (482), 9 states have internal predecessors, (482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:50:03,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:50:03,285 INFO L93 Difference]: Finished difference Result 2372 states and 3504 transitions. [2025-03-16 22:50:03,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-16 22:50:03,285 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 48.2) internal successors, (482), 9 states have internal predecessors, (482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 482 [2025-03-16 22:50:03,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:50:03,288 INFO L225 Difference]: With dead ends: 2372 [2025-03-16 22:50:03,288 INFO L226 Difference]: Without dead ends: 1288 [2025-03-16 22:50:03,289 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2025-03-16 22:50:03,289 INFO L435 NwaCegarLoop]: 1034 mSDtfsCounter, 1627 mSDsluCounter, 5389 mSDsCounter, 0 mSdLazyCounter, 2070 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1627 SdHoareTripleChecker+Valid, 6423 SdHoareTripleChecker+Invalid, 2076 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 2070 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-16 22:50:03,289 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1627 Valid, 6423 Invalid, 2076 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 2070 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-16 22:50:03,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1288 states. [2025-03-16 22:50:03,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1288 to 1237. [2025-03-16 22:50:03,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1237 states, 1236 states have (on average 1.476537216828479) internal successors, (1825), 1236 states have internal predecessors, (1825), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:50:03,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1237 states to 1237 states and 1825 transitions. [2025-03-16 22:50:03,303 INFO L78 Accepts]: Start accepts. Automaton has 1237 states and 1825 transitions. Word has length 482 [2025-03-16 22:50:03,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:50:03,304 INFO L471 AbstractCegarLoop]: Abstraction has 1237 states and 1825 transitions. [2025-03-16 22:50:03,304 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 48.2) internal successors, (482), 9 states have internal predecessors, (482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:50:03,304 INFO L276 IsEmpty]: Start isEmpty. Operand 1237 states and 1825 transitions. [2025-03-16 22:50:03,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 484 [2025-03-16 22:50:03,306 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:50:03,306 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 22:50:03,306 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-16 22:50:03,306 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:50:03,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:50:03,307 INFO L85 PathProgramCache]: Analyzing trace with hash -2085360036, now seen corresponding path program 1 times [2025-03-16 22:50:03,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:50:03,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669973379] [2025-03-16 22:50:03,307 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:50:03,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:50:03,400 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 483 statements into 1 equivalence classes. [2025-03-16 22:50:06,122 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 483 of 483 statements. [2025-03-16 22:50:06,123 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:50:06,123 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:50:06,912 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:50:06,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:50:06,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669973379] [2025-03-16 22:50:06,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [669973379] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:50:06,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:50:06,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 22:50:06,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959402389] [2025-03-16 22:50:06,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:50:06,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 22:50:06,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:50:06,913 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 22:50:06,913 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 22:50:06,914 INFO L87 Difference]: Start difference. First operand 1237 states and 1825 transitions. Second operand has 5 states, 5 states have (on average 96.6) internal successors, (483), 4 states have internal predecessors, (483), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:50:07,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:50:07,581 INFO L93 Difference]: Finished difference Result 2333 states and 3451 transitions. [2025-03-16 22:50:07,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 22:50:07,582 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 96.6) internal successors, (483), 4 states have internal predecessors, (483), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 483 [2025-03-16 22:50:07,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:50:07,584 INFO L225 Difference]: With dead ends: 2333 [2025-03-16 22:50:07,584 INFO L226 Difference]: Without dead ends: 1237 [2025-03-16 22:50:07,585 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-16 22:50:07,586 INFO L435 NwaCegarLoop]: 749 mSDtfsCounter, 1719 mSDsluCounter, 1491 mSDsCounter, 0 mSdLazyCounter, 1521 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1719 SdHoareTripleChecker+Valid, 2240 SdHoareTripleChecker+Invalid, 1521 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1521 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 22:50:07,586 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1719 Valid, 2240 Invalid, 1521 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1521 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 22:50:07,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1237 states. [2025-03-16 22:50:07,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1237 to 1237. [2025-03-16 22:50:07,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1237 states, 1236 states have (on average 1.4757281553398058) internal successors, (1824), 1236 states have internal predecessors, (1824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:50:07,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1237 states to 1237 states and 1824 transitions. [2025-03-16 22:50:07,597 INFO L78 Accepts]: Start accepts. Automaton has 1237 states and 1824 transitions. Word has length 483 [2025-03-16 22:50:07,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:50:07,597 INFO L471 AbstractCegarLoop]: Abstraction has 1237 states and 1824 transitions. [2025-03-16 22:50:07,597 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 96.6) internal successors, (483), 4 states have internal predecessors, (483), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:50:07,597 INFO L276 IsEmpty]: Start isEmpty. Operand 1237 states and 1824 transitions. [2025-03-16 22:50:07,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 484 [2025-03-16 22:50:07,599 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:50:07,600 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 22:50:07,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-16 22:50:07,600 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:50:07,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:50:07,600 INFO L85 PathProgramCache]: Analyzing trace with hash 411361835, now seen corresponding path program 1 times [2025-03-16 22:50:07,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:50:07,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223163281] [2025-03-16 22:50:07,601 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:50:07,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:50:07,686 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 483 statements into 1 equivalence classes. [2025-03-16 22:50:16,043 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 483 of 483 statements. [2025-03-16 22:50:16,043 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:50:16,043 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:50:18,148 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-16 22:50:18,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:50:18,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223163281] [2025-03-16 22:50:18,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [223163281] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:50:18,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:50:18,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 22:50:18,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302978005] [2025-03-16 22:50:18,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:50:18,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 22:50:18,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:50:18,150 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 22:50:18,150 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-16 22:50:18,150 INFO L87 Difference]: Start difference. First operand 1237 states and 1824 transitions. Second operand has 6 states, 6 states have (on average 79.5) internal successors, (477), 5 states have internal predecessors, (477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:50:18,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:50:18,610 INFO L93 Difference]: Finished difference Result 2449 states and 3605 transitions. [2025-03-16 22:50:18,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 22:50:18,611 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 79.5) internal successors, (477), 5 states have internal predecessors, (477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 483 [2025-03-16 22:50:18,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:50:18,613 INFO L225 Difference]: With dead ends: 2449 [2025-03-16 22:50:18,613 INFO L226 Difference]: Without dead ends: 1237 [2025-03-16 22:50:18,614 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-03-16 22:50:18,614 INFO L435 NwaCegarLoop]: 1015 mSDtfsCounter, 1990 mSDsluCounter, 2982 mSDsCounter, 0 mSdLazyCounter, 1018 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1990 SdHoareTripleChecker+Valid, 3997 SdHoareTripleChecker+Invalid, 1023 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1018 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 22:50:18,615 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1990 Valid, 3997 Invalid, 1023 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1018 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 22:50:18,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1237 states. [2025-03-16 22:50:18,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1237 to 1237. [2025-03-16 22:50:18,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1237 states, 1236 states have (on average 1.4749190938511327) internal successors, (1823), 1236 states have internal predecessors, (1823), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:50:18,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1237 states to 1237 states and 1823 transitions. [2025-03-16 22:50:18,625 INFO L78 Accepts]: Start accepts. Automaton has 1237 states and 1823 transitions. Word has length 483 [2025-03-16 22:50:18,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:50:18,625 INFO L471 AbstractCegarLoop]: Abstraction has 1237 states and 1823 transitions. [2025-03-16 22:50:18,625 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 79.5) internal successors, (477), 5 states have internal predecessors, (477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:50:18,625 INFO L276 IsEmpty]: Start isEmpty. Operand 1237 states and 1823 transitions. [2025-03-16 22:50:18,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2025-03-16 22:50:18,628 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:50:18,628 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 22:50:18,628 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-16 22:50:18,628 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:50:18,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:50:18,628 INFO L85 PathProgramCache]: Analyzing trace with hash -438509531, now seen corresponding path program 1 times [2025-03-16 22:50:18,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:50:18,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480719734] [2025-03-16 22:50:18,628 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:50:18,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:50:18,716 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 484 statements into 1 equivalence classes.