./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/list-simple/sll2c_prepend_equal.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_prepend_equal.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 03f177c90a12d9c7303c30b98267f0b09fb5c216e825c492ccdf608b5efd0fcb --- Real Ultimate output --- This is Ultimate 0.3.0-wip.fs.system-includes-da04345-m [2025-04-29 10:56:05,911 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-29 10:56:05,967 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:05,971 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-29 10:56:05,972 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-29 10:56:05,985 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-29 10:56:05,985 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-29 10:56:05,985 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-29 10:56:05,986 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-29 10:56:05,986 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-29 10:56:05,986 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-29 10:56:05,986 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-29 10:56:05,986 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-29 10:56:05,986 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-29 10:56:05,986 INFO L153 SettingsManager]: * Use SBE=true [2025-04-29 10:56:05,987 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-29 10:56:05,987 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-29 10:56:05,987 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-29 10:56:05,987 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-29 10:56:05,987 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-29 10:56:05,987 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-29 10:56:05,987 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-29 10:56:05,987 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-29 10:56:05,987 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-29 10:56:05,987 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-29 10:56:05,987 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-29 10:56:05,988 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-29 10:56:05,988 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-29 10:56:05,988 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-29 10:56:05,988 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 10:56:05,988 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-29 10:56:05,988 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 10:56:05,988 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 10:56:05,988 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-29 10:56:05,988 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 10:56:05,988 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-29 10:56:05,988 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 10:56:05,988 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 10:56:05,989 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-29 10:56:05,989 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-29 10:56:05,989 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-29 10:56:05,989 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-29 10:56:05,989 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-29 10:56:05,989 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-29 10:56:05,989 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-29 10:56:05,989 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-29 10:56:05,989 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-29 10:56:05,989 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 -> 03f177c90a12d9c7303c30b98267f0b09fb5c216e825c492ccdf608b5efd0fcb [2025-04-29 10:56:06,222 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-29 10:56:06,231 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-29 10:56:06,233 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-29 10:56:06,234 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-29 10:56:06,234 INFO L274 PluginConnector]: CDTParser initialized [2025-04-29 10:56:06,235 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-simple/sll2c_prepend_equal.c [2025-04-29 10:56:07,525 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/04a479962/cfaa7275ebf34df9bc4c358139da06ab/FLAGb124235eb [2025-04-29 10:56:07,722 INFO L389 CDTParser]: Found 1 translation units. [2025-04-29 10:56:07,722 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-simple/sll2c_prepend_equal.c [2025-04-29 10:56:07,723 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:07,723 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:07,729 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/04a479962/cfaa7275ebf34df9bc4c358139da06ab/FLAGb124235eb [2025-04-29 10:56:08,575 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/04a479962/cfaa7275ebf34df9bc4c358139da06ab [2025-04-29 10:56:08,577 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-29 10:56:08,578 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-29 10:56:08,579 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-29 10:56:08,579 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-29 10:56:08,582 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-29 10:56:08,582 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 10:56:08" (1/1) ... [2025-04-29 10:56:08,583 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@51d91a22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:56:08, skipping insertion in model container [2025-04-29 10:56:08,583 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 10:56:08" (1/1) ... [2025-04-29 10:56:08,597 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-29 10:56:08,747 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_prepend_equal.c[1641,1654] [2025-04-29 10:56:08,750 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 10:56:08,756 INFO L200 MainTranslator]: Completed pre-run [2025-04-29 10:56:08,782 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_prepend_equal.c[1641,1654] [2025-04-29 10:56:08,783 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 10:56:08,792 INFO L204 MainTranslator]: Completed translation [2025-04-29 10:56:08,792 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:56:08 WrapperNode [2025-04-29 10:56:08,792 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-29 10:56:08,793 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-29 10:56:08,793 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-29 10:56:08,793 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-29 10:56:08,797 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:08" (1/1) ... [2025-04-29 10:56:08,803 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:08" (1/1) ... [2025-04-29 10:56:08,822 INFO L138 Inliner]: procedures = 18, calls = 39, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 128 [2025-04-29 10:56:08,822 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-29 10:56:08,822 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-29 10:56:08,822 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-29 10:56:08,822 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-29 10:56:08,830 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:08" (1/1) ... [2025-04-29 10:56:08,831 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:08" (1/1) ... [2025-04-29 10:56:08,832 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:08" (1/1) ... [2025-04-29 10:56:08,847 INFO L175 MemorySlicer]: Split 23 memory accesses to 2 slices as follows [13, 10]. 57 percent of accesses are in the largest equivalence class. The 1 initializations are split as follows [0, 1]. The 9 writes are split as follows [7, 2]. [2025-04-29 10:56:08,848 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:08" (1/1) ... [2025-04-29 10:56:08,848 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:08" (1/1) ... [2025-04-29 10:56:08,856 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:08" (1/1) ... [2025-04-29 10:56:08,858 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:08" (1/1) ... [2025-04-29 10:56:08,861 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:08" (1/1) ... [2025-04-29 10:56:08,862 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:08" (1/1) ... [2025-04-29 10:56:08,862 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:08" (1/1) ... [2025-04-29 10:56:08,865 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-29 10:56:08,866 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-29 10:56:08,866 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-29 10:56:08,866 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-29 10:56:08,867 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:56:08" (1/1) ... [2025-04-29 10:56:08,870 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 10:56:08,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 10:56:08,891 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:08,892 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:08,908 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-04-29 10:56:08,908 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-04-29 10:56:08,908 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-04-29 10:56:08,908 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-04-29 10:56:08,908 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-04-29 10:56:08,908 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-04-29 10:56:08,908 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-04-29 10:56:08,908 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-29 10:56:08,908 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-29 10:56:08,908 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-29 10:56:08,908 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-29 10:56:08,908 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-29 10:56:08,908 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-29 10:56:08,908 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-29 10:56:08,908 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2025-04-29 10:56:08,908 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2025-04-29 10:56:08,908 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-04-29 10:56:08,985 INFO L234 CfgBuilder]: Building ICFG [2025-04-29 10:56:08,986 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-29 10:56:09,173 INFO L? ?]: Removed 45 outVars from TransFormulas that were not future-live. [2025-04-29 10:56:09,173 INFO L283 CfgBuilder]: Performing block encoding [2025-04-29 10:56:09,182 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-29 10:56:09,182 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2025-04-29 10:56:09,182 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 10:56:09 BoogieIcfgContainer [2025-04-29 10:56:09,183 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-29 10:56:09,185 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-29 10:56:09,186 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-29 10:56:09,188 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-29 10:56:09,189 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.04 10:56:08" (1/3) ... [2025-04-29 10:56:09,189 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56c7b6e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 10:56:09, skipping insertion in model container [2025-04-29 10:56:09,189 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:56:08" (2/3) ... [2025-04-29 10:56:09,189 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56c7b6e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 10:56:09, skipping insertion in model container [2025-04-29 10:56:09,189 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 10:56:09" (3/3) ... [2025-04-29 10:56:09,190 INFO L128 eAbstractionObserver]: Analyzing ICFG sll2c_prepend_equal.c [2025-04-29 10:56:09,200 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-29 10:56:09,201 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG sll2c_prepend_equal.c that has 2 procedures, 34 locations, 49 edges, 1 initial locations, 4 loop locations, and 1 error locations. [2025-04-29 10:56:09,241 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-29 10:56:09,250 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;@451416c1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-29 10:56:09,250 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-04-29 10:56:09,254 INFO L278 IsEmpty]: Start isEmpty. Operand has 34 states, 28 states have (on average 1.4285714285714286) internal successors, (40), 29 states have internal predecessors, (40), 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:09,259 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-04-29 10:56:09,259 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:56:09,260 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 10:56:09,260 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:56:09,265 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:56:09,265 INFO L85 PathProgramCache]: Analyzing trace with hash -1458028568, now seen corresponding path program 1 times [2025-04-29 10:56:09,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:56:09,271 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041308702] [2025-04-29 10:56:09,272 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:56:09,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:56:09,339 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-29 10:56:09,379 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-29 10:56:09,379 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:56:09,379 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:56:09,464 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:09,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:56:09,465 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041308702] [2025-04-29 10:56:09,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041308702] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 10:56:09,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 10:56:09,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 10:56:09,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252407661] [2025-04-29 10:56:09,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 10:56:09,471 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-29 10:56:09,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:56:09,485 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-29 10:56:09,485 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-29 10:56:09,486 INFO L87 Difference]: Start difference. First operand has 34 states, 28 states have (on average 1.4285714285714286) internal successors, (40), 29 states have internal predecessors, (40), 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 7.5) internal successors, (15), 2 states have internal predecessors, (15), 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:09,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 10:56:09,504 INFO L93 Difference]: Finished difference Result 48 states and 65 transitions. [2025-04-29 10:56:09,505 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-29 10:56:09,506 INFO L79 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 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 23 [2025-04-29 10:56:09,507 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 10:56:09,510 INFO L225 Difference]: With dead ends: 48 [2025-04-29 10:56:09,511 INFO L226 Difference]: Without dead ends: 27 [2025-04-29 10:56:09,513 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:09,516 INFO L437 NwaCegarLoop]: 43 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, 43 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:09,517 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 43 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:09,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2025-04-29 10:56:09,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2025-04-29 10:56:09,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 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:09,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 33 transitions. [2025-04-29 10:56:09,542 INFO L79 Accepts]: Start accepts. Automaton has 27 states and 33 transitions. Word has length 23 [2025-04-29 10:56:09,543 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 10:56:09,543 INFO L485 AbstractCegarLoop]: Abstraction has 27 states and 33 transitions. [2025-04-29 10:56:09,543 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 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:09,544 INFO L278 IsEmpty]: Start isEmpty. Operand 27 states and 33 transitions. [2025-04-29 10:56:09,545 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-04-29 10:56:09,545 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:56:09,545 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 10:56:09,546 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-29 10:56:09,546 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:56:09,547 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:56:09,547 INFO L85 PathProgramCache]: Analyzing trace with hash -1458041495, now seen corresponding path program 1 times [2025-04-29 10:56:09,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:56:09,547 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938439983] [2025-04-29 10:56:09,547 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:56:09,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:56:09,571 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-29 10:56:09,589 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-29 10:56:09,590 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:56:09,590 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:56:09,705 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:09,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:56:09,706 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938439983] [2025-04-29 10:56:09,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [938439983] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 10:56:09,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 10:56:09,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 10:56:09,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927716157] [2025-04-29 10:56:09,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 10:56:09,707 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 10:56:09,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:56:09,707 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 10:56:09,707 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 10:56:09,708 INFO L87 Difference]: Start difference. First operand 27 states and 33 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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:09,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 10:56:09,724 INFO L93 Difference]: Finished difference Result 48 states and 58 transitions. [2025-04-29 10:56:09,724 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 10:56:09,724 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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 23 [2025-04-29 10:56:09,725 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 10:56:09,725 INFO L225 Difference]: With dead ends: 48 [2025-04-29 10:56:09,725 INFO L226 Difference]: Without dead ends: 28 [2025-04-29 10:56:09,725 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:09,726 INFO L437 NwaCegarLoop]: 31 mSDtfsCounter, 1 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 56 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:09,726 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 56 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:09,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2025-04-29 10:56:09,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2025-04-29 10:56:09,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 23 states have internal predecessors, (28), 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:09,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2025-04-29 10:56:09,730 INFO L79 Accepts]: Start accepts. Automaton has 28 states and 34 transitions. Word has length 23 [2025-04-29 10:56:09,730 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 10:56:09,730 INFO L485 AbstractCegarLoop]: Abstraction has 28 states and 34 transitions. [2025-04-29 10:56:09,730 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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:09,730 INFO L278 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2025-04-29 10:56:09,731 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-04-29 10:56:09,731 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:56:09,731 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] [2025-04-29 10:56:09,731 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-29 10:56:09,731 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:56:09,731 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:56:09,731 INFO L85 PathProgramCache]: Analyzing trace with hash -1383922991, now seen corresponding path program 1 times [2025-04-29 10:56:09,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:56:09,731 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164381114] [2025-04-29 10:56:09,732 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:56:09,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:56:09,762 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-04-29 10:56:09,789 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-04-29 10:56:09,792 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:56:09,792 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:56:10,065 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:10,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:56:10,065 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164381114] [2025-04-29 10:56:10,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164381114] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 10:56:10,065 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1670834103] [2025-04-29 10:56:10,065 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:56:10,065 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:56:10,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 10:56:10,068 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:10,070 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:10,137 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-04-29 10:56:10,187 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-04-29 10:56:10,187 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:56:10,187 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:56:10,193 INFO L256 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-04-29 10:56:10,198 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 10:56:10,307 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:10,320 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:10,320 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 10:56:10,369 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:10,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1670834103] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 10:56:10,370 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 10:56:10,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 9] total 12 [2025-04-29 10:56:10,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315780528] [2025-04-29 10:56:10,370 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 10:56:10,370 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-29 10:56:10,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:56:10,372 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-29 10:56:10,372 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2025-04-29 10:56:10,374 INFO L87 Difference]: Start difference. First operand 28 states and 34 transitions. Second operand has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 11 states have internal predecessors, (28), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2025-04-29 10:56:14,398 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-04-29 10:56:18,410 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-04-29 10:56:22,417 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-04-29 10:56:26,502 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-04-29 10:56:30,537 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-04-29 10:56:30,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 10:56:30,537 INFO L93 Difference]: Finished difference Result 42 states and 49 transitions. [2025-04-29 10:56:30,538 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-29 10:56:30,539 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 11 states have internal predecessors, (28), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 31 [2025-04-29 10:56:30,539 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 10:56:30,539 INFO L225 Difference]: With dead ends: 42 [2025-04-29 10:56:30,539 INFO L226 Difference]: Without dead ends: 35 [2025-04-29 10:56:30,540 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2025-04-29 10:56:30,540 INFO L437 NwaCegarLoop]: 27 mSDtfsCounter, 13 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 0 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.1s IncrementalHoareTripleChecker+Time [2025-04-29 10:56:30,540 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 216 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 102 Invalid, 5 Unknown, 0 Unchecked, 20.1s Time] [2025-04-29 10:56:30,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2025-04-29 10:56:30,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 33. [2025-04-29 10:56:30,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 27 states have internal predecessors, (31), 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:30,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2025-04-29 10:56:30,545 INFO L79 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 31 [2025-04-29 10:56:30,545 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 10:56:30,545 INFO L485 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2025-04-29 10:56:30,545 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 11 states have internal predecessors, (28), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2025-04-29 10:56:30,546 INFO L278 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2025-04-29 10:56:30,548 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-04-29 10:56:30,548 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:56:30,548 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] [2025-04-29 10:56:30,555 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-04-29 10:56:30,748 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:56:30,749 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:56:30,749 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:56:30,749 INFO L85 PathProgramCache]: Analyzing trace with hash -873694894, now seen corresponding path program 1 times [2025-04-29 10:56:30,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:56:30,749 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234210874] [2025-04-29 10:56:30,749 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:56:30,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:56:30,764 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-04-29 10:56:30,783 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-04-29 10:56:30,783 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:56:30,783 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:56:31,736 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:31,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:56:31,736 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234210874] [2025-04-29 10:56:31,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1234210874] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 10:56:31,736 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [417422089] [2025-04-29 10:56:31,736 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:56:31,736 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:56:31,736 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 10:56:31,738 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:31,741 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:31,813 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-04-29 10:56:31,851 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-04-29 10:56:31,851 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:56:31,851 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:56:31,859 INFO L256 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 72 conjuncts are in the unsatisfiable core [2025-04-29 10:56:31,862 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 10:56:31,867 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:31,964 INFO L325 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-04-29 10:56:31,965 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:32,000 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-04-29 10:56:32,053 INFO L325 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-04-29 10:56:32,054 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:32,131 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:32,137 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:32,188 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 10:56:32,189 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:32,206 INFO L325 Elim1Store]: treesize reduction 8, result has 75.8 percent of original size [2025-04-29 10:56:32,206 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:32,271 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:32,304 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:32,307 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:32,331 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:32,331 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 10:56:32,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [417422089] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 10:56:32,438 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-29 10:56:32,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 20] total 30 [2025-04-29 10:56:32,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769185910] [2025-04-29 10:56:32,438 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-29 10:56:32,438 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-04-29 10:56:32,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:56:32,439 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-04-29 10:56:32,439 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=907, Unknown=0, NotChecked=0, Total=992 [2025-04-29 10:56:32,439 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand has 30 states, 28 states have (on average 1.4642857142857142) internal successors, (41), 24 states have internal predecessors, (41), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2025-04-29 10:56:32,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 10:56:32,859 INFO L93 Difference]: Finished difference Result 57 states and 68 transitions. [2025-04-29 10:56:32,860 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-29 10:56:32,860 INFO L79 Accepts]: Start accepts. Automaton has has 30 states, 28 states have (on average 1.4642857142857142) internal successors, (41), 24 states have internal predecessors, (41), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 34 [2025-04-29 10:56:32,861 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 10:56:32,861 INFO L225 Difference]: With dead ends: 57 [2025-04-29 10:56:32,861 INFO L226 Difference]: Without dead ends: 49 [2025-04-29 10:56:32,862 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=140, Invalid=1266, Unknown=0, NotChecked=0, Total=1406 [2025-04-29 10:56:32,862 INFO L437 NwaCegarLoop]: 19 mSDtfsCounter, 32 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 370 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 388 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 370 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-29 10:56:32,862 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 229 Invalid, 388 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 370 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-29 10:56:32,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2025-04-29 10:56:32,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 42. [2025-04-29 10:56:32,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 34 states have (on average 1.1470588235294117) internal successors, (39), 34 states have internal predecessors, (39), 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:32,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 49 transitions. [2025-04-29 10:56:32,872 INFO L79 Accepts]: Start accepts. Automaton has 42 states and 49 transitions. Word has length 34 [2025-04-29 10:56:32,872 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 10:56:32,872 INFO L485 AbstractCegarLoop]: Abstraction has 42 states and 49 transitions. [2025-04-29 10:56:32,873 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 28 states have (on average 1.4642857142857142) internal successors, (41), 24 states have internal predecessors, (41), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2025-04-29 10:56:32,875 INFO L278 IsEmpty]: Start isEmpty. Operand 42 states and 49 transitions. [2025-04-29 10:56:32,875 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-04-29 10:56:32,875 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:56:32,875 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 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:32,882 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-04-29 10:56:33,076 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:33,076 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:56:33,076 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:56:33,077 INFO L85 PathProgramCache]: Analyzing trace with hash 1190263797, now seen corresponding path program 1 times [2025-04-29 10:56:33,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:56:33,077 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50917234] [2025-04-29 10:56:33,077 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:56:33,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:56:33,096 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-04-29 10:56:33,119 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-04-29 10:56:33,119 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:56:33,119 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:56:34,181 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 10:56:34,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:56:34,182 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50917234] [2025-04-29 10:56:34,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [50917234] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 10:56:34,182 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [623519507] [2025-04-29 10:56:34,182 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:56:34,182 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:56:34,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 10:56:34,184 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:34,185 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:34,257 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-04-29 10:56:34,295 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-04-29 10:56:34,295 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:56:34,295 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:56:34,298 INFO L256 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 108 conjuncts are in the unsatisfiable core [2025-04-29 10:56:34,302 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 10:56:34,330 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:34,484 INFO L325 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-04-29 10:56:34,484 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:34,531 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:34,587 INFO L325 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-04-29 10:56:34,587 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:34,696 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:34,699 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:34,799 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 13 treesize of output 9 [2025-04-29 10:56:34,867 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 10:56:34,868 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:34,886 INFO L325 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2025-04-29 10:56:34,886 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:35,191 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-29 10:56:35,191 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-29 10:56:35,192 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 16 [2025-04-29 10:56:35,348 INFO L325 Elim1Store]: treesize reduction 33, result has 31.3 percent of original size [2025-04-29 10:56:35,349 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 22 [2025-04-29 10:56:35,361 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 40 [2025-04-29 10:56:35,364 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 0 case distinctions, treesize of input 28 treesize of output 8 [2025-04-29 10:56:35,367 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 0 case distinctions, treesize of input 40 treesize of output 21 [2025-04-29 10:56:35,414 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 25 treesize of output 17 [2025-04-29 10:56:35,420 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:35,504 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 10:56:35,504 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 10:56:35,596 WARN L849 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_502 (Array Int Int)) (v_ArrVal_503 (Array Int Int))) (or (not (= v_ArrVal_502 (store (select |c_#memory_int#0| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| (select v_ArrVal_502 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#0| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_502) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_503) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#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:35,632 WARN L849 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_502 (Array Int Int)) (v_ArrVal_503 (Array Int Int))) (or (not (= v_ArrVal_502 (store (select |c_#memory_int#0| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| (select v_ArrVal_502 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#0| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_502) (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset|) v_ArrVal_503) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#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:35,660 WARN L849 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_502 (Array Int Int)) (v_ArrVal_503 (Array Int Int))) (or (not (= v_ArrVal_502 (store (select |c_#memory_int#0| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| (select v_ArrVal_502 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse1 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|))) (select (let ((.cse0 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|))) (select (store (store |c_#memory_int#0| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_502) (select (select |c_#memory_$Pointer$#0.base| (select .cse0 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select .cse1 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) v_ArrVal_503) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse0 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse1 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#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:35,674 WARN L849 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_502 (Array Int Int)) (v_ArrVal_503 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse1 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|))) (select (let ((.cse0 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|))) (select (store (store |c_#memory_int#0| |c_ULTIMATE.start_sll_circular_prepend_#t~ret6#1.base| v_ArrVal_502) (select (select |c_#memory_$Pointer$#0.base| (select .cse0 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select .cse1 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) v_ArrVal_503) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse0 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_#t~ret6#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse1 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_#t~ret6#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)))) (not (= v_ArrVal_502 (store (select |c_#memory_int#0| |c_ULTIMATE.start_sll_circular_prepend_#t~ret6#1.base|) |c_ULTIMATE.start_sll_circular_prepend_#t~ret6#1.offset| (select v_ArrVal_502 |c_ULTIMATE.start_sll_circular_prepend_#t~ret6#1.offset|)))))) is different from false [2025-04-29 10:56:35,730 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 10:56:35,731 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 268 treesize of output 272 [2025-04-29 10:56:35,739 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 238 treesize of output 206 [2025-04-29 10:56:35,799 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 493 treesize of output 445 [2025-04-29 10:56:36,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [623519507] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 10:56:36,053 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-29 10:56:36,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 24] total 42 [2025-04-29 10:56:36,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146763433] [2025-04-29 10:56:36,053 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-29 10:56:36,054 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2025-04-29 10:56:36,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:56:36,056 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2025-04-29 10:56:36,057 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=1859, Unknown=4, NotChecked=356, Total=2352 [2025-04-29 10:56:36,057 INFO L87 Difference]: Start difference. First operand 42 states and 49 transitions. Second operand has 42 states, 39 states have (on average 1.435897435897436) internal successors, (56), 33 states have internal predecessors, (56), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-04-29 10:56:37,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 10:56:37,412 INFO L93 Difference]: Finished difference Result 90 states and 105 transitions. [2025-04-29 10:56:37,413 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-04-29 10:56:37,413 INFO L79 Accepts]: Start accepts. Automaton has has 42 states, 39 states have (on average 1.435897435897436) internal successors, (56), 33 states have internal predecessors, (56), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 37 [2025-04-29 10:56:37,413 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 10:56:37,414 INFO L225 Difference]: With dead ends: 90 [2025-04-29 10:56:37,414 INFO L226 Difference]: Without dead ends: 88 [2025-04-29 10:56:37,415 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 700 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=295, Invalid=3749, Unknown=4, NotChecked=508, Total=4556 [2025-04-29 10:56:37,416 INFO L437 NwaCegarLoop]: 18 mSDtfsCounter, 129 mSDsluCounter, 434 mSDsCounter, 0 mSdLazyCounter, 994 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 452 SdHoareTripleChecker+Invalid, 1015 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 994 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-04-29 10:56:37,416 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 452 Invalid, 1015 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 994 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-04-29 10:56:37,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2025-04-29 10:56:37,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 63. [2025-04-29 10:56:37,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 52 states have (on average 1.1538461538461537) internal successors, (60), 52 states have internal predecessors, (60), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-04-29 10:56:37,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 74 transitions. [2025-04-29 10:56:37,424 INFO L79 Accepts]: Start accepts. Automaton has 63 states and 74 transitions. Word has length 37 [2025-04-29 10:56:37,424 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 10:56:37,424 INFO L485 AbstractCegarLoop]: Abstraction has 63 states and 74 transitions. [2025-04-29 10:56:37,424 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 39 states have (on average 1.435897435897436) internal successors, (56), 33 states have internal predecessors, (56), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-04-29 10:56:37,424 INFO L278 IsEmpty]: Start isEmpty. Operand 63 states and 74 transitions. [2025-04-29 10:56:37,425 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-04-29 10:56:37,425 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:56:37,425 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2025-04-29 10:56:37,432 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:37,625 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:37,626 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:56:37,626 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:56:37,626 INFO L85 PathProgramCache]: Analyzing trace with hash 1382246604, now seen corresponding path program 1 times [2025-04-29 10:56:37,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:56:37,626 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099058095] [2025-04-29 10:56:37,626 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:56:37,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:56:37,640 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-04-29 10:56:37,648 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-04-29 10:56:37,648 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:56:37,648 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:56:38,338 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 11 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 10:56:38,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:56:38,339 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099058095] [2025-04-29 10:56:38,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1099058095] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 10:56:38,340 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1592903354] [2025-04-29 10:56:38,340 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:56:38,340 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:56:38,340 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 10:56:38,343 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:38,345 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:38,414 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-04-29 10:56:38,441 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-04-29 10:56:38,441 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:56:38,441 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:56:38,443 INFO L256 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 95 conjuncts are in the unsatisfiable core [2025-04-29 10:56:38,447 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 10:56:38,457 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2025-04-29 10:56:38,618 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 9 treesize of output 3 [2025-04-29 10:56:38,699 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 18 treesize of output 7 [2025-04-29 10:56:38,750 INFO L325 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2025-04-29 10:56:38,750 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 1 case distinctions, treesize of input 15 treesize of output 15 [2025-04-29 10:56:38,945 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:39,111 INFO L325 Elim1Store]: treesize reduction 43, result has 40.3 percent of original size [2025-04-29 10:56:39,111 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 3 case distinctions, treesize of input 78 treesize of output 39 [2025-04-29 10:56:39,134 INFO L325 Elim1Store]: treesize reduction 20, result has 58.3 percent of original size [2025-04-29 10:56:39,135 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 59 treesize of output 55 [2025-04-29 10:56:39,149 INFO L325 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2025-04-29 10:56:39,149 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 21 [2025-04-29 10:56:39,245 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 58 treesize of output 34 [2025-04-29 10:56:39,248 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 24 treesize of output 12 [2025-04-29 10:56:39,252 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 7 treesize of output 3 [2025-04-29 10:56:39,280 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 11 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 10:56:39,280 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 10:56:39,308 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 12 treesize of output 8 [2025-04-29 10:56:39,550 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 97 treesize of output 89 [2025-04-29 10:56:39,742 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 10:56:39,742 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 5561 treesize of output 5368 [2025-04-29 10:56:40,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1592903354] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 10:56:40,062 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-29 10:56:40,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19] total 37 [2025-04-29 10:56:40,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770975072] [2025-04-29 10:56:40,062 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-29 10:56:40,062 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2025-04-29 10:56:40,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:56:40,063 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2025-04-29 10:56:40,063 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=1829, Unknown=0, NotChecked=0, Total=1980 [2025-04-29 10:56:40,063 INFO L87 Difference]: Start difference. First operand 63 states and 74 transitions. Second operand has 37 states, 35 states have (on average 1.6) internal successors, (56), 31 states have internal predecessors, (56), 3 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2025-04-29 10:56:40,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 10:56:40,704 INFO L93 Difference]: Finished difference Result 75 states and 87 transitions. [2025-04-29 10:56:40,705 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-04-29 10:56:40,705 INFO L79 Accepts]: Start accepts. Automaton has has 37 states, 35 states have (on average 1.6) internal successors, (56), 31 states have internal predecessors, (56), 3 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Word has length 39 [2025-04-29 10:56:40,705 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 10:56:40,706 INFO L225 Difference]: With dead ends: 75 [2025-04-29 10:56:40,706 INFO L226 Difference]: Without dead ends: 72 [2025-04-29 10:56:40,707 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 523 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=219, Invalid=2537, Unknown=0, NotChecked=0, Total=2756 [2025-04-29 10:56:40,707 INFO L437 NwaCegarLoop]: 17 mSDtfsCounter, 28 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 588 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 590 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 588 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-29 10:56:40,707 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 266 Invalid, 590 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 588 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-29 10:56:40,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2025-04-29 10:56:40,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 66. [2025-04-29 10:56:40,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 55 states have (on average 1.1636363636363636) internal successors, (64), 55 states have internal predecessors, (64), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-04-29 10:56:40,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 78 transitions. [2025-04-29 10:56:40,715 INFO L79 Accepts]: Start accepts. Automaton has 66 states and 78 transitions. Word has length 39 [2025-04-29 10:56:40,715 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 10:56:40,715 INFO L485 AbstractCegarLoop]: Abstraction has 66 states and 78 transitions. [2025-04-29 10:56:40,715 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 35 states have (on average 1.6) internal successors, (56), 31 states have internal predecessors, (56), 3 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2025-04-29 10:56:40,715 INFO L278 IsEmpty]: Start isEmpty. Operand 66 states and 78 transitions. [2025-04-29 10:56:40,716 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-29 10:56:40,716 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:56:40,716 INFO L218 NwaCegarLoop]: trace histogram [3, 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] [2025-04-29 10:56:40,722 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-04-29 10:56:40,917 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:56:40,917 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:56:40,917 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:56:40,917 INFO L85 PathProgramCache]: Analyzing trace with hash 1831817842, now seen corresponding path program 2 times [2025-04-29 10:56:40,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:56:40,917 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669179988] [2025-04-29 10:56:40,917 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 10:56:40,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:56:40,929 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 40 statements into 2 equivalence classes. [2025-04-29 10:56:40,953 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 40 of 40 statements. [2025-04-29 10:56:40,953 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-29 10:56:40,953 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:56:41,744 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 12 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 10:56:41,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:56:41,745 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669179988] [2025-04-29 10:56:41,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1669179988] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 10:56:41,745 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [756514075] [2025-04-29 10:56:41,745 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 10:56:41,745 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:56:41,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 10:56:41,747 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 10:56:41,748 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-04-29 10:56:41,828 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 40 statements into 2 equivalence classes. [2025-04-29 10:56:41,875 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 40 of 40 statements. [2025-04-29 10:56:41,876 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-29 10:56:41,876 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:56:41,880 INFO L256 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 132 conjuncts are in the unsatisfiable core [2025-04-29 10:56:41,884 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 10:56:41,906 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:42,073 INFO L325 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-04-29 10:56:42,073 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:42,120 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:42,128 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:42,176 INFO L325 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-04-29 10:56:42,176 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 53 treesize of output 48 [2025-04-29 10:56:42,180 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 27 treesize of output 22 [2025-04-29 10:56:42,268 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 45 treesize of output 21 [2025-04-29 10:56:42,271 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:42,274 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2025-04-29 10:56:42,373 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 13 treesize of output 9 [2025-04-29 10:56:42,432 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 10:56:42,433 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 53 treesize of output 36 [2025-04-29 10:56:42,453 INFO L325 Elim1Store]: treesize reduction 48, result has 47.3 percent of original size [2025-04-29 10:56:42,454 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 2 case distinctions, treesize of input 35 treesize of output 53 [2025-04-29 10:56:42,482 INFO L325 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2025-04-29 10:56:42,483 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:42,781 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-29 10:56:42,782 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-29 10:56:42,782 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 23 [2025-04-29 10:56:42,918 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 10:56:42,919 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-29 10:56:42,919 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-29 10:56:42,923 INFO L325 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-04-29 10:56:42,923 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 16 [2025-04-29 10:56:43,015 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 0 case distinctions, treesize of input 28 treesize of output 8 [2025-04-29 10:56:43,020 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 10:56:43,023 INFO L325 Elim1Store]: treesize reduction 35, result has 2.8 percent of original size [2025-04-29 10:56:43,023 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 1 case distinctions, treesize of input 97 treesize of output 21 [2025-04-29 10:56:43,028 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 39 treesize of output 15 [2025-04-29 10:56:43,041 INFO L325 Elim1Store]: treesize reduction 33, result has 31.3 percent of original size [2025-04-29 10:56:43,041 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 22 [2025-04-29 10:56:43,079 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 25 treesize of output 17 [2025-04-29 10:56:43,080 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 16 [2025-04-29 10:56:43,141 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 7 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 10:56:43,141 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 10:56:50,572 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 1142 treesize of output 1082 [2025-04-29 10:56:50,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [756514075] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 10:56:50,950 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-29 10:56:50,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 25] total 42 [2025-04-29 10:56:50,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659066870] [2025-04-29 10:56:50,950 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-29 10:56:50,951 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2025-04-29 10:56:50,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:56:50,952 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2025-04-29 10:56:50,953 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=2393, Unknown=1, NotChecked=0, Total=2550 [2025-04-29 10:56:50,953 INFO L87 Difference]: Start difference. First operand 66 states and 78 transitions. Second operand has 42 states, 39 states have (on average 1.6923076923076923) internal successors, (66), 34 states have internal predecessors, (66), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-04-29 10:56:52,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 10:56:52,314 INFO L93 Difference]: Finished difference Result 96 states and 112 transitions. [2025-04-29 10:56:52,315 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-04-29 10:56:52,315 INFO L79 Accepts]: Start accepts. Automaton has has 42 states, 39 states have (on average 1.6923076923076923) internal successors, (66), 34 states have internal predecessors, (66), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 40 [2025-04-29 10:56:52,315 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 10:56:52,315 INFO L225 Difference]: With dead ends: 96 [2025-04-29 10:56:52,315 INFO L226 Difference]: Without dead ends: 82 [2025-04-29 10:56:52,316 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 917 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=292, Invalid=3739, Unknown=1, NotChecked=0, Total=4032 [2025-04-29 10:56:52,317 INFO L437 NwaCegarLoop]: 17 mSDtfsCounter, 52 mSDsluCounter, 349 mSDsCounter, 0 mSdLazyCounter, 925 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 939 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 925 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-29 10:56:52,317 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 366 Invalid, 939 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 925 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-29 10:56:52,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2025-04-29 10:56:52,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 69. [2025-04-29 10:56:52,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 58 states have (on average 1.1551724137931034) internal successors, (67), 58 states have internal predecessors, (67), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-04-29 10:56:52,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 81 transitions. [2025-04-29 10:56:52,325 INFO L79 Accepts]: Start accepts. Automaton has 69 states and 81 transitions. Word has length 40 [2025-04-29 10:56:52,325 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 10:56:52,325 INFO L485 AbstractCegarLoop]: Abstraction has 69 states and 81 transitions. [2025-04-29 10:56:52,325 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 39 states have (on average 1.6923076923076923) internal successors, (66), 34 states have internal predecessors, (66), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-04-29 10:56:52,325 INFO L278 IsEmpty]: Start isEmpty. Operand 69 states and 81 transitions. [2025-04-29 10:56:52,325 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-29 10:56:52,325 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:56:52,326 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] [2025-04-29 10:56:52,333 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-04-29 10:56:52,529 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:56:52,529 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:56:52,530 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:56:52,530 INFO L85 PathProgramCache]: Analyzing trace with hash -100105040, now seen corresponding path program 1 times [2025-04-29 10:56:52,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:56:52,530 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176411353] [2025-04-29 10:56:52,530 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:56:52,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:56:52,540 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-04-29 10:56:52,558 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-04-29 10:56:52,558 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:56:52,558 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:56:53,910 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 10:56:53,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:56:53,911 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176411353] [2025-04-29 10:56:53,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [176411353] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 10:56:53,911 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [834805540] [2025-04-29 10:56:53,911 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:56:53,911 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:56:53,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 10:56:53,912 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 10:56:53,913 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-04-29 10:56:53,984 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-04-29 10:56:54,019 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-04-29 10:56:54,019 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:56:54,019 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:56:54,022 INFO L256 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 149 conjuncts are in the unsatisfiable core [2025-04-29 10:56:54,026 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 10:56:54,060 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:54,242 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:54,304 INFO L325 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-04-29 10:56:54,304 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:54,366 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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:54,372 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 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:54,441 INFO L325 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-04-29 10:56:54,441 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2025-04-29 10:56:54,444 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 24 treesize of output 11 [2025-04-29 10:56:54,558 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 30 treesize of output 14 [2025-04-29 10:56:54,562 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 11 treesize of output 3 [2025-04-29 10:56:54,565 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:54,794 INFO L325 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2025-04-29 10:56:54,794 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 20 treesize of output 23 [2025-04-29 10:56:54,812 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 10:56:54,812 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 32 [2025-04-29 10:56:54,829 INFO L325 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2025-04-29 10:56:54,829 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 28 treesize of output 30 [2025-04-29 10:56:55,705 INFO L325 Elim1Store]: treesize reduction 20, result has 58.3 percent of original size [2025-04-29 10:56:55,705 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 333 treesize of output 249 [2025-04-29 10:56:55,724 INFO L325 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2025-04-29 10:56:55,724 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 21 [2025-04-29 10:56:55,799 INFO L325 Elim1Store]: treesize reduction 303, result has 22.1 percent of original size [2025-04-29 10:56:55,799 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 391 treesize of output 267 [2025-04-29 10:56:55,810 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 19 [2025-04-29 10:56:55,849 INFO L325 Elim1Store]: treesize reduction 96, result has 26.2 percent of original size [2025-04-29 10:56:55,849 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 215 treesize of output 178 [2025-04-29 10:56:56,122 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 101 treesize of output 65 [2025-04-29 10:56:56,125 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 7 treesize of output 3 [2025-04-29 10:56:56,130 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-29 10:56:56,130 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 55 treesize of output 30 [2025-04-29 10:56:56,294 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 10:56:56,294 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 10:56:57,582 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 10:56:57,583 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 2358 treesize of output 2169 [2025-04-29 10:57:09,673 WARN L871 $PredicateComparison]: unable to prove that (let ((.cse123 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|))) (let ((.cse14 (select .cse123 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (.cse122 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|))) (let ((.cse29 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse121 (select .cse122 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (.cse6 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse14))) (.cse5 (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset|)) (.cse8 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse123 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse4 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse122 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse12 (= .cse4 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) (.cse0 (= .cse8 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) (.cse15 (select |c_#memory_$Pointer$#0.base| .cse5)) (.cse7 (select .cse6 .cse5)) (.cse3 (+ .cse121 4)) (.cse105 (= .cse5 .cse29))) (let ((.cse56 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse58 (not .cse105)) (.cse22 (= .cse5 .cse8)) (.cse38 (= .cse4 .cse121)) (.cse42 (forall ((v_arrayElimCell_110 Int)) (or (not (= .cse14 (select .cse15 v_arrayElimCell_110))) (forall ((v_prenex_20 (Array Int Int)) (v_prenex_19 Int) (v_prenex_17 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#0| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_prenex_20) .cse5 v_prenex_17) (select (select (store .cse6 .cse5 (store .cse7 v_arrayElimCell_110 v_prenex_19)) .cse8) .cse4)) .cse3))) (= .cse4 v_arrayElimCell_110)))) (.cse43 (forall ((v_arrayElimCell_110 Int)) (or (not (= .cse14 (select .cse15 v_arrayElimCell_110))) (forall ((v_prenex_18 Int) (v_prenex_20 (Array Int Int)) (v_prenex_19 Int) (v_prenex_17 (Array Int Int))) (let ((.cse120 (select (store (store |c_#memory_int#0| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_prenex_20) .cse5 v_prenex_17) (select (select (store .cse6 .cse5 (store .cse7 v_arrayElimCell_110 v_prenex_19)) .cse8) .cse4)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse120 .cse3)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse120 (+ v_prenex_18 4)))))) (= .cse4 v_arrayElimCell_110)))) (.cse32 (not .cse0)) (.cse34 (not .cse12))) (let ((.cse40 (forall ((v_arrayElimCell_110 Int)) (or (forall ((v_prenex_18 Int) (v_prenex_20 (Array Int Int)) (v_prenex_19 Int) (v_prenex_17 (Array Int Int))) (let ((.cse119 (select (store (store |c_#memory_int#0| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_prenex_20) .cse5 v_prenex_17) (select (select (store .cse6 .cse5 (store .cse7 v_arrayElimCell_110 v_prenex_19)) .cse8) .cse4)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse119 .cse3)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse119 (+ v_arrayElimCell_110 4))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse119 (+ v_prenex_18 4)))))) (not (= .cse14 (select .cse15 v_arrayElimCell_110))) (= .cse4 v_arrayElimCell_110)))) (.cse41 (forall ((v_arrayElimCell_110 Int)) (or (not (= .cse14 (select .cse15 v_arrayElimCell_110))) (= .cse4 v_arrayElimCell_110) (forall ((v_prenex_20 (Array Int Int)) (v_prenex_19 Int) (v_prenex_17 (Array Int Int))) (let ((.cse118 (select (store (store |c_#memory_int#0| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_prenex_20) .cse5 v_prenex_17) (select (select (store .cse6 .cse5 (store .cse7 v_arrayElimCell_110 v_prenex_19)) .cse8) .cse4)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse118 .cse3)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse118 (+ v_arrayElimCell_110 4))))))))) (.cse55 (forall ((v_prenex_18 Int) (v_prenex_20 (Array Int Int)) (v_prenex_19 Int) (v_prenex_17 (Array Int Int))) (let ((.cse117 (select (store (store |c_#memory_int#0| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_prenex_20) .cse5 v_prenex_17) (select (select (store .cse6 .cse5 (store .cse7 .cse4 v_prenex_19)) .cse8) .cse4)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse117 .cse3)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse117 (+ v_prenex_18 4))) (= .cse4 v_prenex_18))))) (.cse25 (or (forall ((v_ArrVal_977 (Array Int Int)) (v_arrayElimCell_110 Int) (v_ArrVal_975 Int) (v_ArrVal_973 (Array Int Int))) (let ((.cse116 (select (select (store .cse6 .cse5 (store .cse7 v_arrayElimCell_110 v_ArrVal_975)) .cse8) .cse4))) (or (= .cse116 .cse8) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#0| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_973) .cse5 v_ArrVal_977) .cse116) .cse3)) (not (= .cse14 (select .cse15 v_arrayElimCell_110)))))) .cse32 .cse34)) (.cse63 (or .cse32 .cse34 (and .cse42 .cse43))) (.cse19 (and .cse38 .cse0 .cse12)) (.cse24 (forall ((v_prenex_18 Int) (v_prenex_20 (Array Int Int)) (v_prenex_19 Int) (v_prenex_17 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#0| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_prenex_20) .cse5 v_prenex_17) (select (select (store .cse6 .cse5 (store .cse7 .cse4 v_prenex_19)) .cse8) .cse4)) (+ v_prenex_18 4))) (= .cse4 v_prenex_18)))) (.cse9 (not (= .cse14 (select .cse15 .cse4)))) (.cse10 (not .cse22)) (.cse54 (forall ((v_arrayElimCell_110 Int)) (or (not (= .cse14 (select .cse15 v_arrayElimCell_110))) (forall ((v_prenex_18 Int)) (or (forall ((v_prenex_20 (Array Int Int)) (v_prenex_19 Int) (v_prenex_17 (Array Int Int))) (let ((.cse115 (select (store (store |c_#memory_int#0| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_prenex_20) .cse5 v_prenex_17) (select (select (store .cse6 .cse5 (store .cse7 v_arrayElimCell_110 v_prenex_19)) .cse8) .cse4)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse115 .cse3)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse115 (+ v_prenex_18 4)))))) (= .cse4 v_prenex_18)))))) (.cse44 (forall ((v_arrayElimCell_110 Int)) (or (not (= .cse14 (select .cse15 v_arrayElimCell_110))) (forall ((v_prenex_18 Int) (v_prenex_20 (Array Int Int)) (v_prenex_19 Int) (v_prenex_17 (Array Int Int))) (let ((.cse114 (select (store (store |c_#memory_int#0| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_prenex_20) .cse5 v_prenex_17) (select (select (store .cse6 .cse5 (store .cse7 v_arrayElimCell_110 v_prenex_19)) .cse8) .cse4)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse114 .cse3)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse114 (+ v_prenex_18 4))))))))) (.cse46 (forall ((v_arrayElimCell_110 Int)) (or (not (= .cse14 (select .cse15 v_arrayElimCell_110))) (forall ((v_prenex_20 (Array Int Int)) (v_prenex_19 Int) (v_prenex_17 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#0| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_prenex_20) .cse5 v_prenex_17) (select (select (store .cse6 .cse5 (store .cse7 v_arrayElimCell_110 v_prenex_19)) .cse8) .cse4)) .cse3)))))) (.cse39 (forall ((v_prenex_20 (Array Int Int)) (v_arrayElimCell_110 Int) (v_prenex_19 Int) (v_prenex_17 (Array Int Int))) (or (not (= .cse14 (select .cse15 v_arrayElimCell_110))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#0| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_prenex_20) .cse5 v_prenex_17) (select (select (store .cse6 .cse5 (store .cse7 v_arrayElimCell_110 v_prenex_19)) .cse8) .cse4)) .cse3))))) (.cse103 (or (forall ((v_prenex_18 Int) (v_prenex_20 (Array Int Int)) (v_prenex_19 Int) (v_prenex_17 (Array Int Int))) (or (= .cse56 v_prenex_18) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#0| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_prenex_20) .cse5 v_prenex_17) (select (select (store .cse6 .cse5 (store .cse7 .cse56 v_prenex_19)) .cse8) .cse4)) (+ v_prenex_18 4))))) (not (= .cse14 (select .cse15 .cse56))) .cse58))) (let ((.cse11 (and .cse103 (forall ((v_prenex_20 (Array Int Int)) (v_arrayElimCell_110 Int) (v_prenex_19 Int) (v_prenex_17 (Array Int Int))) (or (not (= .cse14 (select .cse15 v_arrayElimCell_110))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#0| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_prenex_20) .cse5 v_prenex_17) (select (select (store .cse6 .cse5 (store .cse7 v_arrayElimCell_110 v_prenex_19)) .cse8) .cse4)) (+ v_arrayElimCell_110 4))) (= .cse56 v_arrayElimCell_110))) (or (forall ((v_prenex_18 Int) (v_prenex_20 (Array Int Int)) (v_arrayElimCell_110 Int) (v_prenex_19 Int) (v_prenex_17 (Array Int Int))) (let ((.cse112 (select (store (store |c_#memory_int#0| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_prenex_20) .cse5 v_prenex_17) (select (select (store .cse6 .cse5 (store .cse7 v_arrayElimCell_110 v_prenex_19)) .cse8) .cse4)))) (or (= .cse56 v_prenex_18) (not (= .cse14 (select .cse15 v_arrayElimCell_110))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse112 (+ v_arrayElimCell_110 4))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse112 (+ v_prenex_18 4)))))) .cse58) (forall ((v_prenex_18 Int)) (or (= .cse56 v_prenex_18) (forall ((v_prenex_20 (Array Int Int)) (v_arrayElimCell_110 Int) (v_prenex_19 Int) (v_prenex_17 (Array Int Int))) (let ((.cse113 (select (store (store |c_#memory_int#0| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_prenex_20) .cse5 v_prenex_17) (select (select (store .cse6 .cse5 (store .cse7 v_arrayElimCell_110 v_prenex_19)) .cse8) .cse4)))) (or (not (= .cse14 (select .cse15 v_arrayElimCell_110))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse113 (+ v_arrayElimCell_110 4))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse113 (+ v_prenex_18 4))) (= .cse56 v_arrayElimCell_110)))))))) (.cse21 (forall ((v_ArrVal_977 (Array Int Int)) (v_arrayElimCell_110 Int) (v_ArrVal_978 Int) (v_ArrVal_975 Int) (v_ArrVal_973 (Array Int Int))) (let ((.cse111 (store .cse6 .cse5 (store .cse7 v_arrayElimCell_110 v_ArrVal_975)))) (let ((.cse110 (select (store (store |c_#memory_int#0| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_973) .cse5 v_ArrVal_977) (select (select .cse111 .cse8) .cse4)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse110 (+ v_ArrVal_978 4))) (not (= .cse14 (select .cse15 v_arrayElimCell_110))) (= .cse29 (select (select .cse111 .cse29) .cse4)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse110 (+ v_arrayElimCell_110 4)))))))) (.cse13 (let ((.cse67 (forall ((v_prenex_18 Int) (v_prenex_20 (Array Int Int)) (v_arrayElimCell_111 Int) (v_arrayElimCell_110 Int) (v_prenex_19 Int) (v_prenex_17 (Array Int Int))) (let ((.cse109 (select (store (store |c_#memory_int#0| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_prenex_20) .cse5 v_prenex_17) (select (select (store .cse6 .cse5 (store .cse7 v_arrayElimCell_110 v_prenex_19)) .cse8) .cse4)))) (or (= .cse56 v_arrayElimCell_111) (= .cse56 v_prenex_18) (not (= .cse14 (select .cse15 v_arrayElimCell_110))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse109 .cse3)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse109 (+ v_prenex_18 4))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse109 (+ v_arrayElimCell_111 4))))))) (.cse82 (forall ((v_ArrVal_977 (Array Int Int)) (v_arrayElimCell_111 Int) (v_arrayElimCell_110 Int) (v_ArrVal_975 Int) (v_ArrVal_973 (Array Int Int))) (let ((.cse108 (store .cse6 .cse5 (store .cse7 v_arrayElimCell_110 v_ArrVal_975)))) (or (not (= .cse14 (select .cse15 v_arrayElimCell_110))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#0| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_973) .cse5 v_ArrVal_977) (select (select .cse108 .cse8) .cse4)) (+ v_arrayElimCell_111 4))) (= .cse29 (select (select .cse108 .cse29) .cse4)) (= .cse56 v_arrayElimCell_110))))) (.cse72 (forall ((v_ArrVal_977 (Array Int Int)) (v_arrayElimCell_111 Int) (v_arrayElimCell_110 Int) (v_ArrVal_978 Int) (v_ArrVal_975 Int) (v_ArrVal_973 (Array Int Int))) (let ((.cse107 (store .cse6 .cse5 (store .cse7 v_arrayElimCell_110 v_ArrVal_975)))) (let ((.cse106 (select (store (store |c_#memory_int#0| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_973) .cse5 v_ArrVal_977) (select (select .cse107 .cse8) .cse4)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse106 (+ v_ArrVal_978 4))) (not (= .cse14 (select .cse15 v_arrayElimCell_110))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse106 (+ v_arrayElimCell_111 4))) (= .cse29 (select (select .cse107 .cse29) .cse4))))))) (.cse89 (and .cse103 (forall ((v_arrayElimCell_110 Int)) (or (not (= .cse14 (select .cse15 v_arrayElimCell_110))) (forall ((v_arrayElimCell_111 Int)) (or (= .cse56 v_arrayElimCell_111) (forall ((v_prenex_18 Int)) (or (= .cse56 v_prenex_18) (forall ((v_prenex_20 (Array Int Int)) (v_prenex_19 Int) (v_prenex_17 (Array Int Int))) (let ((.cse104 (select (store (store |c_#memory_int#0| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_prenex_20) .cse5 v_prenex_17) (select (select (store .cse6 .cse5 (store .cse7 v_arrayElimCell_110 v_prenex_19)) .cse8) .cse4)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse104 (+ v_prenex_18 4))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse104 (+ v_arrayElimCell_111 4)))))))))))) (forall ((v_arrayElimCell_110 Int)) (or (not (= .cse14 (select .cse15 v_arrayElimCell_110))) (forall ((v_prenex_20 (Array Int Int)) (v_arrayElimCell_111 Int) (v_prenex_19 Int) (v_prenex_17 (Array Int Int))) (or (= .cse56 v_arrayElimCell_111) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#0| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_prenex_20) .cse5 v_prenex_17) (select (select (store .cse6 .cse5 (store .cse7 v_arrayElimCell_110 v_prenex_19)) .cse8) .cse4)) (+ v_arrayElimCell_111 4))))) (= .cse56 v_arrayElimCell_110))) (or (forall ((v_prenex_20 (Array Int Int)) (v_arrayElimCell_111 Int) (v_arrayElimCell_110 Int) (v_prenex_19 Int) (v_prenex_17 (Array Int Int))) (or (= .cse56 v_arrayElimCell_111) (not (= .cse14 (select .cse15 v_arrayElimCell_110))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#0| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_prenex_20) .cse5 v_prenex_17) (select (select (store .cse6 .cse5 (store .cse7 v_arrayElimCell_110 v_prenex_19)) .cse8) .cse4)) (+ v_arrayElimCell_111 4))))) .cse105))) (.cse73 (forall ((v_prenex_18 Int) (v_arrayElimCell_111 Int)) (or (forall ((v_prenex_20 (Array Int Int)) (v_prenex_19 Int) (v_prenex_17 (Array Int Int))) (let ((.cse102 (select (store (store |c_#memory_int#0| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_prenex_20) .cse5 v_prenex_17) (select (select (store .cse6 .cse5 (store .cse7 .cse4 v_prenex_19)) .cse8) .cse4)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse102 .cse3)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse102 (+ v_arrayElimCell_111 4))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse102 (+ v_prenex_18 4)))))) (= .cse4 v_prenex_18)))) (.cse75 (forall ((v_prenex_18 Int)) (or (forall ((v_prenex_20 (Array Int Int)) (v_prenex_19 Int) (v_prenex_17 (Array Int Int))) (let ((.cse101 (select (store (store |c_#memory_int#0| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_prenex_20) .cse5 v_prenex_17) (select (select (store .cse6 .cse5 (store .cse7 .cse4 v_prenex_19)) .cse8) .cse4)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse101 .cse3)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse101 (+ v_prenex_18 4)))))) (= .cse4 v_prenex_18)))) (.cse66 (or .cse39 .cse22))) (and (or .cse32 (and .cse54 .cse66 .cse42) .cse38 .cse34) (or .cse67 .cse0) (or .cse19 (let ((.cse69 (and (forall ((v_arrayElimCell_110 Int)) (or (not (= .cse14 (select .cse15 v_arrayElimCell_110))) (forall ((v_arrayElimCell_111 Int)) (or (= .cse56 v_arrayElimCell_111) (forall ((v_prenex_18 Int) (v_prenex_20 (Array Int Int)) (v_prenex_19 Int) (v_prenex_17 (Array Int Int))) (let ((.cse71 (select (store (store |c_#memory_int#0| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_prenex_20) .cse5 v_prenex_17) (select (select (store .cse6 .cse5 (store .cse7 v_arrayElimCell_110 v_prenex_19)) .cse8) .cse4)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse71 (+ v_prenex_18 4))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse71 (+ v_arrayElimCell_111 4)))))))))) (forall ((v_arrayElimCell_110 Int)) (or (not (= .cse14 (select .cse15 v_arrayElimCell_110))) (forall ((v_arrayElimCell_111 Int)) (or (= .cse56 v_arrayElimCell_111) (forall ((v_prenex_20 (Array Int Int)) (v_prenex_19 Int) (v_prenex_17 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#0| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_prenex_20) .cse5 v_prenex_17) (select (select (store .cse6 .cse5 (store .cse7 v_arrayElimCell_110 v_prenex_19)) .cse8) .cse4)) (+ v_arrayElimCell_111 4))))))))))) (and (forall ((v_arrayElimCell_110 Int)) (or (not (= .cse14 (select .cse15 v_arrayElimCell_110))) (forall ((v_arrayElimCell_111 Int)) (or (forall ((v_prenex_18 Int) (v_prenex_20 (Array Int Int)) (v_prenex_19 Int) (v_prenex_17 (Array Int Int))) (let ((.cse68 (select (store (store |c_#memory_int#0| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_prenex_20) .cse5 v_prenex_17) (select (select (store .cse6 .cse5 (store .cse7 v_arrayElimCell_110 v_prenex_19)) .cse8) .cse4)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse68 .cse3)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse68 (+ v_prenex_18 4))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse68 (+ v_arrayElimCell_111 4)))))) (= .cse4 v_arrayElimCell_111))))) (or .cse69 .cse12) (or .cse32 (and .cse44 .cse46) .cse34) (forall ((v_arrayElimCell_110 Int)) (or (forall ((v_arrayElimCell_111 Int)) (or (forall ((v_prenex_20 (Array Int Int)) (v_prenex_19 Int) (v_prenex_17 (Array Int Int))) (let ((.cse70 (select (store (store |c_#memory_int#0| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_prenex_20) .cse5 v_prenex_17) (select (select (store .cse6 .cse5 (store .cse7 v_arrayElimCell_110 v_prenex_19)) .cse8) .cse4)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse70 .cse3)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse70 (+ v_arrayElimCell_111 4)))))) (= .cse4 v_arrayElimCell_111))) (not (= .cse14 (select .cse15 v_arrayElimCell_110))))) (or .cse69 .cse0))) .cse22) (or .cse72 .cse12) (or .cse9 .cse10 (let ((.cse74 (and (forall ((v_prenex_18 Int) (v_arrayElimCell_111 Int)) (or (= .cse56 v_prenex_18) (forall ((v_prenex_20 (Array Int Int)) (v_prenex_19 Int) (v_prenex_17 (Array Int Int))) (let ((.cse76 (select (store (store |c_#memory_int#0| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_prenex_20) .cse5 v_prenex_17) (select (select (store .cse6 .cse5 (store .cse7 .cse4 v_prenex_19)) .cse8) .cse4)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse76 (+ v_arrayElimCell_111 4))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse76 (+ v_prenex_18 4)))))))) (forall ((v_prenex_18 Int) (v_prenex_20 (Array Int Int)) (v_prenex_19 Int) (v_prenex_17 (Array Int Int))) (or (= .cse56 v_prenex_18) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#0| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_prenex_20) .cse5 v_prenex_17) (select (select (store .cse6 .cse5 (store .cse7 .cse4 v_prenex_19)) .cse8) .cse4)) (+ v_prenex_18 4)))))))) (and .cse73 (or .cse0 .cse74) .cse24 (or .cse74 .cse12) (or .cse32 .cse75 .cse34) .cse55))) (or .cse67 .cse12) (or (let ((.cse79 (forall ((v_ArrVal_977 (Array Int Int)) (v_arrayElimCell_111 Int) (v_arrayElimCell_110 Int) (v_ArrVal_975 Int) (v_ArrVal_973 (Array Int Int))) (let ((.cse80 (store .cse6 .cse5 (store .cse7 v_arrayElimCell_110 v_ArrVal_975)))) (or (not (= .cse14 (select .cse15 v_arrayElimCell_110))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#0| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_973) .cse5 v_ArrVal_977) (select (select .cse80 .cse8) .cse4)) (+ v_arrayElimCell_111 4))) (= .cse29 (select (select .cse80 .cse29) .cse4))))))) (and .cse25 (forall ((v_arrayElimCell_110 Int)) (or (forall ((v_arrayElimCell_111 Int) (v_ArrVal_975 Int)) (let ((.cse77 (select (select (store .cse6 .cse5 (store .cse7 v_arrayElimCell_110 v_ArrVal_975)) .cse8) .cse4))) (or (= .cse77 .cse8) (forall ((v_ArrVal_977 (Array Int Int)) (v_ArrVal_973 (Array Int Int))) (let ((.cse78 (select (store (store |c_#memory_int#0| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_973) .cse5 v_ArrVal_977) .cse77))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse78 .cse3)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse78 (+ v_arrayElimCell_111 4))))))))) (not (= .cse14 (select .cse15 v_arrayElimCell_110))))) (or .cse79 .cse0) (or .cse79 .cse12))) .cse22) (or .cse19 (forall ((v_prenex_20 (Array Int Int)) (v_arrayElimCell_111 Int) (v_arrayElimCell_110 Int) (v_prenex_19 Int) (v_prenex_17 (Array Int Int))) (let ((.cse81 (select (store (store |c_#memory_int#0| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_prenex_20) .cse5 v_prenex_17) (select (select (store .cse6 .cse5 (store .cse7 v_arrayElimCell_110 v_prenex_19)) .cse8) .cse4)))) (or (not (= .cse14 (select .cse15 v_arrayElimCell_110))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse81 .cse3)) (= .cse4 v_arrayElimCell_110) (= .cse4 v_arrayElimCell_111) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse81 (+ v_arrayElimCell_111 4))))))) (or .cse82 .cse12) (or .cse82 .cse0) (or .cse72 .cse0) (forall ((v_arrayElimCell_110 Int)) (or (forall ((v_arrayElimCell_111 Int) (v_ArrVal_975 Int)) (let ((.cse83 (select (select (store .cse6 .cse5 (store .cse7 v_arrayElimCell_110 v_ArrVal_975)) .cse8) .cse4))) (or (= .cse83 .cse8) (forall ((v_ArrVal_977 (Array Int Int)) (v_ArrVal_978 Int) (v_ArrVal_973 (Array Int Int))) (let ((.cse84 (select (store (store |c_#memory_int#0| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_973) .cse5 v_ArrVal_977) .cse83))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse84 (+ v_ArrVal_978 4))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse84 .cse3)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse84 (+ v_arrayElimCell_111 4))))))))) (not (= .cse14 (select .cse15 v_arrayElimCell_110))))) (or .cse19 (let ((.cse85 (and (forall ((v_arrayElimCell_110 Int)) (or (not (= .cse14 (select .cse15 v_arrayElimCell_110))) (forall ((v_arrayElimCell_111 Int)) (or (= .cse56 v_arrayElimCell_111) (forall ((v_prenex_20 (Array Int Int)) (v_prenex_19 Int) (v_prenex_17 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#0| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_prenex_20) .cse5 v_prenex_17) (select (select (store .cse6 .cse5 (store .cse7 v_arrayElimCell_110 v_prenex_19)) .cse8) .cse4)) (+ v_arrayElimCell_111 4)))))) (= .cse56 v_arrayElimCell_110))) (forall ((v_arrayElimCell_110 Int)) (or (not (= .cse14 (select .cse15 v_arrayElimCell_110))) (forall ((v_arrayElimCell_111 Int)) (or (= .cse56 v_arrayElimCell_111) (forall ((v_prenex_18 Int) (v_prenex_20 (Array Int Int)) (v_prenex_19 Int) (v_prenex_17 (Array Int Int))) (let ((.cse88 (select (store (store |c_#memory_int#0| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_prenex_20) .cse5 v_prenex_17) (select (select (store .cse6 .cse5 (store .cse7 v_arrayElimCell_110 v_prenex_19)) .cse8) .cse4)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse88 (+ v_prenex_18 4))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse88 (+ v_arrayElimCell_111 4)))))))) (= .cse56 v_arrayElimCell_110)))))) (and (or .cse85 .cse0) (or .cse85 .cse12) (forall ((v_arrayElimCell_110 Int)) (or (forall ((v_arrayElimCell_111 Int)) (or (forall ((v_prenex_20 (Array Int Int)) (v_prenex_19 Int) (v_prenex_17 (Array Int Int))) (let ((.cse86 (select (store (store |c_#memory_int#0| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_prenex_20) .cse5 v_prenex_17) (select (select (store .cse6 .cse5 (store .cse7 v_arrayElimCell_110 v_prenex_19)) .cse8) .cse4)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse86 .cse3)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse86 (+ v_arrayElimCell_111 4)))))) (= .cse4 v_arrayElimCell_111))) (not (= .cse14 (select .cse15 v_arrayElimCell_110))) (= .cse4 v_arrayElimCell_110))) (forall ((v_arrayElimCell_110 Int)) (or (not (= .cse14 (select .cse15 v_arrayElimCell_110))) (= .cse4 v_arrayElimCell_110) (forall ((v_arrayElimCell_111 Int)) (or (forall ((v_prenex_18 Int) (v_prenex_20 (Array Int Int)) (v_prenex_19 Int) (v_prenex_17 (Array Int Int))) (let ((.cse87 (select (store (store |c_#memory_int#0| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_prenex_20) .cse5 v_prenex_17) (select (select (store .cse6 .cse5 (store .cse7 v_arrayElimCell_110 v_prenex_19)) .cse8) .cse4)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse87 .cse3)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse87 (+ v_prenex_18 4))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse87 (+ v_arrayElimCell_111 4)))))) (= .cse4 v_arrayElimCell_111))))) .cse63))) (or .cse89 .cse12) (or (forall ((v_prenex_18 Int) (v_prenex_20 (Array Int Int)) (v_arrayElimCell_111 Int) (v_arrayElimCell_110 Int) (v_prenex_19 Int) (v_prenex_17 (Array Int Int))) (let ((.cse90 (select (store (store |c_#memory_int#0| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_prenex_20) .cse5 v_prenex_17) (select (select (store .cse6 .cse5 (store .cse7 v_arrayElimCell_110 v_prenex_19)) .cse8) .cse4)))) (or (not (= .cse14 (select .cse15 v_arrayElimCell_110))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse90 .cse3)) (= .cse4 v_arrayElimCell_111) (= .cse4 v_prenex_18) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse90 (+ v_prenex_18 4))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse90 (+ v_arrayElimCell_111 4)))))) .cse38) (forall ((v_arrayElimCell_110 Int)) (or (forall ((v_arrayElimCell_111 Int) (v_ArrVal_975 Int)) (let ((.cse91 (select (select (store .cse6 .cse5 (store .cse7 v_arrayElimCell_110 v_ArrVal_975)) .cse8) .cse4))) (or (= .cse91 .cse8) (forall ((v_ArrVal_977 (Array Int Int)) (v_ArrVal_973 (Array Int Int))) (let ((.cse92 (select (store (store |c_#memory_int#0| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_973) .cse5 v_ArrVal_977) .cse91))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse92 .cse3)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse92 (+ v_arrayElimCell_111 4))))))))) (not (= .cse14 (select .cse15 v_arrayElimCell_110))) (= .cse4 v_arrayElimCell_110))) (or (forall ((v_prenex_20 (Array Int Int)) (v_arrayElimCell_111 Int) (v_arrayElimCell_110 Int) (v_prenex_19 Int) (v_prenex_17 (Array Int Int))) (let ((.cse93 (select (store (store |c_#memory_int#0| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_prenex_20) .cse5 v_prenex_17) (select (select (store .cse6 .cse5 (store .cse7 v_arrayElimCell_110 v_prenex_19)) .cse8) .cse4)))) (or (not (= .cse14 (select .cse15 v_arrayElimCell_110))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse93 .cse3)) (= .cse4 v_arrayElimCell_111) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse93 (+ v_arrayElimCell_111 4)))))) .cse19 .cse22) (or .cse89 .cse0) (or .cse9 .cse10 (forall ((v_prenex_18 Int) (v_prenex_20 (Array Int Int)) (v_arrayElimCell_111 Int) (v_prenex_19 Int) (v_prenex_17 (Array Int Int))) (let ((.cse94 (select (store (store |c_#memory_int#0| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_prenex_20) .cse5 v_prenex_17) (select (select (store .cse6 .cse5 (store .cse7 .cse4 v_prenex_19)) .cse8) .cse4)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse94 .cse3)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse94 (+ v_arrayElimCell_111 4))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse94 (+ v_prenex_18 4))) (= .cse4 v_arrayElimCell_111) (= .cse4 v_prenex_18))))) (or .cse32 .cse34 (and (or (and .cse73 .cse24 .cse75) .cse9 .cse10) (or (and .cse54 (or (and .cse44 (forall ((v_arrayElimCell_110 Int)) (or (not (= .cse14 (select .cse15 v_arrayElimCell_110))) (forall ((v_prenex_18 Int) (v_prenex_20 (Array Int Int)) (v_arrayElimCell_111 Int) (v_prenex_19 Int) (v_prenex_17 (Array Int Int))) (let ((.cse95 (select (store (store |c_#memory_int#0| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_prenex_20) .cse5 v_prenex_17) (select (select (store .cse6 .cse5 (store .cse7 v_arrayElimCell_110 v_prenex_19)) .cse8) .cse4)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse95 .cse3)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse95 (+ v_prenex_18 4))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse95 (+ v_arrayElimCell_111 4)))))))) .cse46 (forall ((v_arrayElimCell_110 Int)) (or (not (= .cse14 (select .cse15 v_arrayElimCell_110))) (forall ((v_prenex_20 (Array Int Int)) (v_arrayElimCell_111 Int) (v_prenex_19 Int) (v_prenex_17 (Array Int Int))) (let ((.cse96 (select (store (store |c_#memory_int#0| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_prenex_20) .cse5 v_prenex_17) (select (select (store .cse6 .cse5 (store .cse7 v_arrayElimCell_110 v_prenex_19)) .cse8) .cse4)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse96 .cse3)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse96 (+ v_arrayElimCell_111 4))))))))) .cse22) .cse66 (forall ((v_arrayElimCell_110 Int)) (or (not (= .cse14 (select .cse15 v_arrayElimCell_110))) (forall ((v_prenex_20 (Array Int Int)) (v_arrayElimCell_111 Int) (v_prenex_19 Int) (v_prenex_17 (Array Int Int))) (let ((.cse97 (select (store (store |c_#memory_int#0| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_prenex_20) .cse5 v_prenex_17) (select (select (store .cse6 .cse5 (store .cse7 v_arrayElimCell_110 v_prenex_19)) .cse8) .cse4)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse97 .cse3)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse97 (+ v_arrayElimCell_111 4)))))) (= .cse4 v_arrayElimCell_110))) .cse42 (or (forall ((v_prenex_20 (Array Int Int)) (v_arrayElimCell_111 Int) (v_arrayElimCell_110 Int) (v_prenex_19 Int) (v_prenex_17 (Array Int Int))) (let ((.cse98 (select (store (store |c_#memory_int#0| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_prenex_20) .cse5 v_prenex_17) (select (select (store .cse6 .cse5 (store .cse7 v_arrayElimCell_110 v_prenex_19)) .cse8) .cse4)))) (or (not (= .cse14 (select .cse15 v_arrayElimCell_110))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse98 .cse3)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse98 (+ v_arrayElimCell_111 4)))))) .cse22) .cse43 (forall ((v_arrayElimCell_110 Int)) (or (not (= .cse14 (select .cse15 v_arrayElimCell_110))) (forall ((v_prenex_18 Int) (v_arrayElimCell_111 Int)) (or (= .cse4 v_prenex_18) (forall ((v_prenex_20 (Array Int Int)) (v_prenex_19 Int) (v_prenex_17 (Array Int Int))) (let ((.cse99 (select (store (store |c_#memory_int#0| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_prenex_20) .cse5 v_prenex_17) (select (select (store .cse6 .cse5 (store .cse7 v_arrayElimCell_110 v_prenex_19)) .cse8) .cse4)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse99 .cse3)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse99 (+ v_prenex_18 4))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse99 (+ v_arrayElimCell_111 4)))))))))) (forall ((v_arrayElimCell_110 Int)) (or (not (= .cse14 (select .cse15 v_arrayElimCell_110))) (forall ((v_prenex_18 Int) (v_prenex_20 (Array Int Int)) (v_arrayElimCell_111 Int) (v_prenex_19 Int) (v_prenex_17 (Array Int Int))) (let ((.cse100 (select (store (store |c_#memory_int#0| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_prenex_20) .cse5 v_prenex_17) (select (select (store .cse6 .cse5 (store .cse7 v_arrayElimCell_110 v_prenex_19)) .cse8) .cse4)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse100 .cse3)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse100 (+ v_prenex_18 4))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse100 (+ v_arrayElimCell_111 4)))))) (= .cse4 v_arrayElimCell_110)))) .cse38)))))) (.cse20 (forall ((v_prenex_20 (Array Int Int)) (v_arrayElimCell_110 Int) (v_prenex_19 Int) (v_prenex_17 (Array Int Int))) (let ((.cse65 (select (store (store |c_#memory_int#0| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_prenex_20) .cse5 v_prenex_17) (select (select (store .cse6 .cse5 (store .cse7 v_arrayElimCell_110 v_prenex_19)) .cse8) .cse4)))) (or (not (= .cse14 (select .cse15 v_arrayElimCell_110))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse65 .cse3)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse65 (+ v_arrayElimCell_110 4))) (= .cse4 v_arrayElimCell_110))))) (.cse18 (let ((.cse62 (and (forall ((v_arrayElimCell_110 Int)) (or (forall ((v_prenex_20 (Array Int Int)) (v_prenex_19 Int) (v_prenex_17 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#0| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_prenex_20) .cse5 v_prenex_17) (select (select (store .cse6 .cse5 (store .cse7 v_arrayElimCell_110 v_prenex_19)) .cse8) .cse4)) (+ v_arrayElimCell_110 4)))) (not (= .cse14 (select .cse15 v_arrayElimCell_110))) (= .cse56 v_arrayElimCell_110))) (forall ((v_arrayElimCell_110 Int)) (or (not (= .cse14 (select .cse15 v_arrayElimCell_110))) (forall ((v_prenex_18 Int) (v_prenex_20 (Array Int Int)) (v_prenex_19 Int) (v_prenex_17 (Array Int Int))) (let ((.cse64 (select (store (store |c_#memory_int#0| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_prenex_20) .cse5 v_prenex_17) (select (select (store .cse6 .cse5 (store .cse7 v_arrayElimCell_110 v_prenex_19)) .cse8) .cse4)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse64 (+ v_arrayElimCell_110 4))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse64 (+ v_prenex_18 4)))))) (= .cse56 v_arrayElimCell_110)))))) (and .cse40 (or .cse62 .cse0) (or .cse62 .cse12) .cse41 .cse63))) (.cse1 (forall ((v_ArrVal_977 (Array Int Int)) (v_arrayElimCell_110 Int) (v_ArrVal_975 Int) (v_ArrVal_973 (Array Int Int))) (let ((.cse61 (store .cse6 .cse5 (store .cse7 v_arrayElimCell_110 v_ArrVal_975)))) (or (not (= .cse14 (select .cse15 v_arrayElimCell_110))) (= .cse29 (select (select .cse61 .cse29) .cse4)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#0| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_973) .cse5 v_ArrVal_977) (select (select .cse61 .cse8) .cse4)) (+ v_arrayElimCell_110 4))) (= .cse56 v_arrayElimCell_110))))) (.cse49 (forall ((v_prenex_18 Int) (v_prenex_20 (Array Int Int)) (v_arrayElimCell_110 Int) (v_prenex_19 Int) (v_prenex_17 (Array Int Int))) (let ((.cse60 (select (store (store |c_#memory_int#0| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_prenex_20) .cse5 v_prenex_17) (select (select (store .cse6 .cse5 (store .cse7 v_arrayElimCell_110 v_prenex_19)) .cse8) .cse4)))) (or (not (= .cse14 (select .cse15 v_arrayElimCell_110))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse60 .cse3)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse60 (+ v_arrayElimCell_110 4))) (= .cse4 v_prenex_18) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse60 (+ v_prenex_18 4))))))) (.cse23 (and (or (forall ((v_prenex_18 Int) (v_prenex_20 (Array Int Int)) (v_arrayElimCell_110 Int) (v_prenex_19 Int) (v_prenex_17 (Array Int Int))) (let ((.cse57 (select (store (store |c_#memory_int#0| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_prenex_20) .cse5 v_prenex_17) (select (select (store .cse6 .cse5 (store .cse7 v_arrayElimCell_110 v_prenex_19)) .cse8) .cse4)))) (or (= .cse56 v_prenex_18) (not (= .cse14 (select .cse15 v_arrayElimCell_110))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse57 .cse3)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse57 (+ v_arrayElimCell_110 4))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse57 (+ v_prenex_18 4)))))) .cse58) (forall ((v_prenex_18 Int)) (or (= .cse56 v_prenex_18) (forall ((v_prenex_20 (Array Int Int)) (v_arrayElimCell_110 Int) (v_prenex_19 Int) (v_prenex_17 (Array Int Int))) (let ((.cse59 (select (store (store |c_#memory_int#0| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_prenex_20) .cse5 v_prenex_17) (select (select (store .cse6 .cse5 (store .cse7 v_arrayElimCell_110 v_prenex_19)) .cse8) .cse4)))) (or (not (= .cse14 (select .cse15 v_arrayElimCell_110))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse59 .cse3)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse59 (+ v_arrayElimCell_110 4))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse59 (+ v_prenex_18 4))) (= .cse56 v_arrayElimCell_110))))))))) (and (or .cse0 .cse1) (or (forall ((v_prenex_18 Int) (v_prenex_20 (Array Int Int)) (v_prenex_19 Int) (v_prenex_17 (Array Int Int))) (let ((.cse2 (select (store (store |c_#memory_int#0| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_prenex_20) .cse5 v_prenex_17) (select (select (store .cse6 .cse5 (store .cse7 .cse4 v_prenex_19)) .cse8) .cse4)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse2 .cse3)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse2 (+ .cse4 4))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse2 (+ v_prenex_18 4))) (= .cse4 v_prenex_18)))) .cse9 .cse10) (or .cse11 .cse12) (or (= .cse4 |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset|) .cse13) (forall ((v_arrayElimCell_110 Int)) (or (not (= .cse14 (select .cse15 v_arrayElimCell_110))) (forall ((v_ArrVal_975 Int)) (let ((.cse16 (select (select (store .cse6 .cse5 (store .cse7 v_arrayElimCell_110 v_ArrVal_975)) .cse8) .cse4))) (or (= .cse16 .cse8) (forall ((v_ArrVal_977 (Array Int Int)) (v_ArrVal_978 Int) (v_ArrVal_973 (Array Int Int))) (let ((.cse17 (select (store (store |c_#memory_int#0| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_973) .cse5 v_ArrVal_977) .cse16))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse17 (+ v_ArrVal_978 4))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse17 .cse3)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse17 (+ v_arrayElimCell_110 4))))))))))) (or .cse18 .cse19) (or .cse11 .cse0) (or .cse19 .cse20) (or .cse21 .cse12) (or .cse19 .cse20 .cse22) (or .cse23 .cse12) (or .cse24 .cse9 .cse10) (or (let ((.cse28 (forall ((v_ArrVal_977 (Array Int Int)) (v_arrayElimCell_110 Int) (v_ArrVal_975 Int) (v_ArrVal_973 (Array Int Int))) (let ((.cse30 (store .cse6 .cse5 (store .cse7 v_arrayElimCell_110 v_ArrVal_975)))) (or (not (= .cse14 (select .cse15 v_arrayElimCell_110))) (= .cse29 (select (select .cse30 .cse29) .cse4)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#0| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_973) .cse5 v_ArrVal_977) (select (select .cse30 .cse8) .cse4)) (+ v_arrayElimCell_110 4)))))))) (and .cse25 (forall ((v_arrayElimCell_110 Int)) (or (not (= .cse14 (select .cse15 v_arrayElimCell_110))) (forall ((v_ArrVal_975 Int)) (let ((.cse27 (select (select (store .cse6 .cse5 (store .cse7 v_arrayElimCell_110 v_ArrVal_975)) .cse8) .cse4))) (or (forall ((v_ArrVal_977 (Array Int Int)) (v_ArrVal_973 (Array Int Int))) (let ((.cse26 (select (store (store |c_#memory_int#0| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_973) .cse5 v_ArrVal_977) .cse27))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse26 .cse3)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse26 (+ v_arrayElimCell_110 4)))))) (= .cse27 .cse8)))))) (or .cse28 .cse12) (or .cse28 .cse0))) .cse22) (or .cse21 .cse0) (or (forall ((v_ArrVal_977 (Array Int Int)) (v_ArrVal_978 Int) (v_ArrVal_975 Int) (v_ArrVal_973 (Array Int Int))) (let ((.cse31 (select (select (store .cse6 .cse5 (store .cse7 .cse4 v_ArrVal_975)) .cse8) .cse4))) (or (= .cse31 .cse8) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#0| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_973) .cse5 v_ArrVal_977) .cse31) (+ v_ArrVal_978 4)))))) .cse9 .cse10) (or .cse32 (forall ((v_ArrVal_977 (Array Int Int)) (v_arrayElimCell_110 Int) (v_ArrVal_975 Int) (v_ArrVal_973 (Array Int Int))) (let ((.cse33 (select (select (store .cse6 .cse5 (store .cse7 v_arrayElimCell_110 v_ArrVal_975)) .cse8) .cse4))) (or (= .cse33 .cse8) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#0| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_973) .cse5 v_ArrVal_977) .cse33) .cse3)) (not (= .cse14 (select .cse15 v_arrayElimCell_110))) (= .cse4 v_arrayElimCell_110)))) .cse34) (or (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| .cse8) .cse13) (forall ((v_arrayElimCell_110 Int)) (or (not (= .cse14 (select .cse15 v_arrayElimCell_110))) (= .cse4 v_arrayElimCell_110) (forall ((v_ArrVal_975 Int)) (let ((.cse36 (select (select (store .cse6 .cse5 (store .cse7 v_arrayElimCell_110 v_ArrVal_975)) .cse8) .cse4))) (or (forall ((v_ArrVal_977 (Array Int Int)) (v_ArrVal_973 (Array Int Int))) (let ((.cse35 (select (store (store |c_#memory_int#0| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_973) .cse5 v_ArrVal_977) .cse36))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse35 .cse3)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse35 (+ v_arrayElimCell_110 4)))))) (= .cse36 .cse8)))))) (or .cse32 (and (or (forall ((v_prenex_20 (Array Int Int)) (v_arrayElimCell_110 Int) (v_prenex_19 Int) (v_prenex_17 (Array Int Int))) (let ((.cse37 (select (store (store |c_#memory_int#0| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_prenex_20) .cse5 v_prenex_17) (select (select (store .cse6 .cse5 (store .cse7 v_arrayElimCell_110 v_prenex_19)) .cse8) .cse4)))) (or (not (= .cse14 (select .cse15 v_arrayElimCell_110))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse37 .cse3)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse37 (+ v_arrayElimCell_110 4)))))) .cse38 .cse22) (or .cse38 .cse39 .cse22) (or .cse38 .cse20) (or (and .cse40 .cse41 .cse42 .cse43) .cse38) (or .cse38 (and .cse44 (forall ((v_arrayElimCell_110 Int)) (or (forall ((v_prenex_18 Int) (v_prenex_20 (Array Int Int)) (v_prenex_19 Int) (v_prenex_17 (Array Int Int))) (let ((.cse45 (select (store (store |c_#memory_int#0| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_prenex_20) .cse5 v_prenex_17) (select (select (store .cse6 .cse5 (store .cse7 v_arrayElimCell_110 v_prenex_19)) .cse8) .cse4)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse45 .cse3)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse45 (+ v_arrayElimCell_110 4))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse45 (+ v_prenex_18 4)))))) (not (= .cse14 (select .cse15 v_arrayElimCell_110))))) .cse46 (forall ((v_arrayElimCell_110 Int)) (or (not (= .cse14 (select .cse15 v_arrayElimCell_110))) (forall ((v_prenex_20 (Array Int Int)) (v_prenex_19 Int) (v_prenex_17 (Array Int Int))) (let ((.cse47 (select (store (store |c_#memory_int#0| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_prenex_20) .cse5 v_prenex_17) (select (select (store .cse6 .cse5 (store .cse7 v_arrayElimCell_110 v_prenex_19)) .cse8) .cse4)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse47 .cse3)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse47 (+ v_arrayElimCell_110 4))))))))) .cse22) (or .cse38 (forall ((v_prenex_18 Int) (v_prenex_20 (Array Int Int)) (v_arrayElimCell_110 Int) (v_prenex_19 Int) (v_prenex_17 (Array Int Int))) (let ((.cse48 (select (store (store |c_#memory_int#0| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_prenex_20) .cse5 v_prenex_17) (select (select (store .cse6 .cse5 (store .cse7 v_arrayElimCell_110 v_prenex_19)) .cse8) .cse4)))) (or (not (= .cse14 (select .cse15 v_arrayElimCell_110))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse48 .cse3)) (= .cse4 v_prenex_18) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse48 (+ v_prenex_18 4))))))) (or (forall ((v_prenex_20 (Array Int Int)) (v_arrayElimCell_110 Int) (v_prenex_19 Int) (v_prenex_17 (Array Int Int))) (or (not (= .cse14 (select .cse15 v_arrayElimCell_110))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#0| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_prenex_20) .cse5 v_prenex_17) (select (select (store .cse6 .cse5 (store .cse7 v_arrayElimCell_110 v_prenex_19)) .cse8) .cse4)) .cse3)) (= .cse4 v_arrayElimCell_110))) .cse38) (or .cse49 .cse38)) .cse34) (or .cse18 .cse19 .cse22) (or .cse12 .cse1) (or .cse38 (and (or .cse49 .cse10) (forall ((v_prenex_18 Int)) (or (forall ((v_prenex_20 (Array Int Int)) (v_arrayElimCell_110 Int) (v_prenex_19 Int) (v_prenex_17 (Array Int Int))) (let ((.cse50 (select (store (store |c_#memory_int#0| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_prenex_20) .cse5 v_prenex_17) (select (select (store .cse6 .cse5 (store .cse7 v_arrayElimCell_110 v_prenex_19)) .cse8) .cse4)))) (or (not (= .cse14 (select .cse15 v_arrayElimCell_110))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse50 .cse3)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse50 (+ v_arrayElimCell_110 4))) (= .cse4 v_arrayElimCell_110) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse50 (+ v_prenex_18 4)))))) (= .cse4 v_prenex_18))))) (or .cse23 .cse0) (or .cse32 .cse34 (forall ((v_ArrVal_977 (Array Int Int)) (v_arrayElimCell_110 Int) (v_ArrVal_978 Int) (v_ArrVal_975 Int) (v_ArrVal_973 (Array Int Int))) (let ((.cse52 (select (select (store .cse6 .cse5 (store .cse7 v_arrayElimCell_110 v_ArrVal_975)) .cse8) .cse4))) (let ((.cse51 (select (store (store |c_#memory_int#0| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_973) .cse5 v_ArrVal_977) .cse52))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse51 (+ v_ArrVal_978 4))) (= .cse52 .cse8) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse51 .cse3)) (not (= .cse14 (select .cse15 v_arrayElimCell_110)))))))) (or .cse32 .cse38 .cse34 (and (forall ((v_arrayElimCell_110 Int)) (or (not (= .cse14 (select .cse15 v_arrayElimCell_110))) (= .cse4 v_arrayElimCell_110) (forall ((v_prenex_18 Int)) (or (forall ((v_prenex_20 (Array Int Int)) (v_prenex_19 Int) (v_prenex_17 (Array Int Int))) (let ((.cse53 (select (store (store |c_#memory_int#0| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_prenex_20) .cse5 v_prenex_17) (select (select (store .cse6 .cse5 (store .cse7 v_arrayElimCell_110 v_prenex_19)) .cse8) .cse4)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse53 .cse3)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse53 (+ v_prenex_18 4)))))) (= .cse4 v_prenex_18))))) .cse42 (or .cse54 .cse10))) (or .cse9 .cse10 .cse55))))))))) is different from true Killed by 15