./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem17_label52.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/Problem17_label52.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 673e4a4bf325c025d58fd334f1e832326bf41b68123ee166ef18eb1ee4097cb0 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 00:15:22,561 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 00:15:22,636 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:15:22,643 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 00:15:22,645 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 00:15:22,669 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 00:15:22,670 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 00:15:22,670 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 00:15:22,671 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 00:15:22,671 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 00:15:22,672 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 00:15:22,672 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 00:15:22,672 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 00:15:22,672 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 00:15:22,673 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 00:15:22,673 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 00:15:22,673 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 00:15:22,673 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 00:15:22,673 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 00:15:22,673 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 00:15:22,673 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 00:15:22,674 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 00:15:22,674 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 00:15:22,674 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 00:15:22,674 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 00:15:22,674 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 00:15:22,674 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 00:15:22,674 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 00:15:22,674 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 00:15:22,674 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 00:15:22,674 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 00:15:22,674 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 00:15:22,674 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 00:15:22,674 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 00:15:22,674 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 00:15:22,674 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 00:15:22,674 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 00:15:22,674 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 00:15:22,675 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 00:15:22,675 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 00:15:22,675 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 00:15:22,675 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 00:15:22,675 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 00:15:22,675 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 00:15:22,675 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 00:15:22,675 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 00:15:22,675 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 00:15:22,675 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 00:15:22,675 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 -> 673e4a4bf325c025d58fd334f1e832326bf41b68123ee166ef18eb1ee4097cb0 [2025-01-09 00:15:22,977 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 00:15:22,985 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 00:15:22,988 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 00:15:22,989 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 00:15:22,989 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 00:15:22,991 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem17_label52.c [2025-01-09 00:15:24,280 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/58167a3e5/e1c59bad36ce4637b727ba9b36079a6d/FLAG373f577a5 [2025-01-09 00:15:24,741 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 00:15:24,742 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem17_label52.c [2025-01-09 00:15:24,769 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/58167a3e5/e1c59bad36ce4637b727ba9b36079a6d/FLAG373f577a5 [2025-01-09 00:15:24,785 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/58167a3e5/e1c59bad36ce4637b727ba9b36079a6d [2025-01-09 00:15:24,788 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 00:15:24,791 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 00:15:24,792 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 00:15:24,793 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 00:15:24,797 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 00:15:24,798 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:15:24" (1/1) ... [2025-01-09 00:15:24,799 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3561a257 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:15:24, skipping insertion in model container [2025-01-09 00:15:24,799 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:15:24" (1/1) ... [2025-01-09 00:15:24,866 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 00:15:25,034 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/Problem17_label52.c[1111,1124] [2025-01-09 00:15:25,586 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 00:15:25,598 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 00:15:25,611 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/Problem17_label52.c[1111,1124] [2025-01-09 00:15:25,879 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 00:15:25,894 INFO L204 MainTranslator]: Completed translation [2025-01-09 00:15:25,896 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:15:25 WrapperNode [2025-01-09 00:15:25,896 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 00:15:25,898 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 00:15:25,898 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 00:15:25,899 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 00:15:25,905 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:15:25" (1/1) ... [2025-01-09 00:15:25,940 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:15:25" (1/1) ... [2025-01-09 00:15:26,184 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 2610 [2025-01-09 00:15:26,185 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 00:15:26,186 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 00:15:26,186 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 00:15:26,186 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 00:15:26,194 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:15:25" (1/1) ... [2025-01-09 00:15:26,195 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:15:25" (1/1) ... [2025-01-09 00:15:26,236 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:15:25" (1/1) ... [2025-01-09 00:15:26,395 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:15:26,395 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:15:25" (1/1) ... [2025-01-09 00:15:26,396 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:15:25" (1/1) ... [2025-01-09 00:15:26,489 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:15:25" (1/1) ... [2025-01-09 00:15:26,508 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:15:25" (1/1) ... [2025-01-09 00:15:26,532 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:15:25" (1/1) ... [2025-01-09 00:15:26,555 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:15:25" (1/1) ... [2025-01-09 00:15:26,573 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:15:25" (1/1) ... [2025-01-09 00:15:26,616 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 00:15:26,618 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 00:15:26,618 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 00:15:26,618 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 00:15:26,619 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:15:25" (1/1) ... [2025-01-09 00:15:26,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 00:15:26,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:15:26,654 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:15:26,658 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:15:26,679 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 00:15:26,680 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 00:15:26,680 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 00:15:26,680 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 00:15:26,746 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 00:15:26,748 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 00:15:30,238 INFO L? ?]: Removed 372 outVars from TransFormulas that were not future-live. [2025-01-09 00:15:30,238 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 00:15:30,273 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 00:15:30,278 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 00:15:30,278 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:15:30 BoogieIcfgContainer [2025-01-09 00:15:30,278 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 00:15:30,284 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 00:15:30,285 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 00:15:30,290 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 00:15:30,290 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 12:15:24" (1/3) ... [2025-01-09 00:15:30,291 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@406ab0b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:15:30, skipping insertion in model container [2025-01-09 00:15:30,291 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:15:25" (2/3) ... [2025-01-09 00:15:30,292 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@406ab0b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:15:30, skipping insertion in model container [2025-01-09 00:15:30,292 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:15:30" (3/3) ... [2025-01-09 00:15:30,294 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem17_label52.c [2025-01-09 00:15:30,309 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 00:15:30,312 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem17_label52.c that has 1 procedures, 590 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 00:15:30,400 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 00:15:30,412 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;@6aafb31f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 00:15:30,413 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 00:15:30,420 INFO L276 IsEmpty]: Start isEmpty. Operand has 590 states, 588 states have (on average 1.804421768707483) internal successors, (1061), 589 states have internal predecessors, (1061), 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:15:30,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-01-09 00:15:30,425 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:15:30,426 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-01-09 00:15:30,426 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:15:30,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:15:30,432 INFO L85 PathProgramCache]: Analyzing trace with hash 889540490, now seen corresponding path program 1 times [2025-01-09 00:15:30,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:15:30,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4745856] [2025-01-09 00:15:30,441 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:15:30,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:15:30,507 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-09 00:15:30,529 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-09 00:15:30,530 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:15:30,530 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:15:30,661 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:15:30,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:15:30,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4745856] [2025-01-09 00:15:30,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [4745856] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:15:30,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:15:30,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 00:15:30,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730769406] [2025-01-09 00:15:30,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:15:30,668 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:15:30,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:15:30,688 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:15:30,689 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:15:30,692 INFO L87 Difference]: Start difference. First operand has 590 states, 588 states have (on average 1.804421768707483) internal successors, (1061), 589 states have internal predecessors, (1061), 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 2.0) internal successors, (6), 2 states have internal predecessors, (6), 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:15:32,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:15:32,994 INFO L93 Difference]: Finished difference Result 1644 states and 3026 transitions. [2025-01-09 00:15:32,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:15:32,995 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 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 6 [2025-01-09 00:15:32,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:15:33,030 INFO L225 Difference]: With dead ends: 1644 [2025-01-09 00:15:33,031 INFO L226 Difference]: Without dead ends: 977 [2025-01-09 00:15:33,040 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:15:33,048 INFO L435 NwaCegarLoop]: 425 mSDtfsCounter, 482 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 1470 mSolverCounterSat, 332 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 482 SdHoareTripleChecker+Valid, 503 SdHoareTripleChecker+Invalid, 1802 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 332 IncrementalHoareTripleChecker+Valid, 1470 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-01-09 00:15:33,048 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [482 Valid, 503 Invalid, 1802 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [332 Valid, 1470 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-01-09 00:15:33,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 977 states. [2025-01-09 00:15:33,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 977 to 971. [2025-01-09 00:15:33,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 971 states, 970 states have (on average 1.5536082474226804) internal successors, (1507), 970 states have internal predecessors, (1507), 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:15:33,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 971 states to 971 states and 1507 transitions. [2025-01-09 00:15:33,199 INFO L78 Accepts]: Start accepts. Automaton has 971 states and 1507 transitions. Word has length 6 [2025-01-09 00:15:33,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:15:33,200 INFO L471 AbstractCegarLoop]: Abstraction has 971 states and 1507 transitions. [2025-01-09 00:15:33,200 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 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:15:33,200 INFO L276 IsEmpty]: Start isEmpty. Operand 971 states and 1507 transitions. [2025-01-09 00:15:33,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-01-09 00:15:33,205 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:15:33,206 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-09 00:15:33,206 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 00:15:33,206 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:15:33,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:15:33,207 INFO L85 PathProgramCache]: Analyzing trace with hash -1037106147, now seen corresponding path program 1 times [2025-01-09 00:15:33,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:15:33,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064474148] [2025-01-09 00:15:33,207 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:15:33,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:15:33,248 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-01-09 00:15:33,302 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-01-09 00:15:33,306 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:15:33,307 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:15:33,643 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:15:33,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:15:33,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064474148] [2025-01-09 00:15:33,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064474148] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:15:33,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:15:33,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 00:15:33,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452898707] [2025-01-09 00:15:33,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:15:33,645 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:15:33,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:15:33,646 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:15:33,646 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:15:33,646 INFO L87 Difference]: Start difference. First operand 971 states and 1507 transitions. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 2 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:15:35,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:15:35,779 INFO L93 Difference]: Finished difference Result 2846 states and 4429 transitions. [2025-01-09 00:15:35,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:15:35,780 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 2 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 73 [2025-01-09 00:15:35,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:15:35,789 INFO L225 Difference]: With dead ends: 2846 [2025-01-09 00:15:35,789 INFO L226 Difference]: Without dead ends: 1877 [2025-01-09 00:15:35,794 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:15:35,795 INFO L435 NwaCegarLoop]: 182 mSDtfsCounter, 444 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 1492 mSolverCounterSat, 350 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 444 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 1842 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 350 IncrementalHoareTripleChecker+Valid, 1492 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-01-09 00:15:35,796 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [444 Valid, 241 Invalid, 1842 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [350 Valid, 1492 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-01-09 00:15:35,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1877 states. [2025-01-09 00:15:35,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1877 to 1854. [2025-01-09 00:15:35,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1854 states, 1853 states have (on average 1.489476524554776) internal successors, (2760), 1853 states have internal predecessors, (2760), 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:15:35,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1854 states to 1854 states and 2760 transitions. [2025-01-09 00:15:35,848 INFO L78 Accepts]: Start accepts. Automaton has 1854 states and 2760 transitions. Word has length 73 [2025-01-09 00:15:35,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:15:35,849 INFO L471 AbstractCegarLoop]: Abstraction has 1854 states and 2760 transitions. [2025-01-09 00:15:35,849 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 2 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:15:35,849 INFO L276 IsEmpty]: Start isEmpty. Operand 1854 states and 2760 transitions. [2025-01-09 00:15:35,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-01-09 00:15:35,851 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:15:35,851 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-09 00:15:35,851 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 00:15:35,851 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:15:35,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:15:35,852 INFO L85 PathProgramCache]: Analyzing trace with hash -1344557322, now seen corresponding path program 1 times [2025-01-09 00:15:35,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:15:35,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913472701] [2025-01-09 00:15:35,853 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:15:35,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:15:35,876 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-01-09 00:15:35,899 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-01-09 00:15:35,900 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:15:35,902 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:15:36,077 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:15:36,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:15:36,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913472701] [2025-01-09 00:15:36,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [913472701] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:15:36,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:15:36,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:15:36,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528994701] [2025-01-09 00:15:36,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:15:36,080 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:15:36,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:15:36,081 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:15:36,081 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:15:36,081 INFO L87 Difference]: Start difference. First operand 1854 states and 2760 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:15:38,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:15:38,228 INFO L93 Difference]: Finished difference Result 4574 states and 7028 transitions. [2025-01-09 00:15:38,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:15:38,230 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2025-01-09 00:15:38,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:15:38,241 INFO L225 Difference]: With dead ends: 4574 [2025-01-09 00:15:38,241 INFO L226 Difference]: Without dead ends: 2722 [2025-01-09 00:15:38,244 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:15:38,245 INFO L435 NwaCegarLoop]: 851 mSDtfsCounter, 486 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 1279 mSolverCounterSat, 414 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 486 SdHoareTripleChecker+Valid, 919 SdHoareTripleChecker+Invalid, 1693 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 414 IncrementalHoareTripleChecker+Valid, 1279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-01-09 00:15:38,245 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [486 Valid, 919 Invalid, 1693 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [414 Valid, 1279 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-01-09 00:15:38,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2722 states. [2025-01-09 00:15:38,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2722 to 2720. [2025-01-09 00:15:38,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2720 states, 2719 states have (on average 1.4133872747333578) internal successors, (3843), 2719 states have internal predecessors, (3843), 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:15:38,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2720 states to 2720 states and 3843 transitions. [2025-01-09 00:15:38,307 INFO L78 Accepts]: Start accepts. Automaton has 2720 states and 3843 transitions. Word has length 76 [2025-01-09 00:15:38,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:15:38,307 INFO L471 AbstractCegarLoop]: Abstraction has 2720 states and 3843 transitions. [2025-01-09 00:15:38,308 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:15:38,308 INFO L276 IsEmpty]: Start isEmpty. Operand 2720 states and 3843 transitions. [2025-01-09 00:15:38,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-01-09 00:15:38,309 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:15:38,310 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:15:38,310 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 00:15:38,310 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:15:38,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:15:38,311 INFO L85 PathProgramCache]: Analyzing trace with hash -1460812367, now seen corresponding path program 1 times [2025-01-09 00:15:38,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:15:38,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898732089] [2025-01-09 00:15:38,311 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:15:38,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:15:38,330 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-01-09 00:15:38,347 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-01-09 00:15:38,347 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:15:38,348 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:15:38,452 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:15:38,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:15:38,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898732089] [2025-01-09 00:15:38,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1898732089] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:15:38,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:15:38,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 00:15:38,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608180084] [2025-01-09 00:15:38,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:15:38,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:15:38,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:15:38,454 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:15:38,454 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:15:38,454 INFO L87 Difference]: Start difference. First operand 2720 states and 3843 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 2 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:15:40,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:15:40,414 INFO L93 Difference]: Finished difference Result 8023 states and 11344 transitions. [2025-01-09 00:15:40,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:15:40,415 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 2 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2025-01-09 00:15:40,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:15:40,432 INFO L225 Difference]: With dead ends: 8023 [2025-01-09 00:15:40,432 INFO L226 Difference]: Without dead ends: 5305 [2025-01-09 00:15:40,437 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:15:40,438 INFO L435 NwaCegarLoop]: 507 mSDtfsCounter, 402 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 1382 mSolverCounterSat, 324 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 402 SdHoareTripleChecker+Valid, 580 SdHoareTripleChecker+Invalid, 1706 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 324 IncrementalHoareTripleChecker+Valid, 1382 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-01-09 00:15:40,438 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [402 Valid, 580 Invalid, 1706 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [324 Valid, 1382 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-01-09 00:15:40,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5305 states. [2025-01-09 00:15:40,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5305 to 5299. [2025-01-09 00:15:40,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5299 states, 5298 states have (on average 1.2659494148735373) internal successors, (6707), 5298 states have internal predecessors, (6707), 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:15:40,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5299 states to 5299 states and 6707 transitions. [2025-01-09 00:15:40,536 INFO L78 Accepts]: Start accepts. Automaton has 5299 states and 6707 transitions. Word has length 78 [2025-01-09 00:15:40,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:15:40,537 INFO L471 AbstractCegarLoop]: Abstraction has 5299 states and 6707 transitions. [2025-01-09 00:15:40,537 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 2 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:15:40,537 INFO L276 IsEmpty]: Start isEmpty. Operand 5299 states and 6707 transitions. [2025-01-09 00:15:40,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-01-09 00:15:40,544 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:15:40,544 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:15:40,544 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 00:15:40,545 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:15:40,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:15:40,545 INFO L85 PathProgramCache]: Analyzing trace with hash 236455692, now seen corresponding path program 1 times [2025-01-09 00:15:40,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:15:40,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829254723] [2025-01-09 00:15:40,545 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:15:40,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:15:40,572 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-01-09 00:15:40,605 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-01-09 00:15:40,605 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:15:40,605 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:15:40,797 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2025-01-09 00:15:40,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:15:40,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829254723] [2025-01-09 00:15:40,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [829254723] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:15:40,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:15:40,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 00:15:40,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360741204] [2025-01-09 00:15:40,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:15:40,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:15:40,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:15:40,800 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:15:40,800 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:15:40,800 INFO L87 Difference]: Start difference. First operand 5299 states and 6707 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 2 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:15:42,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:15:42,601 INFO L93 Difference]: Finished difference Result 15280 states and 19396 transitions. [2025-01-09 00:15:42,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:15:42,602 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 2 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 145 [2025-01-09 00:15:42,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:15:42,625 INFO L225 Difference]: With dead ends: 15280 [2025-01-09 00:15:42,625 INFO L226 Difference]: Without dead ends: 8704 [2025-01-09 00:15:42,634 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:15:42,635 INFO L435 NwaCegarLoop]: 515 mSDtfsCounter, 386 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 1081 mSolverCounterSat, 548 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 386 SdHoareTripleChecker+Valid, 590 SdHoareTripleChecker+Invalid, 1629 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 548 IncrementalHoareTripleChecker+Valid, 1081 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-01-09 00:15:42,636 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [386 Valid, 590 Invalid, 1629 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [548 Valid, 1081 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-01-09 00:15:42,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8704 states. [2025-01-09 00:15:42,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8704 to 6998. [2025-01-09 00:15:42,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6998 states, 6997 states have (on average 1.1554952122338145) internal successors, (8085), 6997 states have internal predecessors, (8085), 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:15:42,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6998 states to 6998 states and 8085 transitions. [2025-01-09 00:15:42,824 INFO L78 Accepts]: Start accepts. Automaton has 6998 states and 8085 transitions. Word has length 145 [2025-01-09 00:15:42,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:15:42,825 INFO L471 AbstractCegarLoop]: Abstraction has 6998 states and 8085 transitions. [2025-01-09 00:15:42,825 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 2 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:15:42,826 INFO L276 IsEmpty]: Start isEmpty. Operand 6998 states and 8085 transitions. [2025-01-09 00:15:42,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2025-01-09 00:15:42,827 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:15:42,827 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:15:42,827 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 00:15:42,827 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:15:42,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:15:42,828 INFO L85 PathProgramCache]: Analyzing trace with hash -1396990483, now seen corresponding path program 1 times [2025-01-09 00:15:42,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:15:42,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383844903] [2025-01-09 00:15:42,828 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:15:42,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:15:42,858 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-01-09 00:15:42,877 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-01-09 00:15:42,879 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:15:42,880 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:15:43,053 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:15:43,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:15:43,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383844903] [2025-01-09 00:15:43,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [383844903] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:15:43,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:15:43,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:15:43,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129886415] [2025-01-09 00:15:43,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:15:43,056 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:15:43,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:15:43,057 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:15:43,057 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:15:43,057 INFO L87 Difference]: Start difference. First operand 6998 states and 8085 transitions. Second operand has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 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:15:44,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:15:44,620 INFO L93 Difference]: Finished difference Result 17826 states and 20935 transitions. [2025-01-09 00:15:44,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:15:44,620 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 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 158 [2025-01-09 00:15:44,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:15:44,646 INFO L225 Difference]: With dead ends: 17826 [2025-01-09 00:15:44,646 INFO L226 Difference]: Without dead ends: 10830 [2025-01-09 00:15:44,651 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:15:44,652 INFO L435 NwaCegarLoop]: 721 mSDtfsCounter, 496 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 1136 mSolverCounterSat, 306 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 496 SdHoareTripleChecker+Valid, 779 SdHoareTripleChecker+Invalid, 1442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 306 IncrementalHoareTripleChecker+Valid, 1136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-01-09 00:15:44,652 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [496 Valid, 779 Invalid, 1442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [306 Valid, 1136 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-01-09 00:15:44,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10830 states. [2025-01-09 00:15:44,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10830 to 10405. [2025-01-09 00:15:44,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10405 states, 10404 states have (on average 1.147443291041907) internal successors, (11938), 10404 states have internal predecessors, (11938), 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:15:44,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10405 states to 10405 states and 11938 transitions. [2025-01-09 00:15:44,803 INFO L78 Accepts]: Start accepts. Automaton has 10405 states and 11938 transitions. Word has length 158 [2025-01-09 00:15:44,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:15:44,803 INFO L471 AbstractCegarLoop]: Abstraction has 10405 states and 11938 transitions. [2025-01-09 00:15:44,804 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 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:15:44,804 INFO L276 IsEmpty]: Start isEmpty. Operand 10405 states and 11938 transitions. [2025-01-09 00:15:44,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-01-09 00:15:44,805 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:15:44,805 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:15:44,805 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 00:15:44,806 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:15:44,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:15:44,806 INFO L85 PathProgramCache]: Analyzing trace with hash -595169400, now seen corresponding path program 1 times [2025-01-09 00:15:44,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:15:44,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204806796] [2025-01-09 00:15:44,807 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:15:44,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:15:44,832 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-01-09 00:15:44,850 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-01-09 00:15:44,851 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:15:44,851 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:15:45,142 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 7 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:15:45,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:15:45,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204806796] [2025-01-09 00:15:45,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [204806796] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 00:15:45,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [825756419] [2025-01-09 00:15:45,144 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:15:45,144 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:15:45,144 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:15:45,147 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:15:45,148 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:15:45,211 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-01-09 00:15:45,252 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-01-09 00:15:45,253 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:15:45,253 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:15:45,255 INFO L256 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 00:15:45,262 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 00:15:45,495 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 7 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:15:45,495 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 00:15:45,773 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:15:45,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [825756419] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-09 00:15:45,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-01-09 00:15:45,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 3] total 5 [2025-01-09 00:15:45,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859397116] [2025-01-09 00:15:45,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:15:45,774 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 00:15:45,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:15:45,775 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 00:15:45,775 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-09 00:15:45,775 INFO L87 Difference]: Start difference. First operand 10405 states and 11938 transitions. Second operand has 4 states, 4 states have (on average 40.0) internal successors, (160), 3 states have internal predecessors, (160), 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:15:48,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:15:48,630 INFO L93 Difference]: Finished difference Result 31055 states and 36045 transitions. [2025-01-09 00:15:48,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 00:15:48,631 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 40.0) internal successors, (160), 3 states have internal predecessors, (160), 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 160 [2025-01-09 00:15:48,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:15:48,672 INFO L225 Difference]: With dead ends: 31055 [2025-01-09 00:15:48,673 INFO L226 Difference]: Without dead ends: 18922 [2025-01-09 00:15:48,688 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 321 GetRequests, 317 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-09 00:15:48,690 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 1047 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 2183 mSolverCounterSat, 1043 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1047 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 3226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1043 IncrementalHoareTripleChecker+Valid, 2183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-01-09 00:15:48,691 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1047 Valid, 154 Invalid, 3226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1043 Valid, 2183 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-01-09 00:15:48,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18922 states. [2025-01-09 00:15:49,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18922 to 18917. [2025-01-09 00:15:49,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18917 states, 18916 states have (on average 1.142154789596109) internal successors, (21605), 18916 states have internal predecessors, (21605), 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:15:49,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18917 states to 18917 states and 21605 transitions. [2025-01-09 00:15:49,134 INFO L78 Accepts]: Start accepts. Automaton has 18917 states and 21605 transitions. Word has length 160 [2025-01-09 00:15:49,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:15:49,135 INFO L471 AbstractCegarLoop]: Abstraction has 18917 states and 21605 transitions. [2025-01-09 00:15:49,136 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 40.0) internal successors, (160), 3 states have internal predecessors, (160), 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:15:49,136 INFO L276 IsEmpty]: Start isEmpty. Operand 18917 states and 21605 transitions. [2025-01-09 00:15:49,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2025-01-09 00:15:49,139 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:15:49,139 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:15:49,149 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 00:15:49,344 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:15:49,344 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:15:49,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:15:49,345 INFO L85 PathProgramCache]: Analyzing trace with hash 1931249190, now seen corresponding path program 1 times [2025-01-09 00:15:49,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:15:49,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355170440] [2025-01-09 00:15:49,345 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:15:49,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:15:49,374 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 234 statements into 1 equivalence classes. [2025-01-09 00:15:49,403 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 234 of 234 statements. [2025-01-09 00:15:49,404 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:15:49,404 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:15:49,795 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 11 proven. 214 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:15:49,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:15:49,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355170440] [2025-01-09 00:15:49,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1355170440] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 00:15:49,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [551573526] [2025-01-09 00:15:49,796 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:15:49,796 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:15:49,796 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:15:49,799 INFO L229 MonitoredProcess]: Starting monitored process 3 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:15:49,800 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 00:15:49,857 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 234 statements into 1 equivalence classes. [2025-01-09 00:15:49,910 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 234 of 234 statements. [2025-01-09 00:15:49,911 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:15:49,911 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:15:49,916 INFO L256 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 00:15:49,924 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 00:15:50,240 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 148 proven. 73 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 00:15:50,241 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 00:15:50,517 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 221 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 00:15:50,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [551573526] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-09 00:15:50,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-01-09 00:15:50,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4, 3] total 6 [2025-01-09 00:15:50,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833937] [2025-01-09 00:15:50,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:15:50,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 00:15:50,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:15:50,519 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 00:15:50,519 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-01-09 00:15:50,519 INFO L87 Difference]: Start difference. First operand 18917 states and 21605 transitions. Second operand has 4 states, 4 states have (on average 57.75) internal successors, (231), 3 states have internal predecessors, (231), 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:15:53,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:15:53,143 INFO L93 Difference]: Finished difference Result 51050 states and 58470 transitions. [2025-01-09 00:15:53,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 00:15:53,144 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 57.75) internal successors, (231), 3 states have internal predecessors, (231), 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 234 [2025-01-09 00:15:53,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:15:53,205 INFO L225 Difference]: With dead ends: 51050 [2025-01-09 00:15:53,205 INFO L226 Difference]: Without dead ends: 32135 [2025-01-09 00:15:53,227 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 470 GetRequests, 465 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-01-09 00:15:53,228 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 839 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 2268 mSolverCounterSat, 512 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 839 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 2780 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 512 IncrementalHoareTripleChecker+Valid, 2268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-01-09 00:15:53,228 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [839 Valid, 190 Invalid, 2780 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [512 Valid, 2268 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-01-09 00:15:53,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32135 states. [2025-01-09 00:15:53,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32135 to 32129. [2025-01-09 00:15:53,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32129 states, 32128 states have (on average 1.133777390438247) internal successors, (36426), 32128 states have internal predecessors, (36426), 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:15:53,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32129 states to 32129 states and 36426 transitions. [2025-01-09 00:15:53,983 INFO L78 Accepts]: Start accepts. Automaton has 32129 states and 36426 transitions. Word has length 234 [2025-01-09 00:15:53,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:15:53,983 INFO L471 AbstractCegarLoop]: Abstraction has 32129 states and 36426 transitions. [2025-01-09 00:15:53,984 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 57.75) internal successors, (231), 3 states have internal predecessors, (231), 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:15:53,984 INFO L276 IsEmpty]: Start isEmpty. Operand 32129 states and 36426 transitions. [2025-01-09 00:15:53,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 340 [2025-01-09 00:15:53,995 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:15:53,996 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 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] [2025-01-09 00:15:54,005 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-09 00:15:54,200 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:15:54,200 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:15:54,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:15:54,201 INFO L85 PathProgramCache]: Analyzing trace with hash 1887220495, now seen corresponding path program 1 times [2025-01-09 00:15:54,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:15:54,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421690082] [2025-01-09 00:15:54,201 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:15:54,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:15:54,293 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 339 statements into 1 equivalence classes. [2025-01-09 00:15:54,327 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 339 of 339 statements. [2025-01-09 00:15:54,327 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:15:54,327 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:15:54,587 INFO L134 CoverageAnalysis]: Checked inductivity of 456 backedges. 370 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2025-01-09 00:15:54,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:15:54,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421690082] [2025-01-09 00:15:54,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1421690082] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:15:54,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:15:54,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:15:54,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476862573] [2025-01-09 00:15:54,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:15:54,588 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:15:54,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:15:54,590 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:15:54,590 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:15:54,590 INFO L87 Difference]: Start difference. First operand 32129 states and 36426 transitions. Second operand has 3 states, 3 states have (on average 85.0) internal successors, (255), 3 states have internal predecessors, (255), 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:15:56,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:15:56,574 INFO L93 Difference]: Finished difference Result 76229 states and 86170 transitions. [2025-01-09 00:15:56,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:15:56,575 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 85.0) internal successors, (255), 3 states have internal predecessors, (255), 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 339 [2025-01-09 00:15:56,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:15:56,651 INFO L225 Difference]: With dead ends: 76229 [2025-01-09 00:15:56,651 INFO L226 Difference]: Without dead ends: 44527 [2025-01-09 00:15:56,684 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:15:56,684 INFO L435 NwaCegarLoop]: 644 mSDtfsCounter, 428 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 1307 mSolverCounterSat, 193 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 428 SdHoareTripleChecker+Valid, 688 SdHoareTripleChecker+Invalid, 1500 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 193 IncrementalHoareTripleChecker+Valid, 1307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-01-09 00:15:56,685 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [428 Valid, 688 Invalid, 1500 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [193 Valid, 1307 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-01-09 00:15:56,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44527 states. [2025-01-09 00:15:57,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44527 to 42366. [2025-01-09 00:15:57,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42366 states, 42365 states have (on average 1.128974389236398) internal successors, (47829), 42365 states have internal predecessors, (47829), 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:15:57,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42366 states to 42366 states and 47829 transitions. [2025-01-09 00:15:57,451 INFO L78 Accepts]: Start accepts. Automaton has 42366 states and 47829 transitions. Word has length 339 [2025-01-09 00:15:57,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:15:57,454 INFO L471 AbstractCegarLoop]: Abstraction has 42366 states and 47829 transitions. [2025-01-09 00:15:57,454 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 85.0) internal successors, (255), 3 states have internal predecessors, (255), 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:15:57,455 INFO L276 IsEmpty]: Start isEmpty. Operand 42366 states and 47829 transitions. [2025-01-09 00:15:57,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 341 [2025-01-09 00:15:57,460 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:15:57,461 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 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:15:57,461 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 00:15:57,461 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:15:57,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:15:57,462 INFO L85 PathProgramCache]: Analyzing trace with hash 110394217, now seen corresponding path program 1 times [2025-01-09 00:15:57,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:15:57,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823590119] [2025-01-09 00:15:57,462 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:15:57,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:15:57,490 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 340 statements into 1 equivalence classes. [2025-01-09 00:15:57,521 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 340 of 340 statements. [2025-01-09 00:15:57,522 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:15:57,522 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:15:57,784 INFO L134 CoverageAnalysis]: Checked inductivity of 472 backedges. 387 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2025-01-09 00:15:57,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:15:57,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823590119] [2025-01-09 00:15:57,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1823590119] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:15:57,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:15:57,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:15:57,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236578175] [2025-01-09 00:15:57,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:15:57,785 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:15:57,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:15:57,786 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:15:57,786 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:15:57,786 INFO L87 Difference]: Start difference. First operand 42366 states and 47829 transitions. Second operand has 3 states, 3 states have (on average 85.66666666666667) internal successors, (257), 3 states have internal predecessors, (257), 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:15:59,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:15:59,657 INFO L93 Difference]: Finished difference Result 97084 states and 109958 transitions. [2025-01-09 00:15:59,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:15:59,658 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 85.66666666666667) internal successors, (257), 3 states have internal predecessors, (257), 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 340 [2025-01-09 00:15:59,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:15:59,730 INFO L225 Difference]: With dead ends: 97084 [2025-01-09 00:15:59,730 INFO L226 Difference]: Without dead ends: 55144 [2025-01-09 00:15:59,769 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:15:59,770 INFO L435 NwaCegarLoop]: 603 mSDtfsCounter, 436 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 1173 mSolverCounterSat, 270 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 436 SdHoareTripleChecker+Valid, 641 SdHoareTripleChecker+Invalid, 1443 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 270 IncrementalHoareTripleChecker+Valid, 1173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-01-09 00:15:59,770 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [436 Valid, 641 Invalid, 1443 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [270 Valid, 1173 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-01-09 00:15:59,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55144 states. [2025-01-09 00:16:00,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55144 to 51729. [2025-01-09 00:16:00,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51729 states, 51728 states have (on average 1.1286537271883699) internal successors, (58383), 51728 states have internal predecessors, (58383), 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:16:00,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51729 states to 51729 states and 58383 transitions. [2025-01-09 00:16:00,394 INFO L78 Accepts]: Start accepts. Automaton has 51729 states and 58383 transitions. Word has length 340 [2025-01-09 00:16:00,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:16:00,395 INFO L471 AbstractCegarLoop]: Abstraction has 51729 states and 58383 transitions. [2025-01-09 00:16:00,395 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 85.66666666666667) internal successors, (257), 3 states have internal predecessors, (257), 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:16:00,395 INFO L276 IsEmpty]: Start isEmpty. Operand 51729 states and 58383 transitions. [2025-01-09 00:16:00,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 345 [2025-01-09 00:16:00,400 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:16:00,401 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-01-09 00:16:00,401 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 00:16:00,401 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:16:00,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:16:00,402 INFO L85 PathProgramCache]: Analyzing trace with hash 1867246240, now seen corresponding path program 1 times [2025-01-09 00:16:00,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:16:00,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002688151] [2025-01-09 00:16:00,402 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:16:00,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:16:00,436 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 344 statements into 1 equivalence classes. [2025-01-09 00:16:00,467 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 344 of 344 statements. [2025-01-09 00:16:00,468 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:16:00,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:16:01,120 INFO L134 CoverageAnalysis]: Checked inductivity of 466 backedges. 462 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 00:16:01,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:16:01,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002688151] [2025-01-09 00:16:01,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2002688151] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:16:01,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:16:01,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 00:16:01,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403497929] [2025-01-09 00:16:01,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:16:01,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 00:16:01,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:16:01,122 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 00:16:01,122 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 00:16:01,122 INFO L87 Difference]: Start difference. First operand 51729 states and 58383 transitions. Second operand has 4 states, 4 states have (on average 85.25) internal successors, (341), 4 states have internal predecessors, (341), 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:16:03,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:16:03,699 INFO L93 Difference]: Finished difference Result 133762 states and 150839 transitions. [2025-01-09 00:16:03,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 00:16:03,700 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 85.25) internal successors, (341), 4 states have internal predecessors, (341), 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 344 [2025-01-09 00:16:03,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:16:03,780 INFO L225 Difference]: With dead ends: 133762 [2025-01-09 00:16:03,781 INFO L226 Difference]: Without dead ends: 82460 [2025-01-09 00:16:03,817 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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:16:03,818 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 816 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 2330 mSolverCounterSat, 411 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 816 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 2741 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 411 IncrementalHoareTripleChecker+Valid, 2330 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-01-09 00:16:03,818 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [816 Valid, 203 Invalid, 2741 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [411 Valid, 2330 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-01-09 00:16:03,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82460 states. [2025-01-09 00:16:04,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82460 to 76069. [2025-01-09 00:16:05,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76069 states, 76068 states have (on average 1.1304885102802755) internal successors, (85994), 76068 states have internal predecessors, (85994), 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:16:05,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76069 states to 76069 states and 85994 transitions. [2025-01-09 00:16:05,072 INFO L78 Accepts]: Start accepts. Automaton has 76069 states and 85994 transitions. Word has length 344 [2025-01-09 00:16:05,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:16:05,072 INFO L471 AbstractCegarLoop]: Abstraction has 76069 states and 85994 transitions. [2025-01-09 00:16:05,072 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 85.25) internal successors, (341), 4 states have internal predecessors, (341), 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:16:05,072 INFO L276 IsEmpty]: Start isEmpty. Operand 76069 states and 85994 transitions. [2025-01-09 00:16:05,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 346 [2025-01-09 00:16:05,076 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:16:05,076 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-09 00:16:05,076 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 00:16:05,076 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:16:05,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:16:05,077 INFO L85 PathProgramCache]: Analyzing trace with hash 1298967867, now seen corresponding path program 1 times [2025-01-09 00:16:05,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:16:05,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825386739] [2025-01-09 00:16:05,077 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:16:05,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:16:05,111 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 345 statements into 1 equivalence classes. [2025-01-09 00:16:05,131 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 345 of 345 statements. [2025-01-09 00:16:05,131 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:16:05,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:16:05,504 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:16:05,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:16:05,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825386739] [2025-01-09 00:16:05,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1825386739] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:16:05,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:16:05,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:16:05,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093634847] [2025-01-09 00:16:05,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:16:05,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 00:16:05,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:16:05,508 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 00:16:05,508 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 00:16:05,508 INFO L87 Difference]: Start difference. First operand 76069 states and 85994 transitions. Second operand has 4 states, 4 states have (on average 86.25) internal successors, (345), 3 states have internal predecessors, (345), 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:16:07,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:16:07,928 INFO L93 Difference]: Finished difference Result 155961 states and 176069 transitions. [2025-01-09 00:16:07,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 00:16:07,928 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 86.25) internal successors, (345), 3 states have internal predecessors, (345), 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 345 [2025-01-09 00:16:07,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:16:08,016 INFO L225 Difference]: With dead ends: 155961 [2025-01-09 00:16:08,016 INFO L226 Difference]: Without dead ends: 79894 [2025-01-09 00:16:08,059 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:16:08,059 INFO L435 NwaCegarLoop]: 140 mSDtfsCounter, 606 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 2290 mSolverCounterSat, 228 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 606 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 2518 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 228 IncrementalHoareTripleChecker+Valid, 2290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-01-09 00:16:08,060 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [606 Valid, 255 Invalid, 2518 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [228 Valid, 2290 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-01-09 00:16:08,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79894 states. [2025-01-09 00:16:09,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79894 to 76069. [2025-01-09 00:16:09,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76069 states, 76068 states have (on average 1.1304753641478678) internal successors, (85993), 76068 states have internal predecessors, (85993), 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:16:09,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76069 states to 76069 states and 85993 transitions. [2025-01-09 00:16:09,221 INFO L78 Accepts]: Start accepts. Automaton has 76069 states and 85993 transitions. Word has length 345 [2025-01-09 00:16:09,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:16:09,221 INFO L471 AbstractCegarLoop]: Abstraction has 76069 states and 85993 transitions. [2025-01-09 00:16:09,221 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 86.25) internal successors, (345), 3 states have internal predecessors, (345), 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:16:09,222 INFO L276 IsEmpty]: Start isEmpty. Operand 76069 states and 85993 transitions. [2025-01-09 00:16:09,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 360 [2025-01-09 00:16:09,225 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:16:09,226 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 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] [2025-01-09 00:16:09,226 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 00:16:09,226 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:16:09,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:16:09,226 INFO L85 PathProgramCache]: Analyzing trace with hash -1544475071, now seen corresponding path program 1 times [2025-01-09 00:16:09,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:16:09,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848035163] [2025-01-09 00:16:09,227 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:16:09,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:16:09,258 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 359 statements into 1 equivalence classes. [2025-01-09 00:16:09,286 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 359 of 359 statements. [2025-01-09 00:16:09,286 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:16:09,286 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:16:09,811 INFO L134 CoverageAnalysis]: Checked inductivity of 456 backedges. 223 proven. 4 refuted. 0 times theorem prover too weak. 229 trivial. 0 not checked. [2025-01-09 00:16:09,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:16:09,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848035163] [2025-01-09 00:16:09,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [848035163] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 00:16:09,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [770233942] [2025-01-09 00:16:09,812 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:16:09,812 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:16:09,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:16:09,815 INFO L229 MonitoredProcess]: Starting monitored process 4 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:16:09,817 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 00:16:09,876 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 359 statements into 1 equivalence classes. [2025-01-09 00:16:09,939 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 359 of 359 statements. [2025-01-09 00:16:09,939 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:16:09,939 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:16:09,941 INFO L256 TraceCheckSpWp]: Trace formula consists of 505 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 00:16:09,945 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 00:16:10,142 INFO L134 CoverageAnalysis]: Checked inductivity of 456 backedges. 223 proven. 4 refuted. 0 times theorem prover too weak. 229 trivial. 0 not checked. [2025-01-09 00:16:10,142 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 00:16:10,438 INFO L134 CoverageAnalysis]: Checked inductivity of 456 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 441 trivial. 0 not checked. [2025-01-09 00:16:10,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [770233942] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-09 00:16:10,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-01-09 00:16:10,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4, 4] total 6 [2025-01-09 00:16:10,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636720775] [2025-01-09 00:16:10,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:16:10,441 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:16:10,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:16:10,442 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:16:10,442 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-01-09 00:16:10,442 INFO L87 Difference]: Start difference. First operand 76069 states and 85993 transitions. Second operand has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 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:16:12,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:16:12,122 INFO L93 Difference]: Finished difference Result 154243 states and 174260 transitions. [2025-01-09 00:16:12,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:16:12,122 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 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 359 [2025-01-09 00:16:12,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:16:12,200 INFO L225 Difference]: With dead ends: 154243 [2025-01-09 00:16:12,200 INFO L226 Difference]: Without dead ends: 78169 [2025-01-09 00:16:12,242 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 720 GetRequests, 715 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-01-09 00:16:12,242 INFO L435 NwaCegarLoop]: 666 mSDtfsCounter, 485 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 1255 mSolverCounterSat, 188 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 485 SdHoareTripleChecker+Valid, 710 SdHoareTripleChecker+Invalid, 1443 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 188 IncrementalHoareTripleChecker+Valid, 1255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-01-09 00:16:12,242 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [485 Valid, 710 Invalid, 1443 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [188 Valid, 1255 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-01-09 00:16:12,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78169 states. [2025-01-09 00:16:13,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78169 to 77703. [2025-01-09 00:16:13,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77703 states, 77702 states have (on average 1.1160845280687757) internal successors, (86722), 77702 states have internal predecessors, (86722), 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:16:13,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77703 states to 77703 states and 86722 transitions. [2025-01-09 00:16:13,472 INFO L78 Accepts]: Start accepts. Automaton has 77703 states and 86722 transitions. Word has length 359 [2025-01-09 00:16:13,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:16:13,473 INFO L471 AbstractCegarLoop]: Abstraction has 77703 states and 86722 transitions. [2025-01-09 00:16:13,473 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 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:16:13,473 INFO L276 IsEmpty]: Start isEmpty. Operand 77703 states and 86722 transitions. [2025-01-09 00:16:13,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 573 [2025-01-09 00:16:13,489 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:16:13,490 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-01-09 00:16:13,496 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-09 00:16:13,690 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:16:13,690 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:16:13,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:16:13,691 INFO L85 PathProgramCache]: Analyzing trace with hash 1367732929, now seen corresponding path program 1 times [2025-01-09 00:16:13,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:16:13,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665561687] [2025-01-09 00:16:13,691 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:16:13,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:16:13,743 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 572 statements into 1 equivalence classes. [2025-01-09 00:16:13,776 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 572 of 572 statements. [2025-01-09 00:16:13,776 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:16:13,776 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:16:14,285 INFO L134 CoverageAnalysis]: Checked inductivity of 525 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 510 trivial. 0 not checked. [2025-01-09 00:16:14,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:16:14,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665561687] [2025-01-09 00:16:14,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665561687] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:16:14,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:16:14,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:16:14,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123210235] [2025-01-09 00:16:14,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:16:14,287 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:16:14,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:16:14,288 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:16:14,288 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:16:14,288 INFO L87 Difference]: Start difference. First operand 77703 states and 86722 transitions. Second operand has 3 states, 3 states have (on average 98.0) internal successors, (294), 3 states have internal predecessors, (294), 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:16:15,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:16:15,931 INFO L93 Difference]: Finished difference Result 165633 states and 184355 transitions. [2025-01-09 00:16:15,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:16:15,932 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 98.0) internal successors, (294), 3 states have internal predecessors, (294), 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 572 [2025-01-09 00:16:15,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:16:16,021 INFO L225 Difference]: With dead ends: 165633 [2025-01-09 00:16:16,021 INFO L226 Difference]: Without dead ends: 86657 [2025-01-09 00:16:16,055 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:16:16,055 INFO L435 NwaCegarLoop]: 759 mSDtfsCounter, 444 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 1276 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 444 SdHoareTripleChecker+Valid, 814 SdHoareTripleChecker+Invalid, 1362 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 1276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-01-09 00:16:16,056 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [444 Valid, 814 Invalid, 1362 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 1276 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-01-09 00:16:16,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86657 states. [2025-01-09 00:16:16,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86657 to 85784. [2025-01-09 00:16:17,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85784 states, 85783 states have (on average 1.1074921604513714) internal successors, (95004), 85783 states have internal predecessors, (95004), 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:16:17,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85784 states to 85784 states and 95004 transitions. [2025-01-09 00:16:17,157 INFO L78 Accepts]: Start accepts. Automaton has 85784 states and 95004 transitions. Word has length 572 [2025-01-09 00:16:17,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:16:17,158 INFO L471 AbstractCegarLoop]: Abstraction has 85784 states and 95004 transitions. [2025-01-09 00:16:17,158 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 98.0) internal successors, (294), 3 states have internal predecessors, (294), 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:16:17,158 INFO L276 IsEmpty]: Start isEmpty. Operand 85784 states and 95004 transitions. [2025-01-09 00:16:17,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 584 [2025-01-09 00:16:17,179 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:16:17,180 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:16:17,180 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 00:16:17,180 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:16:17,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:16:17,181 INFO L85 PathProgramCache]: Analyzing trace with hash 1168713494, now seen corresponding path program 1 times [2025-01-09 00:16:17,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:16:17,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200659992] [2025-01-09 00:16:17,181 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:16:17,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:16:17,444 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 583 statements into 1 equivalence classes. [2025-01-09 00:16:17,470 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 583 of 583 statements. [2025-01-09 00:16:17,471 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:16:17,471 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:16:17,600 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 346 proven. 0 refuted. 0 times theorem prover too weak. 249 trivial. 0 not checked. [2025-01-09 00:16:17,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:16:17,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200659992] [2025-01-09 00:16:17,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [200659992] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:16:17,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:16:17,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:16:17,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916552535] [2025-01-09 00:16:17,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:16:17,602 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:16:17,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:16:17,603 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:16:17,603 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:16:17,603 INFO L87 Difference]: Start difference. First operand 85784 states and 95004 transitions. Second operand has 3 states, 3 states have (on average 139.33333333333334) internal successors, (418), 3 states have internal predecessors, (418), 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:16:19,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:16:19,269 INFO L93 Difference]: Finished difference Result 179220 states and 198676 transitions. [2025-01-09 00:16:19,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:16:19,270 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 139.33333333333334) internal successors, (418), 3 states have internal predecessors, (418), 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 583 [2025-01-09 00:16:19,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:16:19,375 INFO L225 Difference]: With dead ends: 179220 [2025-01-09 00:16:19,375 INFO L226 Difference]: Without dead ends: 93863 [2025-01-09 00:16:19,406 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:16:19,407 INFO L435 NwaCegarLoop]: 634 mSDtfsCounter, 497 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 1140 mSolverCounterSat, 177 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 497 SdHoareTripleChecker+Valid, 681 SdHoareTripleChecker+Invalid, 1317 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 177 IncrementalHoareTripleChecker+Valid, 1140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-01-09 00:16:19,407 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [497 Valid, 681 Invalid, 1317 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [177 Valid, 1140 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-01-09 00:16:19,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93863 states. [2025-01-09 00:16:20,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93863 to 93434. [2025-01-09 00:16:20,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93434 states, 93433 states have (on average 1.1009172348099707) internal successors, (102862), 93433 states have internal predecessors, (102862), 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:16:20,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93434 states to 93434 states and 102862 transitions. [2025-01-09 00:16:20,608 INFO L78 Accepts]: Start accepts. Automaton has 93434 states and 102862 transitions. Word has length 583 [2025-01-09 00:16:20,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:16:20,609 INFO L471 AbstractCegarLoop]: Abstraction has 93434 states and 102862 transitions. [2025-01-09 00:16:20,609 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 139.33333333333334) internal successors, (418), 3 states have internal predecessors, (418), 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:16:20,609 INFO L276 IsEmpty]: Start isEmpty. Operand 93434 states and 102862 transitions. [2025-01-09 00:16:20,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 598 [2025-01-09 00:16:20,632 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:16:20,633 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-01-09 00:16:20,633 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 00:16:20,633 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:16:20,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:16:20,634 INFO L85 PathProgramCache]: Analyzing trace with hash 760201431, now seen corresponding path program 1 times [2025-01-09 00:16:20,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:16:20,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020082397] [2025-01-09 00:16:20,634 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:16:20,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:16:20,698 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 597 statements into 1 equivalence classes. [2025-01-09 00:16:20,748 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 597 of 597 statements. [2025-01-09 00:16:20,748 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:16:20,749 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:16:21,674 INFO L134 CoverageAnalysis]: Checked inductivity of 562 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 547 trivial. 0 not checked. [2025-01-09 00:16:21,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:16:21,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020082397] [2025-01-09 00:16:21,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020082397] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:16:21,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:16:21,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:16:21,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84834822] [2025-01-09 00:16:21,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:16:21,675 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:16:21,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:16:21,675 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:16:21,676 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:16:21,676 INFO L87 Difference]: Start difference. First operand 93434 states and 102862 transitions. Second operand has 3 states, 3 states have (on average 105.0) internal successors, (315), 3 states have internal predecessors, (315), 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:16:23,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:16:23,161 INFO L93 Difference]: Finished difference Result 186438 states and 205292 transitions. [2025-01-09 00:16:23,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:16:23,162 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 105.0) internal successors, (315), 3 states have internal predecessors, (315), 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 597 [2025-01-09 00:16:23,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:16:23,295 INFO L225 Difference]: With dead ends: 186438 [2025-01-09 00:16:23,295 INFO L226 Difference]: Without dead ends: 93431 [2025-01-09 00:16:23,328 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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:16:23,328 INFO L435 NwaCegarLoop]: 536 mSDtfsCounter, 625 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 1076 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 625 SdHoareTripleChecker+Valid, 551 SdHoareTripleChecker+Invalid, 1170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 1076 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-09 00:16:23,328 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [625 Valid, 551 Invalid, 1170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 1076 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-09 00:16:23,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93431 states. [2025-01-09 00:16:24,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93431 to 93004. [2025-01-09 00:16:24,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93004 states, 93003 states have (on average 1.1009429803339676) internal successors, (102391), 93003 states have internal predecessors, (102391), 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:16:24,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93004 states to 93004 states and 102391 transitions. [2025-01-09 00:16:24,349 INFO L78 Accepts]: Start accepts. Automaton has 93004 states and 102391 transitions. Word has length 597 [2025-01-09 00:16:24,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:16:24,350 INFO L471 AbstractCegarLoop]: Abstraction has 93004 states and 102391 transitions. [2025-01-09 00:16:24,350 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 105.0) internal successors, (315), 3 states have internal predecessors, (315), 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:16:24,350 INFO L276 IsEmpty]: Start isEmpty. Operand 93004 states and 102391 transitions. [2025-01-09 00:16:24,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 603 [2025-01-09 00:16:24,365 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:16:24,365 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:16:24,365 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 00:16:24,365 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:16:24,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:16:24,366 INFO L85 PathProgramCache]: Analyzing trace with hash 1075999655, now seen corresponding path program 1 times [2025-01-09 00:16:24,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:16:24,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721342050] [2025-01-09 00:16:24,366 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:16:24,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:16:24,404 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 602 statements into 1 equivalence classes. [2025-01-09 00:16:24,443 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 602 of 602 statements. [2025-01-09 00:16:24,443 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:16:24,443 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:16:25,436 INFO L134 CoverageAnalysis]: Checked inductivity of 323 backedges. 241 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2025-01-09 00:16:25,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:16:25,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721342050] [2025-01-09 00:16:25,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [721342050] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:16:25,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:16:25,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:16:25,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252177760] [2025-01-09 00:16:25,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:16:25,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:16:25,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:16:25,438 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:16:25,439 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:16:25,439 INFO L87 Difference]: Start difference. First operand 93004 states and 102391 transitions. Second operand has 3 states, 3 states have (on average 173.66666666666666) internal successors, (521), 3 states have internal predecessors, (521), 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:16:27,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:16:27,276 INFO L93 Difference]: Finished difference Result 197084 states and 217300 transitions. [2025-01-09 00:16:27,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:16:27,277 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 173.66666666666666) internal successors, (521), 3 states have internal predecessors, (521), 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 602 [2025-01-09 00:16:27,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:16:27,398 INFO L225 Difference]: With dead ends: 197084 [2025-01-09 00:16:27,398 INFO L226 Difference]: Without dead ends: 104507 [2025-01-09 00:16:27,448 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:16:27,449 INFO L435 NwaCegarLoop]: 702 mSDtfsCounter, 104 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 1214 mSolverCounterSat, 120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 761 SdHoareTripleChecker+Invalid, 1334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 1214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-01-09 00:16:27,449 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 761 Invalid, 1334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [120 Valid, 1214 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-01-09 00:16:27,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104507 states. [2025-01-09 00:16:28,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104507 to 100671. [2025-01-09 00:16:28,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100671 states, 100670 states have (on average 1.0992649250024833) internal successors, (110663), 100670 states have internal predecessors, (110663), 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:16:28,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100671 states to 100671 states and 110663 transitions. [2025-01-09 00:16:28,681 INFO L78 Accepts]: Start accepts. Automaton has 100671 states and 110663 transitions. Word has length 602 [2025-01-09 00:16:28,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:16:28,682 INFO L471 AbstractCegarLoop]: Abstraction has 100671 states and 110663 transitions. [2025-01-09 00:16:28,682 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 173.66666666666666) internal successors, (521), 3 states have internal predecessors, (521), 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:16:28,682 INFO L276 IsEmpty]: Start isEmpty. Operand 100671 states and 110663 transitions. [2025-01-09 00:16:28,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 631 [2025-01-09 00:16:28,916 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:16:28,917 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:16:28,917 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 00:16:28,917 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:16:28,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:16:28,917 INFO L85 PathProgramCache]: Analyzing trace with hash 965214843, now seen corresponding path program 1 times [2025-01-09 00:16:28,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:16:28,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120247204] [2025-01-09 00:16:28,918 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:16:28,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:16:28,960 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 630 statements into 1 equivalence classes. [2025-01-09 00:16:28,986 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 630 of 630 statements. [2025-01-09 00:16:28,987 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:16:28,987 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:16:29,332 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 269 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2025-01-09 00:16:29,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:16:29,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120247204] [2025-01-09 00:16:29,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [120247204] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:16:29,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:16:29,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:16:29,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655957268] [2025-01-09 00:16:29,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:16:29,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:16:29,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:16:29,335 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:16:29,335 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:16:29,335 INFO L87 Difference]: Start difference. First operand 100671 states and 110663 transitions. Second operand has 3 states, 3 states have (on average 183.0) internal successors, (549), 3 states have internal predecessors, (549), 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:16:31,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:16:31,083 INFO L93 Difference]: Finished difference Result 209860 states and 230804 transitions. [2025-01-09 00:16:31,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:16:31,083 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 183.0) internal successors, (549), 3 states have internal predecessors, (549), 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 630 [2025-01-09 00:16:31,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:16:31,206 INFO L225 Difference]: With dead ends: 209860 [2025-01-09 00:16:31,206 INFO L226 Difference]: Without dead ends: 109616 [2025-01-09 00:16:31,265 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:16:31,266 INFO L435 NwaCegarLoop]: 281 mSDtfsCounter, 118 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 1237 mSolverCounterSat, 134 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 336 SdHoareTripleChecker+Invalid, 1371 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 134 IncrementalHoareTripleChecker+Valid, 1237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-01-09 00:16:31,266 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 336 Invalid, 1371 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [134 Valid, 1237 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-01-09 00:16:31,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109616 states. [2025-01-09 00:16:32,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109616 to 107055. [2025-01-09 00:16:32,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107055 states, 107054 states have (on average 1.0978104508005306) internal successors, (117525), 107054 states have internal predecessors, (117525), 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:16:33,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107055 states to 107055 states and 117525 transitions. [2025-01-09 00:16:33,160 INFO L78 Accepts]: Start accepts. Automaton has 107055 states and 117525 transitions. Word has length 630 [2025-01-09 00:16:33,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:16:33,160 INFO L471 AbstractCegarLoop]: Abstraction has 107055 states and 117525 transitions. [2025-01-09 00:16:33,161 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 183.0) internal successors, (549), 3 states have internal predecessors, (549), 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:16:33,161 INFO L276 IsEmpty]: Start isEmpty. Operand 107055 states and 117525 transitions. [2025-01-09 00:16:33,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 690 [2025-01-09 00:16:33,190 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:16:33,190 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-01-09 00:16:33,190 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 00:16:33,190 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:16:33,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:16:33,191 INFO L85 PathProgramCache]: Analyzing trace with hash -245661176, now seen corresponding path program 1 times [2025-01-09 00:16:33,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:16:33,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711521932] [2025-01-09 00:16:33,191 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:16:33,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:16:33,240 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 689 statements into 1 equivalence classes. [2025-01-09 00:16:33,266 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 689 of 689 statements. [2025-01-09 00:16:33,266 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:16:33,266 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:16:33,415 INFO L134 CoverageAnalysis]: Checked inductivity of 918 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 899 trivial. 0 not checked. [2025-01-09 00:16:33,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:16:33,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711521932] [2025-01-09 00:16:33,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1711521932] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:16:33,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:16:33,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:16:33,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654640202] [2025-01-09 00:16:33,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:16:33,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:16:33,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:16:33,416 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:16:33,416 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:16:33,416 INFO L87 Difference]: Start difference. First operand 107055 states and 117525 transitions. Second operand has 3 states, 3 states have (on average 106.0) internal successors, (318), 3 states have internal predecessors, (318), 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:16:35,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:16:35,260 INFO L93 Difference]: Finished difference Result 216257 states and 237334 transitions. [2025-01-09 00:16:35,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:16:35,261 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 106.0) internal successors, (318), 3 states have internal predecessors, (318), 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 689 [2025-01-09 00:16:35,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:16:35,385 INFO L225 Difference]: With dead ends: 216257 [2025-01-09 00:16:35,385 INFO L226 Difference]: Without dead ends: 108348 [2025-01-09 00:16:35,428 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:16:35,429 INFO L435 NwaCegarLoop]: 723 mSDtfsCounter, 443 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 1250 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 443 SdHoareTripleChecker+Valid, 776 SdHoareTripleChecker+Invalid, 1344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 1250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-01-09 00:16:35,429 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [443 Valid, 776 Invalid, 1344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 1250 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-01-09 00:16:35,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108348 states. [2025-01-09 00:16:36,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108348 to 103645. [2025-01-09 00:16:36,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103645 states, 103644 states have (on average 1.0985971209138976) internal successors, (113863), 103644 states have internal predecessors, (113863), 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:16:36,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103645 states to 103645 states and 113863 transitions. [2025-01-09 00:16:36,610 INFO L78 Accepts]: Start accepts. Automaton has 103645 states and 113863 transitions. Word has length 689 [2025-01-09 00:16:36,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:16:36,611 INFO L471 AbstractCegarLoop]: Abstraction has 103645 states and 113863 transitions. [2025-01-09 00:16:36,611 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.0) internal successors, (318), 3 states have internal predecessors, (318), 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:16:36,611 INFO L276 IsEmpty]: Start isEmpty. Operand 103645 states and 113863 transitions. [2025-01-09 00:16:36,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 694 [2025-01-09 00:16:36,639 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:16:36,640 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:16:36,640 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 00:16:36,640 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:16:36,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:16:36,640 INFO L85 PathProgramCache]: Analyzing trace with hash -1913748492, now seen corresponding path program 1 times [2025-01-09 00:16:36,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:16:36,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791329621] [2025-01-09 00:16:36,641 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:16:36,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:16:36,693 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 693 statements into 1 equivalence classes. [2025-01-09 00:16:36,719 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 693 of 693 statements. [2025-01-09 00:16:36,719 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:16:36,720 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat