./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/list-simple/sll2c_append_unequal.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version da043454 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/list-simple/sll2c_append_unequal.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 98ff5087a5355b31513a18909e5f9a48fd67959ddcb8a9d1463072561bc9a856 --- Real Ultimate output --- This is Ultimate 0.3.0-wip.fs.system-includes-da04345-m [2025-04-29 10:56:00,084 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-29 10:56:00,131 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-04-29 10:56:00,137 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-29 10:56:00,137 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-29 10:56:00,151 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-29 10:56:00,152 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-29 10:56:00,152 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-29 10:56:00,152 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-29 10:56:00,152 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-29 10:56:00,152 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-29 10:56:00,152 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-29 10:56:00,153 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-29 10:56:00,153 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-29 10:56:00,153 INFO L153 SettingsManager]: * Use SBE=true [2025-04-29 10:56:00,153 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-29 10:56:00,153 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-29 10:56:00,153 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-29 10:56:00,153 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-29 10:56:00,153 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-29 10:56:00,153 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-29 10:56:00,153 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-29 10:56:00,155 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-29 10:56:00,155 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-29 10:56:00,155 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-29 10:56:00,155 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-29 10:56:00,155 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-29 10:56:00,155 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-29 10:56:00,155 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-29 10:56:00,156 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 10:56:00,156 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-29 10:56:00,156 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 10:56:00,156 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 10:56:00,156 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-29 10:56:00,156 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 10:56:00,156 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-29 10:56:00,156 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 10:56:00,156 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 10:56:00,156 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-29 10:56:00,156 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-29 10:56:00,156 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-29 10:56:00,156 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-29 10:56:00,156 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-29 10:56:00,156 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-29 10:56:00,156 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-29 10:56:00,156 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-29 10:56:00,156 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-29 10:56:00,156 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 -> 98ff5087a5355b31513a18909e5f9a48fd67959ddcb8a9d1463072561bc9a856 [2025-04-29 10:56:00,376 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-29 10:56:00,384 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-29 10:56:00,386 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-29 10:56:00,387 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-29 10:56:00,388 INFO L274 PluginConnector]: CDTParser initialized [2025-04-29 10:56:00,389 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-simple/sll2c_append_unequal.c [2025-04-29 10:56:01,700 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ab00244e/3327b34d477144dcae00a3a8880c3dd3/FLAG38619bb93 [2025-04-29 10:56:01,939 INFO L389 CDTParser]: Found 1 translation units. [2025-04-29 10:56:01,939 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-simple/sll2c_append_unequal.c [2025-04-29 10:56:01,941 WARN L117 ultiparseSymbolTable]: System include assert.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 10:56:01,941 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 10:56:01,946 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ab00244e/3327b34d477144dcae00a3a8880c3dd3/FLAG38619bb93 [2025-04-29 10:56:02,750 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ab00244e/3327b34d477144dcae00a3a8880c3dd3 [2025-04-29 10:56:02,752 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-29 10:56:02,753 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-29 10:56:02,754 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-29 10:56:02,754 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-29 10:56:02,756 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-29 10:56:02,757 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 10:56:02" (1/1) ... [2025-04-29 10:56:02,757 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a6ab36e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:56:02, skipping insertion in model container [2025-04-29 10:56:02,758 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 10:56:02" (1/1) ... [2025-04-29 10:56:02,767 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-29 10:56:02,898 WARN L117 LibraryModelHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/list-simple/sll2c_append_unequal.c[1768,1781] [2025-04-29 10:56:02,900 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 10:56:02,906 INFO L200 MainTranslator]: Completed pre-run [2025-04-29 10:56:02,929 WARN L117 LibraryModelHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/list-simple/sll2c_append_unequal.c[1768,1781] [2025-04-29 10:56:02,931 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 10:56:02,939 INFO L204 MainTranslator]: Completed translation [2025-04-29 10:56:02,940 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:56:02 WrapperNode [2025-04-29 10:56:02,940 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-29 10:56:02,941 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-29 10:56:02,941 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-29 10:56:02,941 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-29 10:56:02,945 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:56:02" (1/1) ... [2025-04-29 10:56:02,956 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:56:02" (1/1) ... [2025-04-29 10:56:02,975 INFO L138 Inliner]: procedures = 18, calls = 42, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 148 [2025-04-29 10:56:02,975 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-29 10:56:02,976 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-29 10:56:02,976 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-29 10:56:02,976 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-29 10:56:02,982 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:56:02" (1/1) ... [2025-04-29 10:56:02,982 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:56:02" (1/1) ... [2025-04-29 10:56:02,984 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:56:02" (1/1) ... [2025-04-29 10:56:02,996 INFO L175 MemorySlicer]: Split 26 memory accesses to 2 slices as follows [16, 10]. 62 percent of accesses are in the largest equivalence class. The 1 initializations are split as follows [0, 1]. The 8 writes are split as follows [7, 1]. [2025-04-29 10:56:02,997 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:56:02" (1/1) ... [2025-04-29 10:56:02,997 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:56:02" (1/1) ... [2025-04-29 10:56:03,001 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:56:02" (1/1) ... [2025-04-29 10:56:03,002 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:56:02" (1/1) ... [2025-04-29 10:56:03,004 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:56:02" (1/1) ... [2025-04-29 10:56:03,005 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:56:02" (1/1) ... [2025-04-29 10:56:03,005 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:56:02" (1/1) ... [2025-04-29 10:56:03,008 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-29 10:56:03,008 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-29 10:56:03,008 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-29 10:56:03,009 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-29 10:56:03,009 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:56:02" (1/1) ... [2025-04-29 10:56:03,012 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 10:56:03,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 10:56:03,029 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-29 10:56:03,031 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-29 10:56:03,047 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-04-29 10:56:03,047 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-04-29 10:56:03,047 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-04-29 10:56:03,048 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-04-29 10:56:03,048 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-04-29 10:56:03,048 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-04-29 10:56:03,048 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-04-29 10:56:03,048 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-29 10:56:03,048 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-29 10:56:03,048 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-29 10:56:03,048 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-29 10:56:03,048 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-29 10:56:03,049 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-29 10:56:03,049 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-29 10:56:03,049 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2025-04-29 10:56:03,049 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2025-04-29 10:56:03,049 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-04-29 10:56:03,127 INFO L234 CfgBuilder]: Building ICFG [2025-04-29 10:56:03,128 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-29 10:56:03,314 INFO L? ?]: Removed 49 outVars from TransFormulas that were not future-live. [2025-04-29 10:56:03,314 INFO L283 CfgBuilder]: Performing block encoding [2025-04-29 10:56:03,324 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-29 10:56:03,327 INFO L312 CfgBuilder]: Removed 3 assume(true) statements. [2025-04-29 10:56:03,327 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 10:56:03 BoogieIcfgContainer [2025-04-29 10:56:03,327 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-29 10:56:03,329 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-29 10:56:03,330 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-29 10:56:03,333 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-29 10:56:03,333 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.04 10:56:02" (1/3) ... [2025-04-29 10:56:03,333 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b80c801 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 10:56:03, skipping insertion in model container [2025-04-29 10:56:03,333 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:56:02" (2/3) ... [2025-04-29 10:56:03,334 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b80c801 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 10:56:03, skipping insertion in model container [2025-04-29 10:56:03,335 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 10:56:03" (3/3) ... [2025-04-29 10:56:03,336 INFO L128 eAbstractionObserver]: Analyzing ICFG sll2c_append_unequal.c [2025-04-29 10:56:03,345 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-29 10:56:03,346 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG sll2c_append_unequal.c that has 2 procedures, 39 locations, 57 edges, 1 initial locations, 5 loop locations, and 1 error locations. [2025-04-29 10:56:03,379 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-29 10:56:03,387 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;@771c7a4f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-29 10:56:03,387 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-04-29 10:56:03,390 INFO L278 IsEmpty]: Start isEmpty. Operand has 39 states, 33 states have (on average 1.4545454545454546) internal successors, (48), 34 states have internal predecessors, (48), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-04-29 10:56:03,395 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-04-29 10:56:03,395 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:56:03,395 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:56:03,396 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:56:03,399 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:56:03,399 INFO L85 PathProgramCache]: Analyzing trace with hash -1737730359, now seen corresponding path program 1 times [2025-04-29 10:56:03,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:56:03,404 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146007271] [2025-04-29 10:56:03,404 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:56:03,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:56:03,463 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-29 10:56:03,505 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-29 10:56:03,507 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:56:03,508 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:56:03,583 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-29 10:56:03,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:56:03,584 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146007271] [2025-04-29 10:56:03,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2146007271] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 10:56:03,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 10:56:03,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 10:56:03,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423475044] [2025-04-29 10:56:03,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 10:56:03,589 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-29 10:56:03,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:56:03,601 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-29 10:56:03,601 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-29 10:56:03,602 INFO L87 Difference]: Start difference. First operand has 39 states, 33 states have (on average 1.4545454545454546) internal successors, (48), 34 states have internal predecessors, (48), 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) Second operand has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 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:56:03,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 10:56:03,616 INFO L93 Difference]: Finished difference Result 58 states and 81 transitions. [2025-04-29 10:56:03,616 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-29 10:56:03,617 INFO L79 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 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:56:03,617 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 10:56:03,621 INFO L225 Difference]: With dead ends: 58 [2025-04-29 10:56:03,621 INFO L226 Difference]: Without dead ends: 32 [2025-04-29 10:56:03,623 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-29 10:56:03,626 INFO L437 NwaCegarLoop]: 50 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 10:56:03,627 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 10:56:03,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2025-04-29 10:56:03,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2025-04-29 10:56:03,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 27 states have internal predecessors, (34), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-04-29 10:56:03,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 40 transitions. [2025-04-29 10:56:03,649 INFO L79 Accepts]: Start accepts. Automaton has 32 states and 40 transitions. Word has length 24 [2025-04-29 10:56:03,649 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 10:56:03,650 INFO L485 AbstractCegarLoop]: Abstraction has 32 states and 40 transitions. [2025-04-29 10:56:03,650 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 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:56:03,650 INFO L278 IsEmpty]: Start isEmpty. Operand 32 states and 40 transitions. [2025-04-29 10:56:03,651 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-29 10:56:03,651 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:56:03,651 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 10:56:03,651 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-29 10:56:03,651 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:56:03,652 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:56:03,652 INFO L85 PathProgramCache]: Analyzing trace with hash 1956379767, now seen corresponding path program 1 times [2025-04-29 10:56:03,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:56:03,652 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753510611] [2025-04-29 10:56:03,652 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:56:03,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:56:03,683 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-29 10:56:03,703 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-29 10:56:03,706 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:56:03,706 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:56:03,866 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-29 10:56:03,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:56:03,867 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753510611] [2025-04-29 10:56:03,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1753510611] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 10:56:03,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 10:56:03,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 10:56:03,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544091447] [2025-04-29 10:56:03,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 10:56:03,868 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 10:56:03,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:56:03,868 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 10:56:03,868 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 10:56:03,869 INFO L87 Difference]: Start difference. First operand 32 states and 40 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-04-29 10:56:03,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 10:56:03,888 INFO L93 Difference]: Finished difference Result 58 states and 72 transitions. [2025-04-29 10:56:03,889 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 10:56:03,889 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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) Word has length 25 [2025-04-29 10:56:03,889 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 10:56:03,889 INFO L225 Difference]: With dead ends: 58 [2025-04-29 10:56:03,889 INFO L226 Difference]: Without dead ends: 33 [2025-04-29 10:56:03,890 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 10:56:03,890 INFO L437 NwaCegarLoop]: 38 mSDtfsCounter, 1 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 10:56:03,890 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 70 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 10:56:03,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2025-04-29 10:56:03,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2025-04-29 10:56:03,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 28 states have (on average 1.25) internal successors, (35), 28 states have internal predecessors, (35), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-04-29 10:56:03,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 41 transitions. [2025-04-29 10:56:03,894 INFO L79 Accepts]: Start accepts. Automaton has 33 states and 41 transitions. Word has length 25 [2025-04-29 10:56:03,894 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 10:56:03,894 INFO L485 AbstractCegarLoop]: Abstraction has 33 states and 41 transitions. [2025-04-29 10:56:03,894 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-04-29 10:56:03,895 INFO L278 IsEmpty]: Start isEmpty. Operand 33 states and 41 transitions. [2025-04-29 10:56:03,895 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-04-29 10:56:03,895 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:56:03,895 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 10:56:03,895 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-29 10:56:03,895 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:56:03,896 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:56:03,896 INFO L85 PathProgramCache]: Analyzing trace with hash -120734529, now seen corresponding path program 1 times [2025-04-29 10:56:03,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:56:03,896 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476100083] [2025-04-29 10:56:03,896 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:56:03,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:56:03,925 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-04-29 10:56:03,945 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-04-29 10:56:03,946 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:56:03,946 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:56:04,263 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-04-29 10:56:04,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:56:04,263 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476100083] [2025-04-29 10:56:04,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1476100083] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 10:56:04,263 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [105440251] [2025-04-29 10:56:04,263 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:56:04,263 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:56:04,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 10:56:04,267 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 10:56:04,268 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-04-29 10:56:04,355 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-04-29 10:56:04,410 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-04-29 10:56:04,410 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:56:04,410 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:56:04,414 INFO L256 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 90 conjuncts are in the unsatisfiable core [2025-04-29 10:56:04,423 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 10:56:04,464 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-04-29 10:56:04,632 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 13 treesize of output 9 [2025-04-29 10:56:04,710 INFO L325 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-04-29 10:56:04,710 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 2 case distinctions, treesize of input 17 treesize of output 21 [2025-04-29 10:56:04,766 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2025-04-29 10:56:04,833 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-04-29 10:56:04,956 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 3 [2025-04-29 10:56:04,963 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 15 treesize of output 7 [2025-04-29 10:56:05,124 INFO L325 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2025-04-29 10:56:05,125 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 29 [2025-04-29 10:56:05,134 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2025-04-29 10:56:05,162 INFO L325 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2025-04-29 10:56:05,162 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2025-04-29 10:56:05,328 INFO L325 Elim1Store]: treesize reduction 67, result has 29.5 percent of original size [2025-04-29 10:56:05,329 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 64 treesize of output 56 [2025-04-29 10:56:05,336 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2025-04-29 10:56:05,342 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 21 [2025-04-29 10:56:05,415 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 10:56:05,415 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 37 [2025-04-29 10:56:05,423 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 21 treesize of output 13 [2025-04-29 10:56:05,500 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 10:56:05,501 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 10:56:05,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [105440251] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 10:56:05,827 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-29 10:56:05,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 22] total 29 [2025-04-29 10:56:05,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065324023] [2025-04-29 10:56:05,827 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-29 10:56:05,828 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-04-29 10:56:05,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:56:05,829 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-04-29 10:56:05,829 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=1100, Unknown=0, NotChecked=0, Total=1190 [2025-04-29 10:56:05,831 INFO L87 Difference]: Start difference. First operand 33 states and 41 transitions. Second operand has 29 states, 27 states have (on average 1.7777777777777777) internal successors, (48), 23 states have internal predecessors, (48), 5 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2025-04-29 10:56:06,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 10:56:06,453 INFO L93 Difference]: Finished difference Result 52 states and 63 transitions. [2025-04-29 10:56:06,453 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-04-29 10:56:06,453 INFO L79 Accepts]: Start accepts. Automaton has has 29 states, 27 states have (on average 1.7777777777777777) internal successors, (48), 23 states have internal predecessors, (48), 5 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 33 [2025-04-29 10:56:06,454 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 10:56:06,454 INFO L225 Difference]: With dead ends: 52 [2025-04-29 10:56:06,454 INFO L226 Difference]: Without dead ends: 40 [2025-04-29 10:56:06,455 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 252 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=155, Invalid=1737, Unknown=0, NotChecked=0, Total=1892 [2025-04-29 10:56:06,456 INFO L437 NwaCegarLoop]: 28 mSDtfsCounter, 21 mSDsluCounter, 449 mSDsCounter, 0 mSdLazyCounter, 456 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 477 SdHoareTripleChecker+Invalid, 460 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 456 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-29 10:56:06,456 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 477 Invalid, 460 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 456 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-29 10:56:06,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2025-04-29 10:56:06,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 38. [2025-04-29 10:56:06,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 32 states have (on average 1.1875) internal successors, (38), 32 states have internal predecessors, (38), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-04-29 10:56:06,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 44 transitions. [2025-04-29 10:56:06,463 INFO L79 Accepts]: Start accepts. Automaton has 38 states and 44 transitions. Word has length 33 [2025-04-29 10:56:06,463 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 10:56:06,463 INFO L485 AbstractCegarLoop]: Abstraction has 38 states and 44 transitions. [2025-04-29 10:56:06,464 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 27 states have (on average 1.7777777777777777) internal successors, (48), 23 states have internal predecessors, (48), 5 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2025-04-29 10:56:06,464 INFO L278 IsEmpty]: Start isEmpty. Operand 38 states and 44 transitions. [2025-04-29 10:56:06,464 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-04-29 10:56:06,464 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:56:06,464 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 10:56:06,471 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:56:06,668 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:56:06,669 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:56:06,669 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:56:06,669 INFO L85 PathProgramCache]: Analyzing trace with hash -1400022720, now seen corresponding path program 1 times [2025-04-29 10:56:06,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:56:06,669 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735890655] [2025-04-29 10:56:06,669 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:56:06,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:56:06,686 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-04-29 10:56:06,703 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-04-29 10:56:06,706 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:56:06,706 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:56:07,295 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 10:56:07,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:56:07,296 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735890655] [2025-04-29 10:56:07,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735890655] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 10:56:07,296 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1441571479] [2025-04-29 10:56:07,296 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:56:07,296 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:56:07,296 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 10:56:07,298 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 10:56:07,299 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-04-29 10:56:07,373 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-04-29 10:56:07,409 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-04-29 10:56:07,409 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:56:07,410 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:56:07,412 INFO L256 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 72 conjuncts are in the unsatisfiable core [2025-04-29 10:56:07,414 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 10:56:07,417 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-04-29 10:56:07,515 INFO L325 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-04-29 10:56:07,515 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-04-29 10:56:07,545 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-04-29 10:56:07,583 INFO L325 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-04-29 10:56:07,584 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2025-04-29 10:56:07,635 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 14 [2025-04-29 10:56:07,638 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 15 treesize of output 7 [2025-04-29 10:56:07,713 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 10:56:07,714 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 35 [2025-04-29 10:56:07,724 INFO L325 Elim1Store]: treesize reduction 8, result has 75.8 percent of original size [2025-04-29 10:56:07,725 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 34 [2025-04-29 10:56:07,938 INFO L325 Elim1Store]: treesize reduction 59, result has 38.5 percent of original size [2025-04-29 10:56:07,939 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 76 treesize of output 75 [2025-04-29 10:56:07,943 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 34 [2025-04-29 10:56:07,961 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 28 treesize of output 20 [2025-04-29 10:56:07,996 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 35 treesize of output 19 [2025-04-29 10:56:07,998 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 16 treesize of output 8 [2025-04-29 10:56:07,999 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 10:56:07,999 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 10:56:08,285 WARN L849 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_sll_circular_append_~head#1.offset| Int) (|v_ULTIMATE.start_sll_circular_append_#t~ret6#1.base_14| Int) (v_ArrVal_360 (Array Int Int)) (|ULTIMATE.start_sll_circular_append_~last~1#1.offset| Int) (|ULTIMATE.start_sll_circular_append_~head#1.base| Int) (v_ArrVal_363 (Array Int Int)) (v_ArrVal_358 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |ULTIMATE.start_sll_circular_append_~head#1.base|) |ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse1 (select (store |c_#memory_$Pointer$#0.base| |v_ULTIMATE.start_sll_circular_append_#t~ret6#1.base_14| v_ArrVal_363) .cse0))) (or (not (= .cse0 (select .cse1 |ULTIMATE.start_sll_circular_append_~last~1#1.offset|))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret6#1.base_14|) 0)) (not (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select (store (store |c_#memory_$Pointer$#0.base| .cse0 (store .cse1 |ULTIMATE.start_sll_circular_append_~last~1#1.offset| v_ArrVal_358)) |v_ULTIMATE.start_sll_circular_append_#t~ret6#1.base_14| v_ArrVal_360) .cse2) (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse2))))))) is different from false [2025-04-29 10:56:08,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1441571479] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 10:56:08,286 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-29 10:56:08,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 24] total 34 [2025-04-29 10:56:08,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627881013] [2025-04-29 10:56:08,286 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-29 10:56:08,287 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-04-29 10:56:08,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:56:08,287 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-04-29 10:56:08,288 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=1350, Unknown=24, NotChecked=74, Total=1560 [2025-04-29 10:56:08,288 INFO L87 Difference]: Start difference. First operand 38 states and 44 transitions. Second operand has 34 states, 32 states have (on average 1.5625) internal successors, (50), 27 states have internal predecessors, (50), 4 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2025-04-29 10:56:08,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 10:56:08,988 INFO L93 Difference]: Finished difference Result 86 states and 106 transitions. [2025-04-29 10:56:08,988 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-04-29 10:56:08,988 INFO L79 Accepts]: Start accepts. Automaton has has 34 states, 32 states have (on average 1.5625) internal successors, (50), 27 states have internal predecessors, (50), 4 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 36 [2025-04-29 10:56:08,988 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 10:56:08,989 INFO L225 Difference]: With dead ends: 86 [2025-04-29 10:56:08,989 INFO L226 Difference]: Without dead ends: 73 [2025-04-29 10:56:08,990 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 474 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=220, Invalid=2516, Unknown=24, NotChecked=102, Total=2862 [2025-04-29 10:56:08,991 INFO L437 NwaCegarLoop]: 22 mSDtfsCounter, 72 mSDsluCounter, 462 mSDsCounter, 0 mSdLazyCounter, 753 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 484 SdHoareTripleChecker+Invalid, 766 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 753 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-29 10:56:08,991 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 484 Invalid, 766 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 753 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-29 10:56:08,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2025-04-29 10:56:08,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 56. [2025-04-29 10:56:08,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 48 states have (on average 1.1875) internal successors, (57), 48 states have internal predecessors, (57), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-04-29 10:56:08,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 67 transitions. [2025-04-29 10:56:08,997 INFO L79 Accepts]: Start accepts. Automaton has 56 states and 67 transitions. Word has length 36 [2025-04-29 10:56:08,997 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 10:56:08,997 INFO L485 AbstractCegarLoop]: Abstraction has 56 states and 67 transitions. [2025-04-29 10:56:08,997 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 32 states have (on average 1.5625) internal successors, (50), 27 states have internal predecessors, (50), 4 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2025-04-29 10:56:08,997 INFO L278 IsEmpty]: Start isEmpty. Operand 56 states and 67 transitions. [2025-04-29 10:56:08,998 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-04-29 10:56:08,998 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:56:08,998 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 10:56:09,004 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-04-29 10:56:09,198 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2025-04-29 10:56:09,199 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:56:09,199 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:56:09,199 INFO L85 PathProgramCache]: Analyzing trace with hash -508174851, now seen corresponding path program 1 times [2025-04-29 10:56:09,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:56:09,199 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755708938] [2025-04-29 10:56:09,199 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:56:09,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:56:09,210 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-04-29 10:56:09,223 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-04-29 10:56:09,223 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:56:09,223 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:56:10,870 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 11 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 10:56:10,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:56:10,870 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755708938] [2025-04-29 10:56:10,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1755708938] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 10:56:10,870 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1129182570] [2025-04-29 10:56:10,870 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:56:10,870 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:56:10,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 10:56:10,872 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 10:56:10,873 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-04-29 10:56:10,936 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-04-29 10:56:11,025 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-04-29 10:56:11,026 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:56:11,026 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:56:11,028 INFO L256 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 137 conjuncts are in the unsatisfiable core [2025-04-29 10:56:11,032 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 10:56:11,057 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-04-29 10:56:11,169 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-04-29 10:56:11,219 INFO L325 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-04-29 10:56:11,219 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-04-29 10:56:11,266 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-04-29 10:56:11,270 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-04-29 10:56:11,325 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-04-29 10:56:11,328 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-04-29 10:56:11,448 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 15 treesize of output 7 [2025-04-29 10:56:11,450 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 11 treesize of output 3 [2025-04-29 10:56:11,453 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 11 treesize of output 3 [2025-04-29 10:56:11,585 INFO L325 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2025-04-29 10:56:11,585 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 23 [2025-04-29 10:56:11,602 INFO L325 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2025-04-29 10:56:11,602 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 23 [2025-04-29 10:56:11,617 INFO L325 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2025-04-29 10:56:11,617 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2025-04-29 10:56:11,862 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 15 treesize of output 3 [2025-04-29 10:56:12,002 INFO L325 Elim1Store]: treesize reduction 21, result has 47.5 percent of original size [2025-04-29 10:56:12,003 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 38 [2025-04-29 10:56:12,009 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2025-04-29 10:56:12,029 INFO L325 Elim1Store]: treesize reduction 20, result has 60.0 percent of original size [2025-04-29 10:56:12,029 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 2 case distinctions, treesize of input 39 treesize of output 47 [2025-04-29 10:56:12,038 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 12 treesize of output 1 [2025-04-29 10:56:12,048 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 11 [2025-04-29 10:56:12,055 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 30 treesize of output 23 [2025-04-29 10:56:12,105 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 26 treesize of output 14 [2025-04-29 10:56:12,240 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 10:56:12,240 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 10:56:12,330 WARN L849 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_505 (Array Int Int)) (v_ArrVal_500 (Array Int Int))) (or (= (select (select (store (store |c_#memory_int#0| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| v_ArrVal_505) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_500) (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)) |c_ULTIMATE.start_main_~data~0#1|) (not (= v_ArrVal_505 (store (select |c_#memory_int#0| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| (select v_ArrVal_505 |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|)))))) is different from false [2025-04-29 10:56:12,347 WARN L849 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_505 (Array Int Int)) (v_ArrVal_500 (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|))) (or (not (= v_ArrVal_505 (let ((.cse1 (select (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|))) (store (select |c_#memory_int#0| .cse0) .cse1 (select v_ArrVal_505 .cse1))))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#0| .cse0 v_ArrVal_505) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_500) (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)))))) is different from false [2025-04-29 10:56:12,360 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 51 treesize of output 43 [2025-04-29 10:56:12,366 WARN L849 $PredicateComparison]: unable to prove that (forall ((v_arrayElimCell_60 Int) (v_ArrVal_505 (Array Int Int)) (v_ArrVal_500 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#0| v_arrayElimCell_60 v_ArrVal_505) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_500) (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (not (= v_ArrVal_505 (let ((.cse0 (select (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|))) (store (select |c_#memory_int#0| v_arrayElimCell_60) .cse0 (select v_ArrVal_505 .cse0))))))) is different from false [2025-04-29 10:56:12,373 WARN L849 $PredicateComparison]: unable to prove that (forall ((v_arrayElimCell_60 Int) (v_ArrVal_505 (Array Int Int)) (v_ArrVal_500 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#0| v_arrayElimCell_60 v_ArrVal_505) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_500) (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (not (= v_ArrVal_505 (let ((.cse0 (select (select |c_#memory_$Pointer$#0.offset| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))) (store (select |c_#memory_int#0| v_arrayElimCell_60) .cse0 (select v_ArrVal_505 .cse0))))))) is different from false [2025-04-29 10:56:12,385 WARN L849 $PredicateComparison]: unable to prove that (forall ((v_arrayElimCell_60 Int) (v_ArrVal_505 (Array Int Int)) (v_ArrVal_500 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#0| v_arrayElimCell_60 v_ArrVal_505) |c_ULTIMATE.start_sll_circular_append_#t~ret6#1.base| v_ArrVal_500) (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (not (= v_ArrVal_505 (let ((.cse0 (select (select |c_#memory_$Pointer$#0.offset| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))) (store (select |c_#memory_int#0| v_arrayElimCell_60) .cse0 (select v_ArrVal_505 .cse0))))))) is different from false [2025-04-29 10:56:12,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1129182570] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 10:56:12,474 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-29 10:56:12,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 25] total 43 [2025-04-29 10:56:12,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041673169] [2025-04-29 10:56:12,474 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-29 10:56:12,475 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2025-04-29 10:56:12,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:56:12,475 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2025-04-29 10:56:12,476 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=2042, Unknown=5, NotChecked=470, Total=2652 [2025-04-29 10:56:12,476 INFO L87 Difference]: Start difference. First operand 56 states and 67 transitions. Second operand has 43 states, 40 states have (on average 1.65) internal successors, (66), 36 states have internal predecessors, (66), 5 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2025-04-29 10:56:14,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 10:56:14,297 INFO L93 Difference]: Finished difference Result 124 states and 150 transitions. [2025-04-29 10:56:14,297 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2025-04-29 10:56:14,297 INFO L79 Accepts]: Start accepts. Automaton has has 43 states, 40 states have (on average 1.65) internal successors, (66), 36 states have internal predecessors, (66), 5 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 42 [2025-04-29 10:56:14,297 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 10:56:14,298 INFO L225 Difference]: With dead ends: 124 [2025-04-29 10:56:14,298 INFO L226 Difference]: Without dead ends: 116 [2025-04-29 10:56:14,299 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 1044 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=405, Invalid=5160, Unknown=5, NotChecked=750, Total=6320 [2025-04-29 10:56:14,300 INFO L437 NwaCegarLoop]: 31 mSDtfsCounter, 110 mSDsluCounter, 732 mSDsCounter, 0 mSdLazyCounter, 1343 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 763 SdHoareTripleChecker+Invalid, 1349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-29 10:56:14,300 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 763 Invalid, 1349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1343 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-29 10:56:14,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2025-04-29 10:56:14,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 80. [2025-04-29 10:56:14,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 72 states have (on average 1.1805555555555556) internal successors, (85), 72 states have internal predecessors, (85), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-04-29 10:56:14,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 95 transitions. [2025-04-29 10:56:14,311 INFO L79 Accepts]: Start accepts. Automaton has 80 states and 95 transitions. Word has length 42 [2025-04-29 10:56:14,311 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 10:56:14,311 INFO L485 AbstractCegarLoop]: Abstraction has 80 states and 95 transitions. [2025-04-29 10:56:14,312 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 40 states have (on average 1.65) internal successors, (66), 36 states have internal predecessors, (66), 5 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2025-04-29 10:56:14,312 INFO L278 IsEmpty]: Start isEmpty. Operand 80 states and 95 transitions. [2025-04-29 10:56:14,312 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-04-29 10:56:14,313 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:56:14,315 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 10:56:14,324 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-04-29 10:56:14,517 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:56:14,518 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:56:14,518 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:56:14,518 INFO L85 PathProgramCache]: Analyzing trace with hash -469183648, now seen corresponding path program 2 times [2025-04-29 10:56:14,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:56:14,518 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015667515] [2025-04-29 10:56:14,518 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 10:56:14,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:56:14,529 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 45 statements into 2 equivalence classes. [2025-04-29 10:56:14,545 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 45 of 45 statements. [2025-04-29 10:56:14,545 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-29 10:56:14,545 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:56:17,898 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 7 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 10:56:17,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:56:17,899 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015667515] [2025-04-29 10:56:17,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2015667515] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 10:56:17,899 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [577615984] [2025-04-29 10:56:17,899 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 10:56:17,899 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:56:17,899 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 10:56:17,900 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 10:56:17,902 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-04-29 10:56:17,966 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 45 statements into 2 equivalence classes. [2025-04-29 10:56:18,184 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 45 of 45 statements. [2025-04-29 10:56:18,184 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-29 10:56:18,184 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:56:18,187 INFO L256 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 168 conjuncts are in the unsatisfiable core [2025-04-29 10:56:18,194 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 10:56:18,225 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-04-29 10:56:18,380 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-04-29 10:56:18,439 INFO L325 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-04-29 10:56:18,439 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-04-29 10:56:18,502 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-04-29 10:56:18,509 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-04-29 10:56:18,558 INFO L325 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-04-29 10:56:18,559 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2025-04-29 10:56:18,561 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2025-04-29 10:56:18,654 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2025-04-29 10:56:18,657 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2025-04-29 10:56:18,659 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 15 treesize of output 7 [2025-04-29 10:56:18,752 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-04-29 10:56:18,819 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 10:56:18,820 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 27 [2025-04-29 10:56:18,830 INFO L325 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2025-04-29 10:56:18,830 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2025-04-29 10:56:18,839 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2025-04-29 10:56:19,556 INFO L325 Elim1Store]: treesize reduction 39, result has 39.1 percent of original size [2025-04-29 10:56:19,556 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 4 new quantified variables, introduced 2 case distinctions, treesize of input 186 treesize of output 140 [2025-04-29 10:56:19,560 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 160 treesize of output 125 [2025-04-29 10:56:19,582 INFO L325 Elim1Store]: treesize reduction 68, result has 38.7 percent of original size [2025-04-29 10:56:19,583 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 2 case distinctions, treesize of input 124 treesize of output 91 [2025-04-29 10:56:19,591 INFO L325 Elim1Store]: treesize reduction 28, result has 3.4 percent of original size [2025-04-29 10:56:19,592 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 63 treesize of output 58 [2025-04-29 10:56:19,610 INFO L325 Elim1Store]: treesize reduction 20, result has 60.0 percent of original size [2025-04-29 10:56:19,610 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 47 [2025-04-29 10:56:19,656 INFO L325 Elim1Store]: treesize reduction 65, result has 35.0 percent of original size [2025-04-29 10:56:19,657 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 39 [2025-04-29 10:56:19,684 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 136 treesize of output 210 [2025-04-29 10:56:19,713 INFO L325 Elim1Store]: treesize reduction 71, result has 1.4 percent of original size [2025-04-29 10:56:19,714 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 101 treesize of output 15 [2025-04-29 10:56:19,730 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 118 treesize of output 87 [2025-04-29 10:56:19,735 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 54 [2025-04-29 10:56:19,740 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2025-04-29 10:56:19,744 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 7 [2025-04-29 10:56:20,088 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 141 treesize of output 85 [2025-04-29 10:56:20,093 INFO L325 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2025-04-29 10:56:20,094 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 79 treesize of output 54 [2025-04-29 10:56:20,099 INFO L325 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2025-04-29 10:56:20,099 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 31 [2025-04-29 10:56:20,249 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 7 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 10:56:20,250 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 10:56:20,543 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse0 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_ArrVal_657 (Array Int Int)) (v_ArrVal_658 Int) (v_ArrVal_654 (Array Int Int))) (let ((.cse1 (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| (store (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_654)) (.cse5 (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| (store (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| v_ArrVal_658)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_657))) (let ((.cse2 (select (select .cse5 .cse4) .cse0)) (.cse3 (select (select .cse1 .cse4) .cse0))) (or (not (= .cse0 (select (select .cse1 .cse2) .cse3))) (not (= .cse4 (select (select .cse5 .cse2) .cse3))))))) (forall ((v_ArrVal_652 (Array Int Int)) (v_ArrVal_653 (Array Int Int))) (or (not (= v_ArrVal_653 (store (select |c_#memory_int#0| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| (select v_ArrVal_653 |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#0| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| v_ArrVal_653) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_652) .cse4) (+ .cse0 4))))))) is different from false [2025-04-29 10:56:20,819 WARN L849 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_657 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_append_~last~1#1.base_22| Int) (v_ArrVal_658 Int) (v_ArrVal_652 (Array Int Int)) (v_ArrVal_654 (Array Int Int)) (v_ArrVal_653 (Array Int Int))) (let ((.cse0 (select |c_#memory_$Pointer$#0.base| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_22|)) (.cse1 (select (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|))) (let ((.cse3 (store (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_22| (store (select |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_22|) .cse1 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_654)) (.cse7 (store (store |c_#memory_$Pointer$#0.base| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_22| (store .cse0 .cse1 v_ArrVal_658)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_657)) (.cse6 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse4 (select (select .cse7 .cse6) .cse2)) (.cse5 (select (select .cse3 .cse6) .cse2))) (or (not (= (select .cse0 .cse1) (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (not (= .cse2 (select (select .cse3 .cse4) .cse5))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#0| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_22| v_ArrVal_653) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_652) .cse6) (+ .cse2 4))) (not (= .cse6 (select (select .cse7 .cse4) .cse5))) (not (= (store (select |c_#memory_int#0| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_22|) .cse1 (select v_ArrVal_653 .cse1)) v_ArrVal_653))))))) is different from false [2025-04-29 10:56:20,890 WARN L849 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_657 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_append_~last~1#1.base_22| Int) (v_ArrVal_658 Int) (v_ArrVal_652 (Array Int Int)) (v_ArrVal_654 (Array Int Int)) (v_ArrVal_653 (Array Int Int))) (let ((.cse6 (select |c_#memory_$Pointer$#0.base| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_22|)) (.cse7 (select (select |c_#memory_$Pointer$#0.offset| (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|)) (select (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|)))) (let ((.cse5 (store (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_22| (store (select |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_22|) .cse7 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_654)) (.cse2 (store (store |c_#memory_$Pointer$#0.base| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_22| (store .cse6 .cse7 v_ArrVal_658)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_657)) (.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse3 (select (select .cse2 .cse0) .cse1)) (.cse4 (select (select .cse5 .cse0) .cse1))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#0| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_22| v_ArrVal_653) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_652) .cse0) (+ .cse1 4))) (not (= (select (select .cse2 .cse3) .cse4) .cse0)) (not (= (select (select .cse5 .cse3) .cse4) .cse1)) (not (= (select .cse6 .cse7) (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (not (= v_ArrVal_653 (store (select |c_#memory_int#0| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_22|) .cse7 (select v_ArrVal_653 .cse7))))))))) is different from false [2025-04-29 10:56:20,934 WARN L849 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_657 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_append_~last~1#1.base_22| Int) (v_ArrVal_652 (Array Int Int)) (v_ArrVal_658 Int) (v_ArrVal_654 (Array Int Int)) (v_ArrVal_653 (Array Int Int))) (let ((.cse6 (select |c_#memory_$Pointer$#0.base| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_22|)) (.cse7 (select (select |c_#memory_$Pointer$#0.offset| (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|)) (select (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|)))) (let ((.cse5 (store (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_22| (store (select |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_22|) .cse7 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_654)) (.cse2 (store (store |c_#memory_$Pointer$#0.base| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_22| (store .cse6 .cse7 v_ArrVal_658)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_657)) (.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse3 (select (select .cse2 .cse0) .cse1)) (.cse4 (select (select .cse5 .cse0) .cse1))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#0| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_22| v_ArrVal_653) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_652) .cse0) (+ .cse1 4))) (not (= (select (select .cse2 .cse3) .cse4) .cse0)) (not (= (select (select .cse5 .cse3) .cse4) .cse1)) (not (= (select .cse6 .cse7) (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (not (= v_ArrVal_653 (store (select |c_#memory_int#0| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_22|) .cse7 (select v_ArrVal_653 .cse7))))))))) is different from false [2025-04-29 10:56:20,955 WARN L849 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_657 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_append_~last~1#1.base_22| Int) (v_ArrVal_658 Int) (v_ArrVal_652 (Array Int Int)) (v_ArrVal_654 (Array Int Int)) (v_ArrVal_653 (Array Int Int))) (let ((.cse8 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse7 (select |c_#memory_$Pointer$#0.base| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_22|)) (.cse6 (let ((.cse9 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (select (select |c_#memory_$Pointer$#0.offset| (select (select |c_#memory_$Pointer$#0.base| .cse8) .cse9)) (select (select |c_#memory_$Pointer$#0.offset| .cse8) .cse9))))) (let ((.cse5 (store (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_22| (store (select |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_22|) .cse6 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_654)) (.cse1 (store (store |c_#memory_$Pointer$#0.base| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_22| (store .cse7 .cse6 v_ArrVal_658)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_657)) (.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse4 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse2 (select (select .cse1 .cse0) .cse4)) (.cse3 (select (select .cse5 .cse0) .cse4))) (or (not (= .cse0 (select (select .cse1 .cse2) .cse3))) (not (= .cse4 (select (select .cse5 .cse2) .cse3))) (not (= v_ArrVal_653 (store (select |c_#memory_int#0| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_22|) .cse6 (select v_ArrVal_653 .cse6)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#0| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_22| v_ArrVal_653) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_652) .cse0) (+ .cse4 4))) (not (= (select .cse7 .cse6) .cse8)))))))) is different from false [2025-04-29 10:56:20,974 WARN L849 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_657 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_append_~last~1#1.base_22| Int) (v_ArrVal_658 Int) (v_ArrVal_652 (Array Int Int)) (v_ArrVal_654 (Array Int Int)) (v_ArrVal_653 (Array Int Int))) (let ((.cse8 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse7 (select |c_#memory_$Pointer$#0.base| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_22|)) (.cse5 (let ((.cse9 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (select (select |c_#memory_$Pointer$#0.offset| (select (select |c_#memory_$Pointer$#0.base| .cse8) .cse9)) (select (select |c_#memory_$Pointer$#0.offset| .cse8) .cse9))))) (let ((.cse1 (store (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_22| (store (select |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_22|) .cse5 |c_ULTIMATE.start_sll_circular_append_#t~ret6#1.offset|)) |c_ULTIMATE.start_sll_circular_append_#t~ret6#1.base| v_ArrVal_654)) (.cse6 (store (store |c_#memory_$Pointer$#0.base| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_22| (store .cse7 .cse5 v_ArrVal_658)) |c_ULTIMATE.start_sll_circular_append_#t~ret6#1.base| v_ArrVal_657)) (.cse4 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse0 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse2 (select (select .cse6 .cse4) .cse0)) (.cse3 (select (select .cse1 .cse4) .cse0))) (or (not (= .cse0 (select (select .cse1 .cse2) .cse3))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#0| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_22| v_ArrVal_653) |c_ULTIMATE.start_sll_circular_append_#t~ret6#1.base| v_ArrVal_652) .cse4) (+ .cse0 4))) (not (= v_ArrVal_653 (store (select |c_#memory_int#0| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_22|) .cse5 (select v_ArrVal_653 .cse5)))) (not (= (select (select .cse6 .cse2) .cse3) .cse4)) (not (= (select .cse7 .cse5) .cse8)))))))) is different from false [2025-04-29 10:56:25,527 INFO L325 Elim1Store]: treesize reduction 2069, result has 17.2 percent of original size [2025-04-29 10:56:25,527 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 4 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 15 new quantified variables, introduced 64 case distinctions, treesize of input 19905 treesize of output 14487 [2025-04-29 10:56:27,578 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 10:56:27,579 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 10 new quantified variables, introduced 28 case distinctions, treesize of input 11327 treesize of output 9903 [2025-04-29 10:56:29,179 INFO L204 Elim1Store]: Index analysis took 131 ms [2025-04-29 10:56:29,993 INFO L325 Elim1Store]: treesize reduction 286, result has 75.8 percent of original size [2025-04-29 10:56:29,993 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 10600 treesize of output 10856 [2025-04-29 10:56:30,536 INFO L204 Elim1Store]: Index analysis took 135 ms [2025-04-29 10:56:31,170 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 10:56:31,171 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 10 new quantified variables, introduced 36 case distinctions, treesize of input 11688 treesize of output 11653 Killed by 15