./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/list-simple/dll2n_update_all.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/list-simple/dll2n_update_all.i -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 c46cc56772f2c3f0b073640343b328fb3b128ed13803ffe5a04f6290fe624494 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 04:34:17,982 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 04:34:18,043 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 04:34:18,049 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 04:34:18,049 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 04:34:18,070 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 04:34:18,071 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 04:34:18,071 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 04:34:18,072 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 04:34:18,072 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 04:34:18,073 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 04:34:18,073 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 04:34:18,073 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 04:34:18,073 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 04:34:18,073 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 04:34:18,074 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 04:34:18,074 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 04:34:18,074 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 04:34:18,074 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 04:34:18,074 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 04:34:18,074 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 04:34:18,074 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 04:34:18,074 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 04:34:18,074 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 04:34:18,075 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 04:34:18,075 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 04:34:18,075 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 04:34:18,075 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 04:34:18,075 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 04:34:18,075 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 04:34:18,075 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 04:34:18,075 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 04:34:18,075 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 04:34:18,075 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 04:34:18,076 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 04:34:18,076 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 04:34:18,076 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 04:34:18,076 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 04:34:18,076 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 04:34:18,076 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 04:34:18,076 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 04:34:18,076 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 04:34:18,076 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 04:34:18,076 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 -> c46cc56772f2c3f0b073640343b328fb3b128ed13803ffe5a04f6290fe624494 [2025-03-08 04:34:18,331 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 04:34:18,337 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 04:34:18,339 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 04:34:18,339 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 04:34:18,340 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 04:34:18,340 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/dll2n_update_all.i [2025-03-08 04:34:19,533 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2ae596092/fec90689d87b4ea7ace5dc7deb66b203/FLAG1fa6e3f7a [2025-03-08 04:34:19,892 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 04:34:19,893 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2n_update_all.i [2025-03-08 04:34:19,904 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2ae596092/fec90689d87b4ea7ace5dc7deb66b203/FLAG1fa6e3f7a [2025-03-08 04:34:20,114 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2ae596092/fec90689d87b4ea7ace5dc7deb66b203 [2025-03-08 04:34:20,116 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 04:34:20,117 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 04:34:20,118 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 04:34:20,118 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 04:34:20,121 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 04:34:20,122 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 04:34:20" (1/1) ... [2025-03-08 04:34:20,122 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f3a095d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:34:20, skipping insertion in model container [2025-03-08 04:34:20,123 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 04:34:20" (1/1) ... [2025-03-08 04:34:20,143 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 04:34:20,417 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2n_update_all.i[24455,24468] [2025-03-08 04:34:20,426 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 04:34:20,435 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 04:34:20,474 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2n_update_all.i[24455,24468] [2025-03-08 04:34:20,477 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 04:34:20,498 INFO L204 MainTranslator]: Completed translation [2025-03-08 04:34:20,498 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:34:20 WrapperNode [2025-03-08 04:34:20,498 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 04:34:20,499 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 04:34:20,499 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 04:34:20,499 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 04:34:20,503 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:34:20" (1/1) ... [2025-03-08 04:34:20,511 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:34:20" (1/1) ... [2025-03-08 04:34:20,528 INFO L138 Inliner]: procedures = 126, calls = 27, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 97 [2025-03-08 04:34:20,528 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 04:34:20,529 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 04:34:20,529 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 04:34:20,529 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 04:34:20,535 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:34:20" (1/1) ... [2025-03-08 04:34:20,536 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:34:20" (1/1) ... [2025-03-08 04:34:20,542 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:34:20" (1/1) ... [2025-03-08 04:34:20,553 INFO L175 MemorySlicer]: Split 11 memory accesses to 2 slices as follows [2, 9]. 82 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 5 writes are split as follows [0, 5]. [2025-03-08 04:34:20,553 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:34:20" (1/1) ... [2025-03-08 04:34:20,553 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:34:20" (1/1) ... [2025-03-08 04:34:20,561 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:34:20" (1/1) ... [2025-03-08 04:34:20,562 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:34:20" (1/1) ... [2025-03-08 04:34:20,563 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:34:20" (1/1) ... [2025-03-08 04:34:20,566 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:34:20" (1/1) ... [2025-03-08 04:34:20,569 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 04:34:20,570 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 04:34:20,570 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 04:34:20,570 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 04:34:20,571 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:34:20" (1/1) ... [2025-03-08 04:34:20,576 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 04:34:20,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 04:34:20,597 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 04:34:20,600 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 04:34:20,619 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2025-03-08 04:34:20,619 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2025-03-08 04:34:20,619 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-08 04:34:20,619 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-08 04:34:20,619 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-08 04:34:20,620 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-08 04:34:20,620 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-08 04:34:20,620 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 04:34:20,620 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-08 04:34:20,620 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-08 04:34:20,620 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-08 04:34:20,620 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-08 04:34:20,620 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-08 04:34:20,620 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 04:34:20,620 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 04:34:20,620 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 04:34:20,620 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 04:34:20,752 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 04:34:20,754 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 04:34:20,780 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2025-03-08 04:34:20,902 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L615: havoc dll_get_data_at_#t~mem9#1; [2025-03-08 04:34:20,912 INFO L? ?]: Removed 40 outVars from TransFormulas that were not future-live. [2025-03-08 04:34:20,912 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 04:34:20,919 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 04:34:20,919 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 04:34:20,920 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:34:20 BoogieIcfgContainer [2025-03-08 04:34:20,920 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 04:34:20,922 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 04:34:20,922 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 04:34:20,926 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 04:34:20,926 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 04:34:20" (1/3) ... [2025-03-08 04:34:20,927 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ad5dc3d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 04:34:20, skipping insertion in model container [2025-03-08 04:34:20,927 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:34:20" (2/3) ... [2025-03-08 04:34:20,927 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ad5dc3d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 04:34:20, skipping insertion in model container [2025-03-08 04:34:20,927 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:34:20" (3/3) ... [2025-03-08 04:34:20,928 INFO L128 eAbstractionObserver]: Analyzing ICFG dll2n_update_all.i [2025-03-08 04:34:20,941 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 04:34:20,942 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG dll2n_update_all.i that has 2 procedures, 26 locations, 1 initial locations, 6 loop locations, and 1 error locations. [2025-03-08 04:34:20,981 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 04:34:20,988 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@1c3539be, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 04:34:20,988 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 04:34:20,990 INFO L276 IsEmpty]: Start isEmpty. Operand has 25 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 23 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:34:20,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-08 04:34:20,997 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:34:20,998 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 04:34:21,002 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:34:21,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:34:21,009 INFO L85 PathProgramCache]: Analyzing trace with hash -1678472462, now seen corresponding path program 1 times [2025-03-08 04:34:21,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:34:21,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317864048] [2025-03-08 04:34:21,019 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:34:21,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:34:21,084 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-08 04:34:21,096 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-08 04:34:21,096 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:34:21,096 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:34:21,203 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 04:34:21,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:34:21,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317864048] [2025-03-08 04:34:21,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [317864048] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 04:34:21,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 04:34:21,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 04:34:21,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461534768] [2025-03-08 04:34:21,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 04:34:21,209 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 04:34:21,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:34:21,224 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 04:34:21,224 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 04:34:21,226 INFO L87 Difference]: Start difference. First operand has 25 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 23 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:34:21,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:34:21,248 INFO L93 Difference]: Finished difference Result 46 states and 62 transitions. [2025-03-08 04:34:21,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 04:34:21,250 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-03-08 04:34:21,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:34:21,254 INFO L225 Difference]: With dead ends: 46 [2025-03-08 04:34:21,255 INFO L226 Difference]: Without dead ends: 22 [2025-03-08 04:34:21,257 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 04:34:21,260 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 6 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 57 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-03-08 04:34:21,260 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 57 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 04:34:21,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2025-03-08 04:34:21,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 18. [2025-03-08 04:34:21,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 17 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:34:21,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 23 transitions. [2025-03-08 04:34:21,284 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 23 transitions. Word has length 10 [2025-03-08 04:34:21,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:34:21,284 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 23 transitions. [2025-03-08 04:34:21,284 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:34:21,284 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 23 transitions. [2025-03-08 04:34:21,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-08 04:34:21,285 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:34:21,285 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 04:34:21,285 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 04:34:21,285 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:34:21,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:34:21,286 INFO L85 PathProgramCache]: Analyzing trace with hash 680998005, now seen corresponding path program 1 times [2025-03-08 04:34:21,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:34:21,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200205014] [2025-03-08 04:34:21,286 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:34:21,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:34:21,303 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-08 04:34:21,318 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-08 04:34:21,318 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:34:21,318 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:34:21,399 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 04:34:21,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:34:21,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200205014] [2025-03-08 04:34:21,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1200205014] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 04:34:21,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 04:34:21,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 04:34:21,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305359743] [2025-03-08 04:34:21,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 04:34:21,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 04:34:21,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:34:21,402 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 04:34:21,402 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 04:34:21,402 INFO L87 Difference]: Start difference. First operand 18 states and 23 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:34:21,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:34:21,420 INFO L93 Difference]: Finished difference Result 36 states and 47 transitions. [2025-03-08 04:34:21,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 04:34:21,421 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2025-03-08 04:34:21,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:34:21,421 INFO L225 Difference]: With dead ends: 36 [2025-03-08 04:34:21,421 INFO L226 Difference]: Without dead ends: 21 [2025-03-08 04:34:21,422 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 04:34:21,422 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 0 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 04:34:21,422 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 35 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 04:34:21,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2025-03-08 04:34:21,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2025-03-08 04:34:21,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.3) internal successors, (26), 20 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:34:21,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 26 transitions. [2025-03-08 04:34:21,425 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 26 transitions. Word has length 15 [2025-03-08 04:34:21,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:34:21,425 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 26 transitions. [2025-03-08 04:34:21,425 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:34:21,425 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 26 transitions. [2025-03-08 04:34:21,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-08 04:34:21,426 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:34:21,426 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 04:34:21,426 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 04:34:21,426 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:34:21,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:34:21,427 INFO L85 PathProgramCache]: Analyzing trace with hash 484484500, now seen corresponding path program 1 times [2025-03-08 04:34:21,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:34:21,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284046097] [2025-03-08 04:34:21,427 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:34:21,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:34:21,437 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-08 04:34:21,447 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-08 04:34:21,447 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:34:21,447 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:34:21,545 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 04:34:21,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:34:21,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284046097] [2025-03-08 04:34:21,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1284046097] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 04:34:21,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [361650188] [2025-03-08 04:34:21,547 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:34:21,547 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:34:21,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 04:34:21,550 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 04:34:21,551 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 04:34:21,607 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-08 04:34:21,631 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-08 04:34:21,631 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:34:21,631 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:34:21,633 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-08 04:34:21,637 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 04:34:21,672 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 04:34:21,672 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 04:34:21,700 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 04:34:21,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [361650188] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 04:34:21,700 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 04:34:21,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2025-03-08 04:34:21,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496564038] [2025-03-08 04:34:21,701 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 04:34:21,703 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 04:34:21,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:34:21,703 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 04:34:21,703 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-08 04:34:21,704 INFO L87 Difference]: Start difference. First operand 21 states and 26 transitions. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:34:21,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:34:21,722 INFO L93 Difference]: Finished difference Result 33 states and 42 transitions. [2025-03-08 04:34:21,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 04:34:21,723 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2025-03-08 04:34:21,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:34:21,723 INFO L225 Difference]: With dead ends: 33 [2025-03-08 04:34:21,723 INFO L226 Difference]: Without dead ends: 23 [2025-03-08 04:34:21,724 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-08 04:34:21,724 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 5 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 04:34:21,725 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 50 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 04:34:21,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2025-03-08 04:34:21,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2025-03-08 04:34:21,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 22 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:34:21,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 28 transitions. [2025-03-08 04:34:21,730 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 28 transitions. Word has length 15 [2025-03-08 04:34:21,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:34:21,730 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 28 transitions. [2025-03-08 04:34:21,730 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:34:21,730 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 28 transitions. [2025-03-08 04:34:21,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-03-08 04:34:21,731 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:34:21,731 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 04:34:21,738 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-03-08 04:34:21,931 WARN L453 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-03-08 04:34:21,931 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:34:21,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:34:21,932 INFO L85 PathProgramCache]: Analyzing trace with hash -845385965, now seen corresponding path program 1 times [2025-03-08 04:34:21,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:34:21,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709554628] [2025-03-08 04:34:21,932 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:34:21,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:34:21,945 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-08 04:34:21,958 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-08 04:34:21,959 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:34:21,959 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:34:22,037 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-08 04:34:22,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:34:22,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709554628] [2025-03-08 04:34:22,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1709554628] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 04:34:22,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 04:34:22,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 04:34:22,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777187217] [2025-03-08 04:34:22,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 04:34:22,038 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 04:34:22,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:34:22,038 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 04:34:22,038 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 04:34:22,038 INFO L87 Difference]: Start difference. First operand 23 states and 28 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:34:22,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:34:22,056 INFO L93 Difference]: Finished difference Result 38 states and 47 transitions. [2025-03-08 04:34:22,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 04:34:22,057 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-03-08 04:34:22,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:34:22,058 INFO L225 Difference]: With dead ends: 38 [2025-03-08 04:34:22,058 INFO L226 Difference]: Without dead ends: 32 [2025-03-08 04:34:22,058 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 04:34:22,059 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 22 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 04:34:22,059 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 33 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 04:34:22,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2025-03-08 04:34:22,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 24. [2025-03-08 04:34:22,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 23 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:34:22,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 29 transitions. [2025-03-08 04:34:22,062 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 29 transitions. Word has length 20 [2025-03-08 04:34:22,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:34:22,063 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 29 transitions. [2025-03-08 04:34:22,063 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:34:22,063 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 29 transitions. [2025-03-08 04:34:22,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-08 04:34:22,063 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:34:22,063 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 04:34:22,064 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 04:34:22,064 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:34:22,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:34:22,064 INFO L85 PathProgramCache]: Analyzing trace with hash -1771801072, now seen corresponding path program 1 times [2025-03-08 04:34:22,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:34:22,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666453615] [2025-03-08 04:34:22,065 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:34:22,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:34:22,081 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-08 04:34:22,090 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-08 04:34:22,090 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:34:22,090 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:34:22,262 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 04:34:22,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:34:22,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666453615] [2025-03-08 04:34:22,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1666453615] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 04:34:22,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [639389480] [2025-03-08 04:34:22,262 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:34:22,263 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:34:22,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 04:34:22,266 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 04:34:22,266 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 04:34:22,344 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-08 04:34:22,382 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-08 04:34:22,383 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:34:22,383 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:34:22,384 INFO L256 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-08 04:34:22,386 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 04:34:22,448 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-08 04:34:22,449 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 04:34:22,491 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-08 04:34:22,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [639389480] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 04:34:22,491 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 04:34:22,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 9 [2025-03-08 04:34:22,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911373916] [2025-03-08 04:34:22,491 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 04:34:22,491 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 04:34:22,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:34:22,492 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 04:34:22,492 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-08 04:34:22,492 INFO L87 Difference]: Start difference. First operand 24 states and 29 transitions. Second operand has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:34:22,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:34:22,546 INFO L93 Difference]: Finished difference Result 47 states and 58 transitions. [2025-03-08 04:34:22,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 04:34:22,548 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2025-03-08 04:34:22,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:34:22,549 INFO L225 Difference]: With dead ends: 47 [2025-03-08 04:34:22,549 INFO L226 Difference]: Without dead ends: 41 [2025-03-08 04:34:22,549 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 41 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2025-03-08 04:34:22,549 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 50 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 04:34:22,550 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 61 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 04:34:22,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2025-03-08 04:34:22,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 27. [2025-03-08 04:34:22,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 26 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:34:22,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 33 transitions. [2025-03-08 04:34:22,555 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 33 transitions. Word has length 23 [2025-03-08 04:34:22,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:34:22,555 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 33 transitions. [2025-03-08 04:34:22,556 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:34:22,556 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 33 transitions. [2025-03-08 04:34:22,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-08 04:34:22,556 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:34:22,556 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 04:34:22,564 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-08 04:34:22,757 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:34:22,757 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:34:22,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:34:22,758 INFO L85 PathProgramCache]: Analyzing trace with hash -1144409613, now seen corresponding path program 2 times [2025-03-08 04:34:22,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:34:22,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886362035] [2025-03-08 04:34:22,758 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 04:34:22,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:34:22,774 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-03-08 04:34:22,781 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-03-08 04:34:22,782 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 04:34:22,782 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:34:22,885 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-08 04:34:22,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:34:22,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886362035] [2025-03-08 04:34:22,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1886362035] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 04:34:22,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1635701493] [2025-03-08 04:34:22,885 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 04:34:22,885 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:34:22,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 04:34:22,888 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 04:34:22,890 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 04:34:22,981 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-03-08 04:34:23,011 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-03-08 04:34:23,013 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 04:34:23,013 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:34:23,014 INFO L256 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-08 04:34:23,016 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 04:34:23,048 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-08 04:34:23,048 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 04:34:23,069 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-08 04:34:23,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1635701493] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 04:34:23,069 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 04:34:23,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2025-03-08 04:34:23,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693636581] [2025-03-08 04:34:23,070 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 04:34:23,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 04:34:23,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:34:23,074 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 04:34:23,074 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-03-08 04:34:23,074 INFO L87 Difference]: Start difference. First operand 27 states and 33 transitions. Second operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:34:23,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:34:23,119 INFO L93 Difference]: Finished difference Result 43 states and 54 transitions. [2025-03-08 04:34:23,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 04:34:23,120 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2025-03-08 04:34:23,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:34:23,121 INFO L225 Difference]: With dead ends: 43 [2025-03-08 04:34:23,121 INFO L226 Difference]: Without dead ends: 34 [2025-03-08 04:34:23,121 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 47 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-03-08 04:34:23,122 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 24 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 04:34:23,122 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 72 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 04:34:23,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2025-03-08 04:34:23,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 28. [2025-03-08 04:34:23,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 27 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:34:23,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2025-03-08 04:34:23,129 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 34 transitions. Word has length 26 [2025-03-08 04:34:23,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:34:23,129 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 34 transitions. [2025-03-08 04:34:23,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:34:23,129 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2025-03-08 04:34:23,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-08 04:34:23,130 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:34:23,130 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] [2025-03-08 04:34:23,136 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-08 04:34:23,334 WARN L453 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-03-08 04:34:23,334 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:34:23,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:34:23,334 INFO L85 PathProgramCache]: Analyzing trace with hash -263531378, now seen corresponding path program 1 times [2025-03-08 04:34:23,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:34:23,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643998677] [2025-03-08 04:34:23,335 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:34:23,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:34:23,347 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-08 04:34:23,364 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-08 04:34:23,364 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:34:23,364 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:34:24,219 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 04:34:24,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:34:24,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643998677] [2025-03-08 04:34:24,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1643998677] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 04:34:24,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [563124148] [2025-03-08 04:34:24,219 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:34:24,219 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:34:24,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 04:34:24,226 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 04:34:24,227 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-08 04:34:24,288 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-08 04:34:24,313 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-08 04:34:24,313 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:34:24,313 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:34:24,322 INFO L256 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 74 conjuncts are in the unsatisfiable core [2025-03-08 04:34:24,326 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 04:34:24,358 INFO L378 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-03-08 04:34:24,427 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-08 04:34:24,428 INFO L378 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-03-08 04:34:24,472 INFO L378 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 18 treesize of output 19 [2025-03-08 04:34:24,533 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-08 04:34:24,533 INFO L378 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 40 treesize of output 39 [2025-03-08 04:34:24,787 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 04:34:24,787 INFO L378 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 26 [2025-03-08 04:34:24,800 INFO L378 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 11 treesize of output 7 [2025-03-08 04:34:24,934 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 11 [2025-03-08 04:34:24,978 INFO L378 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 16 treesize of output 11 [2025-03-08 04:34:25,139 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 04:34:25,139 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 04:34:25,267 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_405 (Array Int Int))) (= |c_ULTIMATE.start_main_~len~0#1| (select (select (store |c_#memory_int#1| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_update_at_~head#1.base|) (+ |c_ULTIMATE.start_dll_update_at_~head#1.offset| 4)) v_ArrVal_405) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) is different from false [2025-03-08 04:34:25,343 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 04:34:25,344 INFO L378 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 32 treesize of output 33 [2025-03-08 04:34:25,353 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 04:34:25,354 INFO L378 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 58 treesize of output 61 [2025-03-08 04:34:25,362 INFO L378 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 23 treesize of output 21 [2025-03-08 04:34:25,625 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 04:34:25,625 INFO L378 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 2 case distinctions, treesize of input 28 treesize of output 34 [2025-03-08 04:34:25,630 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 04:34:25,630 INFO L378 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 49 treesize of output 31 [2025-03-08 04:34:25,636 INFO L378 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 8 treesize of output 4 [2025-03-08 04:34:25,721 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2025-03-08 04:34:25,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [563124148] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 04:34:25,721 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 04:34:25,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 19] total 51 [2025-03-08 04:34:25,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085792694] [2025-03-08 04:34:25,721 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 04:34:25,722 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2025-03-08 04:34:25,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:34:25,722 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2025-03-08 04:34:25,723 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=176, Invalid=2237, Unknown=41, NotChecked=96, Total=2550 [2025-03-08 04:34:25,723 INFO L87 Difference]: Start difference. First operand 28 states and 34 transitions. Second operand has 51 states, 51 states have (on average 1.411764705882353) internal successors, (72), 51 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:34:26,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:34:26,750 INFO L93 Difference]: Finished difference Result 56 states and 70 transitions. [2025-03-08 04:34:26,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-08 04:34:26,752 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 51 states have (on average 1.411764705882353) internal successors, (72), 51 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2025-03-08 04:34:26,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:34:26,754 INFO L225 Difference]: With dead ends: 56 [2025-03-08 04:34:26,754 INFO L226 Difference]: Without dead ends: 54 [2025-03-08 04:34:26,756 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 935 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=410, Invalid=3972, Unknown=44, NotChecked=130, Total=4556 [2025-03-08 04:34:26,756 INFO L435 NwaCegarLoop]: 6 mSDtfsCounter, 133 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 966 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 1040 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 966 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 62 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 04:34:26,756 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 177 Invalid, 1040 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 966 Invalid, 0 Unknown, 62 Unchecked, 0.5s Time] [2025-03-08 04:34:26,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2025-03-08 04:34:26,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 39. [2025-03-08 04:34:26,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 38 states have (on average 1.2894736842105263) internal successors, (49), 38 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:34:26,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 49 transitions. [2025-03-08 04:34:26,764 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 49 transitions. Word has length 27 [2025-03-08 04:34:26,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:34:26,764 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 49 transitions. [2025-03-08 04:34:26,764 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 51 states have (on average 1.411764705882353) internal successors, (72), 51 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:34:26,764 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 49 transitions. [2025-03-08 04:34:26,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-08 04:34:26,766 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:34:26,766 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] [2025-03-08 04:34:26,776 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-08 04:34:26,970 WARN L453 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-03-08 04:34:26,970 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:34:26,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:34:26,970 INFO L85 PathProgramCache]: Analyzing trace with hash 421477906, now seen corresponding path program 1 times [2025-03-08 04:34:26,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:34:26,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795075642] [2025-03-08 04:34:26,970 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:34:26,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:34:26,984 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-08 04:34:26,991 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-08 04:34:26,991 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:34:26,991 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:34:27,034 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-08 04:34:27,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:34:27,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795075642] [2025-03-08 04:34:27,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [795075642] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 04:34:27,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 04:34:27,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 04:34:27,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830958139] [2025-03-08 04:34:27,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 04:34:27,035 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 04:34:27,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:34:27,036 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 04:34:27,036 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 04:34:27,037 INFO L87 Difference]: Start difference. First operand 39 states and 49 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:34:27,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:34:27,058 INFO L93 Difference]: Finished difference Result 51 states and 63 transitions. [2025-03-08 04:34:27,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 04:34:27,058 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2025-03-08 04:34:27,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:34:27,059 INFO L225 Difference]: With dead ends: 51 [2025-03-08 04:34:27,059 INFO L226 Difference]: Without dead ends: 45 [2025-03-08 04:34:27,060 INFO L434 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-03-08 04:34:27,060 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 8 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 04:34:27,060 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 47 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 04:34:27,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2025-03-08 04:34:27,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 41. [2025-03-08 04:34:27,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 40 states have (on average 1.25) internal successors, (50), 40 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:34:27,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 50 transitions. [2025-03-08 04:34:27,067 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 50 transitions. Word has length 28 [2025-03-08 04:34:27,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:34:27,068 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 50 transitions. [2025-03-08 04:34:27,068 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:34:27,069 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 50 transitions. [2025-03-08 04:34:27,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-08 04:34:27,069 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:34:27,069 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] [2025-03-08 04:34:27,069 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 04:34:27,069 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:34:27,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:34:27,070 INFO L85 PathProgramCache]: Analyzing trace with hash 1273890131, now seen corresponding path program 2 times [2025-03-08 04:34:27,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:34:27,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047486935] [2025-03-08 04:34:27,071 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 04:34:27,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:34:27,081 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-03-08 04:34:27,088 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-03-08 04:34:27,088 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 04:34:27,088 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:34:27,140 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-08 04:34:27,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:34:27,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047486935] [2025-03-08 04:34:27,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2047486935] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 04:34:27,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1273794913] [2025-03-08 04:34:27,141 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 04:34:27,141 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:34:27,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 04:34:27,142 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-03-08 04:34:27,144 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-03-08 04:34:27,211 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-03-08 04:34:27,234 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-03-08 04:34:27,234 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 04:34:27,234 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:34:27,235 INFO L256 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 04:34:27,236 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 04:34:27,250 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-08 04:34:27,250 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 04:34:27,266 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-08 04:34:27,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1273794913] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 04:34:27,266 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 04:34:27,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 7 [2025-03-08 04:34:27,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980160593] [2025-03-08 04:34:27,266 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 04:34:27,267 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 04:34:27,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:34:27,267 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 04:34:27,267 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-08 04:34:27,267 INFO L87 Difference]: Start difference. First operand 41 states and 50 transitions. Second operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:34:27,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:34:27,301 INFO L93 Difference]: Finished difference Result 66 states and 80 transitions. [2025-03-08 04:34:27,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 04:34:27,301 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2025-03-08 04:34:27,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:34:27,302 INFO L225 Difference]: With dead ends: 66 [2025-03-08 04:34:27,302 INFO L226 Difference]: Without dead ends: 51 [2025-03-08 04:34:27,302 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 52 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2025-03-08 04:34:27,302 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 19 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 04:34:27,303 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 64 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 04:34:27,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2025-03-08 04:34:27,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 40. [2025-03-08 04:34:27,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 39 states have (on average 1.205128205128205) internal successors, (47), 39 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:34:27,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 47 transitions. [2025-03-08 04:34:27,307 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 47 transitions. Word has length 28 [2025-03-08 04:34:27,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:34:27,307 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 47 transitions. [2025-03-08 04:34:27,307 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:34:27,307 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 47 transitions. [2025-03-08 04:34:27,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-03-08 04:34:27,307 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:34:27,307 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] [2025-03-08 04:34:27,314 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-08 04:34:27,508 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:34:27,508 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:34:27,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:34:27,509 INFO L85 PathProgramCache]: Analyzing trace with hash 1927731217, now seen corresponding path program 1 times [2025-03-08 04:34:27,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:34:27,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858980362] [2025-03-08 04:34:27,509 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:34:27,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:34:27,520 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-08 04:34:27,525 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-08 04:34:27,525 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:34:27,525 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:34:27,573 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-08 04:34:27,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:34:27,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858980362] [2025-03-08 04:34:27,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1858980362] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 04:34:27,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [23185437] [2025-03-08 04:34:27,573 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:34:27,573 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:34:27,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 04:34:27,575 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-03-08 04:34:27,597 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-03-08 04:34:27,681 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-08 04:34:27,713 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-08 04:34:27,713 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:34:27,713 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:34:27,714 INFO L256 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-08 04:34:27,716 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 04:34:27,734 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-08 04:34:27,735 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 04:34:27,755 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-08 04:34:27,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [23185437] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 04:34:27,755 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 04:34:27,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 6 [2025-03-08 04:34:27,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038775366] [2025-03-08 04:34:27,756 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 04:34:27,756 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 04:34:27,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:34:27,757 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 04:34:27,757 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 04:34:27,757 INFO L87 Difference]: Start difference. First operand 40 states and 47 transitions. Second operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:34:27,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:34:27,796 INFO L93 Difference]: Finished difference Result 51 states and 60 transitions. [2025-03-08 04:34:27,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 04:34:27,797 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2025-03-08 04:34:27,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:34:27,797 INFO L225 Difference]: With dead ends: 51 [2025-03-08 04:34:27,797 INFO L226 Difference]: Without dead ends: 45 [2025-03-08 04:34:27,797 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 58 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-03-08 04:34:27,798 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 14 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 04:34:27,798 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 73 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 04:34:27,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2025-03-08 04:34:27,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 41. [2025-03-08 04:34:27,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 40 states have (on average 1.2) internal successors, (48), 40 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:34:27,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 48 transitions. [2025-03-08 04:34:27,804 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 48 transitions. Word has length 31 [2025-03-08 04:34:27,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:34:27,804 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 48 transitions. [2025-03-08 04:34:27,804 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:34:27,804 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 48 transitions. [2025-03-08 04:34:27,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-03-08 04:34:27,805 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:34:27,805 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] [2025-03-08 04:34:27,814 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-08 04:34:28,005 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:34:28,006 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:34:28,006 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:34:28,006 INFO L85 PathProgramCache]: Analyzing trace with hash -368858385, now seen corresponding path program 1 times [2025-03-08 04:34:28,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:34:28,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295978408] [2025-03-08 04:34:28,007 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:34:28,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:34:28,022 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-08 04:34:28,046 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-08 04:34:28,046 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:34:28,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:34:28,941 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 04:34:28,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:34:28,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295978408] [2025-03-08 04:34:28,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1295978408] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 04:34:28,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1301317793] [2025-03-08 04:34:28,941 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:34:28,941 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:34:28,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 04:34:28,943 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-03-08 04:34:28,944 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-03-08 04:34:29,025 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-08 04:34:29,052 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-08 04:34:29,052 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:34:29,052 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:34:29,054 INFO L256 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 88 conjuncts are in the unsatisfiable core [2025-03-08 04:34:29,057 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 04:34:29,079 INFO L378 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-03-08 04:34:29,138 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-08 04:34:29,138 INFO L378 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-03-08 04:34:29,178 INFO L378 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 18 treesize of output 19 [2025-03-08 04:34:29,224 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-08 04:34:29,224 INFO L378 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 40 treesize of output 39 [2025-03-08 04:34:29,411 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 04:34:29,412 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 04:34:29,414 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 04:34:29,414 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 26 [2025-03-08 04:34:29,422 INFO L378 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 8 treesize of output 1 [2025-03-08 04:34:29,573 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-08 04:34:29,573 INFO L378 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 89 treesize of output 80 [2025-03-08 04:34:29,581 INFO L378 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 29 treesize of output 19 [2025-03-08 04:34:29,585 INFO L378 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 40 treesize of output 23 [2025-03-08 04:34:29,783 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 24 [2025-03-08 04:34:29,785 INFO L378 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 23 treesize of output 11 [2025-03-08 04:34:29,864 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 04:34:29,864 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 04:34:30,002 INFO L378 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 86 treesize of output 64 [2025-03-08 04:34:30,011 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (and (forall ((v_ArrVal_776 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_776) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0) |c_ULTIMATE.start_dll_update_at_~head#1.offset|)) (= |c_ULTIMATE.start_dll_update_at_~data#1| (+ |c_ULTIMATE.start_main_~len~0#1| 1)) (forall ((v_ArrVal_777 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_777) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0) |c_ULTIMATE.start_dll_update_at_~head#1.base|)))) is different from false [2025-03-08 04:34:30,026 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_dll_update_at_~head#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_update_at_~head#1.base|) .cse2)) (.cse1 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (and (forall ((v_ArrVal_777 (Array Int Int))) (= .cse0 (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_777) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1))) (forall ((v_ArrVal_776 (Array Int Int))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_update_at_~head#1.base|) .cse2) (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_776) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1))) (= |c_ULTIMATE.start_dll_update_at_~data#1| (+ |c_ULTIMATE.start_main_~len~0#1| 1))))) is different from false [2025-03-08 04:34:30,037 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse1))) (and (forall ((v_ArrVal_777 (Array Int Int))) (= .cse0 (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_777) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1))) (forall ((v_ArrVal_776 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_776) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1) (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~s~0#1.base|) .cse1))) (= |c_ULTIMATE.start_main_~i~0#1| 1)))) is different from false [2025-03-08 04:34:30,047 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse1))) (and (= |c_ULTIMATE.start_main_~i~0#1| 0) (forall ((v_ArrVal_777 (Array Int Int))) (= .cse0 (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_777) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1))) (forall ((v_ArrVal_776 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_776) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1) (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~s~0#1.base|) .cse1)))))) is different from false [2025-03-08 04:34:30,063 INFO L378 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 378 treesize of output 330 [2025-03-08 04:34:30,069 INFO L378 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 15 treesize of output 11 [2025-03-08 04:34:30,071 INFO L378 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 24 treesize of output 16 [2025-03-08 04:34:30,367 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_772 (Array Int Int))) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_772) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))))) is different from false [2025-03-08 04:34:30,375 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 04:34:30,375 INFO L378 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 2 case distinctions, treesize of input 28 treesize of output 34 [2025-03-08 04:34:30,378 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 04:34:30,379 INFO L378 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 49 treesize of output 31 [2025-03-08 04:34:30,384 INFO L378 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 8 treesize of output 4 [2025-03-08 04:34:30,475 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2025-03-08 04:34:30,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1301317793] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 04:34:30,475 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 04:34:30,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 22, 22] total 58 [2025-03-08 04:34:30,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375299508] [2025-03-08 04:34:30,475 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 04:34:30,475 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2025-03-08 04:34:30,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:34:30,476 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2025-03-08 04:34:30,477 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=2593, Unknown=5, NotChecked=530, Total=3306 [2025-03-08 04:34:30,477 INFO L87 Difference]: Start difference. First operand 41 states and 48 transitions. Second operand has 58 states, 58 states have (on average 1.5172413793103448) internal successors, (88), 58 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:34:31,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:34:31,987 INFO L93 Difference]: Finished difference Result 72 states and 86 transitions. [2025-03-08 04:34:31,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-08 04:34:31,987 INFO L78 Accepts]: Start accepts. Automaton has has 58 states, 58 states have (on average 1.5172413793103448) internal successors, (88), 58 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2025-03-08 04:34:31,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:34:31,988 INFO L225 Difference]: With dead ends: 72 [2025-03-08 04:34:31,988 INFO L226 Difference]: Without dead ends: 70 [2025-03-08 04:34:31,989 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 76 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 944 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=421, Invalid=4850, Unknown=5, NotChecked=730, Total=6006 [2025-03-08 04:34:31,990 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 106 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 1302 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 1630 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 1302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 319 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 04:34:31,990 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 269 Invalid, 1630 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 1302 Invalid, 0 Unknown, 319 Unchecked, 0.7s Time] [2025-03-08 04:34:31,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2025-03-08 04:34:31,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 50. [2025-03-08 04:34:31,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 49 states have (on average 1.2040816326530612) internal successors, (59), 49 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:34:31,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 59 transitions. [2025-03-08 04:34:31,997 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 59 transitions. Word has length 32 [2025-03-08 04:34:31,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:34:31,997 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 59 transitions. [2025-03-08 04:34:31,997 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 58 states, 58 states have (on average 1.5172413793103448) internal successors, (88), 58 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:34:31,997 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 59 transitions. [2025-03-08 04:34:31,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-03-08 04:34:31,997 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:34:31,997 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 04:34:32,004 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-08 04:34:32,198 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:34:32,198 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:34:32,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:34:32,199 INFO L85 PathProgramCache]: Analyzing trace with hash 1884620181, now seen corresponding path program 3 times [2025-03-08 04:34:32,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:34:32,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122201538] [2025-03-08 04:34:32,199 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 04:34:32,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:34:32,209 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 32 statements into 5 equivalence classes. [2025-03-08 04:34:32,224 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 31 of 32 statements. [2025-03-08 04:34:32,225 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-03-08 04:34:32,225 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:34:32,301 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 15 proven. 5 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-08 04:34:32,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:34:32,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122201538] [2025-03-08 04:34:32,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [122201538] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 04:34:32,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1697245483] [2025-03-08 04:34:32,302 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 04:34:32,302 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:34:32,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 04:34:32,311 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-03-08 04:34:32,312 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-03-08 04:34:32,425 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 32 statements into 5 equivalence classes. [2025-03-08 04:34:32,558 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 31 of 32 statements. [2025-03-08 04:34:32,558 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-03-08 04:34:32,558 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:34:32,560 INFO L256 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-08 04:34:32,562 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 04:34:32,620 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-08 04:34:32,620 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 04:34:32,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1697245483] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 04:34:32,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 04:34:32,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2025-03-08 04:34:32,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127517531] [2025-03-08 04:34:32,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 04:34:32,621 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 04:34:32,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:34:32,622 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 04:34:32,622 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2025-03-08 04:34:32,622 INFO L87 Difference]: Start difference. First operand 50 states and 59 transitions. Second operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:34:32,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:34:32,640 INFO L93 Difference]: Finished difference Result 58 states and 68 transitions. [2025-03-08 04:34:32,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 04:34:32,641 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2025-03-08 04:34:32,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:34:32,641 INFO L225 Difference]: With dead ends: 58 [2025-03-08 04:34:32,641 INFO L226 Difference]: Without dead ends: 34 [2025-03-08 04:34:32,641 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2025-03-08 04:34:32,642 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 9 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 04:34:32,642 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 47 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 04:34:32,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2025-03-08 04:34:32,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2025-03-08 04:34:32,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 33 states have (on average 1.0909090909090908) internal successors, (36), 33 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:34:32,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 36 transitions. [2025-03-08 04:34:32,647 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 36 transitions. Word has length 32 [2025-03-08 04:34:32,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:34:32,647 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 36 transitions. [2025-03-08 04:34:32,647 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:34:32,647 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions. [2025-03-08 04:34:32,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-03-08 04:34:32,647 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:34:32,647 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] [2025-03-08 04:34:32,657 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-08 04:34:32,847 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-03-08 04:34:32,848 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:34:32,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:34:32,848 INFO L85 PathProgramCache]: Analyzing trace with hash 1451307985, now seen corresponding path program 2 times [2025-03-08 04:34:32,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:34:32,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293880675] [2025-03-08 04:34:32,848 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 04:34:32,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:34:32,859 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-03-08 04:34:32,864 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-03-08 04:34:32,865 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 04:34:32,865 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:34:32,908 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-08 04:34:32,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:34:32,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293880675] [2025-03-08 04:34:32,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [293880675] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 04:34:32,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2032962766] [2025-03-08 04:34:32,909 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 04:34:32,909 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:34:32,909 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 04:34:32,911 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-03-08 04:34:32,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-03-08 04:34:33,005 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-03-08 04:34:33,042 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-03-08 04:34:33,042 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 04:34:33,042 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:34:33,045 INFO L256 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 04:34:33,048 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 04:34:33,084 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-08 04:34:33,084 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 04:34:33,125 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-08 04:34:33,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2032962766] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 04:34:33,126 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 04:34:33,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 6 [2025-03-08 04:34:33,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254770834] [2025-03-08 04:34:33,126 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 04:34:33,126 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 04:34:33,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:34:33,127 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 04:34:33,127 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 04:34:33,127 INFO L87 Difference]: Start difference. First operand 34 states and 36 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:34:33,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:34:33,149 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2025-03-08 04:34:33,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 04:34:33,149 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2025-03-08 04:34:33,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:34:33,149 INFO L225 Difference]: With dead ends: 34 [2025-03-08 04:34:33,149 INFO L226 Difference]: Without dead ends: 0 [2025-03-08 04:34:33,150 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 63 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2025-03-08 04:34:33,150 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 2 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 04:34:33,150 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 30 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 04:34:33,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-08 04:34:33,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-08 04:34:33,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:34:33,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-08 04:34:33,151 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 33 [2025-03-08 04:34:33,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:34:33,151 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-08 04:34:33,151 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:34:33,151 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-08 04:34:33,151 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-08 04:34:33,156 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 04:34:33,169 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-08 04:34:33,361 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-03-08 04:34:33,363 INFO L422 BasicCegarLoop]: Path program histogram: [3, 2, 2, 1, 1, 1, 1, 1, 1] [2025-03-08 04:34:33,365 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-08 04:34:33,573 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 04:34:33,578 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base [2025-03-08 04:34:33,579 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] [2025-03-08 04:34:33,579 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~s~0!base,]]] [2025-03-08 04:34:33,581 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~i~0 [2025-03-08 04:34:33,582 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base [2025-03-08 04:34:33,582 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] [2025-03-08 04:34:33,582 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~s~0!base,]]] [2025-03-08 04:34:33,582 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~s~0!base [2025-03-08 04:34:33,582 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~expected~0 [2025-03-08 04:34:33,582 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2025-03-08 04:34:33,582 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2025-03-08 04:34:33,582 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~s~0!base,]]],[IntegerLiteral[4]]]]] [2025-03-08 04:34:33,582 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2025-03-08 04:34:33,582 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2025-03-08 04:34:33,582 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~head!base,]]] [2025-03-08 04:34:33,582 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~len~0 [2025-03-08 04:34:33,582 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~s~0!offset [2025-03-08 04:34:33,582 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~i~0 [2025-03-08 04:34:33,582 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base [2025-03-08 04:34:33,582 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] [2025-03-08 04:34:33,582 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~s~0!base,]]] [2025-03-08 04:34:33,582 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2025-03-08 04:34:33,582 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2025-03-08 04:34:33,582 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~head!base,]]] [2025-03-08 04:34:33,582 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~expected~0 [2025-03-08 04:34:33,582 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base [2025-03-08 04:34:33,583 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] [2025-03-08 04:34:33,583 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~s~0!base,]]] [2025-03-08 04:34:33,583 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~s~0!base [2025-03-08 04:34:33,583 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2025-03-08 04:34:33,583 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2025-03-08 04:34:33,583 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~s~0!base,]]],[IntegerLiteral[4]]]]] [2025-03-08 04:34:33,583 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2025-03-08 04:34:33,583 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2025-03-08 04:34:33,583 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~s~0!base,]]] [2025-03-08 04:34:33,583 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~len~0 [2025-03-08 04:34:33,583 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~s~0!offset [2025-03-08 04:34:33,583 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2025-03-08 04:34:33,583 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2025-03-08 04:34:33,583 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~head!base,]]],[IntegerLiteral[4]]]]] [2025-03-08 04:34:33,583 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~head!offset [2025-03-08 04:34:33,583 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base [2025-03-08 04:34:33,583 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] [2025-03-08 04:34:33,583 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~s~0!base,]]] [2025-03-08 04:34:33,583 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~i~0 [2025-03-08 04:34:33,583 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base [2025-03-08 04:34:33,583 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] [2025-03-08 04:34:33,583 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~head!base,]]] [2025-03-08 04:34:33,583 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~head!base [2025-03-08 04:34:33,583 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base [2025-03-08 04:34:33,585 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] [2025-03-08 04:34:33,585 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~s~0!base,]]] [2025-03-08 04:34:33,585 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~s~0!base [2025-03-08 04:34:33,585 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~expected~0 [2025-03-08 04:34:33,586 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base [2025-03-08 04:34:33,586 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] [2025-03-08 04:34:33,586 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~head!base,]]] [2025-03-08 04:34:33,586 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2025-03-08 04:34:33,586 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2025-03-08 04:34:33,586 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~s~0!base,]]],[IntegerLiteral[4]]]]] [2025-03-08 04:34:33,586 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~len~0 [2025-03-08 04:34:33,586 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~s~0!offset [2025-03-08 04:34:33,588 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~head~0!offset [2025-03-08 04:34:33,589 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~head~0!base [2025-03-08 04:34:33,589 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2025-03-08 04:34:33,589 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2025-03-08 04:34:33,589 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2025-03-08 04:34:33,589 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2025-03-08 04:34:33,590 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base [2025-03-08 04:34:33,590 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] [2025-03-08 04:34:33,590 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~head~0!base,]]] [2025-03-08 04:34:33,590 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~head~0!base [2025-03-08 04:34:33,590 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base [2025-03-08 04:34:33,590 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] [2025-03-08 04:34:33,590 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~head~0!base,]]] [2025-03-08 04:34:33,590 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~head~0!offset [2025-03-08 04:34:33,590 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base [2025-03-08 04:34:33,590 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] [2025-03-08 04:34:33,591 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~s~0!base,]]] [2025-03-08 04:34:33,593 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base [2025-03-08 04:34:33,593 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] [2025-03-08 04:34:33,593 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~s~0!base,]]] [2025-03-08 04:34:33,593 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~s~0!base [2025-03-08 04:34:33,593 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2025-03-08 04:34:33,593 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2025-03-08 04:34:33,593 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~s~0!base,]]],[IntegerLiteral[4]]]]] [2025-03-08 04:34:33,593 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2025-03-08 04:34:33,593 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2025-03-08 04:34:33,593 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~s~0!base,]]] [2025-03-08 04:34:33,593 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~s~0!offset [2025-03-08 04:34:33,593 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base [2025-03-08 04:34:33,593 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] [2025-03-08 04:34:33,593 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~s~0!base,]]] [2025-03-08 04:34:33,593 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base [2025-03-08 04:34:33,593 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] [2025-03-08 04:34:33,593 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~s~0!base,]]] [2025-03-08 04:34:33,593 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~s~0!base [2025-03-08 04:34:33,593 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2025-03-08 04:34:33,593 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2025-03-08 04:34:33,594 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~s~0!base,]]] [2025-03-08 04:34:33,594 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~s~0!offset [2025-03-08 04:34:33,594 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base [2025-03-08 04:34:33,594 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] [2025-03-08 04:34:33,594 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~s~0!base,]]] [2025-03-08 04:34:33,594 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base [2025-03-08 04:34:33,594 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] [2025-03-08 04:34:33,594 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~s~0!base,]]] [2025-03-08 04:34:33,594 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~s~0!base [2025-03-08 04:34:33,594 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~s~0!offset [2025-03-08 04:34:33,595 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~s~0!base [2025-03-08 04:34:33,595 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~head!base [2025-03-08 04:34:33,595 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base [2025-03-08 04:34:33,595 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] [2025-03-08 04:34:33,595 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~s~0!base,]]] [2025-03-08 04:34:33,595 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~i~0 [2025-03-08 04:34:33,595 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~head!offset [2025-03-08 04:34:33,595 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base [2025-03-08 04:34:33,595 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] [2025-03-08 04:34:33,595 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~s~0!base,]]] [2025-03-08 04:34:33,595 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~s~0!base [2025-03-08 04:34:33,595 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2025-03-08 04:34:33,595 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2025-03-08 04:34:33,595 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~s~0!base,]]] [2025-03-08 04:34:33,595 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~len~0 [2025-03-08 04:34:33,595 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~s~0!offset [2025-03-08 04:34:33,595 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base [2025-03-08 04:34:33,595 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] [2025-03-08 04:34:33,595 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~s~0!base,]]] [2025-03-08 04:34:33,595 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~head!base [2025-03-08 04:34:33,595 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base [2025-03-08 04:34:33,595 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] [2025-03-08 04:34:33,595 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~s~0!base,]]] [2025-03-08 04:34:33,595 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~i~0 [2025-03-08 04:34:33,595 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base [2025-03-08 04:34:33,595 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] [2025-03-08 04:34:33,595 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~s~0!base,]]] [2025-03-08 04:34:33,598 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~s~0!base [2025-03-08 04:34:33,598 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2025-03-08 04:34:33,598 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2025-03-08 04:34:33,598 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~s~0!base,]]] [2025-03-08 04:34:33,598 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset [2025-03-08 04:34:33,598 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] [2025-03-08 04:34:33,598 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[IdentifierExpression[~s~0!base,]]] [2025-03-08 04:34:33,598 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~head!offset [2025-03-08 04:34:33,598 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~len~0 [2025-03-08 04:34:33,598 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~s~0!offset [2025-03-08 04:34:33,598 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~i~0 [2025-03-08 04:34:33,598 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~s~0!base [2025-03-08 04:34:33,598 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~head!base [2025-03-08 04:34:33,598 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base [2025-03-08 04:34:33,598 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] [2025-03-08 04:34:33,598 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~s~0!base,]]] [2025-03-08 04:34:33,598 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~head!offset [2025-03-08 04:34:33,598 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base [2025-03-08 04:34:33,598 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] [2025-03-08 04:34:33,598 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~s~0!base,]]] [2025-03-08 04:34:33,598 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~s~0!base [2025-03-08 04:34:33,598 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~len~0 [2025-03-08 04:34:33,598 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~s~0!offset [2025-03-08 04:34:33,599 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base [2025-03-08 04:34:33,599 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] [2025-03-08 04:34:33,599 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~s~0!base,]]] [2025-03-08 04:34:33,599 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base [2025-03-08 04:34:33,599 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] [2025-03-08 04:34:33,599 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~s~0!base,]]] [2025-03-08 04:34:33,599 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~s~0!base [2025-03-08 04:34:33,599 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2025-03-08 04:34:33,599 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2025-03-08 04:34:33,599 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~s~0!base,]]],[IntegerLiteral[4]]]]] [2025-03-08 04:34:33,599 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2025-03-08 04:34:33,599 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2025-03-08 04:34:33,599 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~s~0!base,]]] [2025-03-08 04:34:33,599 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~s~0!offset [2025-03-08 04:34:33,599 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base [2025-03-08 04:34:33,599 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] [2025-03-08 04:34:33,599 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~s~0!base,]]] [2025-03-08 04:34:33,600 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base [2025-03-08 04:34:33,600 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] [2025-03-08 04:34:33,600 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~s~0!base,]]] [2025-03-08 04:34:33,600 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~s~0!base [2025-03-08 04:34:33,600 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2025-03-08 04:34:33,600 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2025-03-08 04:34:33,600 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~s~0!base,]]],[IntegerLiteral[4]]]]] [2025-03-08 04:34:33,600 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~s~0!offset [2025-03-08 04:34:33,600 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 04:34:33 BoogieIcfgContainer [2025-03-08 04:34:33,601 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 04:34:33,601 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 04:34:33,601 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 04:34:33,601 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 04:34:33,602 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:34:20" (3/4) ... [2025-03-08 04:34:33,604 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-08 04:34:33,609 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure myexit [2025-03-08 04:34:33,613 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2025-03-08 04:34:33,614 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2025-03-08 04:34:33,614 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-08 04:34:33,614 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-08 04:34:33,682 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-08 04:34:33,682 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-08 04:34:33,682 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 04:34:33,683 INFO L158 Benchmark]: Toolchain (without parser) took 13565.63ms. Allocated memory was 142.6MB in the beginning and 419.4MB in the end (delta: 276.8MB). Free memory was 105.8MB in the beginning and 246.4MB in the end (delta: -140.6MB). Peak memory consumption was 136.6MB. Max. memory is 16.1GB. [2025-03-08 04:34:33,684 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 201.3MB. Free memory is still 116.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 04:34:33,684 INFO L158 Benchmark]: CACSL2BoogieTranslator took 380.35ms. Allocated memory is still 142.6MB. Free memory was 105.8MB in the beginning and 88.2MB in the end (delta: 17.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 04:34:33,684 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.17ms. Allocated memory is still 142.6MB. Free memory was 88.2MB in the beginning and 86.8MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 04:34:33,684 INFO L158 Benchmark]: Boogie Preprocessor took 40.68ms. Allocated memory is still 142.6MB. Free memory was 86.8MB in the beginning and 84.6MB in the end (delta: 2.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 04:34:33,685 INFO L158 Benchmark]: IcfgBuilder took 350.15ms. Allocated memory is still 142.6MB. Free memory was 84.6MB in the beginning and 68.7MB in the end (delta: 15.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 04:34:33,685 INFO L158 Benchmark]: TraceAbstraction took 12678.93ms. Allocated memory was 142.6MB in the beginning and 419.4MB in the end (delta: 276.8MB). Free memory was 68.5MB in the beginning and 250.7MB in the end (delta: -182.1MB). Peak memory consumption was 94.7MB. Max. memory is 16.1GB. [2025-03-08 04:34:33,685 INFO L158 Benchmark]: Witness Printer took 81.01ms. Allocated memory is still 419.4MB. Free memory was 250.7MB in the beginning and 246.4MB in the end (delta: 4.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 04:34:33,686 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23ms. Allocated memory is still 201.3MB. Free memory is still 116.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 380.35ms. Allocated memory is still 142.6MB. Free memory was 105.8MB in the beginning and 88.2MB in the end (delta: 17.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 29.17ms. Allocated memory is still 142.6MB. Free memory was 88.2MB in the beginning and 86.8MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 40.68ms. Allocated memory is still 142.6MB. Free memory was 86.8MB in the beginning and 84.6MB in the end (delta: 2.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 350.15ms. Allocated memory is still 142.6MB. Free memory was 84.6MB in the beginning and 68.7MB in the end (delta: 15.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 12678.93ms. Allocated memory was 142.6MB in the beginning and 419.4MB in the end (delta: 276.8MB). Free memory was 68.5MB in the beginning and 250.7MB in the end (delta: -182.1MB). Peak memory consumption was 94.7MB. Max. memory is 16.1GB. * Witness Printer took 81.01ms. Allocated memory is still 419.4MB. Free memory was 250.7MB in the beginning and 246.4MB in the end (delta: 4.3MB). 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: #memory_$Pointer$#1.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~s~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~i~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~s~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~s~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~expected~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~s~0!base,]]],[IntegerLiteral[4]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~head!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: ~i~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~s~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~head!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~expected~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.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#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~s~0!base,]]],[IntegerLiteral[4]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,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_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~head!base,]]],[IntegerLiteral[4]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~head!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~s~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~i~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~head!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~head!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~s~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~s~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~expected~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~head!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~s~0!base,]]],[IntegerLiteral[4]]]]] - 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: ~head~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~head~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: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~head~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~head~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~head~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~head~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~s~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.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#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~s~0!base,]]],[IntegerLiteral[4]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~s~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~s~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~s~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.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#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~s~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~s~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~s~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~s~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~s~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~s~0!offset - 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$#1.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~s~0!base,]]] - 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: #memory_$Pointer$#1.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.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#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,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$#1.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~s~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~head!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~s~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~i~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.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#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~s~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[IdentifierExpression[~s~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~head!offset - 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: ~i~0 - 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$#1.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~s~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~head!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~s~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~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$#1.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~s~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.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#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~s~0!base,]]],[IntegerLiteral[4]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~s~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~s~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~s~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.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#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~s~0!base,]]],[IntegerLiteral[4]]]]] - 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: 641]: 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, 26 locations, 35 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 12.4s, OverallIterations: 13, TraceHistogramMax: 3, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 2.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 398 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 398 mSDsluCounter, 1015 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 381 IncrementalHoareTripleChecker+Unchecked, 784 mSDsCounter, 46 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2480 IncrementalHoareTripleChecker+Invalid, 2907 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 46 mSolverCounterUnsat, 231 mSDtfsCounter, 2480 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 586 GetRequests, 378 SyntacticMatches, 16 SemanticMatches, 192 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 1950 ImplicationChecksByTransitivity, 3.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=50occurred in iteration=11, InterpolantAutomatonStates: 98, 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.5s SatisfiabilityAnalysisTime, 5.9s InterpolantComputationTime, 567 NumberOfCodeBlocks, 565 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 752 ConstructedInterpolants, 12 QuantifiedInterpolants, 3859 SizeOfPredicates, 30 NumberOfNonLiveVariables, 2328 ConjunctsInSsa, 198 ConjunctsInUnsatCore, 30 InterpolantComputations, 5 PerfectInterpolantSequences, 294/424 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: 611]: Location Invariant Derived location invariant: (((index <= 0) || (index == 0)) || (index == 1)) - InvariantResult [Line: 587]: Location Invariant Derived location invariant: ((((2 == len) && (len == 2)) || ((1 <= len) && (len == 2))) || (len == 2)) - InvariantResult [Line: 629]: Location Invariant Derived location invariant: ((((2 <= i) && (len == 2)) || ((i == 1) && (len == 2))) || ((i == 0) && (len == 2))) - InvariantResult [Line: 618]: Location Invariant Derived location invariant: ((((3 == data) && (index == 1)) || ((3 == data) && (index <= 0))) || ((index <= 0) && (2 == data))) - InvariantResult [Line: 633]: Location Invariant Derived location invariant: ((((i == 0) && (len == 2)) || ((2 <= i) && (len == 2))) || ((i == 1) && (len == 2))) RESULT: Ultimate proved your program to be correct! [2025-03-08 04:34:33,708 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