./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem01_label24.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 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/eca-rers2012/Problem01_label24.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-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 32bit --witnessprinter.graph.data.programhash 3b098f62dc80370f0e14e7fa6b354d0aae7e8d94738f84002290c368f38c01b4 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 09:48:05,564 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 09:48:05,605 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 09:48:05,608 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 09:48:05,608 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 09:48:05,627 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 09:48:05,628 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 09:48:05,628 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 09:48:05,628 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 09:48:05,628 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 09:48:05,628 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 09:48:05,628 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 09:48:05,629 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 09:48:05,629 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 09:48:05,629 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 09:48:05,629 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 09:48:05,629 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 09:48:05,629 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 09:48:05,629 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 09:48:05,629 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 09:48:05,629 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 09:48:05,629 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 09:48:05,630 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 09:48:05,630 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 09:48:05,630 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 09:48:05,630 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 09:48:05,630 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 09:48:05,630 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 09:48:05,630 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 09:48:05,630 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 09:48:05,630 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 09:48:05,630 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 09:48:05,630 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 09:48:05,631 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 09:48:05,631 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 09:48:05,631 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 09:48:05,631 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 09:48:05,631 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 09:48:05,631 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 09:48:05,631 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 09:48:05,631 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 09:48:05,631 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 09:48:05,631 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 09:48:05,631 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 3b098f62dc80370f0e14e7fa6b354d0aae7e8d94738f84002290c368f38c01b4 [2025-03-03 09:48:05,846 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 09:48:05,851 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 09:48:05,853 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 09:48:05,854 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 09:48:05,854 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 09:48:05,855 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem01_label24.c [2025-03-03 09:48:06,959 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f6fe2e533/ef2f3ec21fd04b66a8114aa5c814767e/FLAG55a56a3b7 [2025-03-03 09:48:07,226 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 09:48:07,227 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem01_label24.c [2025-03-03 09:48:07,234 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f6fe2e533/ef2f3ec21fd04b66a8114aa5c814767e/FLAG55a56a3b7 [2025-03-03 09:48:07,244 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f6fe2e533/ef2f3ec21fd04b66a8114aa5c814767e [2025-03-03 09:48:07,246 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 09:48:07,247 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 09:48:07,248 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 09:48:07,248 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 09:48:07,252 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 09:48:07,253 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:48:07" (1/1) ... [2025-03-03 09:48:07,253 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d69d508 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:48:07, skipping insertion in model container [2025-03-03 09:48:07,253 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:48:07" (1/1) ... [2025-03-03 09:48:07,279 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 09:48:07,478 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/eca-rers2012/Problem01_label24.c[17735,17748] [2025-03-03 09:48:07,512 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 09:48:07,524 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 09:48:07,586 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/eca-rers2012/Problem01_label24.c[17735,17748] [2025-03-03 09:48:07,597 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 09:48:07,609 INFO L204 MainTranslator]: Completed translation [2025-03-03 09:48:07,610 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:48:07 WrapperNode [2025-03-03 09:48:07,610 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 09:48:07,611 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 09:48:07,611 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 09:48:07,611 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 09:48:07,615 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:48:07" (1/1) ... [2025-03-03 09:48:07,627 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:48:07" (1/1) ... [2025-03-03 09:48:07,658 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 655 [2025-03-03 09:48:07,658 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 09:48:07,659 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 09:48:07,659 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 09:48:07,659 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 09:48:07,667 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:48:07" (1/1) ... [2025-03-03 09:48:07,668 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:48:07" (1/1) ... [2025-03-03 09:48:07,671 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:48:07" (1/1) ... [2025-03-03 09:48:07,682 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-03 09:48:07,682 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:48:07" (1/1) ... [2025-03-03 09:48:07,682 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:48:07" (1/1) ... [2025-03-03 09:48:07,699 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:48:07" (1/1) ... [2025-03-03 09:48:07,700 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:48:07" (1/1) ... [2025-03-03 09:48:07,702 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:48:07" (1/1) ... [2025-03-03 09:48:07,703 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:48:07" (1/1) ... [2025-03-03 09:48:07,709 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 09:48:07,709 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 09:48:07,710 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 09:48:07,710 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 09:48:07,710 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:48:07" (1/1) ... [2025-03-03 09:48:07,714 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 09:48:07,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:48:07,733 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-03 09:48:07,735 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-03 09:48:07,750 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 09:48:07,750 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 09:48:07,750 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 09:48:07,750 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 09:48:07,798 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 09:48:07,800 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 09:48:08,460 INFO L? ?]: Removed 75 outVars from TransFormulas that were not future-live. [2025-03-03 09:48:08,460 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 09:48:08,471 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 09:48:08,472 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 09:48:08,472 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:48:08 BoogieIcfgContainer [2025-03-03 09:48:08,472 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 09:48:08,476 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 09:48:08,476 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 09:48:08,479 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 09:48:08,479 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 09:48:07" (1/3) ... [2025-03-03 09:48:08,480 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1532bdc3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:48:08, skipping insertion in model container [2025-03-03 09:48:08,480 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:48:07" (2/3) ... [2025-03-03 09:48:08,480 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1532bdc3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:48:08, skipping insertion in model container [2025-03-03 09:48:08,480 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:48:08" (3/3) ... [2025-03-03 09:48:08,481 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem01_label24.c [2025-03-03 09:48:08,493 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 09:48:08,494 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem01_label24.c that has 1 procedures, 198 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 09:48:08,538 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 09:48:08,548 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;@3aa461ac, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 09:48:08,548 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 09:48:08,552 INFO L276 IsEmpty]: Start isEmpty. Operand has 198 states, 196 states have (on average 1.663265306122449) internal successors, (326), 197 states have internal predecessors, (326), 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-03 09:48:08,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-03 09:48:08,560 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:48:08,560 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:48:08,561 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:48:08,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:48:08,565 INFO L85 PathProgramCache]: Analyzing trace with hash 848537622, now seen corresponding path program 1 times [2025-03-03 09:48:08,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:48:08,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542092999] [2025-03-03 09:48:08,571 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:48:08,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:48:08,660 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-03 09:48:08,720 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-03 09:48:08,720 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:48:08,720 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:48:08,975 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-03 09:48:08,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:48:08,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542092999] [2025-03-03 09:48:08,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1542092999] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:48:08,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:48:08,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 09:48:08,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327601248] [2025-03-03 09:48:08,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:48:08,980 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:48:08,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:48:08,992 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:48:08,993 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:48:08,994 INFO L87 Difference]: Start difference. First operand has 198 states, 196 states have (on average 1.663265306122449) internal successors, (326), 197 states have internal predecessors, (326), 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 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 2 states have internal predecessors, (98), 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-03 09:48:09,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:48:09,494 INFO L93 Difference]: Finished difference Result 553 states and 937 transitions. [2025-03-03 09:48:09,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:48:09,496 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 2 states have internal predecessors, (98), 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 98 [2025-03-03 09:48:09,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:48:09,502 INFO L225 Difference]: With dead ends: 553 [2025-03-03 09:48:09,502 INFO L226 Difference]: Without dead ends: 266 [2025-03-03 09:48:09,504 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:48:09,505 INFO L435 NwaCegarLoop]: 64 mSDtfsCounter, 87 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 442 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 510 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 442 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 09:48:09,505 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 72 Invalid, 510 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 442 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 09:48:09,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2025-03-03 09:48:09,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 266. [2025-03-03 09:48:09,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 265 states have (on average 1.4339622641509433) internal successors, (380), 265 states have internal predecessors, (380), 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-03 09:48:09,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 380 transitions. [2025-03-03 09:48:09,551 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 380 transitions. Word has length 98 [2025-03-03 09:48:09,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:48:09,552 INFO L471 AbstractCegarLoop]: Abstraction has 266 states and 380 transitions. [2025-03-03 09:48:09,553 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 2 states have internal predecessors, (98), 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-03 09:48:09,553 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 380 transitions. [2025-03-03 09:48:09,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-03 09:48:09,558 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:48:09,558 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-03 09:48:09,558 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 09:48:09,558 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:48:09,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:48:09,559 INFO L85 PathProgramCache]: Analyzing trace with hash 641164596, now seen corresponding path program 1 times [2025-03-03 09:48:09,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:48:09,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916337158] [2025-03-03 09:48:09,559 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:48:09,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:48:09,575 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-03 09:48:09,580 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-03 09:48:09,580 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:48:09,580 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:48:09,640 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:48:09,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:48:09,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916337158] [2025-03-03 09:48:09,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1916337158] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:48:09,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:48:09,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 09:48:09,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153803417] [2025-03-03 09:48:09,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:48:09,641 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:48:09,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:48:09,642 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:48:09,642 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:48:09,642 INFO L87 Difference]: Start difference. First operand 266 states and 380 transitions. Second operand has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 2 states have internal predecessors, (104), 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-03 09:48:09,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:48:09,957 INFO L93 Difference]: Finished difference Result 792 states and 1135 transitions. [2025-03-03 09:48:09,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:48:09,958 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 2 states have internal predecessors, (104), 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 104 [2025-03-03 09:48:09,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:48:09,960 INFO L225 Difference]: With dead ends: 792 [2025-03-03 09:48:09,960 INFO L226 Difference]: Without dead ends: 528 [2025-03-03 09:48:09,960 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:48:09,961 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 142 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 327 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 09:48:09,961 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 36 Invalid, 398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 327 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 09:48:09,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2025-03-03 09:48:09,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 528. [2025-03-03 09:48:09,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 528 states, 527 states have (on average 1.3453510436432639) internal successors, (709), 527 states have internal predecessors, (709), 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-03 09:48:09,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 709 transitions. [2025-03-03 09:48:09,981 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 709 transitions. Word has length 104 [2025-03-03 09:48:09,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:48:09,981 INFO L471 AbstractCegarLoop]: Abstraction has 528 states and 709 transitions. [2025-03-03 09:48:09,981 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 2 states have internal predecessors, (104), 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-03 09:48:09,981 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 709 transitions. [2025-03-03 09:48:09,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-03-03 09:48:09,983 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:48:09,983 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-03 09:48:09,983 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 09:48:09,983 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:48:09,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:48:09,983 INFO L85 PathProgramCache]: Analyzing trace with hash -2144728715, now seen corresponding path program 1 times [2025-03-03 09:48:09,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:48:09,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322031435] [2025-03-03 09:48:09,984 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:48:09,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:48:10,012 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-03 09:48:10,031 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-03 09:48:10,031 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:48:10,031 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:48:10,299 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:48:10,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:48:10,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322031435] [2025-03-03 09:48:10,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1322031435] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:48:10,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:48:10,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 09:48:10,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534473234] [2025-03-03 09:48:10,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:48:10,301 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 09:48:10,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:48:10,301 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 09:48:10,301 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 09:48:10,301 INFO L87 Difference]: Start difference. First operand 528 states and 709 transitions. Second operand has 4 states, 4 states have (on average 26.25) internal successors, (105), 3 states have internal predecessors, (105), 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-03 09:48:10,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:48:10,777 INFO L93 Difference]: Finished difference Result 1280 states and 1708 transitions. [2025-03-03 09:48:10,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 09:48:10,777 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.25) internal successors, (105), 3 states have internal predecessors, (105), 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 105 [2025-03-03 09:48:10,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:48:10,779 INFO L225 Difference]: With dead ends: 1280 [2025-03-03 09:48:10,779 INFO L226 Difference]: Without dead ends: 659 [2025-03-03 09:48:10,780 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 09:48:10,784 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 127 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 569 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 637 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 569 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 09:48:10,784 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 82 Invalid, 637 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 569 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 09:48:10,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 659 states. [2025-03-03 09:48:10,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 659 to 659. [2025-03-03 09:48:10,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 659 states, 658 states have (on average 1.1899696048632218) internal successors, (783), 658 states have internal predecessors, (783), 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-03 09:48:10,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 659 states to 659 states and 783 transitions. [2025-03-03 09:48:10,798 INFO L78 Accepts]: Start accepts. Automaton has 659 states and 783 transitions. Word has length 105 [2025-03-03 09:48:10,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:48:10,798 INFO L471 AbstractCegarLoop]: Abstraction has 659 states and 783 transitions. [2025-03-03 09:48:10,798 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.25) internal successors, (105), 3 states have internal predecessors, (105), 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-03 09:48:10,798 INFO L276 IsEmpty]: Start isEmpty. Operand 659 states and 783 transitions. [2025-03-03 09:48:10,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-03 09:48:10,800 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:48:10,800 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 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] [2025-03-03 09:48:10,800 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 09:48:10,800 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:48:10,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:48:10,801 INFO L85 PathProgramCache]: Analyzing trace with hash -54884856, now seen corresponding path program 1 times [2025-03-03 09:48:10,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:48:10,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161030385] [2025-03-03 09:48:10,801 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:48:10,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:48:10,822 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-03 09:48:10,828 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-03 09:48:10,828 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:48:10,828 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:48:10,942 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:48:10,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:48:10,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161030385] [2025-03-03 09:48:10,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [161030385] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:48:10,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:48:10,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 09:48:10,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532441267] [2025-03-03 09:48:10,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:48:10,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 09:48:10,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:48:10,943 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 09:48:10,943 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 09:48:10,944 INFO L87 Difference]: Start difference. First operand 659 states and 783 transitions. Second operand has 4 states, 4 states have (on average 28.25) internal successors, (113), 3 states have internal predecessors, (113), 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-03 09:48:11,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:48:11,411 INFO L93 Difference]: Finished difference Result 1840 states and 2243 transitions. [2025-03-03 09:48:11,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 09:48:11,412 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.25) internal successors, (113), 3 states have internal predecessors, (113), 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 113 [2025-03-03 09:48:11,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:48:11,415 INFO L225 Difference]: With dead ends: 1840 [2025-03-03 09:48:11,416 INFO L226 Difference]: Without dead ends: 1183 [2025-03-03 09:48:11,417 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 09:48:11,419 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 257 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 610 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 685 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 610 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 09:48:11,420 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [257 Valid, 36 Invalid, 685 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 610 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 09:48:11,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1183 states. [2025-03-03 09:48:11,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1183 to 1183. [2025-03-03 09:48:11,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1183 states, 1182 states have (on average 1.1844331641285957) internal successors, (1400), 1182 states have internal predecessors, (1400), 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-03 09:48:11,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1183 states to 1183 states and 1400 transitions. [2025-03-03 09:48:11,445 INFO L78 Accepts]: Start accepts. Automaton has 1183 states and 1400 transitions. Word has length 113 [2025-03-03 09:48:11,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:48:11,445 INFO L471 AbstractCegarLoop]: Abstraction has 1183 states and 1400 transitions. [2025-03-03 09:48:11,445 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.25) internal successors, (113), 3 states have internal predecessors, (113), 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-03 09:48:11,446 INFO L276 IsEmpty]: Start isEmpty. Operand 1183 states and 1400 transitions. [2025-03-03 09:48:11,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-03-03 09:48:11,448 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:48:11,449 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 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] [2025-03-03 09:48:11,449 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 09:48:11,449 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:48:11,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:48:11,449 INFO L85 PathProgramCache]: Analyzing trace with hash -862899052, now seen corresponding path program 1 times [2025-03-03 09:48:11,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:48:11,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850336461] [2025-03-03 09:48:11,449 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:48:11,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:48:11,468 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-03 09:48:11,471 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-03 09:48:11,471 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:48:11,471 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:48:11,536 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-03 09:48:11,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:48:11,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850336461] [2025-03-03 09:48:11,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1850336461] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:48:11,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:48:11,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 09:48:11,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74070041] [2025-03-03 09:48:11,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:48:11,537 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:48:11,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:48:11,537 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:48:11,537 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:48:11,537 INFO L87 Difference]: Start difference. First operand 1183 states and 1400 transitions. Second operand has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 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-03 09:48:11,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:48:11,817 INFO L93 Difference]: Finished difference Result 3281 states and 3864 transitions. [2025-03-03 09:48:11,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:48:11,818 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 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 122 [2025-03-03 09:48:11,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:48:11,824 INFO L225 Difference]: With dead ends: 3281 [2025-03-03 09:48:11,824 INFO L226 Difference]: Without dead ends: 2100 [2025-03-03 09:48:11,825 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:48:11,826 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 135 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 314 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 365 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 09:48:11,826 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 19 Invalid, 365 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 314 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 09:48:11,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2100 states. [2025-03-03 09:48:11,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2100 to 1707. [2025-03-03 09:48:11,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1707 states, 1706 states have (on average 1.182883939038687) internal successors, (2018), 1706 states have internal predecessors, (2018), 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-03 09:48:11,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1707 states to 1707 states and 2018 transitions. [2025-03-03 09:48:11,852 INFO L78 Accepts]: Start accepts. Automaton has 1707 states and 2018 transitions. Word has length 122 [2025-03-03 09:48:11,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:48:11,852 INFO L471 AbstractCegarLoop]: Abstraction has 1707 states and 2018 transitions. [2025-03-03 09:48:11,852 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 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-03 09:48:11,852 INFO L276 IsEmpty]: Start isEmpty. Operand 1707 states and 2018 transitions. [2025-03-03 09:48:11,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-03-03 09:48:11,854 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:48:11,854 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-03 09:48:11,854 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 09:48:11,855 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:48:11,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:48:11,855 INFO L85 PathProgramCache]: Analyzing trace with hash -869854973, now seen corresponding path program 1 times [2025-03-03 09:48:11,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:48:11,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235504386] [2025-03-03 09:48:11,855 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:48:11,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:48:11,870 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-03 09:48:11,874 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-03 09:48:11,874 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:48:11,876 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:48:11,969 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-03 09:48:11,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:48:11,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235504386] [2025-03-03 09:48:11,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [235504386] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:48:11,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:48:11,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 09:48:11,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254719765] [2025-03-03 09:48:11,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:48:11,969 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:48:11,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:48:11,970 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:48:11,970 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:48:11,970 INFO L87 Difference]: Start difference. First operand 1707 states and 2018 transitions. Second operand has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 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-03 09:48:12,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:48:12,268 INFO L93 Difference]: Finished difference Result 3805 states and 4477 transitions. [2025-03-03 09:48:12,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:48:12,268 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 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 128 [2025-03-03 09:48:12,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:48:12,273 INFO L225 Difference]: With dead ends: 3805 [2025-03-03 09:48:12,273 INFO L226 Difference]: Without dead ends: 2100 [2025-03-03 09:48:12,275 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:48:12,275 INFO L435 NwaCegarLoop]: 185 mSDtfsCounter, 121 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 331 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 09:48:12,275 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 191 Invalid, 349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 331 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 09:48:12,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2100 states. [2025-03-03 09:48:12,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2100 to 1969. [2025-03-03 09:48:12,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1969 states, 1968 states have (on average 1.1717479674796747) internal successors, (2306), 1968 states have internal predecessors, (2306), 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-03 09:48:12,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1969 states to 1969 states and 2306 transitions. [2025-03-03 09:48:12,301 INFO L78 Accepts]: Start accepts. Automaton has 1969 states and 2306 transitions. Word has length 128 [2025-03-03 09:48:12,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:48:12,301 INFO L471 AbstractCegarLoop]: Abstraction has 1969 states and 2306 transitions. [2025-03-03 09:48:12,301 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 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-03 09:48:12,302 INFO L276 IsEmpty]: Start isEmpty. Operand 1969 states and 2306 transitions. [2025-03-03 09:48:12,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-03-03 09:48:12,304 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:48:12,304 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-03 09:48:12,304 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 09:48:12,304 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:48:12,304 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:48:12,304 INFO L85 PathProgramCache]: Analyzing trace with hash -645531130, now seen corresponding path program 1 times [2025-03-03 09:48:12,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:48:12,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91758420] [2025-03-03 09:48:12,305 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:48:12,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:48:12,318 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-03-03 09:48:12,323 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-03-03 09:48:12,323 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:48:12,323 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:48:12,434 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-03 09:48:12,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:48:12,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91758420] [2025-03-03 09:48:12,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [91758420] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:48:12,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:48:12,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 09:48:12,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696388576] [2025-03-03 09:48:12,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:48:12,435 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 09:48:12,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:48:12,435 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 09:48:12,435 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 09:48:12,436 INFO L87 Difference]: Start difference. First operand 1969 states and 2306 transitions. Second operand has 4 states, 4 states have (on average 33.0) internal successors, (132), 3 states have internal predecessors, (132), 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-03 09:48:12,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:48:12,889 INFO L93 Difference]: Finished difference Result 4460 states and 5191 transitions. [2025-03-03 09:48:12,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 09:48:12,889 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 33.0) internal successors, (132), 3 states have internal predecessors, (132), 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 142 [2025-03-03 09:48:12,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:48:12,896 INFO L225 Difference]: With dead ends: 4460 [2025-03-03 09:48:12,896 INFO L226 Difference]: Without dead ends: 2493 [2025-03-03 09:48:12,898 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 09:48:12,899 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 239 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 630 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 239 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 672 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 630 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 09:48:12,900 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [239 Valid, 46 Invalid, 672 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 630 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 09:48:12,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2493 states. [2025-03-03 09:48:12,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2493 to 2362. [2025-03-03 09:48:12,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2362 states, 2361 states have (on average 1.1524777636594663) internal successors, (2721), 2361 states have internal predecessors, (2721), 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-03 09:48:12,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2362 states to 2362 states and 2721 transitions. [2025-03-03 09:48:12,950 INFO L78 Accepts]: Start accepts. Automaton has 2362 states and 2721 transitions. Word has length 142 [2025-03-03 09:48:12,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:48:12,950 INFO L471 AbstractCegarLoop]: Abstraction has 2362 states and 2721 transitions. [2025-03-03 09:48:12,951 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.0) internal successors, (132), 3 states have internal predecessors, (132), 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-03 09:48:12,951 INFO L276 IsEmpty]: Start isEmpty. Operand 2362 states and 2721 transitions. [2025-03-03 09:48:12,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2025-03-03 09:48:12,955 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:48:12,955 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-03 09:48:12,955 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 09:48:12,955 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:48:12,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:48:12,956 INFO L85 PathProgramCache]: Analyzing trace with hash 1210189774, now seen corresponding path program 1 times [2025-03-03 09:48:12,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:48:12,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077835031] [2025-03-03 09:48:12,956 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:48:12,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:48:12,972 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-03-03 09:48:12,977 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-03-03 09:48:12,978 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:48:12,978 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:48:13,090 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-03 09:48:13,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:48:13,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077835031] [2025-03-03 09:48:13,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1077835031] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:48:13,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:48:13,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 09:48:13,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457178794] [2025-03-03 09:48:13,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:48:13,092 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:48:13,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:48:13,092 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:48:13,092 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:48:13,092 INFO L87 Difference]: Start difference. First operand 2362 states and 2721 transitions. Second operand has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 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-03 09:48:13,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:48:13,390 INFO L93 Difference]: Finished difference Result 5115 states and 5915 transitions. [2025-03-03 09:48:13,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:48:13,391 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 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 159 [2025-03-03 09:48:13,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:48:13,398 INFO L225 Difference]: With dead ends: 5115 [2025-03-03 09:48:13,398 INFO L226 Difference]: Without dead ends: 2755 [2025-03-03 09:48:13,400 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:48:13,400 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 93 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 301 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 352 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 301 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 09:48:13,401 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 42 Invalid, 352 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 301 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 09:48:13,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2755 states. [2025-03-03 09:48:13,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2755 to 2624. [2025-03-03 09:48:13,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2624 states, 2623 states have (on average 1.1437285550895921) internal successors, (3000), 2623 states have internal predecessors, (3000), 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-03 09:48:13,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2624 states to 2624 states and 3000 transitions. [2025-03-03 09:48:13,452 INFO L78 Accepts]: Start accepts. Automaton has 2624 states and 3000 transitions. Word has length 159 [2025-03-03 09:48:13,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:48:13,453 INFO L471 AbstractCegarLoop]: Abstraction has 2624 states and 3000 transitions. [2025-03-03 09:48:13,453 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 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-03 09:48:13,453 INFO L276 IsEmpty]: Start isEmpty. Operand 2624 states and 3000 transitions. [2025-03-03 09:48:13,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2025-03-03 09:48:13,456 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:48:13,456 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-03 09:48:13,456 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 09:48:13,457 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:48:13,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:48:13,457 INFO L85 PathProgramCache]: Analyzing trace with hash 603177839, now seen corresponding path program 1 times [2025-03-03 09:48:13,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:48:13,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179148049] [2025-03-03 09:48:13,457 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:48:13,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:48:13,481 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 215 statements into 1 equivalence classes. [2025-03-03 09:48:13,489 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 215 of 215 statements. [2025-03-03 09:48:13,489 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:48:13,489 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:48:13,543 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 191 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-03-03 09:48:13,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:48:13,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179148049] [2025-03-03 09:48:13,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1179148049] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:48:13,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:48:13,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 09:48:13,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634472690] [2025-03-03 09:48:13,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:48:13,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:48:13,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:48:13,544 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:48:13,544 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:48:13,545 INFO L87 Difference]: Start difference. First operand 2624 states and 3000 transitions. Second operand has 3 states, 3 states have (on average 65.0) internal successors, (195), 3 states have internal predecessors, (195), 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-03 09:48:13,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:48:13,816 INFO L93 Difference]: Finished difference Result 5246 states and 5998 transitions. [2025-03-03 09:48:13,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:48:13,816 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 65.0) internal successors, (195), 3 states have internal predecessors, (195), 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 215 [2025-03-03 09:48:13,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:48:13,823 INFO L225 Difference]: With dead ends: 5246 [2025-03-03 09:48:13,823 INFO L226 Difference]: Without dead ends: 2624 [2025-03-03 09:48:13,825 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:48:13,825 INFO L435 NwaCegarLoop]: 158 mSDtfsCounter, 96 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 304 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 09:48:13,826 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 164 Invalid, 343 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 304 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 09:48:13,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2624 states. [2025-03-03 09:48:13,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2624 to 2624. [2025-03-03 09:48:13,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2624 states, 2623 states have (on average 1.1132291269538697) internal successors, (2920), 2623 states have internal predecessors, (2920), 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-03 09:48:13,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2624 states to 2624 states and 2920 transitions. [2025-03-03 09:48:13,859 INFO L78 Accepts]: Start accepts. Automaton has 2624 states and 2920 transitions. Word has length 215 [2025-03-03 09:48:13,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:48:13,859 INFO L471 AbstractCegarLoop]: Abstraction has 2624 states and 2920 transitions. [2025-03-03 09:48:13,859 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 65.0) internal successors, (195), 3 states have internal predecessors, (195), 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-03 09:48:13,859 INFO L276 IsEmpty]: Start isEmpty. Operand 2624 states and 2920 transitions. [2025-03-03 09:48:13,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2025-03-03 09:48:13,862 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:48:13,862 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-03 09:48:13,863 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 09:48:13,863 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:48:13,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:48:13,863 INFO L85 PathProgramCache]: Analyzing trace with hash 251175439, now seen corresponding path program 1 times [2025-03-03 09:48:13,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:48:13,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190025553] [2025-03-03 09:48:13,863 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:48:13,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:48:13,882 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 224 statements into 1 equivalence classes. [2025-03-03 09:48:13,892 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 224 of 224 statements. [2025-03-03 09:48:13,893 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:48:13,893 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:48:13,980 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 125 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2025-03-03 09:48:13,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:48:13,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190025553] [2025-03-03 09:48:13,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1190025553] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:48:13,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:48:13,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 09:48:13,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069240660] [2025-03-03 09:48:13,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:48:13,981 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:48:13,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:48:13,981 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:48:13,981 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:48:13,982 INFO L87 Difference]: Start difference. First operand 2624 states and 2920 transitions. Second operand has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 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-03 09:48:14,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:48:14,263 INFO L93 Difference]: Finished difference Result 6032 states and 6721 transitions. [2025-03-03 09:48:14,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:48:14,264 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 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 224 [2025-03-03 09:48:14,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:48:14,270 INFO L225 Difference]: With dead ends: 6032 [2025-03-03 09:48:14,270 INFO L226 Difference]: Without dead ends: 2886 [2025-03-03 09:48:14,273 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:48:14,273 INFO L435 NwaCegarLoop]: 173 mSDtfsCounter, 39 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 351 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 09:48:14,273 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 179 Invalid, 351 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 320 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 09:48:14,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2886 states. [2025-03-03 09:48:14,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2886 to 2755. [2025-03-03 09:48:14,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2755 states, 2754 states have (on average 1.097676107480029) internal successors, (3023), 2754 states have internal predecessors, (3023), 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-03 09:48:14,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2755 states to 2755 states and 3023 transitions. [2025-03-03 09:48:14,303 INFO L78 Accepts]: Start accepts. Automaton has 2755 states and 3023 transitions. Word has length 224 [2025-03-03 09:48:14,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:48:14,303 INFO L471 AbstractCegarLoop]: Abstraction has 2755 states and 3023 transitions. [2025-03-03 09:48:14,303 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 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-03 09:48:14,303 INFO L276 IsEmpty]: Start isEmpty. Operand 2755 states and 3023 transitions. [2025-03-03 09:48:14,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2025-03-03 09:48:14,307 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:48:14,307 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-03 09:48:14,307 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 09:48:14,307 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:48:14,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:48:14,307 INFO L85 PathProgramCache]: Analyzing trace with hash -1673585708, now seen corresponding path program 1 times [2025-03-03 09:48:14,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:48:14,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665202653] [2025-03-03 09:48:14,308 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:48:14,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:48:14,326 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 243 statements into 1 equivalence classes. [2025-03-03 09:48:14,336 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 243 of 243 statements. [2025-03-03 09:48:14,336 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:48:14,337 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:48:14,651 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 143 proven. 86 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-03-03 09:48:14,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:48:14,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665202653] [2025-03-03 09:48:14,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [665202653] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:48:14,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1178653083] [2025-03-03 09:48:14,653 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:48:14,653 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:48:14,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:48:14,655 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-03 09:48:14,657 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-03 09:48:14,706 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 243 statements into 1 equivalence classes. [2025-03-03 09:48:14,756 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 243 of 243 statements. [2025-03-03 09:48:14,756 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:48:14,756 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:48:14,759 INFO L256 TraceCheckSpWp]: Trace formula consists of 427 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 09:48:14,767 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:48:14,895 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2025-03-03 09:48:14,895 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 09:48:14,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1178653083] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:48:14,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 09:48:14,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-03-03 09:48:14,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840840890] [2025-03-03 09:48:14,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:48:14,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:48:14,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:48:14,897 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:48:14,897 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-03 09:48:14,897 INFO L87 Difference]: Start difference. First operand 2755 states and 3023 transitions. Second operand has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 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-03 09:48:15,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:48:15,176 INFO L93 Difference]: Finished difference Result 5637 states and 6195 transitions. [2025-03-03 09:48:15,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:48:15,177 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 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 243 [2025-03-03 09:48:15,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:48:15,177 INFO L225 Difference]: With dead ends: 5637 [2025-03-03 09:48:15,177 INFO L226 Difference]: Without dead ends: 0 [2025-03-03 09:48:15,181 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 243 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-03 09:48:15,181 INFO L435 NwaCegarLoop]: 156 mSDtfsCounter, 39 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 09:48:15,181 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 161 Invalid, 346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 306 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 09:48:15,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-03 09:48:15,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-03 09:48:15,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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-03 09:48:15,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-03 09:48:15,182 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 243 [2025-03-03 09:48:15,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:48:15,182 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-03 09:48:15,182 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 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-03 09:48:15,182 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-03 09:48:15,182 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-03 09:48:15,184 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 09:48:15,191 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 09:48:15,385 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,SelfDestructingSolverStorable10 [2025-03-03 09:48:15,387 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:48:15,388 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-03 09:48:15,628 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 09:48:15,639 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 09:48:15 BoogieIcfgContainer [2025-03-03 09:48:15,639 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 09:48:15,640 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 09:48:15,640 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 09:48:15,640 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 09:48:15,640 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:48:08" (3/4) ... [2025-03-03 09:48:15,642 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-03 09:48:15,651 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2025-03-03 09:48:15,652 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-03 09:48:15,652 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-03 09:48:15,653 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-03 09:48:15,749 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-03 09:48:15,751 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-03 09:48:15,751 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 09:48:15,752 INFO L158 Benchmark]: Toolchain (without parser) took 8504.77ms. Allocated memory was 142.6MB in the beginning and 343.9MB in the end (delta: 201.3MB). Free memory was 109.0MB in the beginning and 128.7MB in the end (delta: -19.7MB). Peak memory consumption was 180.1MB. Max. memory is 16.1GB. [2025-03-03 09:48:15,752 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 201.3MB. Free memory was 126.3MB in the beginning and 126.0MB in the end (delta: 307.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 09:48:15,752 INFO L158 Benchmark]: CACSL2BoogieTranslator took 362.60ms. Allocated memory is still 142.6MB. Free memory was 109.0MB in the beginning and 82.4MB in the end (delta: 26.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-03 09:48:15,753 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.31ms. Allocated memory is still 142.6MB. Free memory was 82.4MB in the beginning and 77.2MB in the end (delta: 5.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 09:48:15,753 INFO L158 Benchmark]: Boogie Preprocessor took 50.36ms. Allocated memory is still 142.6MB. Free memory was 77.2MB in the beginning and 73.1MB in the end (delta: 4.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 09:48:15,753 INFO L158 Benchmark]: IcfgBuilder took 762.98ms. Allocated memory is still 142.6MB. Free memory was 73.1MB in the beginning and 57.2MB in the end (delta: 15.9MB). Peak memory consumption was 50.2MB. Max. memory is 16.1GB. [2025-03-03 09:48:15,754 INFO L158 Benchmark]: TraceAbstraction took 7163.41ms. Allocated memory was 142.6MB in the beginning and 343.9MB in the end (delta: 201.3MB). Free memory was 56.4MB in the beginning and 140.9MB in the end (delta: -84.4MB). Peak memory consumption was 121.5MB. Max. memory is 16.1GB. [2025-03-03 09:48:15,754 INFO L158 Benchmark]: Witness Printer took 111.17ms. Allocated memory is still 343.9MB. Free memory was 140.9MB in the beginning and 128.7MB in the end (delta: 12.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 09:48:15,757 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23ms. Allocated memory is still 201.3MB. Free memory was 126.3MB in the beginning and 126.0MB in the end (delta: 307.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 362.60ms. Allocated memory is still 142.6MB. Free memory was 109.0MB in the beginning and 82.4MB in the end (delta: 26.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 47.31ms. Allocated memory is still 142.6MB. Free memory was 82.4MB in the beginning and 77.2MB in the end (delta: 5.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 50.36ms. Allocated memory is still 142.6MB. Free memory was 77.2MB in the beginning and 73.1MB in the end (delta: 4.1MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 762.98ms. Allocated memory is still 142.6MB. Free memory was 73.1MB in the beginning and 57.2MB in the end (delta: 15.9MB). Peak memory consumption was 50.2MB. Max. memory is 16.1GB. * TraceAbstraction took 7163.41ms. Allocated memory was 142.6MB in the beginning and 343.9MB in the end (delta: 201.3MB). Free memory was 56.4MB in the beginning and 140.9MB in the end (delta: -84.4MB). Peak memory consumption was 121.5MB. Max. memory is 16.1GB. * Witness Printer took 111.17ms. Allocated memory is still 343.9MB. Free memory was 140.9MB in the beginning and 128.7MB in the end (delta: 12.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 480]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 198 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.9s, OverallIterations: 11, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1375 SdHoareTripleChecker+Valid, 3.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1375 mSDsluCounter, 1028 SdHoareTripleChecker+Invalid, 3.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 80 mSDsCounter, 554 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4454 IncrementalHoareTripleChecker+Invalid, 5008 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 554 mSolverCounterUnsat, 948 mSDtfsCounter, 4454 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 275 GetRequests, 258 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2755occurred in iteration=10, InterpolantAutomatonStates: 36, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 11 MinimizatonAttempts, 917 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 1896 NumberOfCodeBlocks, 1896 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 1884 ConstructedInterpolants, 0 QuantifiedInterpolants, 7658 SizeOfPredicates, 0 NumberOfNonLiveVariables, 427 ConjunctsInSsa, 2 ConjunctsInUnsatCore, 12 InterpolantComputations, 11 PerfectInterpolantSequences, 1154/1240 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 593]: Location Invariant Derived location invariant: (((((((a8 <= 13) && (a20 == 1)) || (((a8 <= 13) && (a7 != 1)) && (a16 <= 5))) || ((((a7 <= 0) && (a12 == 8)) && (a21 == 1)) && (a17 == 1))) || (((a8 <= 13) && (a17 == 1)) && (a16 <= 5))) || (a17 <= 0)) || (((a20 != 1) && (a7 != 1)) && (a17 == 1))) RESULT: Ultimate proved your program to be correct! [2025-03-03 09:48:15,771 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE