./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem19_label26.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem19_label26.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 4ebd5aed45c5461e176385745bb70c1ebeb4378f3074685fcb814a1b840527ca --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 00:25:05,226 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 00:25:05,304 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 00:25:05,309 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 00:25:05,309 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 00:25:05,346 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 00:25:05,347 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 00:25:05,347 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 00:25:05,348 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 00:25:05,348 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 00:25:05,349 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 00:25:05,349 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 00:25:05,349 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 00:25:05,350 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 00:25:05,350 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 00:25:05,350 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 00:25:05,350 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 00:25:05,351 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 00:25:05,351 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 00:25:05,351 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 00:25:05,351 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 00:25:05,351 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 00:25:05,351 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 00:25:05,351 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 00:25:05,351 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 00:25:05,351 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 00:25:05,352 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 00:25:05,352 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 00:25:05,352 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 00:25:05,352 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 00:25:05,352 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 00:25:05,352 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 00:25:05,353 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 00:25:05,353 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 00:25:05,353 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 00:25:05,353 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 00:25:05,353 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 00:25:05,354 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 00:25:05,354 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 00:25:05,354 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 00:25:05,354 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 00:25:05,354 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 00:25:05,354 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 00:25:05,354 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 00:25:05,355 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 00:25:05,355 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 00:25:05,355 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 00:25:05,355 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 00:25:05,355 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-jdk21/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 -> 4ebd5aed45c5461e176385745bb70c1ebeb4378f3074685fcb814a1b840527ca [2025-01-09 00:25:05,619 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 00:25:05,630 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 00:25:05,631 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 00:25:05,632 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 00:25:05,634 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 00:25:05,635 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem19_label26.c [2025-01-09 00:25:06,985 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8e52004b9/2ea1e14fdbdc43699cc5d17827c3838b/FLAGd1fa21436 [2025-01-09 00:25:07,517 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 00:25:07,518 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem19_label26.c [2025-01-09 00:25:07,572 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8e52004b9/2ea1e14fdbdc43699cc5d17827c3838b/FLAGd1fa21436 [2025-01-09 00:25:07,589 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8e52004b9/2ea1e14fdbdc43699cc5d17827c3838b [2025-01-09 00:25:07,591 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 00:25:07,592 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 00:25:07,594 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 00:25:07,594 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 00:25:07,598 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 00:25:07,598 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:25:07" (1/1) ... [2025-01-09 00:25:07,599 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4106a613 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:25:07, skipping insertion in model container [2025-01-09 00:25:07,600 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:25:07" (1/1) ... [2025-01-09 00:25:07,746 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 00:25:07,999 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem19_label26.c[3735,3748] [2025-01-09 00:25:08,911 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 00:25:08,922 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 00:25:08,939 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem19_label26.c[3735,3748] [2025-01-09 00:25:09,574 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 00:25:09,634 INFO L204 MainTranslator]: Completed translation [2025-01-09 00:25:09,635 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:25:09 WrapperNode [2025-01-09 00:25:09,635 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 00:25:09,637 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 00:25:09,637 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 00:25:09,637 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 00:25:09,643 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:25:09" (1/1) ... [2025-01-09 00:25:09,712 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:25:09" (1/1) ... [2025-01-09 00:25:10,410 INFO L138 Inliner]: procedures = 19, calls = 13, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 9428 [2025-01-09 00:25:10,411 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 00:25:10,416 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 00:25:10,416 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 00:25:10,416 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 00:25:10,430 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:25:09" (1/1) ... [2025-01-09 00:25:10,434 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:25:09" (1/1) ... [2025-01-09 00:25:10,616 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:25:09" (1/1) ... [2025-01-09 00:25:11,069 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-01-09 00:25:11,070 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:25:09" (1/1) ... [2025-01-09 00:25:11,070 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:25:09" (1/1) ... [2025-01-09 00:25:11,306 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:25:09" (1/1) ... [2025-01-09 00:25:11,333 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:25:09" (1/1) ... [2025-01-09 00:25:11,388 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:25:09" (1/1) ... [2025-01-09 00:25:11,445 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:25:09" (1/1) ... [2025-01-09 00:25:11,483 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:25:09" (1/1) ... [2025-01-09 00:25:11,581 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 00:25:11,583 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 00:25:11,584 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 00:25:11,584 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 00:25:11,585 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:25:09" (1/1) ... [2025-01-09 00:25:11,589 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 00:25:11,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:25:11,613 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 00:25:11,616 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 00:25:11,637 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 00:25:11,637 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 00:25:11,637 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 00:25:11,638 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 00:25:11,704 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 00:25:11,707 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 00:25:19,380 INFO L? ?]: Removed 1320 outVars from TransFormulas that were not future-live. [2025-01-09 00:25:19,381 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 00:25:19,427 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 00:25:19,427 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 00:25:19,428 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:25:19 BoogieIcfgContainer [2025-01-09 00:25:19,428 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 00:25:19,431 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 00:25:19,431 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 00:25:19,435 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 00:25:19,439 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 12:25:07" (1/3) ... [2025-01-09 00:25:19,440 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1410d213 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:25:19, skipping insertion in model container [2025-01-09 00:25:19,440 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:25:09" (2/3) ... [2025-01-09 00:25:19,440 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1410d213 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:25:19, skipping insertion in model container [2025-01-09 00:25:19,440 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:25:19" (3/3) ... [2025-01-09 00:25:19,441 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem19_label26.c [2025-01-09 00:25:19,454 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 00:25:19,456 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem19_label26.c that has 1 procedures, 1748 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 00:25:19,559 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 00:25:19,570 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;@5cf047b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 00:25:19,571 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 00:25:19,583 INFO L276 IsEmpty]: Start isEmpty. Operand has 1748 states, 1746 states have (on average 1.8694158075601375) internal successors, (3264), 1747 states have internal predecessors, (3264), 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-01-09 00:25:19,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-01-09 00:25:19,589 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:25:19,590 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] [2025-01-09 00:25:19,590 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:25:19,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:25:19,596 INFO L85 PathProgramCache]: Analyzing trace with hash -406871462, now seen corresponding path program 1 times [2025-01-09 00:25:19,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:25:19,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648382535] [2025-01-09 00:25:19,603 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:25:19,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:25:19,678 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-09 00:25:19,715 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-09 00:25:19,715 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:25:19,715 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:25:19,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:25:19,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:25:19,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648382535] [2025-01-09 00:25:19,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1648382535] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:25:19,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:25:19,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 00:25:19,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086800759] [2025-01-09 00:25:19,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:25:19,893 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:25:19,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:25:19,908 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:25:19,909 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:25:19,916 INFO L87 Difference]: Start difference. First operand has 1748 states, 1746 states have (on average 1.8694158075601375) internal successors, (3264), 1747 states have internal predecessors, (3264), 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 8.666666666666666) internal successors, (26), 2 states have internal predecessors, (26), 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-01-09 00:25:25,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:25:25,996 INFO L93 Difference]: Finished difference Result 4975 states and 9413 transitions. [2025-01-09 00:25:25,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:25:25,998 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 2 states have internal predecessors, (26), 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 26 [2025-01-09 00:25:25,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:25:26,025 INFO L225 Difference]: With dead ends: 4975 [2025-01-09 00:25:26,026 INFO L226 Difference]: Without dead ends: 3163 [2025-01-09 00:25:26,033 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-01-09 00:25:26,035 INFO L435 NwaCegarLoop]: 1354 mSDtfsCounter, 1520 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 4670 mSolverCounterSat, 1123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1520 SdHoareTripleChecker+Valid, 1525 SdHoareTripleChecker+Invalid, 5793 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1123 IncrementalHoareTripleChecker+Valid, 4670 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.9s IncrementalHoareTripleChecker+Time [2025-01-09 00:25:26,036 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1520 Valid, 1525 Invalid, 5793 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1123 Valid, 4670 Invalid, 0 Unknown, 0 Unchecked, 5.9s Time] [2025-01-09 00:25:26,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3163 states. [2025-01-09 00:25:26,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3163 to 3123. [2025-01-09 00:25:26,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3123 states, 3122 states have (on average 1.6268417680973735) internal successors, (5079), 3122 states have internal predecessors, (5079), 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-01-09 00:25:26,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3123 states to 3123 states and 5079 transitions. [2025-01-09 00:25:26,183 INFO L78 Accepts]: Start accepts. Automaton has 3123 states and 5079 transitions. Word has length 26 [2025-01-09 00:25:26,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:25:26,183 INFO L471 AbstractCegarLoop]: Abstraction has 3123 states and 5079 transitions. [2025-01-09 00:25:26,183 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 2 states have internal predecessors, (26), 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-01-09 00:25:26,184 INFO L276 IsEmpty]: Start isEmpty. Operand 3123 states and 5079 transitions. [2025-01-09 00:25:26,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-01-09 00:25:26,187 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:25:26,188 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-01-09 00:25:26,188 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 00:25:26,189 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:25:26,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:25:26,190 INFO L85 PathProgramCache]: Analyzing trace with hash 1193189312, now seen corresponding path program 1 times [2025-01-09 00:25:26,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:25:26,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795361578] [2025-01-09 00:25:26,190 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:25:26,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:25:26,214 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-01-09 00:25:26,250 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-01-09 00:25:26,250 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:25:26,251 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:25:26,454 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:25:26,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:25:26,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795361578] [2025-01-09 00:25:26,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1795361578] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:25:26,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:25:26,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 00:25:26,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551008799] [2025-01-09 00:25:26,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:25:26,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:25:26,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:25:26,459 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:25:26,460 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:25:26,460 INFO L87 Difference]: Start difference. First operand 3123 states and 5079 transitions. Second operand has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 2 states have internal predecessors, (97), 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-01-09 00:25:32,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:25:32,186 INFO L93 Difference]: Finished difference Result 9053 states and 14813 transitions. [2025-01-09 00:25:32,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:25:32,186 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 2 states have internal predecessors, (97), 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 97 [2025-01-09 00:25:32,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:25:32,212 INFO L225 Difference]: With dead ends: 9053 [2025-01-09 00:25:32,212 INFO L226 Difference]: Without dead ends: 5932 [2025-01-09 00:25:32,218 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-01-09 00:25:32,219 INFO L435 NwaCegarLoop]: 1329 mSDtfsCounter, 1534 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 4265 mSolverCounterSat, 1473 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1534 SdHoareTripleChecker+Valid, 1548 SdHoareTripleChecker+Invalid, 5738 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1473 IncrementalHoareTripleChecker+Valid, 4265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.6s IncrementalHoareTripleChecker+Time [2025-01-09 00:25:32,219 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1534 Valid, 1548 Invalid, 5738 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1473 Valid, 4265 Invalid, 0 Unknown, 0 Unchecked, 5.6s Time] [2025-01-09 00:25:32,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5932 states. [2025-01-09 00:25:32,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5932 to 5910. [2025-01-09 00:25:32,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5910 states, 5909 states have (on average 1.423421898798443) internal successors, (8411), 5909 states have internal predecessors, (8411), 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-01-09 00:25:32,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5910 states to 5910 states and 8411 transitions. [2025-01-09 00:25:32,331 INFO L78 Accepts]: Start accepts. Automaton has 5910 states and 8411 transitions. Word has length 97 [2025-01-09 00:25:32,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:25:32,331 INFO L471 AbstractCegarLoop]: Abstraction has 5910 states and 8411 transitions. [2025-01-09 00:25:32,331 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 2 states have internal predecessors, (97), 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-01-09 00:25:32,332 INFO L276 IsEmpty]: Start isEmpty. Operand 5910 states and 8411 transitions. [2025-01-09 00:25:32,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-01-09 00:25:32,336 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:25:32,337 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-01-09 00:25:32,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 00:25:32,337 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:25:32,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:25:32,341 INFO L85 PathProgramCache]: Analyzing trace with hash -802679119, now seen corresponding path program 1 times [2025-01-09 00:25:32,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:25:32,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872382266] [2025-01-09 00:25:32,341 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:25:32,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:25:32,364 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-01-09 00:25:32,386 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-01-09 00:25:32,389 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:25:32,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:25:32,561 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:25:32,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:25:32,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872382266] [2025-01-09 00:25:32,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1872382266] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:25:32,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:25:32,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 00:25:32,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801773517] [2025-01-09 00:25:32,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:25:32,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:25:32,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:25:32,563 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:25:32,564 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:25:32,564 INFO L87 Difference]: Start difference. First operand 5910 states and 8411 transitions. Second operand has 3 states, 3 states have (on average 41.0) internal successors, (123), 2 states have internal predecessors, (123), 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-01-09 00:25:37,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:25:37,894 INFO L93 Difference]: Finished difference Result 17505 states and 24942 transitions. [2025-01-09 00:25:37,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:25:37,894 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 2 states have internal predecessors, (123), 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 123 [2025-01-09 00:25:37,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:25:37,929 INFO L225 Difference]: With dead ends: 17505 [2025-01-09 00:25:37,929 INFO L226 Difference]: Without dead ends: 11597 [2025-01-09 00:25:37,937 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-01-09 00:25:37,941 INFO L435 NwaCegarLoop]: 1531 mSDtfsCounter, 1750 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 4227 mSolverCounterSat, 1430 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1750 SdHoareTripleChecker+Valid, 1804 SdHoareTripleChecker+Invalid, 5657 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1430 IncrementalHoareTripleChecker+Valid, 4227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2025-01-09 00:25:37,942 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1750 Valid, 1804 Invalid, 5657 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1430 Valid, 4227 Invalid, 0 Unknown, 0 Unchecked, 5.2s Time] [2025-01-09 00:25:37,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11597 states. [2025-01-09 00:25:38,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11597 to 11578. [2025-01-09 00:25:38,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11578 states, 11577 states have (on average 1.2801243845555843) internal successors, (14820), 11577 states have internal predecessors, (14820), 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-01-09 00:25:38,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11578 states to 11578 states and 14820 transitions. [2025-01-09 00:25:38,134 INFO L78 Accepts]: Start accepts. Automaton has 11578 states and 14820 transitions. Word has length 123 [2025-01-09 00:25:38,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:25:38,135 INFO L471 AbstractCegarLoop]: Abstraction has 11578 states and 14820 transitions. [2025-01-09 00:25:38,135 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 2 states have internal predecessors, (123), 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-01-09 00:25:38,136 INFO L276 IsEmpty]: Start isEmpty. Operand 11578 states and 14820 transitions. [2025-01-09 00:25:38,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-01-09 00:25:38,141 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:25:38,141 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-01-09 00:25:38,142 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 00:25:38,142 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:25:38,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:25:38,142 INFO L85 PathProgramCache]: Analyzing trace with hash -452091107, now seen corresponding path program 1 times [2025-01-09 00:25:38,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:25:38,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073527284] [2025-01-09 00:25:38,142 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:25:38,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:25:38,163 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-01-09 00:25:38,178 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-01-09 00:25:38,178 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:25:38,178 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:25:38,341 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:25:38,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:25:38,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073527284] [2025-01-09 00:25:38,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2073527284] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:25:38,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:25:38,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 00:25:38,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019441052] [2025-01-09 00:25:38,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:25:38,344 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:25:38,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:25:38,344 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:25:38,345 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:25:38,346 INFO L87 Difference]: Start difference. First operand 11578 states and 14820 transitions. Second operand has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 2 states have internal predecessors, (131), 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-01-09 00:25:43,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:25:43,959 INFO L93 Difference]: Finished difference Result 34273 states and 43832 transitions. [2025-01-09 00:25:43,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:25:43,960 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 2 states have internal predecessors, (131), 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 131 [2025-01-09 00:25:43,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:25:44,009 INFO L225 Difference]: With dead ends: 34273 [2025-01-09 00:25:44,010 INFO L226 Difference]: Without dead ends: 22697 [2025-01-09 00:25:44,023 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-01-09 00:25:44,024 INFO L435 NwaCegarLoop]: 721 mSDtfsCounter, 2497 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 5120 mSolverCounterSat, 434 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2497 SdHoareTripleChecker+Valid, 993 SdHoareTripleChecker+Invalid, 5554 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 434 IncrementalHoareTripleChecker+Valid, 5120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.4s IncrementalHoareTripleChecker+Time [2025-01-09 00:25:44,024 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2497 Valid, 993 Invalid, 5554 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [434 Valid, 5120 Invalid, 0 Unknown, 0 Unchecked, 5.4s Time] [2025-01-09 00:25:44,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22697 states. [2025-01-09 00:25:44,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22697 to 22694. [2025-01-09 00:25:44,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22694 states, 22693 states have (on average 1.238663905168995) internal successors, (28109), 22693 states have internal predecessors, (28109), 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-01-09 00:25:44,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22694 states to 22694 states and 28109 transitions. [2025-01-09 00:25:44,455 INFO L78 Accepts]: Start accepts. Automaton has 22694 states and 28109 transitions. Word has length 131 [2025-01-09 00:25:44,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:25:44,456 INFO L471 AbstractCegarLoop]: Abstraction has 22694 states and 28109 transitions. [2025-01-09 00:25:44,458 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 2 states have internal predecessors, (131), 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-01-09 00:25:44,458 INFO L276 IsEmpty]: Start isEmpty. Operand 22694 states and 28109 transitions. [2025-01-09 00:25:44,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 394 [2025-01-09 00:25:44,465 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:25:44,465 INFO L218 NwaCegarLoop]: trace histogram [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, 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, 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, 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, 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] [2025-01-09 00:25:44,466 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 00:25:44,466 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:25:44,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:25:44,467 INFO L85 PathProgramCache]: Analyzing trace with hash -478246905, now seen corresponding path program 1 times [2025-01-09 00:25:44,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:25:44,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934646622] [2025-01-09 00:25:44,467 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:25:44,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:25:44,536 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 393 statements into 1 equivalence classes. [2025-01-09 00:25:44,572 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 393 of 393 statements. [2025-01-09 00:25:44,573 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:25:44,573 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:25:45,757 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 182 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-09 00:25:45,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:25:45,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934646622] [2025-01-09 00:25:45,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1934646622] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:25:45,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:25:45,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:25:45,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738485475] [2025-01-09 00:25:45,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:25:45,759 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 00:25:45,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:25:45,760 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 00:25:45,760 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 00:25:45,760 INFO L87 Difference]: Start difference. First operand 22694 states and 28109 transitions. Second operand has 4 states, 4 states have (on average 92.5) internal successors, (370), 3 states have internal predecessors, (370), 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-01-09 00:25:53,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:25:53,404 INFO L93 Difference]: Finished difference Result 57752 states and 69837 transitions. [2025-01-09 00:25:53,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 00:25:53,404 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 92.5) internal successors, (370), 3 states have internal predecessors, (370), 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 393 [2025-01-09 00:25:53,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:25:53,474 INFO L225 Difference]: With dead ends: 57752 [2025-01-09 00:25:53,474 INFO L226 Difference]: Without dead ends: 35060 [2025-01-09 00:25:53,494 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 00:25:53,495 INFO L435 NwaCegarLoop]: 1806 mSDtfsCounter, 3756 mSDsluCounter, 356 mSDsCounter, 0 mSdLazyCounter, 9454 mSolverCounterSat, 244 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3756 SdHoareTripleChecker+Valid, 2162 SdHoareTripleChecker+Invalid, 9698 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 244 IncrementalHoareTripleChecker+Valid, 9454 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.3s IncrementalHoareTripleChecker+Time [2025-01-09 00:25:53,495 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3756 Valid, 2162 Invalid, 9698 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [244 Valid, 9454 Invalid, 0 Unknown, 0 Unchecked, 7.3s Time] [2025-01-09 00:25:53,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35060 states. [2025-01-09 00:25:53,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35060 to 32288. [2025-01-09 00:25:53,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32288 states, 32287 states have (on average 1.1912844178771642) internal successors, (38463), 32287 states have internal predecessors, (38463), 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-01-09 00:25:53,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32288 states to 32288 states and 38463 transitions. [2025-01-09 00:25:53,913 INFO L78 Accepts]: Start accepts. Automaton has 32288 states and 38463 transitions. Word has length 393 [2025-01-09 00:25:53,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:25:53,913 INFO L471 AbstractCegarLoop]: Abstraction has 32288 states and 38463 transitions. [2025-01-09 00:25:53,914 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 92.5) internal successors, (370), 3 states have internal predecessors, (370), 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-01-09 00:25:53,914 INFO L276 IsEmpty]: Start isEmpty. Operand 32288 states and 38463 transitions. [2025-01-09 00:25:53,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 422 [2025-01-09 00:25:53,923 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:25:53,923 INFO L218 NwaCegarLoop]: trace histogram [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, 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, 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:25:53,923 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 00:25:53,923 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:25:53,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:25:53,924 INFO L85 PathProgramCache]: Analyzing trace with hash 1470570785, now seen corresponding path program 1 times [2025-01-09 00:25:53,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:25:53,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547775114] [2025-01-09 00:25:53,924 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:25:53,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:25:53,977 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 421 statements into 1 equivalence classes. [2025-01-09 00:25:54,011 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 421 of 421 statements. [2025-01-09 00:25:54,011 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:25:54,011 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:25:54,817 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 206 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:25:54,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:25:54,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547775114] [2025-01-09 00:25:54,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [547775114] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:25:54,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:25:54,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:25:54,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075646108] [2025-01-09 00:25:54,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:25:54,821 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 00:25:54,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:25:54,822 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 00:25:54,822 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 00:25:54,822 INFO L87 Difference]: Start difference. First operand 32288 states and 38463 transitions. Second operand has 4 states, 4 states have (on average 105.25) internal successors, (421), 3 states have internal predecessors, (421), 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-01-09 00:26:00,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:26:00,478 INFO L93 Difference]: Finished difference Result 67335 states and 79703 transitions. [2025-01-09 00:26:00,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 00:26:00,478 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 105.25) internal successors, (421), 3 states have internal predecessors, (421), 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 421 [2025-01-09 00:26:00,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:26:00,544 INFO L225 Difference]: With dead ends: 67335 [2025-01-09 00:26:00,544 INFO L226 Difference]: Without dead ends: 35018 [2025-01-09 00:26:00,559 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-01-09 00:26:00,560 INFO L435 NwaCegarLoop]: 1776 mSDtfsCounter, 1138 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 7327 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1138 SdHoareTripleChecker+Valid, 2118 SdHoareTripleChecker+Invalid, 7335 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 7327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2025-01-09 00:26:00,560 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1138 Valid, 2118 Invalid, 7335 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 7327 Invalid, 0 Unknown, 0 Unchecked, 5.3s Time] [2025-01-09 00:26:00,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35018 states. [2025-01-09 00:26:00,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35018 to 35018. [2025-01-09 00:26:00,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35018 states, 35017 states have (on average 1.1765142645000999) internal successors, (41198), 35017 states have internal predecessors, (41198), 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-01-09 00:26:00,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35018 states to 35018 states and 41198 transitions. [2025-01-09 00:26:00,925 INFO L78 Accepts]: Start accepts. Automaton has 35018 states and 41198 transitions. Word has length 421 [2025-01-09 00:26:00,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:26:00,926 INFO L471 AbstractCegarLoop]: Abstraction has 35018 states and 41198 transitions. [2025-01-09 00:26:00,926 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 105.25) internal successors, (421), 3 states have internal predecessors, (421), 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-01-09 00:26:00,926 INFO L276 IsEmpty]: Start isEmpty. Operand 35018 states and 41198 transitions. [2025-01-09 00:26:00,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 514 [2025-01-09 00:26:00,934 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:26:00,934 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:26:00,935 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 00:26:00,935 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:26:00,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:26:00,935 INFO L85 PathProgramCache]: Analyzing trace with hash -1184138681, now seen corresponding path program 1 times [2025-01-09 00:26:00,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:26:00,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084290182] [2025-01-09 00:26:00,936 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:26:00,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:26:00,993 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 513 statements into 1 equivalence classes. [2025-01-09 00:26:01,031 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 513 of 513 statements. [2025-01-09 00:26:01,031 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:26:01,032 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:26:01,377 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:26:01,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:26:01,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084290182] [2025-01-09 00:26:01,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2084290182] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:26:01,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:26:01,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:26:01,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572078065] [2025-01-09 00:26:01,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:26:01,379 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:26:01,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:26:01,380 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:26:01,380 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:26:01,380 INFO L87 Difference]: Start difference. First operand 35018 states and 41198 transitions. Second operand has 3 states, 3 states have (on average 171.0) internal successors, (513), 3 states have internal predecessors, (513), 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-01-09 00:26:07,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:26:07,061 INFO L93 Difference]: Finished difference Result 78377 states and 94558 transitions. [2025-01-09 00:26:07,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:26:07,062 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 171.0) internal successors, (513), 3 states have internal predecessors, (513), 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 513 [2025-01-09 00:26:07,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:26:07,133 INFO L225 Difference]: With dead ends: 78377 [2025-01-09 00:26:07,134 INFO L226 Difference]: Without dead ends: 46091 [2025-01-09 00:26:07,160 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-01-09 00:26:07,161 INFO L435 NwaCegarLoop]: 2745 mSDtfsCounter, 1509 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 4061 mSolverCounterSat, 1803 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1509 SdHoareTripleChecker+Valid, 2924 SdHoareTripleChecker+Invalid, 5864 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1803 IncrementalHoareTripleChecker+Valid, 4061 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.4s IncrementalHoareTripleChecker+Time [2025-01-09 00:26:07,161 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1509 Valid, 2924 Invalid, 5864 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1803 Valid, 4061 Invalid, 0 Unknown, 0 Unchecked, 5.4s Time] [2025-01-09 00:26:07,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46091 states. [2025-01-09 00:26:07,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46091 to 45986. [2025-01-09 00:26:07,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45986 states, 45985 states have (on average 1.167293682722627) internal successors, (53678), 45985 states have internal predecessors, (53678), 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-01-09 00:26:07,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45986 states to 45986 states and 53678 transitions. [2025-01-09 00:26:07,750 INFO L78 Accepts]: Start accepts. Automaton has 45986 states and 53678 transitions. Word has length 513 [2025-01-09 00:26:07,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:26:07,751 INFO L471 AbstractCegarLoop]: Abstraction has 45986 states and 53678 transitions. [2025-01-09 00:26:07,751 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 171.0) internal successors, (513), 3 states have internal predecessors, (513), 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-01-09 00:26:07,751 INFO L276 IsEmpty]: Start isEmpty. Operand 45986 states and 53678 transitions. [2025-01-09 00:26:07,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 726 [2025-01-09 00:26:07,766 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:26:07,766 INFO L218 NwaCegarLoop]: trace histogram [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, 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, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 00:26:07,767 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 00:26:07,767 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:26:07,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:26:07,768 INFO L85 PathProgramCache]: Analyzing trace with hash 197369663, now seen corresponding path program 1 times [2025-01-09 00:26:07,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:26:07,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788353497] [2025-01-09 00:26:07,768 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:26:07,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:26:07,850 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 725 statements into 1 equivalence classes. [2025-01-09 00:26:07,893 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 725 of 725 statements. [2025-01-09 00:26:07,893 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:26:07,893 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:26:08,329 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 209 trivial. 0 not checked. [2025-01-09 00:26:08,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:26:08,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788353497] [2025-01-09 00:26:08,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [788353497] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:26:08,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:26:08,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:26:08,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412186845] [2025-01-09 00:26:08,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:26:08,332 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:26:08,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:26:08,332 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:26:08,333 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:26:08,333 INFO L87 Difference]: Start difference. First operand 45986 states and 53678 transitions. Second operand has 3 states, 3 states have (on average 172.33333333333334) internal successors, (517), 3 states have internal predecessors, (517), 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-01-09 00:26:14,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:26:14,267 INFO L93 Difference]: Finished difference Result 113841 states and 135601 transitions. [2025-01-09 00:26:14,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:26:14,268 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 172.33333333333334) internal successors, (517), 3 states have internal predecessors, (517), 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 725 [2025-01-09 00:26:14,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:26:14,349 INFO L225 Difference]: With dead ends: 113841 [2025-01-09 00:26:14,349 INFO L226 Difference]: Without dead ends: 70587 [2025-01-09 00:26:14,373 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-01-09 00:26:14,374 INFO L435 NwaCegarLoop]: 3109 mSDtfsCounter, 1392 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 4613 mSolverCounterSat, 1160 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1392 SdHoareTripleChecker+Valid, 3309 SdHoareTripleChecker+Invalid, 5773 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1160 IncrementalHoareTripleChecker+Valid, 4613 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2025-01-09 00:26:14,374 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1392 Valid, 3309 Invalid, 5773 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1160 Valid, 4613 Invalid, 0 Unknown, 0 Unchecked, 5.5s Time] [2025-01-09 00:26:14,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70587 states. [2025-01-09 00:26:15,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70587 to 70573. [2025-01-09 00:26:15,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70573 states, 70572 states have (on average 1.1289746641727598) internal successors, (79674), 70572 states have internal predecessors, (79674), 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-01-09 00:26:15,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70573 states to 70573 states and 79674 transitions. [2025-01-09 00:26:15,162 INFO L78 Accepts]: Start accepts. Automaton has 70573 states and 79674 transitions. Word has length 725 [2025-01-09 00:26:15,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:26:15,163 INFO L471 AbstractCegarLoop]: Abstraction has 70573 states and 79674 transitions. [2025-01-09 00:26:15,164 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 172.33333333333334) internal successors, (517), 3 states have internal predecessors, (517), 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-01-09 00:26:15,164 INFO L276 IsEmpty]: Start isEmpty. Operand 70573 states and 79674 transitions. [2025-01-09 00:26:15,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 733 [2025-01-09 00:26:15,170 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:26:15,170 INFO L218 NwaCegarLoop]: trace histogram [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, 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, 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, 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, 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:26:15,170 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 00:26:15,171 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:26:15,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:26:15,172 INFO L85 PathProgramCache]: Analyzing trace with hash -1043598391, now seen corresponding path program 1 times [2025-01-09 00:26:15,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:26:15,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784523110] [2025-01-09 00:26:15,172 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:26:15,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:26:15,241 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 732 statements into 1 equivalence classes. [2025-01-09 00:26:15,280 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 732 of 732 statements. [2025-01-09 00:26:15,280 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:26:15,280 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:26:17,223 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 69 proven. 196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:26:17,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:26:17,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784523110] [2025-01-09 00:26:17,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1784523110] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 00:26:17,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [139872616] [2025-01-09 00:26:17,224 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:26:17,225 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:26:17,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:26:17,232 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 00:26:17,240 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 00:26:17,459 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 732 statements into 1 equivalence classes. [2025-01-09 00:26:17,681 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 732 of 732 statements. [2025-01-09 00:26:17,681 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:26:17,681 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:26:17,686 INFO L256 TraceCheckSpWp]: Trace formula consists of 838 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 00:26:17,710 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 00:26:17,893 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 218 trivial. 0 not checked. [2025-01-09 00:26:17,893 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 00:26:17,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [139872616] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:26:17,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 00:26:17,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-01-09 00:26:17,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197579715] [2025-01-09 00:26:17,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:26:17,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:26:17,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:26:17,897 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:26:17,897 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-01-09 00:26:17,897 INFO L87 Difference]: Start difference. First operand 70573 states and 79674 transitions. Second operand has 3 states, 3 states have (on average 171.66666666666666) internal successors, (515), 3 states have internal predecessors, (515), 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)