./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/list-simple/sll2c_update_all_reverse.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version da043454 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 ../../../trunk/examples/svcomp/list-simple/sll2c_update_all_reverse.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 6614f926e290c90f9bb6248c9dd43b6ef9cc35729cf8bbca78a928cb6c7f9af3 --- Real Ultimate output --- This is Ultimate 0.3.0-wip.fs.system-includes-da04345-m [2025-04-29 10:56:25,670 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-29 10:56:25,723 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-04-29 10:56:25,727 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-29 10:56:25,727 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-29 10:56:25,751 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-29 10:56:25,752 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-29 10:56:25,752 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-29 10:56:25,752 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-29 10:56:25,752 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-29 10:56:25,753 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-29 10:56:25,753 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-29 10:56:25,753 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-29 10:56:25,754 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-29 10:56:25,754 INFO L153 SettingsManager]: * Use SBE=true [2025-04-29 10:56:25,754 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-29 10:56:25,754 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-29 10:56:25,754 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-29 10:56:25,754 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-29 10:56:25,754 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-29 10:56:25,754 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-29 10:56:25,754 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-29 10:56:25,754 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-29 10:56:25,754 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-29 10:56:25,754 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-29 10:56:25,754 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-29 10:56:25,754 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-29 10:56:25,754 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-29 10:56:25,754 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-29 10:56:25,754 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 10:56:25,754 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-29 10:56:25,754 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 10:56:25,754 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 10:56:25,754 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-29 10:56:25,755 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 10:56:25,755 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-29 10:56:25,755 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 10:56:25,755 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 10:56:25,755 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-29 10:56:25,755 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-29 10:56:25,755 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-29 10:56:25,755 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-29 10:56:25,755 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-29 10:56:25,755 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-29 10:56:25,755 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-29 10:56:25,755 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-29 10:56:25,755 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-29 10:56:25,755 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 -> 6614f926e290c90f9bb6248c9dd43b6ef9cc35729cf8bbca78a928cb6c7f9af3 [2025-04-29 10:56:25,954 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-29 10:56:25,963 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-29 10:56:25,965 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-29 10:56:25,966 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-29 10:56:25,967 INFO L274 PluginConnector]: CDTParser initialized [2025-04-29 10:56:25,968 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-simple/sll2c_update_all_reverse.c [2025-04-29 10:56:27,249 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c27b57fd9/e02e3166fd674daaaf423ed5c29eb116/FLAG1902ec072 [2025-04-29 10:56:27,474 INFO L389 CDTParser]: Found 1 translation units. [2025-04-29 10:56:27,475 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-simple/sll2c_update_all_reverse.c [2025-04-29 10:56:27,476 WARN L117 ultiparseSymbolTable]: System include assert.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 10:56:27,476 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 10:56:27,482 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c27b57fd9/e02e3166fd674daaaf423ed5c29eb116/FLAG1902ec072 [2025-04-29 10:56:28,300 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c27b57fd9/e02e3166fd674daaaf423ed5c29eb116 [2025-04-29 10:56:28,302 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-29 10:56:28,303 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-29 10:56:28,304 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-29 10:56:28,304 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-29 10:56:28,307 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-29 10:56:28,307 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 10:56:28" (1/1) ... [2025-04-29 10:56:28,308 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@408f7b5b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:56:28, skipping insertion in model container [2025-04-29 10:56:28,308 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 10:56:28" (1/1) ... [2025-04-29 10:56:28,318 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-29 10:56:28,452 WARN L117 LibraryModelHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/list-simple/sll2c_update_all_reverse.c[1630,1643] [2025-04-29 10:56:28,455 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 10:56:28,461 INFO L200 MainTranslator]: Completed pre-run [2025-04-29 10:56:28,486 WARN L117 LibraryModelHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/list-simple/sll2c_update_all_reverse.c[1630,1643] [2025-04-29 10:56:28,487 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 10:56:28,498 INFO L204 MainTranslator]: Completed translation [2025-04-29 10:56:28,499 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:56:28 WrapperNode [2025-04-29 10:56:28,502 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-29 10:56:28,503 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-29 10:56:28,503 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-29 10:56:28,503 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-29 10:56:28,509 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:56:28" (1/1) ... [2025-04-29 10:56:28,518 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:56:28" (1/1) ... [2025-04-29 10:56:28,537 INFO L138 Inliner]: procedures = 17, calls = 22, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 110 [2025-04-29 10:56:28,537 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-29 10:56:28,538 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-29 10:56:28,538 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-29 10:56:28,538 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-29 10:56:28,543 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:56:28" (1/1) ... [2025-04-29 10:56:28,543 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:56:28" (1/1) ... [2025-04-29 10:56:28,545 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:56:28" (1/1) ... [2025-04-29 10:56:28,557 INFO L175 MemorySlicer]: Split 10 memory accesses to 1 slices as follows [10]. 100 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0]. The 5 writes are split as follows [5]. [2025-04-29 10:56:28,557 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:56:28" (1/1) ... [2025-04-29 10:56:28,557 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:56:28" (1/1) ... [2025-04-29 10:56:28,565 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:56:28" (1/1) ... [2025-04-29 10:56:28,566 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:56:28" (1/1) ... [2025-04-29 10:56:28,567 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:56:28" (1/1) ... [2025-04-29 10:56:28,568 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:56:28" (1/1) ... [2025-04-29 10:56:28,569 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:56:28" (1/1) ... [2025-04-29 10:56:28,571 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-29 10:56:28,571 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-29 10:56:28,571 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-29 10:56:28,572 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-29 10:56:28,572 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:56:28" (1/1) ... [2025-04-29 10:56:28,576 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 10:56:28,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 10:56:28,594 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-04-29 10:56:28,597 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-04-29 10:56:28,616 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-04-29 10:56:28,616 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-04-29 10:56:28,616 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-29 10:56:28,616 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-29 10:56:28,617 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-29 10:56:28,617 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-29 10:56:28,617 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-29 10:56:28,617 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2025-04-29 10:56:28,617 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2025-04-29 10:56:28,617 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-04-29 10:56:28,686 INFO L234 CfgBuilder]: Building ICFG [2025-04-29 10:56:28,688 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-29 10:56:28,863 INFO L? ?]: Removed 45 outVars from TransFormulas that were not future-live. [2025-04-29 10:56:28,863 INFO L283 CfgBuilder]: Performing block encoding [2025-04-29 10:56:28,871 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-29 10:56:28,872 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-29 10:56:28,872 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 10:56:28 BoogieIcfgContainer [2025-04-29 10:56:28,873 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-29 10:56:28,874 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-29 10:56:28,874 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-29 10:56:28,877 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-29 10:56:28,877 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.04 10:56:28" (1/3) ... [2025-04-29 10:56:28,878 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42df8314 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 10:56:28, skipping insertion in model container [2025-04-29 10:56:28,879 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:56:28" (2/3) ... [2025-04-29 10:56:28,879 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42df8314 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 10:56:28, skipping insertion in model container [2025-04-29 10:56:28,880 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 10:56:28" (3/3) ... [2025-04-29 10:56:28,880 INFO L128 eAbstractionObserver]: Analyzing ICFG sll2c_update_all_reverse.c [2025-04-29 10:56:28,892 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-29 10:56:28,893 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG sll2c_update_all_reverse.c that has 2 procedures, 29 locations, 40 edges, 1 initial locations, 6 loop locations, and 1 error locations. [2025-04-29 10:56:28,935 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-29 10:56:28,945 INFO L340 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;@7813bbe4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-29 10:56:28,946 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-04-29 10:56:28,949 INFO L278 IsEmpty]: Start isEmpty. Operand has 29 states, 24 states have (on average 1.4166666666666667) internal successors, (34), 25 states have internal predecessors, (34), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-04-29 10:56:28,953 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-04-29 10:56:28,953 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:56:28,954 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 10:56:28,954 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:56:28,957 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:56:28,958 INFO L85 PathProgramCache]: Analyzing trace with hash 644260098, now seen corresponding path program 1 times [2025-04-29 10:56:28,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:56:28,963 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248718196] [2025-04-29 10:56:28,964 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:56:28,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:56:29,018 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-29 10:56:29,044 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-29 10:56:29,045 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:56:29,045 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:56:29,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 10:56:29,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:56:29,196 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248718196] [2025-04-29 10:56:29,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1248718196] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 10:56:29,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 10:56:29,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 10:56:29,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829220521] [2025-04-29 10:56:29,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 10:56:29,200 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 10:56:29,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:56:29,211 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 10:56:29,211 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 10:56:29,212 INFO L87 Difference]: Start difference. First operand has 29 states, 24 states have (on average 1.4166666666666667) internal successors, (34), 25 states have internal predecessors, (34), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-29 10:56:29,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 10:56:29,235 INFO L93 Difference]: Finished difference Result 48 states and 65 transitions. [2025-04-29 10:56:29,236 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 10:56:29,240 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2025-04-29 10:56:29,240 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 10:56:29,245 INFO L225 Difference]: With dead ends: 48 [2025-04-29 10:56:29,245 INFO L226 Difference]: Without dead ends: 25 [2025-04-29 10:56:29,247 INFO L436 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-04-29 10:56:29,249 INFO L437 NwaCegarLoop]: 35 mSDtfsCounter, 1 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 10:56:29,252 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 65 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 10:56:29,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2025-04-29 10:56:29,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 23. [2025-04-29 10:56:29,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 19 states have (on average 1.263157894736842) internal successors, (24), 19 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-04-29 10:56:29,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 28 transitions. [2025-04-29 10:56:29,275 INFO L79 Accepts]: Start accepts. Automaton has 23 states and 28 transitions. Word has length 17 [2025-04-29 10:56:29,275 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 10:56:29,276 INFO L485 AbstractCegarLoop]: Abstraction has 23 states and 28 transitions. [2025-04-29 10:56:29,276 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-29 10:56:29,276 INFO L278 IsEmpty]: Start isEmpty. Operand 23 states and 28 transitions. [2025-04-29 10:56:29,276 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-29 10:56:29,276 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:56:29,277 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 10:56:29,277 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-29 10:56:29,277 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:56:29,277 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:56:29,277 INFO L85 PathProgramCache]: Analyzing trace with hash -110734934, now seen corresponding path program 1 times [2025-04-29 10:56:29,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:56:29,278 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000188091] [2025-04-29 10:56:29,278 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:56:29,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:56:29,293 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-29 10:56:29,311 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-29 10:56:29,311 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:56:29,311 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:56:29,395 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-29 10:56:29,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:56:29,395 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000188091] [2025-04-29 10:56:29,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2000188091] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 10:56:29,396 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 10:56:29,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-29 10:56:29,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566240933] [2025-04-29 10:56:29,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 10:56:29,396 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 10:56:29,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:56:29,397 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 10:56:29,397 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-29 10:56:29,397 INFO L87 Difference]: Start difference. First operand 23 states and 28 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-04-29 10:56:29,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 10:56:29,435 INFO L93 Difference]: Finished difference Result 38 states and 47 transitions. [2025-04-29 10:56:29,435 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-29 10:56:29,435 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 25 [2025-04-29 10:56:29,436 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 10:56:29,436 INFO L225 Difference]: With dead ends: 38 [2025-04-29 10:56:29,436 INFO L226 Difference]: Without dead ends: 32 [2025-04-29 10:56:29,436 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-29 10:56:29,437 INFO L437 NwaCegarLoop]: 21 mSDtfsCounter, 33 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 10:56:29,437 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 48 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 10:56:29,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2025-04-29 10:56:29,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 24. [2025-04-29 10:56:29,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 20 states have (on average 1.25) internal successors, (25), 20 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-04-29 10:56:29,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 29 transitions. [2025-04-29 10:56:29,445 INFO L79 Accepts]: Start accepts. Automaton has 24 states and 29 transitions. Word has length 25 [2025-04-29 10:56:29,445 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 10:56:29,445 INFO L485 AbstractCegarLoop]: Abstraction has 24 states and 29 transitions. [2025-04-29 10:56:29,445 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-04-29 10:56:29,446 INFO L278 IsEmpty]: Start isEmpty. Operand 24 states and 29 transitions. [2025-04-29 10:56:29,446 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-29 10:56:29,446 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:56:29,446 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 10:56:29,447 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-29 10:56:29,447 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:56:29,447 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:56:29,449 INFO L85 PathProgramCache]: Analyzing trace with hash 1348033212, now seen corresponding path program 1 times [2025-04-29 10:56:29,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:56:29,450 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131944389] [2025-04-29 10:56:29,450 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:56:29,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:56:29,476 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-29 10:56:29,491 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-29 10:56:29,492 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:56:29,493 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:56:29,673 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-29 10:56:29,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:56:29,673 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131944389] [2025-04-29 10:56:29,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2131944389] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 10:56:29,673 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [368574567] [2025-04-29 10:56:29,673 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:56:29,674 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:56:29,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 10:56:29,675 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-04-29 10:56:29,677 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-04-29 10:56:29,740 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-29 10:56:29,779 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-29 10:56:29,779 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:56:29,779 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:56:29,781 INFO L256 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-29 10:56:29,788 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 10:56:29,840 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-29 10:56:29,842 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-29 10:56:29,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [368574567] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 10:56:29,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-29 10:56:29,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 8 [2025-04-29 10:56:29,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434359374] [2025-04-29 10:56:29,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 10:56:29,843 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 10:56:29,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:56:29,843 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 10:56:29,844 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-04-29 10:56:29,844 INFO L87 Difference]: Start difference. First operand 24 states and 29 transitions. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-04-29 10:56:29,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 10:56:29,894 INFO L93 Difference]: Finished difference Result 42 states and 53 transitions. [2025-04-29 10:56:29,895 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-29 10:56:29,895 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 28 [2025-04-29 10:56:29,895 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 10:56:29,896 INFO L225 Difference]: With dead ends: 42 [2025-04-29 10:56:29,896 INFO L226 Difference]: Without dead ends: 33 [2025-04-29 10:56:29,896 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2025-04-29 10:56:29,897 INFO L437 NwaCegarLoop]: 20 mSDtfsCounter, 35 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 10:56:29,897 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 66 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 10:56:29,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2025-04-29 10:56:29,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 25. [2025-04-29 10:56:29,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 21 states have internal predecessors, (26), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-04-29 10:56:29,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 30 transitions. [2025-04-29 10:56:29,900 INFO L79 Accepts]: Start accepts. Automaton has 25 states and 30 transitions. Word has length 28 [2025-04-29 10:56:29,900 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 10:56:29,900 INFO L485 AbstractCegarLoop]: Abstraction has 25 states and 30 transitions. [2025-04-29 10:56:29,900 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-04-29 10:56:29,900 INFO L278 IsEmpty]: Start isEmpty. Operand 25 states and 30 transitions. [2025-04-29 10:56:29,901 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-29 10:56:29,901 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:56:29,901 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 10:56:29,908 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-04-29 10:56:30,101 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:56:30,102 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:56:30,103 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:56:30,103 INFO L85 PathProgramCache]: Analyzing trace with hash 1368484080, now seen corresponding path program 1 times [2025-04-29 10:56:30,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:56:30,103 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547415764] [2025-04-29 10:56:30,103 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:56:30,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:56:30,118 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-29 10:56:30,131 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-29 10:56:30,131 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:56:30,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:56:30,201 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-04-29 10:56:30,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:56:30,202 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547415764] [2025-04-29 10:56:30,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547415764] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 10:56:30,203 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [539631972] [2025-04-29 10:56:30,203 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:56:30,203 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:56:30,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 10:56:30,205 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-04-29 10:56:30,207 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-04-29 10:56:30,266 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-29 10:56:30,295 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-29 10:56:30,296 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:56:30,296 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:56:30,297 INFO L256 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-29 10:56:30,298 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 10:56:30,327 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-04-29 10:56:30,327 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 10:56:30,371 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-04-29 10:56:30,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [539631972] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 10:56:30,371 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 10:56:30,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 5 [2025-04-29 10:56:30,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327511615] [2025-04-29 10:56:30,371 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 10:56:30,371 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 10:56:30,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:56:30,372 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 10:56:30,372 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-29 10:56:30,373 INFO L87 Difference]: Start difference. First operand 25 states and 30 transitions. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-04-29 10:56:30,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 10:56:30,412 INFO L93 Difference]: Finished difference Result 41 states and 50 transitions. [2025-04-29 10:56:30,412 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-29 10:56:30,412 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 29 [2025-04-29 10:56:30,412 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 10:56:30,413 INFO L225 Difference]: With dead ends: 41 [2025-04-29 10:56:30,413 INFO L226 Difference]: Without dead ends: 35 [2025-04-29 10:56:30,413 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 55 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-04-29 10:56:30,413 INFO L437 NwaCegarLoop]: 21 mSDtfsCounter, 41 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 10:56:30,413 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 61 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 10:56:30,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2025-04-29 10:56:30,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 28. [2025-04-29 10:56:30,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 24 states have (on average 1.25) internal successors, (30), 24 states have internal predecessors, (30), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-04-29 10:56:30,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2025-04-29 10:56:30,417 INFO L79 Accepts]: Start accepts. Automaton has 28 states and 34 transitions. Word has length 29 [2025-04-29 10:56:30,417 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 10:56:30,417 INFO L485 AbstractCegarLoop]: Abstraction has 28 states and 34 transitions. [2025-04-29 10:56:30,417 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-04-29 10:56:30,417 INFO L278 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2025-04-29 10:56:30,418 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-04-29 10:56:30,418 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:56:30,418 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 10:56:30,424 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-04-29 10:56:30,618 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2025-04-29 10:56:30,619 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:56:30,619 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:56:30,619 INFO L85 PathProgramCache]: Analyzing trace with hash -1897744970, now seen corresponding path program 2 times [2025-04-29 10:56:30,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:56:30,619 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330202676] [2025-04-29 10:56:30,620 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 10:56:30,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:56:30,632 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 32 statements into 2 equivalence classes. [2025-04-29 10:56:30,636 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 17 of 32 statements. [2025-04-29 10:56:30,637 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-29 10:56:30,637 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:56:30,689 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-04-29 10:56:30,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:56:30,689 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330202676] [2025-04-29 10:56:30,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1330202676] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 10:56:30,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 10:56:30,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 10:56:30,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579765589] [2025-04-29 10:56:30,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 10:56:30,689 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 10:56:30,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:56:30,690 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 10:56:30,690 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-29 10:56:30,690 INFO L87 Difference]: Start difference. First operand 28 states and 34 transitions. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-04-29 10:56:30,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 10:56:30,724 INFO L93 Difference]: Finished difference Result 41 states and 50 transitions. [2025-04-29 10:56:30,724 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-29 10:56:30,724 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 32 [2025-04-29 10:56:30,725 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 10:56:30,725 INFO L225 Difference]: With dead ends: 41 [2025-04-29 10:56:30,726 INFO L226 Difference]: Without dead ends: 35 [2025-04-29 10:56:30,726 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-04-29 10:56:30,726 INFO L437 NwaCegarLoop]: 20 mSDtfsCounter, 25 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 10:56:30,726 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 56 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 10:56:30,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2025-04-29 10:56:30,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 30. [2025-04-29 10:56:30,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 26 states have internal predecessors, (32), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-04-29 10:56:30,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2025-04-29 10:56:30,730 INFO L79 Accepts]: Start accepts. Automaton has 30 states and 36 transitions. Word has length 32 [2025-04-29 10:56:30,731 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 10:56:30,731 INFO L485 AbstractCegarLoop]: Abstraction has 30 states and 36 transitions. [2025-04-29 10:56:30,731 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-04-29 10:56:30,731 INFO L278 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2025-04-29 10:56:30,731 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-04-29 10:56:30,731 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:56:30,731 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-04-29 10:56:30,731 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-29 10:56:30,732 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:56:30,732 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:56:30,732 INFO L85 PathProgramCache]: Analyzing trace with hash 1297538040, now seen corresponding path program 1 times [2025-04-29 10:56:30,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:56:30,732 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528879502] [2025-04-29 10:56:30,732 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:56:30,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:56:30,744 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-04-29 10:56:30,776 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-04-29 10:56:30,776 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:56:30,776 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:56:32,260 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 10:56:32,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:56:32,261 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528879502] [2025-04-29 10:56:32,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528879502] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 10:56:32,261 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [979450637] [2025-04-29 10:56:32,261 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:56:32,261 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:56:32,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 10:56:32,263 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-04-29 10:56:32,264 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-04-29 10:56:32,322 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-04-29 10:56:32,354 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-04-29 10:56:32,354 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:56:32,354 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:56:32,356 INFO L256 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 114 conjuncts are in the unsatisfiable core [2025-04-29 10:56:32,361 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 10:56:32,410 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-04-29 10:56:32,526 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-29 10:56:32,526 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-04-29 10:56:32,573 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-04-29 10:56:32,626 INFO L325 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2025-04-29 10:56:32,626 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 33 [2025-04-29 10:56:32,839 INFO L325 Elim1Store]: treesize reduction 27, result has 15.6 percent of original size [2025-04-29 10:56:32,840 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 77 treesize of output 64 [2025-04-29 10:56:32,842 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-04-29 10:56:32,849 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2025-04-29 10:56:32,852 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2025-04-29 10:56:32,974 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 10:56:32,975 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 21 [2025-04-29 10:56:32,981 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 10:56:32,982 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 25 [2025-04-29 10:56:32,987 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2025-04-29 10:56:33,120 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 21 [2025-04-29 10:56:33,123 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2025-04-29 10:56:33,212 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-29 10:56:33,212 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 10:56:33,356 WARN L849 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_377 Int) (v_ArrVal_376 Int) (v_ArrVal_378 (Array Int Int))) (= (+ (let ((.cse0 (+ |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset| 4))) (select (select (store |c_#memory_int#0| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_378) (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| (store (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) .cse0 v_ArrVal_376)) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) (+ (select (select (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| (store (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) .cse0 v_ArrVal_377)) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) 4))) 1) (* |c_ULTIMATE.start_main_~len~0#1| 2))) is different from false [2025-04-29 10:56:33,451 WARN L849 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_378 (Array Int Int))) (= (* |c_ULTIMATE.start_main_~len~0#1| 2) (+ (select (select (store |c_#memory_int#0| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_378) (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) (+ (select (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) 4)) 1))) is different from false [2025-04-29 10:56:33,458 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 10:56:33,459 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 41 [2025-04-29 10:56:33,467 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 10:56:33,467 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 79 treesize of output 78 [2025-04-29 10:56:33,472 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 18 [2025-04-29 10:56:33,573 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 10:56:33,573 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 37 [2025-04-29 10:56:33,577 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2025-04-29 10:56:34,147 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2025-04-29 10:56:34,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [979450637] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 10:56:34,147 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 10:56:34,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 23, 24] total 61 [2025-04-29 10:56:34,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982870321] [2025-04-29 10:56:34,147 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 10:56:34,148 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 61 states [2025-04-29 10:56:34,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:56:34,149 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2025-04-29 10:56:34,151 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=198, Invalid=3219, Unknown=13, NotChecked=230, Total=3660 [2025-04-29 10:56:34,152 INFO L87 Difference]: Start difference. First operand 30 states and 36 transitions. Second operand has 61 states, 59 states have (on average 1.2203389830508475) internal successors, (72), 53 states have internal predecessors, (72), 6 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-04-29 10:56:35,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 10:56:35,420 INFO L93 Difference]: Finished difference Result 63 states and 80 transitions. [2025-04-29 10:56:35,420 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-04-29 10:56:35,421 INFO L79 Accepts]: Start accepts. Automaton has has 61 states, 59 states have (on average 1.2203389830508475) internal successors, (72), 53 states have internal predecessors, (72), 6 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 33 [2025-04-29 10:56:35,421 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 10:56:35,423 INFO L225 Difference]: With dead ends: 63 [2025-04-29 10:56:35,423 INFO L226 Difference]: Without dead ends: 61 [2025-04-29 10:56:35,427 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1137 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=361, Invalid=5184, Unknown=13, NotChecked=294, Total=5852 [2025-04-29 10:56:35,428 INFO L437 NwaCegarLoop]: 16 mSDtfsCounter, 151 mSDsluCounter, 409 mSDsCounter, 0 mSdLazyCounter, 1122 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 425 SdHoareTripleChecker+Invalid, 1264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 1122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 128 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-29 10:56:35,429 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 425 Invalid, 1264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 1122 Invalid, 0 Unknown, 128 Unchecked, 0.6s Time] [2025-04-29 10:56:35,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2025-04-29 10:56:35,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 47. [2025-04-29 10:56:35,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 42 states have (on average 1.2619047619047619) internal successors, (53), 42 states have internal predecessors, (53), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-04-29 10:56:35,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 59 transitions. [2025-04-29 10:56:35,436 INFO L79 Accepts]: Start accepts. Automaton has 47 states and 59 transitions. Word has length 33 [2025-04-29 10:56:35,436 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 10:56:35,436 INFO L485 AbstractCegarLoop]: Abstraction has 47 states and 59 transitions. [2025-04-29 10:56:35,437 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 61 states, 59 states have (on average 1.2203389830508475) internal successors, (72), 53 states have internal predecessors, (72), 6 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-04-29 10:56:35,437 INFO L278 IsEmpty]: Start isEmpty. Operand 47 states and 59 transitions. [2025-04-29 10:56:35,437 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-04-29 10:56:35,437 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:56:35,437 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 10:56:35,444 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-04-29 10:56:35,637 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:56:35,638 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:56:35,638 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:56:35,639 INFO L85 PathProgramCache]: Analyzing trace with hash -1951166908, now seen corresponding path program 2 times [2025-04-29 10:56:35,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:56:35,639 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901171849] [2025-04-29 10:56:35,639 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 10:56:35,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:56:35,650 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 34 statements into 2 equivalence classes. [2025-04-29 10:56:35,666 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 34 of 34 statements. [2025-04-29 10:56:35,666 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-29 10:56:35,666 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:56:35,729 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-29 10:56:35,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:56:35,730 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901171849] [2025-04-29 10:56:35,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1901171849] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 10:56:35,730 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [599788404] [2025-04-29 10:56:35,730 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 10:56:35,730 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:56:35,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 10:56:35,732 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-04-29 10:56:35,734 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-04-29 10:56:35,791 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 34 statements into 2 equivalence classes. [2025-04-29 10:56:35,824 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 34 of 34 statements. [2025-04-29 10:56:35,824 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-29 10:56:35,824 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:56:35,826 INFO L256 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-29 10:56:35,827 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 10:56:35,844 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-29 10:56:35,844 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-29 10:56:35,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [599788404] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 10:56:35,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-29 10:56:35,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 7 [2025-04-29 10:56:35,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005364412] [2025-04-29 10:56:35,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 10:56:35,845 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 10:56:35,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:56:35,845 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 10:56:35,845 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-04-29 10:56:35,845 INFO L87 Difference]: Start difference. First operand 47 states and 59 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-04-29 10:56:35,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 10:56:35,877 INFO L93 Difference]: Finished difference Result 62 states and 79 transitions. [2025-04-29 10:56:35,877 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 10:56:35,878 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 34 [2025-04-29 10:56:35,878 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 10:56:35,879 INFO L225 Difference]: With dead ends: 62 [2025-04-29 10:56:35,879 INFO L226 Difference]: Without dead ends: 48 [2025-04-29 10:56:35,879 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2025-04-29 10:56:35,879 INFO L437 NwaCegarLoop]: 19 mSDtfsCounter, 24 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 10:56:35,880 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 58 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 10:56:35,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2025-04-29 10:56:35,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2025-04-29 10:56:35,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 43 states have (on average 1.2093023255813953) internal successors, (52), 43 states have internal predecessors, (52), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-04-29 10:56:35,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 58 transitions. [2025-04-29 10:56:35,886 INFO L79 Accepts]: Start accepts. Automaton has 48 states and 58 transitions. Word has length 34 [2025-04-29 10:56:35,886 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 10:56:35,886 INFO L485 AbstractCegarLoop]: Abstraction has 48 states and 58 transitions. [2025-04-29 10:56:35,886 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-04-29 10:56:35,886 INFO L278 IsEmpty]: Start isEmpty. Operand 48 states and 58 transitions. [2025-04-29 10:56:35,887 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-04-29 10:56:35,887 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:56:35,887 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 10:56:35,894 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-04-29 10:56:36,087 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:56:36,088 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:56:36,088 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:56:36,088 INFO L85 PathProgramCache]: Analyzing trace with hash -1575152520, now seen corresponding path program 3 times [2025-04-29 10:56:36,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:56:36,088 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562522387] [2025-04-29 10:56:36,088 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-29 10:56:36,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:56:36,100 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 34 statements into 4 equivalence classes. [2025-04-29 10:56:36,114 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 34 of 34 statements. [2025-04-29 10:56:36,114 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-04-29 10:56:36,115 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:56:36,168 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-04-29 10:56:36,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:56:36,168 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562522387] [2025-04-29 10:56:36,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1562522387] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 10:56:36,168 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2115579455] [2025-04-29 10:56:36,168 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-29 10:56:36,168 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:56:36,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 10:56:36,170 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 10:56:36,172 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-04-29 10:56:36,246 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 34 statements into 4 equivalence classes. [2025-04-29 10:56:36,304 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 34 of 34 statements. [2025-04-29 10:56:36,304 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-04-29 10:56:36,304 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:56:36,305 INFO L256 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-29 10:56:36,307 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 10:56:36,317 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-04-29 10:56:36,317 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 10:56:36,342 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-04-29 10:56:36,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2115579455] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-29 10:56:36,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-29 10:56:36,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 6 [2025-04-29 10:56:36,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880134344] [2025-04-29 10:56:36,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 10:56:36,346 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 10:56:36,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:56:36,346 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 10:56:36,346 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-04-29 10:56:36,346 INFO L87 Difference]: Start difference. First operand 48 states and 58 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-04-29 10:56:36,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 10:56:36,373 INFO L93 Difference]: Finished difference Result 58 states and 70 transitions. [2025-04-29 10:56:36,374 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-29 10:56:36,374 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 34 [2025-04-29 10:56:36,375 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 10:56:36,375 INFO L225 Difference]: With dead ends: 58 [2025-04-29 10:56:36,375 INFO L226 Difference]: Without dead ends: 50 [2025-04-29 10:56:36,375 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 65 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-04-29 10:56:36,376 INFO L437 NwaCegarLoop]: 24 mSDtfsCounter, 6 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 10:56:36,376 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 55 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 10:56:36,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2025-04-29 10:56:36,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 47. [2025-04-29 10:56:36,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 42 states have (on average 1.2142857142857142) internal successors, (51), 42 states have internal predecessors, (51), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-04-29 10:56:36,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 57 transitions. [2025-04-29 10:56:36,385 INFO L79 Accepts]: Start accepts. Automaton has 47 states and 57 transitions. Word has length 34 [2025-04-29 10:56:36,385 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 10:56:36,385 INFO L485 AbstractCegarLoop]: Abstraction has 47 states and 57 transitions. [2025-04-29 10:56:36,385 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-04-29 10:56:36,385 INFO L278 IsEmpty]: Start isEmpty. Operand 47 states and 57 transitions. [2025-04-29 10:56:36,386 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-04-29 10:56:36,387 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:56:36,387 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 10:56:36,394 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-04-29 10:56:36,591 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:56:36,591 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:56:36,591 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:56:36,591 INFO L85 PathProgramCache]: Analyzing trace with hash 1567063542, now seen corresponding path program 4 times [2025-04-29 10:56:36,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:56:36,592 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147506002] [2025-04-29 10:56:36,592 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-29 10:56:36,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:56:36,602 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 34 statements into 2 equivalence classes. [2025-04-29 10:56:36,606 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 33 of 34 statements. [2025-04-29 10:56:36,606 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-29 10:56:36,606 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:56:36,680 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-04-29 10:56:36,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:56:36,680 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147506002] [2025-04-29 10:56:36,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [147506002] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 10:56:36,680 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1260605504] [2025-04-29 10:56:36,681 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-29 10:56:36,681 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:56:36,681 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 10:56:36,682 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 10:56:36,684 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-04-29 10:56:36,752 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 34 statements into 2 equivalence classes. [2025-04-29 10:56:36,779 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 33 of 34 statements. [2025-04-29 10:56:36,780 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-29 10:56:36,780 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:56:36,781 INFO L256 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-29 10:56:36,784 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 10:56:36,804 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-04-29 10:56:36,804 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-29 10:56:36,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1260605504] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 10:56:36,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-29 10:56:36,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 7 [2025-04-29 10:56:36,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379534962] [2025-04-29 10:56:36,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 10:56:36,805 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 10:56:36,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:56:36,805 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 10:56:36,805 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-04-29 10:56:36,805 INFO L87 Difference]: Start difference. First operand 47 states and 57 transitions. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-04-29 10:56:36,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 10:56:36,841 INFO L93 Difference]: Finished difference Result 54 states and 66 transitions. [2025-04-29 10:56:36,841 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 10:56:36,841 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 34 [2025-04-29 10:56:36,841 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 10:56:36,841 INFO L225 Difference]: With dead ends: 54 [2025-04-29 10:56:36,841 INFO L226 Difference]: Without dead ends: 48 [2025-04-29 10:56:36,842 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2025-04-29 10:56:36,842 INFO L437 NwaCegarLoop]: 19 mSDtfsCounter, 19 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 10:56:36,842 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 75 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 10:56:36,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2025-04-29 10:56:36,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2025-04-29 10:56:36,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 43 states have (on average 1.186046511627907) internal successors, (51), 43 states have internal predecessors, (51), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-04-29 10:56:36,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 57 transitions. [2025-04-29 10:56:36,848 INFO L79 Accepts]: Start accepts. Automaton has 48 states and 57 transitions. Word has length 34 [2025-04-29 10:56:36,848 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 10:56:36,848 INFO L485 AbstractCegarLoop]: Abstraction has 48 states and 57 transitions. [2025-04-29 10:56:36,848 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-04-29 10:56:36,848 INFO L278 IsEmpty]: Start isEmpty. Operand 48 states and 57 transitions. [2025-04-29 10:56:36,848 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-04-29 10:56:36,848 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:56:36,849 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-04-29 10:56:36,855 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-04-29 10:56:37,049 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:56:37,049 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:56:37,050 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:56:37,050 INFO L85 PathProgramCache]: Analyzing trace with hash -80655042, now seen corresponding path program 5 times [2025-04-29 10:56:37,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:56:37,050 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849349197] [2025-04-29 10:56:37,050 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-29 10:56:37,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:56:37,061 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 37 statements into 4 equivalence classes. [2025-04-29 10:56:37,065 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 20 of 37 statements. [2025-04-29 10:56:37,065 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-29 10:56:37,066 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:56:37,107 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 15 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-29 10:56:37,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:56:37,107 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849349197] [2025-04-29 10:56:37,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1849349197] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 10:56:37,108 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1753459760] [2025-04-29 10:56:37,108 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-29 10:56:37,108 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:56:37,108 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 10:56:37,109 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 10:56:37,111 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-04-29 10:56:37,182 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 37 statements into 4 equivalence classes. [2025-04-29 10:56:37,201 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 20 of 37 statements. [2025-04-29 10:56:37,201 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-29 10:56:37,201 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:56:37,202 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-29 10:56:37,203 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 10:56:37,220 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 13 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-29 10:56:37,220 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 10:56:37,265 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 13 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-29 10:56:37,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1753459760] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 10:56:37,265 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 10:56:37,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 10 [2025-04-29 10:56:37,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119723673] [2025-04-29 10:56:37,266 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 10:56:37,266 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-29 10:56:37,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:56:37,266 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-29 10:56:37,266 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2025-04-29 10:56:37,266 INFO L87 Difference]: Start difference. First operand 48 states and 57 transitions. Second operand has 10 states, 10 states have (on average 3.2) internal successors, (32), 10 states have internal predecessors, (32), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-04-29 10:56:37,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 10:56:37,297 INFO L93 Difference]: Finished difference Result 63 states and 75 transitions. [2025-04-29 10:56:37,297 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-29 10:56:37,297 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.2) internal successors, (32), 10 states have internal predecessors, (32), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 37 [2025-04-29 10:56:37,297 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 10:56:37,298 INFO L225 Difference]: With dead ends: 63 [2025-04-29 10:56:37,298 INFO L226 Difference]: Without dead ends: 48 [2025-04-29 10:56:37,298 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 69 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2025-04-29 10:56:37,298 INFO L437 NwaCegarLoop]: 23 mSDtfsCounter, 1 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 10:56:37,298 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 135 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 10:56:37,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2025-04-29 10:56:37,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2025-04-29 10:56:37,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 43 states have (on average 1.1395348837209303) internal successors, (49), 43 states have internal predecessors, (49), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-04-29 10:56:37,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 55 transitions. [2025-04-29 10:56:37,304 INFO L79 Accepts]: Start accepts. Automaton has 48 states and 55 transitions. Word has length 37 [2025-04-29 10:56:37,304 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 10:56:37,304 INFO L485 AbstractCegarLoop]: Abstraction has 48 states and 55 transitions. [2025-04-29 10:56:37,304 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.2) internal successors, (32), 10 states have internal predecessors, (32), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-04-29 10:56:37,304 INFO L278 IsEmpty]: Start isEmpty. Operand 48 states and 55 transitions. [2025-04-29 10:56:37,305 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-04-29 10:56:37,305 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:56:37,305 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-04-29 10:56:37,311 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-04-29 10:56:37,509 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:56:37,509 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:56:37,509 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:56:37,509 INFO L85 PathProgramCache]: Analyzing trace with hash -806555187, now seen corresponding path program 1 times [2025-04-29 10:56:37,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:56:37,509 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929583346] [2025-04-29 10:56:37,509 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:56:37,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:56:37,519 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-04-29 10:56:37,531 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-04-29 10:56:37,531 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:56:37,531 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:56:38,229 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 17 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 10:56:38,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:56:38,229 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929583346] [2025-04-29 10:56:38,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1929583346] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 10:56:38,229 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1372064778] [2025-04-29 10:56:38,229 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:56:38,229 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:56:38,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 10:56:38,231 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 10:56:38,232 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-04-29 10:56:38,310 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-04-29 10:56:38,337 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-04-29 10:56:38,338 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:56:38,338 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:56:38,340 INFO L256 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-04-29 10:56:38,341 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 10:56:38,412 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2025-04-29 10:56:38,534 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 12 [2025-04-29 10:56:38,581 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-04-29 10:56:38,581 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 10:56:38,668 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 32 [2025-04-29 10:56:38,685 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-04-29 10:56:38,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1372064778] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 10:56:38,686 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 10:56:38,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 11, 11] total 37 [2025-04-29 10:56:38,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488593755] [2025-04-29 10:56:38,686 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 10:56:38,686 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2025-04-29 10:56:38,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:56:38,687 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2025-04-29 10:56:38,687 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=1233, Unknown=0, NotChecked=0, Total=1332 [2025-04-29 10:56:38,687 INFO L87 Difference]: Start difference. First operand 48 states and 55 transitions. Second operand has 37 states, 36 states have (on average 1.8888888888888888) internal successors, (68), 34 states have internal predecessors, (68), 3 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-04-29 10:56:39,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 10:56:39,626 INFO L93 Difference]: Finished difference Result 101 states and 115 transitions. [2025-04-29 10:56:39,626 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-04-29 10:56:39,626 INFO L79 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 1.8888888888888888) internal successors, (68), 34 states have internal predecessors, (68), 3 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 37 [2025-04-29 10:56:39,627 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 10:56:39,627 INFO L225 Difference]: With dead ends: 101 [2025-04-29 10:56:39,627 INFO L226 Difference]: Without dead ends: 99 [2025-04-29 10:56:39,628 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 609 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=357, Invalid=3183, Unknown=0, NotChecked=0, Total=3540 [2025-04-29 10:56:39,628 INFO L437 NwaCegarLoop]: 15 mSDtfsCounter, 222 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 861 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 896 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 861 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-29 10:56:39,628 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [223 Valid, 340 Invalid, 896 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 861 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-29 10:56:39,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2025-04-29 10:56:39,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 65. [2025-04-29 10:56:39,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 60 states have (on average 1.1833333333333333) internal successors, (71), 60 states have internal predecessors, (71), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-04-29 10:56:39,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 77 transitions. [2025-04-29 10:56:39,641 INFO L79 Accepts]: Start accepts. Automaton has 65 states and 77 transitions. Word has length 37 [2025-04-29 10:56:39,641 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 10:56:39,641 INFO L485 AbstractCegarLoop]: Abstraction has 65 states and 77 transitions. [2025-04-29 10:56:39,641 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 1.8888888888888888) internal successors, (68), 34 states have internal predecessors, (68), 3 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-04-29 10:56:39,641 INFO L278 IsEmpty]: Start isEmpty. Operand 65 states and 77 transitions. [2025-04-29 10:56:39,642 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-04-29 10:56:39,642 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:56:39,642 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-04-29 10:56:39,648 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-04-29 10:56:39,842 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-04-29 10:56:39,842 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:56:39,843 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:56:39,843 INFO L85 PathProgramCache]: Analyzing trace with hash 764682945, now seen corresponding path program 2 times [2025-04-29 10:56:39,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:56:39,843 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732198650] [2025-04-29 10:56:39,843 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 10:56:39,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:56:39,852 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 38 statements into 2 equivalence classes. [2025-04-29 10:56:39,858 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 38 of 38 statements. [2025-04-29 10:56:39,858 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-29 10:56:39,858 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:56:39,909 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-04-29 10:56:39,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:56:39,909 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732198650] [2025-04-29 10:56:39,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [732198650] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 10:56:39,909 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1316742606] [2025-04-29 10:56:39,909 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 10:56:39,909 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:56:39,909 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 10:56:39,912 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 10:56:39,913 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-04-29 10:56:39,999 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 38 statements into 2 equivalence classes. [2025-04-29 10:56:40,045 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 38 of 38 statements. [2025-04-29 10:56:40,045 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-29 10:56:40,045 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:56:40,046 INFO L256 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-29 10:56:40,048 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 10:56:40,078 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-04-29 10:56:40,078 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 10:56:40,132 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-04-29 10:56:40,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1316742606] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 10:56:40,133 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 10:56:40,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 6 [2025-04-29 10:56:40,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901113828] [2025-04-29 10:56:40,133 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 10:56:40,134 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 10:56:40,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:56:40,134 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 10:56:40,134 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-04-29 10:56:40,134 INFO L87 Difference]: Start difference. First operand 65 states and 77 transitions. Second operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-04-29 10:56:40,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 10:56:40,172 INFO L93 Difference]: Finished difference Result 82 states and 96 transitions. [2025-04-29 10:56:40,172 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 10:56:40,172 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 38 [2025-04-29 10:56:40,173 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 10:56:40,173 INFO L225 Difference]: With dead ends: 82 [2025-04-29 10:56:40,173 INFO L226 Difference]: Without dead ends: 50 [2025-04-29 10:56:40,174 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 73 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-04-29 10:56:40,174 INFO L437 NwaCegarLoop]: 25 mSDtfsCounter, 20 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 10:56:40,174 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 73 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 10:56:40,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2025-04-29 10:56:40,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 45. [2025-04-29 10:56:40,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 40 states have (on average 1.125) internal successors, (45), 40 states have internal predecessors, (45), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-04-29 10:56:40,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 51 transitions. [2025-04-29 10:56:40,184 INFO L79 Accepts]: Start accepts. Automaton has 45 states and 51 transitions. Word has length 38 [2025-04-29 10:56:40,184 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 10:56:40,184 INFO L485 AbstractCegarLoop]: Abstraction has 45 states and 51 transitions. [2025-04-29 10:56:40,184 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-04-29 10:56:40,184 INFO L278 IsEmpty]: Start isEmpty. Operand 45 states and 51 transitions. [2025-04-29 10:56:40,185 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-04-29 10:56:40,185 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:56:40,185 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 10:56:40,192 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-04-29 10:56:40,386 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:56:40,386 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:56:40,387 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:56:40,387 INFO L85 PathProgramCache]: Analyzing trace with hash -93307744, now seen corresponding path program 6 times [2025-04-29 10:56:40,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:56:40,387 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547927891] [2025-04-29 10:56:40,387 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-29 10:56:40,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:56:40,398 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 41 statements into 3 equivalence classes. [2025-04-29 10:56:40,404 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 41 of 41 statements. [2025-04-29 10:56:40,408 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-29 10:56:40,408 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:56:40,447 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-04-29 10:56:40,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:56:40,448 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547927891] [2025-04-29 10:56:40,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547927891] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 10:56:40,448 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1391752860] [2025-04-29 10:56:40,448 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-29 10:56:40,448 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:56:40,448 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 10:56:40,450 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 10:56:40,452 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-04-29 10:56:40,539 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 41 statements into 3 equivalence classes. [2025-04-29 10:56:40,593 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 41 of 41 statements. [2025-04-29 10:56:40,593 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-29 10:56:40,593 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:56:40,595 INFO L256 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-29 10:56:40,596 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 10:56:40,614 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-04-29 10:56:40,615 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-29 10:56:40,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1391752860] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 10:56:40,615 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-29 10:56:40,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2025-04-29 10:56:40,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758378585] [2025-04-29 10:56:40,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 10:56:40,615 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 10:56:40,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:56:40,615 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 10:56:40,615 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-29 10:56:40,615 INFO L87 Difference]: Start difference. First operand 45 states and 51 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-04-29 10:56:40,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 10:56:40,625 INFO L93 Difference]: Finished difference Result 50 states and 55 transitions. [2025-04-29 10:56:40,626 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-29 10:56:40,626 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 41 [2025-04-29 10:56:40,626 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 10:56:40,626 INFO L225 Difference]: With dead ends: 50 [2025-04-29 10:56:40,626 INFO L226 Difference]: Without dead ends: 0 [2025-04-29 10:56:40,626 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-29 10:56:40,627 INFO L437 NwaCegarLoop]: 11 mSDtfsCounter, 0 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 10:56:40,627 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 26 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 10:56:40,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-04-29 10:56:40,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-04-29 10:56:40,627 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-04-29 10:56:40,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-04-29 10:56:40,627 INFO L79 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 41 [2025-04-29 10:56:40,627 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 10:56:40,627 INFO L485 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-29 10:56:40,627 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-04-29 10:56:40,627 INFO L278 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-04-29 10:56:40,628 INFO L284 IsEmpty]: Finished isEmpty. No accepting run. [2025-04-29 10:56:40,630 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-04-29 10:56:40,637 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-04-29 10:56:40,831 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-04-29 10:56:40,833 INFO L422 BasicCegarLoop]: Path program histogram: [6, 2, 2, 1, 1, 1] [2025-04-29 10:56:40,834 INFO L312 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-04-29 10:56:41,188 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-29 10:56:41,195 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~i~0 [2025-04-29 10:56:41,197 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2025-04-29 10:56:41,197 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2025-04-29 10:56:41,197 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~head!base,]]] [2025-04-29 10:56:41,197 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#0.offset [2025-04-29 10:56:41,197 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#0.offset,GLOBAL] [2025-04-29 10:56:41,197 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#0.offset,GLOBAL],[IdentifierExpression[~s~0!base,]]] [2025-04-29 10:56:41,197 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~head!offset [2025-04-29 10:56:41,197 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2025-04-29 10:56:41,197 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2025-04-29 10:56:41,198 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~s~0!base,]]] [2025-04-29 10:56:41,198 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~len~0 [2025-04-29 10:56:41,198 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2025-04-29 10:56:41,198 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2025-04-29 10:56:41,198 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~head!base,]]] [2025-04-29 10:56:41,198 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~expected~0 [2025-04-29 10:56:41,198 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~s~0!offset [2025-04-29 10:56:41,198 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#0.offset [2025-04-29 10:56:41,198 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#0.offset,GLOBAL] [2025-04-29 10:56:41,198 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#0.offset,GLOBAL],[IdentifierExpression[~head!base,]]] [2025-04-29 10:56:41,198 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~i~0 [2025-04-29 10:56:41,198 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~head!base [2025-04-29 10:56:41,198 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#0.base [2025-04-29 10:56:41,198 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#0.base,GLOBAL] [2025-04-29 10:56:41,198 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#0.base,GLOBAL],[IdentifierExpression[~head!base,]]] [2025-04-29 10:56:41,198 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~expected~0 [2025-04-29 10:56:41,198 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2025-04-29 10:56:41,198 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2025-04-29 10:56:41,198 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#0.base,GLOBAL],[IdentifierExpression[~s~0!base,]]],[IntegerLiteral[0]]]]] [2025-04-29 10:56:41,198 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#0.offset [2025-04-29 10:56:41,198 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#0.offset,GLOBAL] [2025-04-29 10:56:41,198 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#0.offset,GLOBAL],[IdentifierExpression[~s~0!base,]]] [2025-04-29 10:56:41,198 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~head!offset [2025-04-29 10:56:41,198 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2025-04-29 10:56:41,198 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2025-04-29 10:56:41,198 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~s~0!base,]]] [2025-04-29 10:56:41,198 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~len~0 [2025-04-29 10:56:41,199 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2025-04-29 10:56:41,199 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2025-04-29 10:56:41,199 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#0.base,GLOBAL],[IdentifierExpression[~head!base,]]],[IntegerLiteral[0]]]]] [2025-04-29 10:56:41,199 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~s~0!offset [2025-04-29 10:56:41,199 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~i~0 [2025-04-29 10:56:41,199 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~expected~0 [2025-04-29 10:56:41,199 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2025-04-29 10:56:41,199 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2025-04-29 10:56:41,199 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#0.base,GLOBAL],[IdentifierExpression[~s~0!base,]]],[IntegerLiteral[0]]]]] [2025-04-29 10:56:41,199 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#0.offset [2025-04-29 10:56:41,199 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#0.offset,GLOBAL] [2025-04-29 10:56:41,199 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#0.offset,GLOBAL],[IdentifierExpression[~s~0!base,]]] [2025-04-29 10:56:41,199 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~head!offset [2025-04-29 10:56:41,199 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2025-04-29 10:56:41,199 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2025-04-29 10:56:41,199 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~s~0!base,]]] [2025-04-29 10:56:41,199 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~len~0 [2025-04-29 10:56:41,199 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2025-04-29 10:56:41,199 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2025-04-29 10:56:41,199 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~head!base,]]] [2025-04-29 10:56:41,199 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~s~0!offset [2025-04-29 10:56:41,204 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#0.base [2025-04-29 10:56:41,204 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#0.base,GLOBAL] [2025-04-29 10:56:41,204 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#0.base,GLOBAL],[IdentifierExpression[~s~0!base,]]] [2025-04-29 10:56:41,204 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~s~0!base [2025-04-29 10:56:41,204 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#0.offset [2025-04-29 10:56:41,204 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#0.offset,GLOBAL] [2025-04-29 10:56:41,204 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#0.offset,GLOBAL],[IdentifierExpression[~s~0!base,]]] [2025-04-29 10:56:41,204 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~s~0!base [2025-04-29 10:56:41,204 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#0.base [2025-04-29 10:56:41,205 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#0.base,GLOBAL] [2025-04-29 10:56:41,205 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#0.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#0.base,GLOBAL],[IdentifierExpression[~s~0!base,]]],[IntegerLiteral[0]]]]] [2025-04-29 10:56:41,205 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~s~0!offset [2025-04-29 10:56:41,205 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#0.base [2025-04-29 10:56:41,205 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#0.base,GLOBAL] [2025-04-29 10:56:41,205 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#0.base,GLOBAL],[IdentifierExpression[~s~0!base,]]] [2025-04-29 10:56:41,205 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~s~0!base [2025-04-29 10:56:41,205 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2025-04-29 10:56:41,205 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2025-04-29 10:56:41,205 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#0.base,GLOBAL],[IdentifierExpression[~s~0!base,]]],[IntegerLiteral[0]]]]] [2025-04-29 10:56:41,205 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#0.offset [2025-04-29 10:56:41,205 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#0.offset,GLOBAL] [2025-04-29 10:56:41,205 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#0.offset,GLOBAL],[IdentifierExpression[~s~0!base,]]] [2025-04-29 10:56:41,205 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~s~0!offset [2025-04-29 10:56:41,205 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2025-04-29 10:56:41,205 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2025-04-29 10:56:41,205 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#0.base,GLOBAL],[IdentifierExpression[~s~0!base,]]],[IntegerLiteral[0]]]]] [2025-04-29 10:56:41,205 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#0.offset [2025-04-29 10:56:41,205 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#0.offset,GLOBAL] [2025-04-29 10:56:41,205 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#0.offset,GLOBAL],[IdentifierExpression[~s~0!base,]]] [2025-04-29 10:56:41,205 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2025-04-29 10:56:41,205 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2025-04-29 10:56:41,205 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~s~0!base,]]] [2025-04-29 10:56:41,205 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~s~0!offset [2025-04-29 10:56:41,206 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~head~0!offset [2025-04-29 10:56:41,207 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~last~0!offset [2025-04-29 10:56:41,207 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~head~0!base [2025-04-29 10:56:41,207 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~last~0!base [2025-04-29 10:56:41,207 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2025-04-29 10:56:41,207 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2025-04-29 10:56:41,207 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~head~0!offset [2025-04-29 10:56:41,207 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~last~0!offset [2025-04-29 10:56:41,207 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#0.base [2025-04-29 10:56:41,207 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#0.base,GLOBAL] [2025-04-29 10:56:41,207 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#0.base,GLOBAL],[IdentifierExpression[~head~0!base,]]] [2025-04-29 10:56:41,207 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~last~0!base [2025-04-29 10:56:41,207 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~head~0!base [2025-04-29 10:56:41,207 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~last~0!base [2025-04-29 10:56:41,208 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#0.offset [2025-04-29 10:56:41,208 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#0.offset,GLOBAL] [2025-04-29 10:56:41,208 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#0.offset,GLOBAL],[IdentifierExpression[~head~0!base,]]] [2025-04-29 10:56:41,208 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~head!offset [2025-04-29 10:56:41,209 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~head!base [2025-04-29 10:56:41,209 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#0.base [2025-04-29 10:56:41,209 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#0.base,GLOBAL] [2025-04-29 10:56:41,209 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#0.base,GLOBAL],[IdentifierExpression[~s~0!base,]]] [2025-04-29 10:56:41,209 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~i~0 [2025-04-29 10:56:41,209 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#0.offset [2025-04-29 10:56:41,209 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#0.offset,GLOBAL] [2025-04-29 10:56:41,209 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#0.offset,GLOBAL],[IdentifierExpression[~s~0!base,]]] [2025-04-29 10:56:41,209 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~len~0 [2025-04-29 10:56:41,209 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~head!base [2025-04-29 10:56:41,209 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~s~0!base [2025-04-29 10:56:41,209 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~s~0!base [2025-04-29 10:56:41,209 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#0.base [2025-04-29 10:56:41,210 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#0.base,GLOBAL] [2025-04-29 10:56:41,210 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#0.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#0.base,GLOBAL],[IdentifierExpression[~s~0!base,]]],[IntegerLiteral[0]]]]] [2025-04-29 10:56:41,210 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~s~0!offset [2025-04-29 10:56:41,210 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~i~0 [2025-04-29 10:56:41,210 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~head!offset [2025-04-29 10:56:41,210 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~head!base [2025-04-29 10:56:41,210 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~s~0!base [2025-04-29 10:56:41,210 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~head!base [2025-04-29 10:56:41,210 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#0.base [2025-04-29 10:56:41,210 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#0.base,GLOBAL] [2025-04-29 10:56:41,210 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#0.base,GLOBAL],[IdentifierExpression[~head!base,]]] [2025-04-29 10:56:41,210 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2025-04-29 10:56:41,210 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2025-04-29 10:56:41,210 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#0.base,GLOBAL],[IdentifierExpression[~s~0!base,]]],[IntegerLiteral[0]]]]] [2025-04-29 10:56:41,210 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#0.offset [2025-04-29 10:56:41,210 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#0.offset,GLOBAL] [2025-04-29 10:56:41,210 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#0.offset,GLOBAL],[IdentifierExpression[~s~0!base,]]] [2025-04-29 10:56:41,210 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~len~0 [2025-04-29 10:56:41,210 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~s~0!offset [2025-04-29 10:56:41,210 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#0.base [2025-04-29 10:56:41,210 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#0.base,GLOBAL] [2025-04-29 10:56:41,210 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#0.base,GLOBAL],[IdentifierExpression[~s~0!base,]]] [2025-04-29 10:56:41,210 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~s~0!base [2025-04-29 10:56:41,210 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~head!offset [2025-04-29 10:56:41,210 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~head!base [2025-04-29 10:56:41,210 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~s~0!base [2025-04-29 10:56:41,210 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~i~0 [2025-04-29 10:56:41,211 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~len~0 [2025-04-29 10:56:41,211 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#0.offset [2025-04-29 10:56:41,211 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#0.offset,GLOBAL] [2025-04-29 10:56:41,211 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#0.offset,GLOBAL],[IdentifierExpression[~head!base,]]] [2025-04-29 10:56:41,211 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~s~0!base [2025-04-29 10:56:41,211 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#0.base [2025-04-29 10:56:41,211 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#0.base,GLOBAL] [2025-04-29 10:56:41,211 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#0.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#0.base,GLOBAL],[IdentifierExpression[~s~0!base,]]],[IntegerLiteral[0]]]]] [2025-04-29 10:56:41,211 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~s~0!offset [2025-04-29 10:56:41,211 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2025-04-29 10:56:41,211 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2025-04-29 10:56:41,211 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#0.base,GLOBAL],[IdentifierExpression[~s~0!base,]]],[IntegerLiteral[0]]]]] [2025-04-29 10:56:41,211 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#0.offset [2025-04-29 10:56:41,212 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#0.offset,GLOBAL] [2025-04-29 10:56:41,212 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#0.offset,GLOBAL],[IdentifierExpression[~s~0!base,]]] [2025-04-29 10:56:41,212 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2025-04-29 10:56:41,212 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2025-04-29 10:56:41,212 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~s~0!base,]]] [2025-04-29 10:56:41,212 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~s~0!offset [2025-04-29 10:56:41,212 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#0.offset [2025-04-29 10:56:41,212 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#0.offset,GLOBAL] [2025-04-29 10:56:41,213 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#0.offset,GLOBAL],[IdentifierExpression[~s~0!base,]]] [2025-04-29 10:56:41,213 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2025-04-29 10:56:41,213 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2025-04-29 10:56:41,213 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~s~0!base,]]] [2025-04-29 10:56:41,213 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~s~0!offset [2025-04-29 10:56:41,213 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.04 10:56:41 BoogieIcfgContainer [2025-04-29 10:56:41,213 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-29 10:56:41,214 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-04-29 10:56:41,214 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-04-29 10:56:41,214 INFO L274 PluginConnector]: Witness Printer initialized [2025-04-29 10:56:41,215 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 10:56:28" (3/4) ... [2025-04-29 10:56:41,216 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-04-29 10:56:41,221 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure node_create [2025-04-29 10:56:41,224 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2025-04-29 10:56:41,224 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-04-29 10:56:41,224 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2025-04-29 10:56:41,224 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-04-29 10:56:41,290 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-04-29 10:56:41,290 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-04-29 10:56:41,291 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-04-29 10:56:41,291 INFO L158 Benchmark]: Toolchain (without parser) took 12987.87ms. Allocated memory was 142.6MB in the beginning and 251.7MB in the end (delta: 109.1MB). Free memory was 111.9MB in the beginning and 77.8MB in the end (delta: 34.1MB). Peak memory consumption was 139.5MB. Max. memory is 16.1GB. [2025-04-29 10:56:41,291 INFO L158 Benchmark]: CDTParser took 0.87ms. Allocated memory is still 201.3MB. Free memory is still 126.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-04-29 10:56:41,291 INFO L158 Benchmark]: CACSL2BoogieTranslator took 198.51ms. Allocated memory is still 142.6MB. Free memory was 111.5MB in the beginning and 97.1MB in the end (delta: 14.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-04-29 10:56:41,292 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.25ms. Allocated memory is still 142.6MB. Free memory was 97.1MB in the beginning and 95.4MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-29 10:56:41,292 INFO L158 Benchmark]: Boogie Preprocessor took 33.31ms. Allocated memory is still 142.6MB. Free memory was 95.4MB in the beginning and 92.9MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-29 10:56:41,292 INFO L158 Benchmark]: RCFGBuilder took 301.59ms. Allocated memory is still 142.6MB. Free memory was 92.9MB in the beginning and 78.0MB in the end (delta: 15.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-04-29 10:56:41,293 INFO L158 Benchmark]: TraceAbstraction took 12339.12ms. Allocated memory was 142.6MB in the beginning and 251.7MB in the end (delta: 109.1MB). Free memory was 77.6MB in the beginning and 86.7MB in the end (delta: -9.1MB). Peak memory consumption was 97.6MB. Max. memory is 16.1GB. [2025-04-29 10:56:41,293 INFO L158 Benchmark]: Witness Printer took 76.52ms. Allocated memory is still 251.7MB. Free memory was 86.7MB in the beginning and 77.8MB in the end (delta: 8.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-04-29 10:56:41,293 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.87ms. Allocated memory is still 201.3MB. Free memory is still 126.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 198.51ms. Allocated memory is still 142.6MB. Free memory was 111.5MB in the beginning and 97.1MB in the end (delta: 14.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 34.25ms. Allocated memory is still 142.6MB. Free memory was 97.1MB in the beginning and 95.4MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 33.31ms. Allocated memory is still 142.6MB. Free memory was 95.4MB in the beginning and 92.9MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 301.59ms. Allocated memory is still 142.6MB. Free memory was 92.9MB in the beginning and 78.0MB in the end (delta: 15.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 12339.12ms. Allocated memory was 142.6MB in the beginning and 251.7MB in the end (delta: 109.1MB). Free memory was 77.6MB in the beginning and 86.7MB in the end (delta: -9.1MB). Peak memory consumption was 97.6MB. Max. memory is 16.1GB. * Witness Printer took 76.52ms. Allocated memory is still 251.7MB. Free memory was 86.7MB in the beginning and 77.8MB in the end (delta: 8.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~i~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~head!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#0.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#0.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#0.offset,GLOBAL],[IdentifierExpression[~s~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~head!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~s~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~len~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~head!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~expected~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~s~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#0.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#0.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#0.offset,GLOBAL],[IdentifierExpression[~head!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~i~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~head!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#0.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#0.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#0.base,GLOBAL],[IdentifierExpression[~head!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~expected~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#0.base,GLOBAL],[IdentifierExpression[~s~0!base,]]],[IntegerLiteral[0]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#0.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#0.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#0.offset,GLOBAL],[IdentifierExpression[~s~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~head!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~s~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~len~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#0.base,GLOBAL],[IdentifierExpression[~head!base,]]],[IntegerLiteral[0]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~s~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~i~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~expected~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#0.base,GLOBAL],[IdentifierExpression[~s~0!base,]]],[IntegerLiteral[0]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#0.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#0.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#0.offset,GLOBAL],[IdentifierExpression[~s~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~head!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~s~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~len~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~head!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~s~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#0.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#0.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#0.base,GLOBAL],[IdentifierExpression[~s~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~s~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#0.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#0.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#0.offset,GLOBAL],[IdentifierExpression[~s~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~s~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#0.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#0.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#0.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#0.base,GLOBAL],[IdentifierExpression[~s~0!base,]]],[IntegerLiteral[0]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~s~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#0.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#0.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#0.base,GLOBAL],[IdentifierExpression[~s~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~s~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#0.base,GLOBAL],[IdentifierExpression[~s~0!base,]]],[IntegerLiteral[0]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#0.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#0.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#0.offset,GLOBAL],[IdentifierExpression[~s~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~s~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#0.base,GLOBAL],[IdentifierExpression[~s~0!base,]]],[IntegerLiteral[0]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#0.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#0.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#0.offset,GLOBAL],[IdentifierExpression[~s~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~s~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~s~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~head~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~last~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~head~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~last~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~head~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~last~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#0.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#0.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#0.base,GLOBAL],[IdentifierExpression[~head~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~last~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~head~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~last~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#0.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#0.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#0.offset,GLOBAL],[IdentifierExpression[~head~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~head!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~head!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#0.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#0.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#0.base,GLOBAL],[IdentifierExpression[~s~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~i~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#0.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#0.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#0.offset,GLOBAL],[IdentifierExpression[~s~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~len~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~head!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~s~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~s~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#0.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#0.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#0.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#0.base,GLOBAL],[IdentifierExpression[~s~0!base,]]],[IntegerLiteral[0]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~s~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~i~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~head!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~head!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~s~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~head!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#0.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#0.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#0.base,GLOBAL],[IdentifierExpression[~head!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#0.base,GLOBAL],[IdentifierExpression[~s~0!base,]]],[IntegerLiteral[0]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#0.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#0.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#0.offset,GLOBAL],[IdentifierExpression[~s~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~len~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~s~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#0.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#0.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#0.base,GLOBAL],[IdentifierExpression[~s~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~s~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~head!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~head!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~s~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~i~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~len~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#0.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#0.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#0.offset,GLOBAL],[IdentifierExpression[~head!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~s~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#0.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#0.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#0.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#0.base,GLOBAL],[IdentifierExpression[~s~0!base,]]],[IntegerLiteral[0]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~s~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#0.base,GLOBAL],[IdentifierExpression[~s~0!base,]]],[IntegerLiteral[0]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#0.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#0.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#0.offset,GLOBAL],[IdentifierExpression[~s~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~s~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~s~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#0.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#0.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#0.offset,GLOBAL],[IdentifierExpression[~s~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~s~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~s~0!offset * 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: 87]: 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 2 procedures, 29 locations, 40 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 11.9s, OverallIterations: 13, TraceHistogramMax: 3, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 2.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 581 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 578 mSDsluCounter, 1483 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 128 IncrementalHoareTripleChecker+Unchecked, 1214 mSDsCounter, 67 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2203 IncrementalHoareTripleChecker+Invalid, 2398 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 67 mSolverCounterUnsat, 269 mSDtfsCounter, 2203 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 700 GetRequests, 497 SyntacticMatches, 10 SemanticMatches, 193 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1791 ImplicationChecksByTransitivity, 3.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=65occurred in iteration=11, InterpolantAutomatonStates: 111, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 13 MinimizatonAttempts, 86 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 5.6s InterpolantComputationTime, 764 NumberOfCodeBlocks, 713 NumberOfCodeBlocksAsserted, 41 NumberOfCheckSat, 943 ConstructedInterpolants, 10 QuantifiedInterpolants, 3680 SizeOfPredicates, 30 NumberOfNonLiveVariables, 2844 ConjunctsInSsa, 200 ConjunctsInUnsatCore, 29 InterpolantComputations, 8 PerfectInterpolantSequences, 374/473 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: 55]: Loop Invariant Derived loop invariant: (((index <= 0) || (index == 1)) || (index <= 0)) - InvariantResult [Line: 75]: Loop Invariant Derived loop invariant: ((((i == 1) && (len == 2)) || ((i == 0) && (len == 2))) || ((i <= 0) && (len == 2))) - InvariantResult [Line: 32]: Loop Invariant Derived loop invariant: (((2 == len) && (len == 2)) || ((len <= 1) && (len == 2))) - InvariantResult [Line: 63]: Loop Invariant Derived loop invariant: ((((3 == data) && (index == 0)) || ((2 == data) && (index == 0))) || ((3 == data) && (index == 1))) - InvariantResult [Line: 79]: Loop Invariant Derived loop invariant: (((i == 1) && (len == 2)) || ((i <= 0) && (len == 2))) RESULT: Ultimate proved your program to be correct! [2025-04-29 10:56:41,315 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