./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/list-simple/dll2c_remove_all_reverse.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version da043454 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/list-simple/dll2c_remove_all_reverse.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8d2a13c8ee01ce2939efe770c0c02e73e3e360ade7884d56be15c977b3caac01 --- Real Ultimate output --- This is Ultimate 0.3.0-wip.fs.system-includes-da04345-m [2025-04-29 10:54:57,729 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-29 10:54:57,778 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-04-29 10:54:57,784 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-29 10:54:57,784 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-29 10:54:57,806 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-29 10:54:57,807 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-29 10:54:57,807 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-29 10:54:57,807 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-29 10:54:57,807 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-29 10:54:57,808 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-29 10:54:57,808 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-29 10:54:57,808 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-29 10:54:57,808 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-29 10:54:57,809 INFO L153 SettingsManager]: * Use SBE=true [2025-04-29 10:54:57,809 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-29 10:54:57,809 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-29 10:54:57,809 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-29 10:54:57,809 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-29 10:54:57,809 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-29 10:54:57,809 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-29 10:54:57,810 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-29 10:54:57,810 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-29 10:54:57,810 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-29 10:54:57,810 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-29 10:54:57,810 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-29 10:54:57,810 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-29 10:54:57,810 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-29 10:54:57,810 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-29 10:54:57,810 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 10:54:57,810 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-29 10:54:57,811 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 10:54:57,811 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 10:54:57,811 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-29 10:54:57,811 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 10:54:57,811 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-29 10:54:57,811 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 10:54:57,811 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 10:54:57,811 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-29 10:54:57,811 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-29 10:54:57,811 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-29 10:54:57,811 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-29 10:54:57,811 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-29 10:54:57,811 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-29 10:54:57,812 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-29 10:54:57,812 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-29 10:54:57,812 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-29 10:54:57,812 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 -> 8d2a13c8ee01ce2939efe770c0c02e73e3e360ade7884d56be15c977b3caac01 [2025-04-29 10:54:58,013 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-29 10:54:58,018 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-29 10:54:58,019 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-29 10:54:58,020 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-29 10:54:58,020 INFO L274 PluginConnector]: CDTParser initialized [2025-04-29 10:54:58,021 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-simple/dll2c_remove_all_reverse.c [2025-04-29 10:54:59,278 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d8b37789/d43b98b4e4184c4f96993d3fbca3c6f6/FLAG36478d245 [2025-04-29 10:54:59,472 INFO L389 CDTParser]: Found 1 translation units. [2025-04-29 10:54:59,473 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-simple/dll2c_remove_all_reverse.c [2025-04-29 10:54:59,474 WARN L117 ultiparseSymbolTable]: System include assert.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 10:54:59,474 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 10:54:59,480 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d8b37789/d43b98b4e4184c4f96993d3fbca3c6f6/FLAG36478d245 [2025-04-29 10:55:00,279 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d8b37789/d43b98b4e4184c4f96993d3fbca3c6f6 [2025-04-29 10:55:00,281 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-29 10:55:00,282 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-29 10:55:00,283 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-29 10:55:00,283 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-29 10:55:00,287 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-29 10:55:00,287 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 10:55:00" (1/1) ... [2025-04-29 10:55:00,288 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@55dc61fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:55:00, skipping insertion in model container [2025-04-29 10:55:00,288 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 10:55:00" (1/1) ... [2025-04-29 10:55:00,300 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-29 10:55:00,453 WARN L117 LibraryModelHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/list-simple/dll2c_remove_all_reverse.c[1356,1369] [2025-04-29 10:55:00,461 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 10:55:00,472 INFO L200 MainTranslator]: Completed pre-run [2025-04-29 10:55:00,500 WARN L117 LibraryModelHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/list-simple/dll2c_remove_all_reverse.c[1356,1369] [2025-04-29 10:55:00,501 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 10:55:00,509 INFO L204 MainTranslator]: Completed translation [2025-04-29 10:55:00,510 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:55:00 WrapperNode [2025-04-29 10:55:00,510 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-29 10:55:00,511 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-29 10:55:00,511 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-29 10:55:00,511 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-29 10:55:00,514 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:55:00" (1/1) ... [2025-04-29 10:55:00,521 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:55:00" (1/1) ... [2025-04-29 10:55:00,536 INFO L138 Inliner]: procedures = 17, calls = 33, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 96 [2025-04-29 10:55:00,536 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-29 10:55:00,537 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-29 10:55:00,537 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-29 10:55:00,537 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-29 10:55:00,542 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:55:00" (1/1) ... [2025-04-29 10:55:00,542 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:55:00" (1/1) ... [2025-04-29 10:55:00,543 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:55:00" (1/1) ... [2025-04-29 10:55:00,559 INFO L175 MemorySlicer]: Split 19 memory accesses to 2 slices as follows [11, 8]. 58 percent of accesses are in the largest equivalence class. The 1 initializations are split as follows [0, 1]. The 10 writes are split as follows [9, 1]. [2025-04-29 10:55:00,560 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:55:00" (1/1) ... [2025-04-29 10:55:00,560 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:55:00" (1/1) ... [2025-04-29 10:55:00,566 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:55:00" (1/1) ... [2025-04-29 10:55:00,570 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:55:00" (1/1) ... [2025-04-29 10:55:00,572 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:55:00" (1/1) ... [2025-04-29 10:55:00,574 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:55:00" (1/1) ... [2025-04-29 10:55:00,574 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:55:00" (1/1) ... [2025-04-29 10:55:00,577 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-29 10:55:00,577 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-29 10:55:00,577 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-29 10:55:00,577 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-29 10:55:00,578 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:55:00" (1/1) ... [2025-04-29 10:55:00,582 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 10:55:00,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 10:55:00,602 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-29 10:55:00,608 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-29 10:55:00,623 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-04-29 10:55:00,624 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-04-29 10:55:00,624 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-04-29 10:55:00,624 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-04-29 10:55:00,624 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-04-29 10:55:00,624 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-04-29 10:55:00,624 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-04-29 10:55:00,624 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-29 10:55:00,624 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-29 10:55:00,624 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-29 10:55:00,624 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-29 10:55:00,624 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-29 10:55:00,624 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2025-04-29 10:55:00,625 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2025-04-29 10:55:00,625 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-04-29 10:55:00,681 INFO L234 CfgBuilder]: Building ICFG [2025-04-29 10:55:00,682 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-29 10:55:00,825 INFO L? ?]: Removed 36 outVars from TransFormulas that were not future-live. [2025-04-29 10:55:00,825 INFO L283 CfgBuilder]: Performing block encoding [2025-04-29 10:55:00,831 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-29 10:55:00,831 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-29 10:55:00,831 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 10:55:00 BoogieIcfgContainer [2025-04-29 10:55:00,834 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-29 10:55:00,835 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-29 10:55:00,835 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-29 10:55:00,838 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-29 10:55:00,838 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.04 10:55:00" (1/3) ... [2025-04-29 10:55:00,839 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24d5085a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 10:55:00, skipping insertion in model container [2025-04-29 10:55:00,839 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:55:00" (2/3) ... [2025-04-29 10:55:00,839 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24d5085a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 10:55:00, skipping insertion in model container [2025-04-29 10:55:00,839 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 10:55:00" (3/3) ... [2025-04-29 10:55:00,841 INFO L128 eAbstractionObserver]: Analyzing ICFG dll2c_remove_all_reverse.c [2025-04-29 10:55:00,851 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-29 10:55:00,852 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG dll2c_remove_all_reverse.c that has 2 procedures, 25 locations, 33 edges, 1 initial locations, 2 loop locations, and 1 error locations. [2025-04-29 10:55:00,892 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-29 10:55:00,903 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@533358ad, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-29 10:55:00,903 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-04-29 10:55:00,907 INFO L278 IsEmpty]: Start isEmpty. Operand has 25 states, 20 states have (on average 1.35) internal successors, (27), 21 states have internal predecessors, (27), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-04-29 10:55:00,911 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-04-29 10:55:00,911 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:55:00,911 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 10:55:00,911 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:55:00,914 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:55:00,915 INFO L85 PathProgramCache]: Analyzing trace with hash -380301731, now seen corresponding path program 1 times [2025-04-29 10:55:00,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:55:00,922 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742689343] [2025-04-29 10:55:00,922 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:55:00,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:55:00,991 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-29 10:55:01,025 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-29 10:55:01,025 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:55:01,025 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:55:01,179 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 10:55:01,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:55:01,179 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742689343] [2025-04-29 10:55:01,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [742689343] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 10:55:01,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 10:55:01,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 10:55:01,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021299558] [2025-04-29 10:55:01,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 10:55:01,184 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 10:55:01,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:55:01,196 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 10:55:01,196 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 10:55:01,198 INFO L87 Difference]: Start difference. First operand has 25 states, 20 states have (on average 1.35) internal successors, (27), 21 states have internal predecessors, (27), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-29 10:55:01,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 10:55:01,235 INFO L93 Difference]: Finished difference Result 40 states and 51 transitions. [2025-04-29 10:55:01,236 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 10:55:01,238 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2025-04-29 10:55:01,238 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 10:55:01,242 INFO L225 Difference]: With dead ends: 40 [2025-04-29 10:55:01,243 INFO L226 Difference]: Without dead ends: 26 [2025-04-29 10:55:01,245 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 10:55:01,248 INFO L437 NwaCegarLoop]: 28 mSDtfsCounter, 4 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 10:55:01,250 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 48 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 10:55:01,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2025-04-29 10:55:01,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 22. [2025-04-29 10:55:01,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 18 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-04-29 10:55:01,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2025-04-29 10:55:01,273 INFO L79 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 14 [2025-04-29 10:55:01,273 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 10:55:01,273 INFO L485 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2025-04-29 10:55:01,274 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-29 10:55:01,274 INFO L278 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2025-04-29 10:55:01,275 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-04-29 10:55:01,275 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:55:01,275 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 10:55:01,275 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-29 10:55:01,275 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:55:01,276 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:55:01,276 INFO L85 PathProgramCache]: Analyzing trace with hash -1879100559, now seen corresponding path program 1 times [2025-04-29 10:55:01,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:55:01,276 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087017314] [2025-04-29 10:55:01,276 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:55:01,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:55:01,311 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-29 10:55:01,323 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-29 10:55:01,324 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:55:01,324 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:55:01,542 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-29 10:55:01,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:55:01,542 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087017314] [2025-04-29 10:55:01,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087017314] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 10:55:01,542 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1518420948] [2025-04-29 10:55:01,542 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:55:01,542 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:55:01,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 10:55:01,546 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 10:55:01,548 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-04-29 10:55:01,615 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-29 10:55:01,656 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-29 10:55:01,657 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:55:01,657 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:55:01,659 INFO L256 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-04-29 10:55:01,662 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 10:55:01,721 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-29 10:55:01,721 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-29 10:55:01,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1518420948] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 10:55:01,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-29 10:55:01,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2025-04-29 10:55:01,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204997504] [2025-04-29 10:55:01,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 10:55:01,723 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 10:55:01,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:55:01,724 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 10:55:01,724 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-04-29 10:55:01,724 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-04-29 10:55:01,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 10:55:01,750 INFO L93 Difference]: Finished difference Result 28 states and 33 transitions. [2025-04-29 10:55:01,751 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-29 10:55:01,751 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2025-04-29 10:55:01,751 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 10:55:01,751 INFO L225 Difference]: With dead ends: 28 [2025-04-29 10:55:01,752 INFO L226 Difference]: Without dead ends: 25 [2025-04-29 10:55:01,752 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-04-29 10:55:01,753 INFO L437 NwaCegarLoop]: 22 mSDtfsCounter, 12 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 10:55:01,753 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 40 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 10:55:01,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2025-04-29 10:55:01,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 23. [2025-04-29 10:55:01,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 19 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-04-29 10:55:01,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2025-04-29 10:55:01,761 INFO L79 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 24 [2025-04-29 10:55:01,761 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 10:55:01,761 INFO L485 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2025-04-29 10:55:01,762 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-04-29 10:55:01,762 INFO L278 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2025-04-29 10:55:01,762 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-04-29 10:55:01,762 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:55:01,762 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 10:55:01,773 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-04-29 10:55:01,967 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:55:01,968 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:55:01,968 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:55:01,968 INFO L85 PathProgramCache]: Analyzing trace with hash 52774590, now seen corresponding path program 1 times [2025-04-29 10:55:01,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:55:01,968 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946467562] [2025-04-29 10:55:01,969 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:55:01,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:55:01,984 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-29 10:55:01,992 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-29 10:55:01,992 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:55:01,992 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:55:02,202 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-29 10:55:02,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:55:02,203 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946467562] [2025-04-29 10:55:02,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1946467562] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 10:55:02,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 10:55:02,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 10:55:02,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432003618] [2025-04-29 10:55:02,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 10:55:02,203 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 10:55:02,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:55:02,204 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 10:55:02,204 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-29 10:55:02,204 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-04-29 10:55:02,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 10:55:02,246 INFO L93 Difference]: Finished difference Result 29 states and 34 transitions. [2025-04-29 10:55:02,246 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 10:55:02,246 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 27 [2025-04-29 10:55:02,247 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 10:55:02,247 INFO L225 Difference]: With dead ends: 29 [2025-04-29 10:55:02,247 INFO L226 Difference]: Without dead ends: 23 [2025-04-29 10:55:02,247 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-29 10:55:02,248 INFO L437 NwaCegarLoop]: 22 mSDtfsCounter, 2 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 10:55:02,248 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 79 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 10:55:02,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2025-04-29 10:55:02,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2025-04-29 10:55:02,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 19 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-04-29 10:55:02,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2025-04-29 10:55:02,253 INFO L79 Accepts]: Start accepts. Automaton has 23 states and 26 transitions. Word has length 27 [2025-04-29 10:55:02,253 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 10:55:02,253 INFO L485 AbstractCegarLoop]: Abstraction has 23 states and 26 transitions. [2025-04-29 10:55:02,254 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-04-29 10:55:02,254 INFO L278 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2025-04-29 10:55:02,254 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-04-29 10:55:02,254 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:55:02,254 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 10:55:02,255 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-29 10:55:02,255 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:55:02,256 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:55:02,256 INFO L85 PathProgramCache]: Analyzing trace with hash 54621632, now seen corresponding path program 1 times [2025-04-29 10:55:02,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:55:02,256 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954828540] [2025-04-29 10:55:02,256 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:55:02,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:55:02,274 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-29 10:55:02,286 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-29 10:55:02,288 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:55:02,288 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:55:02,416 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-29 10:55:02,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:55:02,418 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954828540] [2025-04-29 10:55:02,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1954828540] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 10:55:02,418 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [687458612] [2025-04-29 10:55:02,418 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:55:02,418 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:55:02,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 10:55:02,423 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 10:55:02,425 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-04-29 10:55:02,497 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-29 10:55:02,535 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-29 10:55:02,535 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:55:02,535 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:55:02,536 INFO L256 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-29 10:55:02,539 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 10:55:02,593 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-29 10:55:02,594 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 10:55:02,645 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-29 10:55:02,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [687458612] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 10:55:02,649 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 10:55:02,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 9 [2025-04-29 10:55:02,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858639313] [2025-04-29 10:55:02,650 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 10:55:02,650 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-29 10:55:02,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:55:02,650 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-29 10:55:02,650 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-04-29 10:55:02,651 INFO L87 Difference]: Start difference. First operand 23 states and 26 transitions. Second operand has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-04-29 10:55:02,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 10:55:02,705 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2025-04-29 10:55:02,705 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-29 10:55:02,706 INFO L79 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 27 [2025-04-29 10:55:02,706 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 10:55:02,706 INFO L225 Difference]: With dead ends: 35 [2025-04-29 10:55:02,706 INFO L226 Difference]: Without dead ends: 32 [2025-04-29 10:55:02,707 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 49 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-04-29 10:55:02,707 INFO L437 NwaCegarLoop]: 19 mSDtfsCounter, 10 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 10:55:02,707 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 62 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 10:55:02,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2025-04-29 10:55:02,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 26. [2025-04-29 10:55:02,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 22 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-04-29 10:55:02,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2025-04-29 10:55:02,710 INFO L79 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 27 [2025-04-29 10:55:02,711 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 10:55:02,711 INFO L485 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2025-04-29 10:55:02,711 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-04-29 10:55:02,711 INFO L278 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2025-04-29 10:55:02,711 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-29 10:55:02,711 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:55:02,712 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 10:55:02,718 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-04-29 10:55:02,912 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2025-04-29 10:55:02,912 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:55:02,913 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:55:02,913 INFO L85 PathProgramCache]: Analyzing trace with hash -823927535, now seen corresponding path program 2 times [2025-04-29 10:55:02,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:55:02,913 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043002963] [2025-04-29 10:55:02,913 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 10:55:02,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:55:02,931 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-04-29 10:55:02,981 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-04-29 10:55:02,981 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-29 10:55:02,981 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:55:04,886 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 10:55:04,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:55:04,887 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043002963] [2025-04-29 10:55:04,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1043002963] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 10:55:04,887 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1430298718] [2025-04-29 10:55:04,887 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 10:55:04,887 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:55:04,887 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 10:55:04,889 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 10:55:04,891 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-04-29 10:55:04,980 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-04-29 10:55:05,480 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-04-29 10:55:05,481 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-29 10:55:05,481 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:55:05,485 INFO L256 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 121 conjuncts are in the unsatisfiable core [2025-04-29 10:55:05,490 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 10:55:05,527 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-04-29 10:55:05,642 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 15 [2025-04-29 10:55:05,679 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-29 10:55:05,679 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-04-29 10:55:05,750 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2025-04-29 10:55:05,816 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2025-04-29 10:55:05,828 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-04-29 10:55:05,984 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 39 [2025-04-29 10:55:06,004 INFO L325 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2025-04-29 10:55:06,004 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 81 treesize of output 39 [2025-04-29 10:55:06,253 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 141 [2025-04-29 10:55:06,269 INFO L325 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2025-04-29 10:55:06,269 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 268 treesize of output 104 [2025-04-29 10:55:06,277 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 94 treesize of output 33 [2025-04-29 10:55:06,291 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 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 30 treesize of output 37 [2025-04-29 10:55:06,404 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 10:55:06,404 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 91 treesize of output 38 [2025-04-29 10:55:06,410 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 13 [2025-04-29 10:55:06,453 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 10:55:06,454 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 10:55:06,656 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse3 (select |c_#memory_$Pointer$#0.offset| .cse1)) (.cse7 (select |c_#memory_$Pointer$#0.base| .cse1)) (.cse4 (+ .cse0 4))) (let ((.cse8 (select .cse7 .cse4)) (.cse9 (+ (select .cse3 .cse4) 4))) (let ((.cse5 (select (select |c_#memory_$Pointer$#0.offset| .cse8) .cse9)) (.cse2 (select (select |c_#memory_$Pointer$#0.base| .cse8) .cse9))) (and (forall ((v_ArrVal_541 (Array Int Int))) (= .cse0 (select (select (store (store |c_#memory_$Pointer$#0.offset| .cse1 v_ArrVal_541) .cse2 (store (select (store |c_#memory_$Pointer$#0.offset| .cse1 (store .cse3 .cse4 .cse5)) .cse2) .cse5 .cse0)) .cse1) .cse4))) (= .cse1 (select (select (let ((.cse6 (store |c_#memory_$Pointer$#0.base| .cse1 (store .cse7 .cse4 .cse2)))) (store .cse6 .cse2 (store (select .cse6 .cse2) .cse5 .cse1))) .cse1) .cse4))))))) is different from false [2025-04-29 10:55:06,664 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 455 treesize of output 335 [2025-04-29 10:55:06,668 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 339 treesize of output 235 [2025-04-29 10:55:06,675 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_dll_circular_create_#res#1.base|)) (.cse5 (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base|)) (.cse2 (+ 4 |c_ULTIMATE.start_dll_circular_create_#res#1.offset|))) (let ((.cse6 (select .cse5 .cse2)) (.cse7 (+ (select .cse1 .cse2) 4))) (let ((.cse3 (select (select |c_#memory_$Pointer$#0.offset| .cse6) .cse7)) (.cse0 (select (select |c_#memory_$Pointer$#0.base| .cse6) .cse7))) (and (forall ((v_ArrVal_541 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_dll_circular_create_#res#1.base| v_ArrVal_541) .cse0 (store (select (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_dll_circular_create_#res#1.base| (store .cse1 .cse2 .cse3)) .cse0) .cse3 |c_ULTIMATE.start_dll_circular_create_#res#1.offset|)) |c_ULTIMATE.start_dll_circular_create_#res#1.base|) .cse2) |c_ULTIMATE.start_dll_circular_create_#res#1.offset|)) (= |c_ULTIMATE.start_dll_circular_create_#res#1.base| (select (select (let ((.cse4 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base| (store .cse5 .cse2 .cse0)))) (store .cse4 .cse0 (store (select .cse4 .cse0) .cse3 |c_ULTIMATE.start_dll_circular_create_#res#1.base|))) |c_ULTIMATE.start_dll_circular_create_#res#1.base|) .cse2)))))) is different from false [2025-04-29 10:55:07,132 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 295 treesize of output 277 [2025-04-29 10:55:07,150 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 993 treesize of output 981 [2025-04-29 10:55:07,300 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 10:55:07,301 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 17 [2025-04-29 10:55:07,304 INFO L354 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 17 treesize of output 9 [2025-04-29 10:55:07,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1430298718] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 10:55:07,376 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-29 10:55:07,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 19] total 30 [2025-04-29 10:55:07,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661004001] [2025-04-29 10:55:07,376 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-29 10:55:07,376 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-04-29 10:55:07,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:55:07,377 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-04-29 10:55:07,377 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=1269, Unknown=11, NotChecked=146, Total=1560 [2025-04-29 10:55:07,378 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand has 30 states, 29 states have (on average 1.3448275862068966) internal successors, (39), 25 states have internal predecessors, (39), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-04-29 10:55:07,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 10:55:07,922 INFO L93 Difference]: Finished difference Result 44 states and 51 transitions. [2025-04-29 10:55:07,922 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-29 10:55:07,923 INFO L79 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 1.3448275862068966) internal successors, (39), 25 states have internal predecessors, (39), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 30 [2025-04-29 10:55:07,923 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 10:55:07,924 INFO L225 Difference]: With dead ends: 44 [2025-04-29 10:55:07,924 INFO L226 Difference]: Without dead ends: 32 [2025-04-29 10:55:07,925 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 225 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=162, Invalid=1556, Unknown=12, NotChecked=162, Total=1892 [2025-04-29 10:55:07,925 INFO L437 NwaCegarLoop]: 13 mSDtfsCounter, 16 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 430 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 433 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 430 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-29 10:55:07,925 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 203 Invalid, 433 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 430 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-29 10:55:07,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2025-04-29 10:55:07,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2025-04-29 10:55:07,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 26 states have internal predecessors, (30), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-04-29 10:55:07,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 36 transitions. [2025-04-29 10:55:07,931 INFO L79 Accepts]: Start accepts. Automaton has 31 states and 36 transitions. Word has length 30 [2025-04-29 10:55:07,931 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 10:55:07,931 INFO L485 AbstractCegarLoop]: Abstraction has 31 states and 36 transitions. [2025-04-29 10:55:07,931 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 1.3448275862068966) internal successors, (39), 25 states have internal predecessors, (39), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-04-29 10:55:07,932 INFO L278 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2025-04-29 10:55:07,932 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-29 10:55:07,932 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:55:07,932 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 10:55:07,940 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-04-29 10:55:08,133 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:55:08,133 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:55:08,134 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:55:08,134 INFO L85 PathProgramCache]: Analyzing trace with hash -1410733549, now seen corresponding path program 1 times [2025-04-29 10:55:08,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:55:08,134 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992142553] [2025-04-29 10:55:08,134 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:55:08,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:55:08,147 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-04-29 10:55:08,151 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-04-29 10:55:08,151 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:55:08,151 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:55:08,194 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-29 10:55:08,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:55:08,194 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992142553] [2025-04-29 10:55:08,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [992142553] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 10:55:08,194 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [813410939] [2025-04-29 10:55:08,194 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:55:08,194 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:55:08,195 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 10:55:08,196 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 10:55:08,198 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-04-29 10:55:08,278 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-04-29 10:55:08,308 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-04-29 10:55:08,308 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:55:08,308 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:55:08,310 INFO L256 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-29 10:55:08,311 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 10:55:08,322 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-29 10:55:08,323 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 10:55:08,342 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-29 10:55:08,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [813410939] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 10:55:08,343 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 10:55:08,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 6 [2025-04-29 10:55:08,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491156817] [2025-04-29 10:55:08,343 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 10:55:08,343 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 10:55:08,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:55:08,344 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 10:55:08,344 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-29 10:55:08,344 INFO L87 Difference]: Start difference. First operand 31 states and 36 transitions. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-04-29 10:55:08,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 10:55:08,375 INFO L93 Difference]: Finished difference Result 52 states and 59 transitions. [2025-04-29 10:55:08,375 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 10:55:08,375 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 30 [2025-04-29 10:55:08,375 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 10:55:08,376 INFO L225 Difference]: With dead ends: 52 [2025-04-29 10:55:08,376 INFO L226 Difference]: Without dead ends: 31 [2025-04-29 10:55:08,376 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-29 10:55:08,376 INFO L437 NwaCegarLoop]: 19 mSDtfsCounter, 0 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 10:55:08,376 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 85 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 10:55:08,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2025-04-29 10:55:08,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2025-04-29 10:55:08,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 26 states have internal predecessors, (29), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-04-29 10:55:08,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2025-04-29 10:55:08,380 INFO L79 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 30 [2025-04-29 10:55:08,380 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 10:55:08,380 INFO L485 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2025-04-29 10:55:08,380 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-04-29 10:55:08,381 INFO L278 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2025-04-29 10:55:08,381 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-29 10:55:08,381 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:55:08,381 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 10:55:08,388 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-04-29 10:55:08,582 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:55:08,582 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:55:08,582 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:55:08,582 INFO L85 PathProgramCache]: Analyzing trace with hash -1142334939, now seen corresponding path program 3 times [2025-04-29 10:55:08,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:55:08,582 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557283791] [2025-04-29 10:55:08,582 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-29 10:55:08,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:55:08,601 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 40 statements into 3 equivalence classes. [2025-04-29 10:55:08,610 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 29 of 40 statements. [2025-04-29 10:55:08,610 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-29 10:55:08,610 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:55:08,666 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-04-29 10:55:08,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:55:08,666 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557283791] [2025-04-29 10:55:08,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1557283791] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 10:55:08,666 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1241527939] [2025-04-29 10:55:08,666 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-29 10:55:08,666 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:55:08,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 10:55:08,668 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 10:55:08,670 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-04-29 10:55:08,751 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 40 statements into 3 equivalence classes. [2025-04-29 10:55:08,865 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 29 of 40 statements. [2025-04-29 10:55:08,865 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-29 10:55:08,865 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:55:08,867 INFO L256 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-29 10:55:08,868 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 10:55:08,894 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-29 10:55:08,895 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-29 10:55:08,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1241527939] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 10:55:08,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-29 10:55:08,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-04-29 10:55:08,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120645406] [2025-04-29 10:55:08,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 10:55:08,895 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 10:55:08,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:55:08,895 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 10:55:08,895 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-04-29 10:55:08,895 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-04-29 10:55:08,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 10:55:08,908 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2025-04-29 10:55:08,908 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-29 10:55:08,908 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 40 [2025-04-29 10:55:08,908 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 10:55:08,908 INFO L225 Difference]: With dead ends: 36 [2025-04-29 10:55:08,908 INFO L226 Difference]: Without dead ends: 0 [2025-04-29 10:55:08,909 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-04-29 10:55:08,909 INFO L437 NwaCegarLoop]: 13 mSDtfsCounter, 0 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 10:55:08,909 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 30 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 10:55:08,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-04-29 10:55:08,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-04-29 10:55:08,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 10:55:08,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-04-29 10:55:08,909 INFO L79 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 40 [2025-04-29 10:55:08,909 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 10:55:08,910 INFO L485 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-29 10:55:08,910 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-04-29 10:55:08,910 INFO L278 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-04-29 10:55:08,910 INFO L284 IsEmpty]: Finished isEmpty. No accepting run. [2025-04-29 10:55:08,913 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-04-29 10:55:08,921 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-04-29 10:55:09,114 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:55:09,116 INFO L422 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1] [2025-04-29 10:55:09,117 INFO L312 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-04-29 10:55:09,209 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-29 10:55:09,218 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset [2025-04-29 10:55:09,219 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] [2025-04-29 10:55:09,219 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[IdentifierExpression[~#s~0!base,]]] [2025-04-29 10:55:09,221 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base [2025-04-29 10:55:09,221 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] [2025-04-29 10:55:09,221 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]] [2025-04-29 10:55:09,221 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#0.base [2025-04-29 10:55:09,221 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#0.base,GLOBAL] [2025-04-29 10:55:09,221 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#0.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IntegerLiteral[0]]]]] [2025-04-29 10:55:09,222 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base [2025-04-29 10:55:09,222 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] [2025-04-29 10:55:09,222 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]] [2025-04-29 10:55:09,222 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#0.base [2025-04-29 10:55:09,222 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#0.base,GLOBAL] [2025-04-29 10:55:09,222 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#0.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#0.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IntegerLiteral[0]]]]],[IntegerLiteral[4]]]]] [2025-04-29 10:55:09,222 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#0.offset [2025-04-29 10:55:09,222 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#0.offset,GLOBAL] [2025-04-29 10:55:09,222 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#0.offset,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#0.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IntegerLiteral[0]]]]],[IntegerLiteral[4]]]]] [2025-04-29 10:55:09,222 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#0.offset [2025-04-29 10:55:09,222 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#0.offset,GLOBAL] [2025-04-29 10:55:09,222 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#0.offset,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IntegerLiteral[0]]]]] [2025-04-29 10:55:09,222 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#0.offset [2025-04-29 10:55:09,222 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#0.offset,GLOBAL] [2025-04-29 10:55:09,223 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#0.offset,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IntegerLiteral[0]]]]] [2025-04-29 10:55:09,223 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#s~0!offset [2025-04-29 10:55:09,223 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset [2025-04-29 10:55:09,223 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] [2025-04-29 10:55:09,223 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[IdentifierExpression[~#s~0!base,]]] [2025-04-29 10:55:09,223 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base [2025-04-29 10:55:09,223 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] [2025-04-29 10:55:09,223 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]] [2025-04-29 10:55:09,223 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset [2025-04-29 10:55:09,223 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] [2025-04-29 10:55:09,223 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[IdentifierExpression[~#s~0!base,]]] [2025-04-29 10:55:09,223 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base [2025-04-29 10:55:09,223 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] [2025-04-29 10:55:09,224 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]] [2025-04-29 10:55:09,224 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#0.base [2025-04-29 10:55:09,224 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#0.base,GLOBAL] [2025-04-29 10:55:09,224 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#0.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#0.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IntegerLiteral[0]]]]],[IntegerLiteral[4]]]]] [2025-04-29 10:55:09,224 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#0.offset [2025-04-29 10:55:09,224 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#0.offset,GLOBAL] [2025-04-29 10:55:09,224 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#0.offset,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#0.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IntegerLiteral[0]]]]],[IntegerLiteral[4]]]]] [2025-04-29 10:55:09,224 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#0.offset [2025-04-29 10:55:09,224 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#0.offset,GLOBAL] [2025-04-29 10:55:09,225 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#0.offset,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#0.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IntegerLiteral[0]]]]],[IntegerLiteral[4]]]]] [2025-04-29 10:55:09,225 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2025-04-29 10:55:09,225 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#s~0!offset [2025-04-29 10:55:09,225 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base [2025-04-29 10:55:09,225 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] [2025-04-29 10:55:09,225 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]] [2025-04-29 10:55:09,225 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#0.base [2025-04-29 10:55:09,225 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#0.base,GLOBAL] [2025-04-29 10:55:09,225 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#0.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IntegerLiteral[0]]]]] [2025-04-29 10:55:09,232 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~last~0!base [2025-04-29 10:55:09,233 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#0.base [2025-04-29 10:55:09,233 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#0.base,GLOBAL] [2025-04-29 10:55:09,233 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#0.base,GLOBAL],[IdentifierExpression[~last~0!base,]]] [2025-04-29 10:55:09,234 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~head~0!base [2025-04-29 10:55:09,234 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#0.base [2025-04-29 10:55:09,234 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#0.base,GLOBAL] [2025-04-29 10:55:09,234 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#0.base,GLOBAL],[IdentifierExpression[~last~0!base,]]] [2025-04-29 10:55:09,234 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~head~0!offset [2025-04-29 10:55:09,234 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#0.offset [2025-04-29 10:55:09,234 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#0.offset,GLOBAL] [2025-04-29 10:55:09,234 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#0.offset,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#0.base,GLOBAL],[IdentifierExpression[~last~0!base,]]],[IntegerLiteral[4]]]]] [2025-04-29 10:55:09,234 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#0.offset [2025-04-29 10:55:09,234 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#0.offset,GLOBAL] [2025-04-29 10:55:09,234 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#0.offset,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#0.base,GLOBAL],[IdentifierExpression[~last~0!base,]]],[IntegerLiteral[4]]]]] [2025-04-29 10:55:09,235 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#0.offset [2025-04-29 10:55:09,235 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#0.offset,GLOBAL] [2025-04-29 10:55:09,235 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#0.offset,GLOBAL],[IdentifierExpression[~last~0!base,]]] [2025-04-29 10:55:09,235 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#s~0!offset [2025-04-29 10:55:09,235 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~last~0!offset [2025-04-29 10:55:09,235 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~head~0!offset [2025-04-29 10:55:09,235 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2025-04-29 10:55:09,235 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2025-04-29 10:55:09,235 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#s~0!offset [2025-04-29 10:55:09,235 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~last~0!offset [2025-04-29 10:55:09,235 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~head~0!base [2025-04-29 10:55:09,235 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~head~0!base [2025-04-29 10:55:09,235 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~last~0!base [2025-04-29 10:55:09,235 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.04 10:55:09 BoogieIcfgContainer [2025-04-29 10:55:09,235 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-29 10:55:09,236 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-04-29 10:55:09,236 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-04-29 10:55:09,236 INFO L274 PluginConnector]: Witness Printer initialized [2025-04-29 10:55:09,237 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 10:55:00" (3/4) ... [2025-04-29 10:55:09,238 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-04-29 10:55:09,243 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure node_create [2025-04-29 10:55:09,246 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2025-04-29 10:55:09,246 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-04-29 10:55:09,247 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2025-04-29 10:55:09,247 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-04-29 10:55:09,307 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-04-29 10:55:09,308 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-04-29 10:55:09,308 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-04-29 10:55:09,309 INFO L158 Benchmark]: Toolchain (without parser) took 9026.34ms. Allocated memory was 142.6MB in the beginning and 453.0MB in the end (delta: 310.4MB). Free memory was 114.9MB in the beginning and 172.9MB in the end (delta: -57.9MB). Peak memory consumption was 252.9MB. Max. memory is 16.1GB. [2025-04-29 10:55:09,310 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 201.3MB. Free memory is still 125.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-04-29 10:55:09,310 INFO L158 Benchmark]: CACSL2BoogieTranslator took 227.47ms. Allocated memory is still 142.6MB. Free memory was 114.9MB in the beginning and 100.8MB in the end (delta: 14.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-04-29 10:55:09,310 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.74ms. Allocated memory is still 142.6MB. Free memory was 100.8MB in the beginning and 98.7MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-29 10:55:09,311 INFO L158 Benchmark]: Boogie Preprocessor took 40.02ms. Allocated memory is still 142.6MB. Free memory was 98.7MB in the beginning and 96.7MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-29 10:55:09,311 INFO L158 Benchmark]: RCFGBuilder took 256.66ms. Allocated memory is still 142.6MB. Free memory was 96.7MB in the beginning and 82.0MB in the end (delta: 14.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-04-29 10:55:09,311 INFO L158 Benchmark]: TraceAbstraction took 8400.32ms. Allocated memory was 142.6MB in the beginning and 453.0MB in the end (delta: 310.4MB). Free memory was 80.9MB in the beginning and 181.1MB in the end (delta: -100.1MB). Peak memory consumption was 210.9MB. Max. memory is 16.1GB. [2025-04-29 10:55:09,311 INFO L158 Benchmark]: Witness Printer took 71.95ms. Allocated memory is still 453.0MB. Free memory was 181.1MB in the beginning and 172.9MB in the end (delta: 8.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-04-29 10:55:09,312 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.22ms. Allocated memory is still 201.3MB. Free memory is still 125.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 227.47ms. Allocated memory is still 142.6MB. Free memory was 114.9MB in the beginning and 100.8MB in the end (delta: 14.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 25.74ms. Allocated memory is still 142.6MB. Free memory was 100.8MB in the beginning and 98.7MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 40.02ms. Allocated memory is still 142.6MB. Free memory was 98.7MB in the beginning and 96.7MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 256.66ms. Allocated memory is still 142.6MB. Free memory was 96.7MB in the beginning and 82.0MB in the end (delta: 14.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 8400.32ms. Allocated memory was 142.6MB in the beginning and 453.0MB in the end (delta: 310.4MB). Free memory was 80.9MB in the beginning and 181.1MB in the end (delta: -100.1MB). Peak memory consumption was 210.9MB. Max. memory is 16.1GB. * Witness Printer took 71.95ms. Allocated memory is still 453.0MB. Free memory was 181.1MB in the beginning and 172.9MB in the end (delta: 8.2MB). 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.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: #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$#0.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#0.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#0.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IntegerLiteral[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_$Pointer$#0.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#0.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#0.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#0.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IntegerLiteral[0]]]]],[IntegerLiteral[4]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#0.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#0.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#0.offset,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#0.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IntegerLiteral[0]]]]],[IntegerLiteral[4]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#0.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#0.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#0.offset,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IntegerLiteral[0]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#0.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#0.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#0.offset,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IntegerLiteral[0]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#s~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#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: #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.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: #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$#0.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#0.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#0.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#0.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IntegerLiteral[0]]]]],[IntegerLiteral[4]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#0.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#0.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#0.offset,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#0.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IntegerLiteral[0]]]]],[IntegerLiteral[4]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#0.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#0.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#0.offset,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#0.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IntegerLiteral[0]]]]],[IntegerLiteral[4]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - 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$#0.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#0.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#0.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IntegerLiteral[0]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~last~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#0.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#0.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#0.base,GLOBAL],[IdentifierExpression[~last~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~head~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#0.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#0.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#0.base,GLOBAL],[IdentifierExpression[~last~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~head~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#0.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#0.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#0.offset,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#0.base,GLOBAL],[IdentifierExpression[~last~0!base,]]],[IntegerLiteral[4]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#0.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#0.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#0.offset,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#0.base,GLOBAL],[IdentifierExpression[~last~0!base,]]],[IntegerLiteral[4]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#0.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#0.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#0.offset,GLOBAL],[IdentifierExpression[~last~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#s~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~last~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~head~0!offset - 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: ~#s~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~last~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~head~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~head~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~last~0!base * 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: 73]: 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, 25 locations, 33 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 8.2s, OverallIterations: 7, TraceHistogramMax: 3, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 46 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 44 mSDsluCounter, 547 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 411 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 540 IncrementalHoareTripleChecker+Invalid, 544 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 136 mSDtfsCounter, 540 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 271 GetRequests, 202 SyntacticMatches, 2 SemanticMatches, 67 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 246 ImplicationChecksByTransitivity, 1.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=31occurred in iteration=5, InterpolantAutomatonStates: 47, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 13 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 4.8s InterpolantComputationTime, 343 NumberOfCodeBlocks, 321 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 386 ConstructedInterpolants, 2 QuantifiedInterpolants, 2195 SizeOfPredicates, 6 NumberOfNonLiveVariables, 1493 ConjunctsInSsa, 142 ConjunctsInUnsatCore, 14 InterpolantComputations, 4 PerfectInterpolantSequences, 117/149 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: 66]: Loop Invariant Derived loop invariant: ((((2 <= len) && (i == 0)) || (2 <= len)) || ((2 <= len) && (i <= 1))) - InvariantResult [Line: 34]: Loop Invariant Derived loop invariant: (((2 <= len) && (len <= 1)) || ((2 == len) && (len == 2))) RESULT: Ultimate proved your program to be correct! [2025-04-29 10:55:09,340 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE