./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem10_label45.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem10_label45.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0a3986623018c70e6eab20909e61181eb3fd2fad76b9f685fe7d2107541e2f5e --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 01:40:45,058 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 01:40:45,092 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 01:40:45,095 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 01:40:45,098 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 01:40:45,120 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 01:40:45,121 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 01:40:45,121 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 01:40:45,121 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 01:40:45,121 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 01:40:45,122 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 01:40:45,122 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 01:40:45,123 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 01:40:45,123 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 01:40:45,123 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 01:40:45,123 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 01:40:45,123 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 01:40:45,123 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 01:40:45,123 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 01:40:45,123 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 01:40:45,124 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 01:40:45,124 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 01:40:45,124 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 01:40:45,124 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 01:40:45,124 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 01:40:45,124 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 01:40:45,124 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 01:40:45,124 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 01:40:45,124 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 01:40:45,124 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 01:40:45,124 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 01:40:45,124 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 01:40:45,125 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 01:40:45,125 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 01:40:45,125 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 01:40:45,125 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 01:40:45,125 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 01:40:45,125 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 01:40:45,125 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 01:40:45,126 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 01:40:45,126 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 01:40:45,126 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 01:40:45,126 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 01:40:45,126 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0a3986623018c70e6eab20909e61181eb3fd2fad76b9f685fe7d2107541e2f5e [2025-03-08 01:40:45,347 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 01:40:45,354 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 01:40:45,356 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 01:40:45,356 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 01:40:45,357 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 01:40:45,358 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem10_label45.c [2025-03-08 01:40:46,516 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7021134ee/23461d37a7a04f4ebe46417072efad40/FLAGe91fdf4b6 [2025-03-08 01:40:46,798 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 01:40:46,799 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem10_label45.c [2025-03-08 01:40:46,810 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7021134ee/23461d37a7a04f4ebe46417072efad40/FLAGe91fdf4b6 [2025-03-08 01:40:47,096 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7021134ee/23461d37a7a04f4ebe46417072efad40 [2025-03-08 01:40:47,098 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 01:40:47,099 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 01:40:47,100 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 01:40:47,100 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 01:40:47,102 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 01:40:47,103 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 01:40:47" (1/1) ... [2025-03-08 01:40:47,103 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@70112e52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:40:47, skipping insertion in model container [2025-03-08 01:40:47,103 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 01:40:47" (1/1) ... [2025-03-08 01:40:47,123 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 01:40:47,245 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem10_label45.c[4437,4450] [2025-03-08 01:40:47,370 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 01:40:47,379 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 01:40:47,395 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem10_label45.c[4437,4450] [2025-03-08 01:40:47,463 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 01:40:47,474 INFO L204 MainTranslator]: Completed translation [2025-03-08 01:40:47,475 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:40:47 WrapperNode [2025-03-08 01:40:47,475 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 01:40:47,476 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 01:40:47,476 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 01:40:47,476 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 01:40:47,480 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:40:47" (1/1) ... [2025-03-08 01:40:47,499 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:40:47" (1/1) ... [2025-03-08 01:40:47,540 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 595 [2025-03-08 01:40:47,541 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 01:40:47,542 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 01:40:47,542 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 01:40:47,542 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 01:40:47,549 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:40:47" (1/1) ... [2025-03-08 01:40:47,549 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:40:47" (1/1) ... [2025-03-08 01:40:47,553 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:40:47" (1/1) ... [2025-03-08 01:40:47,581 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 01:40:47,581 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:40:47" (1/1) ... [2025-03-08 01:40:47,581 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:40:47" (1/1) ... [2025-03-08 01:40:47,606 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:40:47" (1/1) ... [2025-03-08 01:40:47,613 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:40:47" (1/1) ... [2025-03-08 01:40:47,620 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:40:47" (1/1) ... [2025-03-08 01:40:47,623 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:40:47" (1/1) ... [2025-03-08 01:40:47,629 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 01:40:47,630 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 01:40:47,630 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 01:40:47,631 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 01:40:47,632 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:40:47" (1/1) ... [2025-03-08 01:40:47,635 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 01:40:47,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 01:40:47,658 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 01:40:47,660 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 01:40:47,679 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 01:40:47,679 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 01:40:47,680 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 01:40:47,680 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 01:40:47,733 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 01:40:47,736 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 01:40:48,614 INFO L? ?]: Removed 84 outVars from TransFormulas that were not future-live. [2025-03-08 01:40:48,614 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 01:40:48,624 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 01:40:48,627 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 01:40:48,627 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 01:40:48 BoogieIcfgContainer [2025-03-08 01:40:48,627 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 01:40:48,629 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 01:40:48,629 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 01:40:48,633 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 01:40:48,633 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 01:40:47" (1/3) ... [2025-03-08 01:40:48,633 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d51b14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 01:40:48, skipping insertion in model container [2025-03-08 01:40:48,634 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:40:47" (2/3) ... [2025-03-08 01:40:48,634 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d51b14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 01:40:48, skipping insertion in model container [2025-03-08 01:40:48,634 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 01:40:48" (3/3) ... [2025-03-08 01:40:48,635 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem10_label45.c [2025-03-08 01:40:48,648 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 01:40:48,649 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem10_label45.c that has 1 procedures, 206 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 01:40:48,695 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 01:40:48,706 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;@422e2c3b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 01:40:48,707 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 01:40:48,710 INFO L276 IsEmpty]: Start isEmpty. Operand has 206 states, 204 states have (on average 1.6813725490196079) internal successors, (343), 205 states have internal predecessors, (343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:40:48,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-03-08 01:40:48,716 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:40:48,716 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 01:40:48,717 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:40:48,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:40:48,721 INFO L85 PathProgramCache]: Analyzing trace with hash -1007803794, now seen corresponding path program 1 times [2025-03-08 01:40:48,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:40:48,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756883424] [2025-03-08 01:40:48,727 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:40:48,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:40:48,777 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-08 01:40:48,810 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-08 01:40:48,810 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:40:48,810 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:40:48,974 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 01:40:48,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:40:48,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756883424] [2025-03-08 01:40:48,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756883424] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:40:48,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:40:48,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 01:40:48,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479176385] [2025-03-08 01:40:48,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:40:48,979 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:40:48,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:40:48,994 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:40:48,994 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:40:48,996 INFO L87 Difference]: Start difference. First operand has 206 states, 204 states have (on average 1.6813725490196079) internal successors, (343), 205 states have internal predecessors, (343), 0 states have call successors, (0), 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 12.666666666666666) internal successors, (38), 2 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:40:49,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:40:49,579 INFO L93 Difference]: Finished difference Result 552 states and 963 transitions. [2025-03-08 01:40:49,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:40:49,581 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 2 states have internal predecessors, (38), 0 states have call successors, (0), 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 38 [2025-03-08 01:40:49,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:40:49,589 INFO L225 Difference]: With dead ends: 552 [2025-03-08 01:40:49,591 INFO L226 Difference]: Without dead ends: 282 [2025-03-08 01:40:49,595 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:40:49,597 INFO L435 NwaCegarLoop]: 113 mSDtfsCounter, 125 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 414 mSolverCounterSat, 130 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 544 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 130 IncrementalHoareTripleChecker+Valid, 414 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 01:40:49,598 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 120 Invalid, 544 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [130 Valid, 414 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 01:40:49,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2025-03-08 01:40:49,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 282. [2025-03-08 01:40:49,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 281 states have (on average 1.3416370106761566) internal successors, (377), 281 states have internal predecessors, (377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:40:49,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 377 transitions. [2025-03-08 01:40:49,641 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 377 transitions. Word has length 38 [2025-03-08 01:40:49,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:40:49,642 INFO L471 AbstractCegarLoop]: Abstraction has 282 states and 377 transitions. [2025-03-08 01:40:49,642 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 2 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:40:49,642 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 377 transitions. [2025-03-08 01:40:49,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-08 01:40:49,644 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:40:49,644 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-08 01:40:49,644 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 01:40:49,644 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:40:49,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:40:49,645 INFO L85 PathProgramCache]: Analyzing trace with hash 1998191656, now seen corresponding path program 1 times [2025-03-08 01:40:49,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:40:49,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771331752] [2025-03-08 01:40:49,645 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:40:49,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:40:49,662 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-08 01:40:49,689 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-08 01:40:49,689 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:40:49,689 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:40:49,853 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 01:40:49,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:40:49,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771331752] [2025-03-08 01:40:49,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [771331752] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:40:49,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:40:49,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 01:40:49,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138062232] [2025-03-08 01:40:49,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:40:49,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:40:49,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:40:49,856 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:40:49,856 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:40:49,856 INFO L87 Difference]: Start difference. First operand 282 states and 377 transitions. Second operand has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:40:50,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:40:50,216 INFO L93 Difference]: Finished difference Result 701 states and 967 transitions. [2025-03-08 01:40:50,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:40:50,216 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 104 [2025-03-08 01:40:50,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:40:50,218 INFO L225 Difference]: With dead ends: 701 [2025-03-08 01:40:50,218 INFO L226 Difference]: Without dead ends: 421 [2025-03-08 01:40:50,219 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:40:50,219 INFO L435 NwaCegarLoop]: 210 mSDtfsCounter, 108 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 340 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 01:40:50,219 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 215 Invalid, 425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 340 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 01:40:50,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2025-03-08 01:40:50,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 421. [2025-03-08 01:40:50,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 421 states, 420 states have (on average 1.2523809523809524) internal successors, (526), 420 states have internal predecessors, (526), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:40:50,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 526 transitions. [2025-03-08 01:40:50,238 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 526 transitions. Word has length 104 [2025-03-08 01:40:50,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:40:50,238 INFO L471 AbstractCegarLoop]: Abstraction has 421 states and 526 transitions. [2025-03-08 01:40:50,239 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:40:50,239 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 526 transitions. [2025-03-08 01:40:50,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-08 01:40:50,243 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:40:50,243 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-08 01:40:50,244 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 01:40:50,244 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:40:50,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:40:50,244 INFO L85 PathProgramCache]: Analyzing trace with hash 31149946, now seen corresponding path program 1 times [2025-03-08 01:40:50,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:40:50,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942105449] [2025-03-08 01:40:50,244 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:40:50,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:40:50,268 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-08 01:40:50,283 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-08 01:40:50,284 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:40:50,284 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:40:50,480 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 01:40:50,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:40:50,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942105449] [2025-03-08 01:40:50,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [942105449] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:40:50,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:40:50,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 01:40:50,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378402526] [2025-03-08 01:40:50,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:40:50,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:40:50,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:40:50,481 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:40:50,481 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:40:50,481 INFO L87 Difference]: Start difference. First operand 421 states and 526 transitions. Second operand has 3 states, 3 states have (on average 37.0) internal successors, (111), 2 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:40:50,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:40:50,807 INFO L93 Difference]: Finished difference Result 979 states and 1209 transitions. [2025-03-08 01:40:50,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:40:50,808 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 2 states have internal predecessors, (111), 0 states have call successors, (0), 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 111 [2025-03-08 01:40:50,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:40:50,809 INFO L225 Difference]: With dead ends: 979 [2025-03-08 01:40:50,810 INFO L226 Difference]: Without dead ends: 560 [2025-03-08 01:40:50,810 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:40:50,812 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 68 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 358 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 358 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 01:40:50,813 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 77 Invalid, 367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 358 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 01:40:50,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2025-03-08 01:40:50,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 560. [2025-03-08 01:40:50,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 560 states, 559 states have (on average 1.2075134168157424) internal successors, (675), 559 states have internal predecessors, (675), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:40:50,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 675 transitions. [2025-03-08 01:40:50,825 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 675 transitions. Word has length 111 [2025-03-08 01:40:50,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:40:50,826 INFO L471 AbstractCegarLoop]: Abstraction has 560 states and 675 transitions. [2025-03-08 01:40:50,826 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 2 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:40:50,826 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 675 transitions. [2025-03-08 01:40:50,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-08 01:40:50,828 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:40:50,829 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 01:40:50,829 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 01:40:50,829 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:40:50,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:40:50,829 INFO L85 PathProgramCache]: Analyzing trace with hash -545651147, now seen corresponding path program 1 times [2025-03-08 01:40:50,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:40:50,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100524383] [2025-03-08 01:40:50,829 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:40:50,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:40:50,846 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-08 01:40:50,856 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-08 01:40:50,856 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:40:50,856 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:40:51,077 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 01:40:51,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:40:51,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100524383] [2025-03-08 01:40:51,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2100524383] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:40:51,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:40:51,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 01:40:51,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692641485] [2025-03-08 01:40:51,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:40:51,078 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 01:40:51,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:40:51,079 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 01:40:51,079 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 01:40:51,079 INFO L87 Difference]: Start difference. First operand 560 states and 675 transitions. Second operand has 4 states, 4 states have (on average 28.25) internal successors, (113), 3 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:40:51,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:40:51,610 INFO L93 Difference]: Finished difference Result 1415 states and 1741 transitions. [2025-03-08 01:40:51,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 01:40:51,611 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.25) internal successors, (113), 3 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 113 [2025-03-08 01:40:51,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:40:51,614 INFO L225 Difference]: With dead ends: 1415 [2025-03-08 01:40:51,614 INFO L226 Difference]: Without dead ends: 977 [2025-03-08 01:40:51,615 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 01:40:51,616 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 77 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 646 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 709 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 646 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 01:40:51,616 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 38 Invalid, 709 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 646 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 01:40:51,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 977 states. [2025-03-08 01:40:51,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 977 to 977. [2025-03-08 01:40:51,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 977 states, 976 states have (on average 1.2243852459016393) internal successors, (1195), 976 states have internal predecessors, (1195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:40:51,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 977 states to 977 states and 1195 transitions. [2025-03-08 01:40:51,639 INFO L78 Accepts]: Start accepts. Automaton has 977 states and 1195 transitions. Word has length 113 [2025-03-08 01:40:51,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:40:51,640 INFO L471 AbstractCegarLoop]: Abstraction has 977 states and 1195 transitions. [2025-03-08 01:40:51,640 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.25) internal successors, (113), 3 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:40:51,641 INFO L276 IsEmpty]: Start isEmpty. Operand 977 states and 1195 transitions. [2025-03-08 01:40:51,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-08 01:40:51,645 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:40:51,645 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-08 01:40:51,645 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 01:40:51,645 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:40:51,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:40:51,646 INFO L85 PathProgramCache]: Analyzing trace with hash 2024778765, now seen corresponding path program 1 times [2025-03-08 01:40:51,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:40:51,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604446399] [2025-03-08 01:40:51,646 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:40:51,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:40:51,669 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-08 01:40:51,681 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-08 01:40:51,681 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:40:51,681 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:40:51,771 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 01:40:51,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:40:51,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604446399] [2025-03-08 01:40:51,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [604446399] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:40:51,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:40:51,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 01:40:51,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756316680] [2025-03-08 01:40:51,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:40:51,773 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:40:51,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:40:51,773 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:40:51,774 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:40:51,774 INFO L87 Difference]: Start difference. First operand 977 states and 1195 transitions. Second operand has 3 states, 3 states have (on average 43.0) internal successors, (129), 2 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:40:52,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:40:52,180 INFO L93 Difference]: Finished difference Result 2230 states and 2828 transitions. [2025-03-08 01:40:52,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:40:52,180 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.0) internal successors, (129), 2 states have internal predecessors, (129), 0 states have call successors, (0), 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 129 [2025-03-08 01:40:52,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:40:52,185 INFO L225 Difference]: With dead ends: 2230 [2025-03-08 01:40:52,185 INFO L226 Difference]: Without dead ends: 1394 [2025-03-08 01:40:52,186 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:40:52,187 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 87 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 433 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 01:40:52,187 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 34 Invalid, 433 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 334 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 01:40:52,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1394 states. [2025-03-08 01:40:52,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1394 to 1394. [2025-03-08 01:40:52,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1394 states, 1393 states have (on average 1.2261306532663316) internal successors, (1708), 1393 states have internal predecessors, (1708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:40:52,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1394 states to 1394 states and 1708 transitions. [2025-03-08 01:40:52,215 INFO L78 Accepts]: Start accepts. Automaton has 1394 states and 1708 transitions. Word has length 129 [2025-03-08 01:40:52,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:40:52,216 INFO L471 AbstractCegarLoop]: Abstraction has 1394 states and 1708 transitions. [2025-03-08 01:40:52,216 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.0) internal successors, (129), 2 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:40:52,216 INFO L276 IsEmpty]: Start isEmpty. Operand 1394 states and 1708 transitions. [2025-03-08 01:40:52,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-03-08 01:40:52,217 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:40:52,217 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 01:40:52,217 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 01:40:52,218 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:40:52,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:40:52,218 INFO L85 PathProgramCache]: Analyzing trace with hash -12807333, now seen corresponding path program 1 times [2025-03-08 01:40:52,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:40:52,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597532271] [2025-03-08 01:40:52,218 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:40:52,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:40:52,239 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-03-08 01:40:52,250 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-03-08 01:40:52,251 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:40:52,251 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:40:52,460 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 01:40:52,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:40:52,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597532271] [2025-03-08 01:40:52,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1597532271] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 01:40:52,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1903500041] [2025-03-08 01:40:52,461 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:40:52,461 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 01:40:52,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 01:40:52,466 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 01:40:52,467 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 01:40:52,506 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-03-08 01:40:52,532 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-03-08 01:40:52,532 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:40:52,532 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:40:52,534 INFO L256 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 01:40:52,540 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 01:40:52,706 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2025-03-08 01:40:52,706 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 01:40:52,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1903500041] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:40:52,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 01:40:52,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4 [2025-03-08 01:40:52,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972327405] [2025-03-08 01:40:52,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:40:52,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:40:52,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:40:52,707 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:40:52,707 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 01:40:52,707 INFO L87 Difference]: Start difference. First operand 1394 states and 1708 transitions. Second operand has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 2 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:40:53,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:40:53,074 INFO L93 Difference]: Finished difference Result 2230 states and 2683 transitions. [2025-03-08 01:40:53,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:40:53,078 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 2 states have internal predecessors, (115), 0 states have call successors, (0), 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 149 [2025-03-08 01:40:53,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:40:53,084 INFO L225 Difference]: With dead ends: 2230 [2025-03-08 01:40:53,085 INFO L226 Difference]: Without dead ends: 2228 [2025-03-08 01:40:53,085 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 01:40:53,086 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 69 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 364 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 422 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 364 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 01:40:53,086 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 11 Invalid, 422 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 364 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 01:40:53,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2228 states. [2025-03-08 01:40:53,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2228 to 1672. [2025-03-08 01:40:53,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1672 states, 1671 states have (on average 1.24655894673848) internal successors, (2083), 1671 states have internal predecessors, (2083), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:40:53,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1672 states to 1672 states and 2083 transitions. [2025-03-08 01:40:53,115 INFO L78 Accepts]: Start accepts. Automaton has 1672 states and 2083 transitions. Word has length 149 [2025-03-08 01:40:53,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:40:53,115 INFO L471 AbstractCegarLoop]: Abstraction has 1672 states and 2083 transitions. [2025-03-08 01:40:53,115 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 2 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:40:53,115 INFO L276 IsEmpty]: Start isEmpty. Operand 1672 states and 2083 transitions. [2025-03-08 01:40:53,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2025-03-08 01:40:53,117 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:40:53,117 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 01:40:53,124 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 01:40:53,318 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-03-08 01:40:53,318 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:40:53,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:40:53,319 INFO L85 PathProgramCache]: Analyzing trace with hash 1537870839, now seen corresponding path program 1 times [2025-03-08 01:40:53,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:40:53,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546224887] [2025-03-08 01:40:53,319 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:40:53,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:40:53,335 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 227 statements into 1 equivalence classes. [2025-03-08 01:40:53,356 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 227 of 227 statements. [2025-03-08 01:40:53,356 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:40:53,356 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:40:53,461 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 148 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 01:40:53,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:40:53,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546224887] [2025-03-08 01:40:53,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [546224887] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:40:53,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:40:53,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 01:40:53,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968870036] [2025-03-08 01:40:53,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:40:53,462 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:40:53,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:40:53,462 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:40:53,462 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:40:53,462 INFO L87 Difference]: Start difference. First operand 1672 states and 2083 transitions. Second operand has 3 states, 3 states have (on average 75.66666666666667) internal successors, (227), 3 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:40:53,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:40:53,823 INFO L93 Difference]: Finished difference Result 3759 states and 4777 transitions. [2025-03-08 01:40:53,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:40:53,824 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 75.66666666666667) internal successors, (227), 3 states have internal predecessors, (227), 0 states have call successors, (0), 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 227 [2025-03-08 01:40:53,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:40:53,831 INFO L225 Difference]: With dead ends: 3759 [2025-03-08 01:40:53,831 INFO L226 Difference]: Without dead ends: 2228 [2025-03-08 01:40:53,833 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:40:53,834 INFO L435 NwaCegarLoop]: 185 mSDtfsCounter, 77 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 362 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 416 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 01:40:53,834 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 189 Invalid, 416 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 362 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 01:40:53,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2228 states. [2025-03-08 01:40:53,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2228 to 1811. [2025-03-08 01:40:53,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1811 states, 1810 states have (on average 1.181767955801105) internal successors, (2139), 1810 states have internal predecessors, (2139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:40:53,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1811 states to 1811 states and 2139 transitions. [2025-03-08 01:40:53,867 INFO L78 Accepts]: Start accepts. Automaton has 1811 states and 2139 transitions. Word has length 227 [2025-03-08 01:40:53,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:40:53,868 INFO L471 AbstractCegarLoop]: Abstraction has 1811 states and 2139 transitions. [2025-03-08 01:40:53,868 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 75.66666666666667) internal successors, (227), 3 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:40:53,868 INFO L276 IsEmpty]: Start isEmpty. Operand 1811 states and 2139 transitions. [2025-03-08 01:40:53,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2025-03-08 01:40:53,870 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:40:53,870 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 01:40:53,871 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 01:40:53,871 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:40:53,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:40:53,871 INFO L85 PathProgramCache]: Analyzing trace with hash -699221783, now seen corresponding path program 1 times [2025-03-08 01:40:53,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:40:53,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321866973] [2025-03-08 01:40:53,871 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:40:53,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:40:53,893 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 261 statements into 1 equivalence classes. [2025-03-08 01:40:53,910 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 261 of 261 statements. [2025-03-08 01:40:53,911 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:40:53,912 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:40:54,344 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 228 proven. 84 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 01:40:54,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:40:54,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321866973] [2025-03-08 01:40:54,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [321866973] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 01:40:54,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [521222536] [2025-03-08 01:40:54,345 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:40:54,345 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 01:40:54,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 01:40:54,347 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 01:40:54,349 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 01:40:54,389 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 261 statements into 1 equivalence classes. [2025-03-08 01:40:54,433 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 261 of 261 statements. [2025-03-08 01:40:54,433 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:40:54,433 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:40:54,434 INFO L256 TraceCheckSpWp]: Trace formula consists of 388 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-08 01:40:54,441 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 01:40:55,526 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 125 proven. 122 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2025-03-08 01:40:55,527 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 01:40:56,630 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 125 proven. 122 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2025-03-08 01:40:56,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [521222536] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 01:40:56,631 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 01:40:56,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-03-08 01:40:56,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209955878] [2025-03-08 01:40:56,631 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 01:40:56,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 01:40:56,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:40:56,632 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 01:40:56,633 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2025-03-08 01:40:56,633 INFO L87 Difference]: Start difference. First operand 1811 states and 2139 transitions. Second operand has 12 states, 12 states have (on average 42.166666666666664) internal successors, (506), 11 states have internal predecessors, (506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:40:59,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:40:59,633 INFO L93 Difference]: Finished difference Result 7853 states and 9218 transitions. [2025-03-08 01:40:59,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-08 01:40:59,633 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 42.166666666666664) internal successors, (506), 11 states have internal predecessors, (506), 0 states have call successors, (0), 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 261 [2025-03-08 01:40:59,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:40:59,649 INFO L225 Difference]: With dead ends: 7853 [2025-03-08 01:40:59,650 INFO L226 Difference]: Without dead ends: 6183 [2025-03-08 01:40:59,653 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 539 GetRequests, 515 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=221, Invalid=429, Unknown=0, NotChecked=0, Total=650 [2025-03-08 01:40:59,654 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 2322 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 3520 mSolverCounterSat, 695 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2322 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 4215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 695 IncrementalHoareTripleChecker+Valid, 3520 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-03-08 01:40:59,654 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2322 Valid, 79 Invalid, 4215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [695 Valid, 3520 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-03-08 01:40:59,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6183 states. [2025-03-08 01:40:59,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6183 to 2506. [2025-03-08 01:40:59,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2506 states, 2505 states have (on average 1.1572854291417165) internal successors, (2899), 2505 states have internal predecessors, (2899), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:40:59,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2506 states to 2506 states and 2899 transitions. [2025-03-08 01:40:59,743 INFO L78 Accepts]: Start accepts. Automaton has 2506 states and 2899 transitions. Word has length 261 [2025-03-08 01:40:59,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:40:59,745 INFO L471 AbstractCegarLoop]: Abstraction has 2506 states and 2899 transitions. [2025-03-08 01:40:59,745 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 42.166666666666664) internal successors, (506), 11 states have internal predecessors, (506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:40:59,745 INFO L276 IsEmpty]: Start isEmpty. Operand 2506 states and 2899 transitions. [2025-03-08 01:40:59,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2025-03-08 01:40:59,748 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:40:59,749 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 01:40:59,756 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-08 01:40:59,949 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2025-03-08 01:40:59,949 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:40:59,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:40:59,950 INFO L85 PathProgramCache]: Analyzing trace with hash 419922061, now seen corresponding path program 1 times [2025-03-08 01:40:59,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:40:59,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319156689] [2025-03-08 01:40:59,950 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:40:59,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:40:59,966 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 286 statements into 1 equivalence classes. [2025-03-08 01:40:59,978 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 286 of 286 statements. [2025-03-08 01:40:59,978 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:40:59,978 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:41:00,262 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 77 proven. 104 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 01:41:00,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:41:00,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319156689] [2025-03-08 01:41:00,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [319156689] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 01:41:00,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1802195023] [2025-03-08 01:41:00,262 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:41:00,262 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 01:41:00,262 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 01:41:00,264 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 01:41:00,266 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 01:41:00,318 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 286 statements into 1 equivalence classes. [2025-03-08 01:41:00,365 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 286 of 286 statements. [2025-03-08 01:41:00,365 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:41:00,365 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:41:00,366 INFO L256 TraceCheckSpWp]: Trace formula consists of 391 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 01:41:00,370 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 01:41:00,420 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2025-03-08 01:41:00,420 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 01:41:00,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1802195023] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:41:00,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 01:41:00,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-08 01:41:00,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777731597] [2025-03-08 01:41:00,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:41:00,421 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:41:00,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:41:00,421 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:41:00,421 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 01:41:00,421 INFO L87 Difference]: Start difference. First operand 2506 states and 2899 transitions. Second operand has 3 states, 3 states have (on average 59.0) internal successors, (177), 3 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:41:00,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:41:00,763 INFO L93 Difference]: Finished difference Result 5427 states and 6384 transitions. [2025-03-08 01:41:00,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:41:00,764 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 59.0) internal successors, (177), 3 states have internal predecessors, (177), 0 states have call successors, (0), 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 286 [2025-03-08 01:41:00,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:41:00,772 INFO L225 Difference]: With dead ends: 5427 [2025-03-08 01:41:00,772 INFO L226 Difference]: Without dead ends: 3062 [2025-03-08 01:41:00,774 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 290 GetRequests, 286 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 01:41:00,776 INFO L435 NwaCegarLoop]: 221 mSDtfsCounter, 104 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 361 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 408 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 361 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 01:41:00,776 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 226 Invalid, 408 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 361 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 01:41:00,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3062 states. [2025-03-08 01:41:00,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3062 to 2645. [2025-03-08 01:41:00,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2645 states, 2644 states have (on average 1.1395612708018155) internal successors, (3013), 2644 states have internal predecessors, (3013), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:41:00,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2645 states to 2645 states and 3013 transitions. [2025-03-08 01:41:00,818 INFO L78 Accepts]: Start accepts. Automaton has 2645 states and 3013 transitions. Word has length 286 [2025-03-08 01:41:00,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:41:00,818 INFO L471 AbstractCegarLoop]: Abstraction has 2645 states and 3013 transitions. [2025-03-08 01:41:00,818 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.0) internal successors, (177), 3 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:41:00,819 INFO L276 IsEmpty]: Start isEmpty. Operand 2645 states and 3013 transitions. [2025-03-08 01:41:00,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2025-03-08 01:41:00,821 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:41:00,822 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 01:41:00,828 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-08 01:41:01,022 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 01:41:01,022 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:41:01,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:41:01,023 INFO L85 PathProgramCache]: Analyzing trace with hash 2085474889, now seen corresponding path program 1 times [2025-03-08 01:41:01,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:41:01,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91990088] [2025-03-08 01:41:01,023 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:41:01,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:41:01,039 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 300 statements into 1 equivalence classes. [2025-03-08 01:41:01,050 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 300 of 300 statements. [2025-03-08 01:41:01,050 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:41:01,050 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:41:01,373 INFO L134 CoverageAnalysis]: Checked inductivity of 329 backedges. 180 proven. 149 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 01:41:01,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:41:01,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91990088] [2025-03-08 01:41:01,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [91990088] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 01:41:01,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [435196018] [2025-03-08 01:41:01,373 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:41:01,373 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 01:41:01,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 01:41:01,375 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 01:41:01,377 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-08 01:41:01,411 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 300 statements into 1 equivalence classes. [2025-03-08 01:41:01,450 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 300 of 300 statements. [2025-03-08 01:41:01,450 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:41:01,450 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:41:01,452 INFO L256 TraceCheckSpWp]: Trace formula consists of 427 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 01:41:01,454 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 01:41:01,521 INFO L134 CoverageAnalysis]: Checked inductivity of 329 backedges. 257 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2025-03-08 01:41:01,521 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 01:41:01,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [435196018] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:41:01,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 01:41:01,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-08 01:41:01,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531883268] [2025-03-08 01:41:01,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:41:01,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:41:01,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:41:01,522 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:41:01,522 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-08 01:41:01,523 INFO L87 Difference]: Start difference. First operand 2645 states and 3013 transitions. Second operand has 3 states, 3 states have (on average 76.33333333333333) internal successors, (229), 3 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:41:01,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:41:01,840 INFO L93 Difference]: Finished difference Result 5149 states and 5881 transitions. [2025-03-08 01:41:01,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:41:01,840 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 76.33333333333333) internal successors, (229), 3 states have internal predecessors, (229), 0 states have call successors, (0), 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 300 [2025-03-08 01:41:01,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:41:01,846 INFO L225 Difference]: With dead ends: 5149 [2025-03-08 01:41:01,846 INFO L226 Difference]: Without dead ends: 2645 [2025-03-08 01:41:01,847 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 304 GetRequests, 300 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-08 01:41:01,848 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 87 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 351 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 404 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 351 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 01:41:01,848 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 19 Invalid, 404 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 351 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 01:41:01,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2645 states. [2025-03-08 01:41:01,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2645 to 2645. [2025-03-08 01:41:01,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2645 states, 2644 states have (on average 1.126323751891074) internal successors, (2978), 2644 states have internal predecessors, (2978), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:41:01,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2645 states to 2645 states and 2978 transitions. [2025-03-08 01:41:01,878 INFO L78 Accepts]: Start accepts. Automaton has 2645 states and 2978 transitions. Word has length 300 [2025-03-08 01:41:01,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:41:01,879 INFO L471 AbstractCegarLoop]: Abstraction has 2645 states and 2978 transitions. [2025-03-08 01:41:01,879 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 76.33333333333333) internal successors, (229), 3 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:41:01,879 INFO L276 IsEmpty]: Start isEmpty. Operand 2645 states and 2978 transitions. [2025-03-08 01:41:01,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2025-03-08 01:41:01,882 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:41:01,882 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 01:41:01,888 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-08 01:41:02,082 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 01:41:02,083 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:41:02,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:41:02,083 INFO L85 PathProgramCache]: Analyzing trace with hash 2040373232, now seen corresponding path program 1 times [2025-03-08 01:41:02,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:41:02,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177067494] [2025-03-08 01:41:02,083 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:41:02,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:41:02,102 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 310 statements into 1 equivalence classes. [2025-03-08 01:41:02,114 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 310 of 310 statements. [2025-03-08 01:41:02,114 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:41:02,114 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:41:02,199 INFO L134 CoverageAnalysis]: Checked inductivity of 344 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 237 trivial. 0 not checked. [2025-03-08 01:41:02,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:41:02,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177067494] [2025-03-08 01:41:02,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1177067494] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:41:02,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:41:02,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 01:41:02,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142446432] [2025-03-08 01:41:02,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:41:02,200 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:41:02,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:41:02,200 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:41:02,200 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:41:02,201 INFO L87 Difference]: Start difference. First operand 2645 states and 2978 transitions. Second operand has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:41:02,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:41:02,529 INFO L93 Difference]: Finished difference Result 5703 states and 6411 transitions. [2025-03-08 01:41:02,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:41:02,530 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 0 states have call successors, (0), 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 310 [2025-03-08 01:41:02,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:41:02,531 INFO L225 Difference]: With dead ends: 5703 [2025-03-08 01:41:02,531 INFO L226 Difference]: Without dead ends: 0 [2025-03-08 01:41:02,535 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:41:02,535 INFO L435 NwaCegarLoop]: 219 mSDtfsCounter, 104 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 341 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 397 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 01:41:02,536 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 223 Invalid, 397 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 341 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 01:41:02,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-08 01:41:02,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-08 01:41:02,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:41:02,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-08 01:41:02,537 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 310 [2025-03-08 01:41:02,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:41:02,537 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-08 01:41:02,538 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:41:02,538 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-08 01:41:02,538 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-08 01:41:02,540 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 01:41:02,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 01:41:02,542 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 01:41:02,545 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-08 01:41:03,000 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 01:41:03,018 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 01:41:03 BoogieIcfgContainer [2025-03-08 01:41:03,018 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 01:41:03,019 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 01:41:03,019 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 01:41:03,019 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 01:41:03,019 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 01:40:48" (3/4) ... [2025-03-08 01:41:03,021 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-08 01:41:03,031 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2025-03-08 01:41:03,034 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-08 01:41:03,035 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-08 01:41:03,035 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-08 01:41:03,130 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-08 01:41:03,132 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-08 01:41:03,132 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 01:41:03,132 INFO L158 Benchmark]: Toolchain (without parser) took 16033.49ms. Allocated memory was 142.6MB in the beginning and 427.8MB in the end (delta: 285.2MB). Free memory was 103.2MB in the beginning and 274.5MB in the end (delta: -171.3MB). Peak memory consumption was 116.3MB. Max. memory is 16.1GB. [2025-03-08 01:41:03,133 INFO L158 Benchmark]: CDTParser took 0.46ms. Allocated memory is still 201.3MB. Free memory is still 124.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 01:41:03,133 INFO L158 Benchmark]: CACSL2BoogieTranslator took 376.16ms. Allocated memory is still 142.6MB. Free memory was 102.2MB in the beginning and 76.4MB in the end (delta: 25.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-08 01:41:03,133 INFO L158 Benchmark]: Boogie Procedure Inliner took 65.07ms. Allocated memory is still 142.6MB. Free memory was 76.4MB in the beginning and 67.9MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 01:41:03,133 INFO L158 Benchmark]: Boogie Preprocessor took 87.56ms. Allocated memory is still 142.6MB. Free memory was 67.9MB in the beginning and 59.5MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 01:41:03,133 INFO L158 Benchmark]: IcfgBuilder took 997.35ms. Allocated memory is still 142.6MB. Free memory was 59.5MB in the beginning and 97.1MB in the end (delta: -37.6MB). Peak memory consumption was 46.2MB. Max. memory is 16.1GB. [2025-03-08 01:41:03,134 INFO L158 Benchmark]: TraceAbstraction took 14389.45ms. Allocated memory was 142.6MB in the beginning and 427.8MB in the end (delta: 285.2MB). Free memory was 96.2MB in the beginning and 287.0MB in the end (delta: -190.8MB). Peak memory consumption was 249.7MB. Max. memory is 16.1GB. [2025-03-08 01:41:03,134 INFO L158 Benchmark]: Witness Printer took 112.82ms. Allocated memory is still 427.8MB. Free memory was 287.0MB in the beginning and 274.5MB in the end (delta: 12.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 01:41:03,135 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.46ms. Allocated memory is still 201.3MB. Free memory is still 124.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 376.16ms. Allocated memory is still 142.6MB. Free memory was 102.2MB in the beginning and 76.4MB in the end (delta: 25.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 65.07ms. Allocated memory is still 142.6MB. Free memory was 76.4MB in the beginning and 67.9MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 87.56ms. Allocated memory is still 142.6MB. Free memory was 67.9MB in the beginning and 59.5MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 997.35ms. Allocated memory is still 142.6MB. Free memory was 59.5MB in the beginning and 97.1MB in the end (delta: -37.6MB). Peak memory consumption was 46.2MB. Max. memory is 16.1GB. * TraceAbstraction took 14389.45ms. Allocated memory was 142.6MB in the beginning and 427.8MB in the end (delta: 285.2MB). Free memory was 96.2MB in the beginning and 287.0MB in the end (delta: -190.8MB). Peak memory consumption was 249.7MB. Max. memory is 16.1GB. * Witness Printer took 112.82ms. Allocated memory is still 427.8MB. Free memory was 287.0MB in the beginning and 274.5MB in the end (delta: 12.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 128]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 206 locations, 343 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 13.9s, OverallIterations: 11, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 7.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3228 SdHoareTripleChecker+Valid, 6.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3228 mSDsluCounter, 1231 SdHoareTripleChecker+Invalid, 5.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 115 mSDsCounter, 1349 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7391 IncrementalHoareTripleChecker+Invalid, 8740 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1349 mSolverCounterUnsat, 1116 mSDtfsCounter, 7391 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1302 GetRequests, 1259 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2645occurred in iteration=9, InterpolantAutomatonStates: 52, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 11 MinimizatonAttempts, 5067 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 4.8s InterpolantComputationTime, 3024 NumberOfCodeBlocks, 3024 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 3269 ConstructedInterpolants, 0 QuantifiedInterpolants, 16793 SizeOfPredicates, 5 NumberOfNonLiveVariables, 1434 ConjunctsInSsa, 17 ConjunctsInUnsatCore, 16 InterpolantComputations, 10 PerfectInterpolantSequences, 2042/2658 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 592]: Location Invariant Derived location invariant: ((((((((((((a19 <= 9) && (0 <= (331283 + ((a1 >= 0) ? (a1 / 5) : ((a1 / 5) - 1))))) && (4 <= a10)) && ((0 < (331283 + ((a1 >= 0) ? (a1 / 5) : ((a1 / 5) - 1)))) || (((a1 >= 0) ? (a1 % 5) : ((a1 % 5) + 5)) != 0))) || (((a10 <= 0) && (0 <= (331283 + ((a1 >= 0) ? (a1 / 5) : ((a1 / 5) - 1))))) && ((0 < (331283 + ((a1 >= 0) ? (a1 / 5) : ((a1 / 5) - 1)))) || (((a1 >= 0) ? (a1 % 5) : ((a1 % 5) + 5)) != 0)))) || ((((a10 == 1) && (0 <= (331283 + ((a1 >= 0) ? (a1 / 5) : ((a1 / 5) - 1))))) && ((0 < (331283 + ((a1 >= 0) ? (a1 / 5) : ((a1 / 5) - 1)))) || (((a1 >= 0) ? (a1 % 5) : ((a1 % 5) + 5)) != 0))) && (9 <= a19))) || ((((a19 == 9) && (14 == a4)) && (a10 == 2)) && (a12 == 0))) || ((((a19 <= 9) && (0 <= (331283 + ((a1 >= 0) ? (a1 / 5) : ((a1 / 5) - 1))))) && ((0 < (331283 + ((a1 >= 0) ? (a1 / 5) : ((a1 / 5) - 1)))) || (((a1 >= 0) ? (a1 % 5) : ((a1 % 5) + 5)) != 0))) && (a10 == 2))) || ((((a10 == 0) && (a19 == 9)) && (14 == a4)) && (a12 == 0))) || (((((a19 == 9) && (0 <= (331283 + ((a1 >= 0) ? (a1 / 5) : ((a1 / 5) - 1))))) && ((0 < (331283 + ((a1 >= 0) ? (a1 / 5) : ((a1 / 5) - 1)))) || (((a1 >= 0) ? (a1 % 5) : ((a1 % 5) + 5)) != 0))) && (14 == a4)) && (a12 == 0))) || (((0 <= (331283 + ((a1 >= 0) ? (a1 / 5) : ((a1 / 5) - 1)))) && ((0 < (331283 + ((a1 >= 0) ? (a1 / 5) : ((a1 / 5) - 1)))) || (((a1 >= 0) ? (a1 % 5) : ((a1 % 5) + 5)) != 0))) && (a19 <= 7))) || ((((a19 <= 9) && (219 <= a1)) && (14 == a4)) && (a12 == 0))) RESULT: Ultimate proved your program to be correct! [2025-03-08 01:41:03,153 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE