./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2n_prepend_equal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fca748b1 Calling Ultimate with: /root/.sdkman/candidates/java/current/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.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2n_prepend_equal.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e4cb0386e6b22b9d67dd4f4c4c33eb167dcf1836f99794e4424c5e73e6fc14d4 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-19 20:51:25,345 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 20:51:25,421 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-19 20:51:25,425 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 20:51:25,426 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 20:51:25,460 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 20:51:25,461 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 20:51:25,461 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 20:51:25,462 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 20:51:25,463 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 20:51:25,464 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 20:51:25,464 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 20:51:25,465 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 20:51:25,467 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 20:51:25,467 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 20:51:25,467 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 20:51:25,468 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 20:51:25,468 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 20:51:25,468 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 20:51:25,468 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 20:51:25,469 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 20:51:25,472 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 20:51:25,472 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 20:51:25,473 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 20:51:25,473 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 20:51:25,473 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 20:51:25,473 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 20:51:25,474 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 20:51:25,474 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 20:51:25,474 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 20:51:25,474 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 20:51:25,475 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 20:51:25,475 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 20:51:25,475 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 20:51:25,475 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 20:51:25,475 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 20:51:25,476 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 20:51:25,476 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 20:51:25,476 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 20:51:25,477 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 20:51:25,477 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 20:51:25,478 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 20:51:25,478 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 -> e4cb0386e6b22b9d67dd4f4c4c33eb167dcf1836f99794e4424c5e73e6fc14d4 [2024-11-19 20:51:25,707 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 20:51:25,731 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 20:51:25,733 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 20:51:25,734 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 20:51:25,735 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 20:51:25,736 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2n_prepend_equal.i [2024-11-19 20:51:27,193 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 20:51:27,399 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 20:51:27,400 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2n_prepend_equal.i [2024-11-19 20:51:27,410 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ea2906a54/b8dc18bca39342bfb548fcc1b388669e/FLAG3d5286519 [2024-11-19 20:51:27,757 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ea2906a54/b8dc18bca39342bfb548fcc1b388669e [2024-11-19 20:51:27,759 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 20:51:27,760 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 20:51:27,761 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 20:51:27,761 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 20:51:27,769 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 20:51:27,769 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 08:51:27" (1/1) ... [2024-11-19 20:51:27,770 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a09e46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:51:27, skipping insertion in model container [2024-11-19 20:51:27,770 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 08:51:27" (1/1) ... [2024-11-19 20:51:27,811 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 20:51:28,107 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2n_prepend_equal.i[24076,24089] [2024-11-19 20:51:28,111 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 20:51:28,119 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 20:51:28,160 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2n_prepend_equal.i[24076,24089] [2024-11-19 20:51:28,161 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 20:51:28,187 INFO L204 MainTranslator]: Completed translation [2024-11-19 20:51:28,188 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:51:28 WrapperNode [2024-11-19 20:51:28,188 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 20:51:28,189 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 20:51:28,189 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 20:51:28,189 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 20:51:28,195 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:51:28" (1/1) ... [2024-11-19 20:51:28,206 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:51:28" (1/1) ... [2024-11-19 20:51:28,232 INFO L138 Inliner]: procedures = 127, calls = 30, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 105 [2024-11-19 20:51:28,232 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 20:51:28,233 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 20:51:28,233 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 20:51:28,233 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 20:51:28,242 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:51:28" (1/1) ... [2024-11-19 20:51:28,243 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:51:28" (1/1) ... [2024-11-19 20:51:28,250 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:51:28" (1/1) ... [2024-11-19 20:51:28,271 INFO L175 MemorySlicer]: Split 14 memory accesses to 3 slices as follows [2, 5, 7]. 50 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1, 0]. The 5 writes are split as follows [0, 1, 4]. [2024-11-19 20:51:28,271 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:51:28" (1/1) ... [2024-11-19 20:51:28,272 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:51:28" (1/1) ... [2024-11-19 20:51:28,282 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:51:28" (1/1) ... [2024-11-19 20:51:28,285 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:51:28" (1/1) ... [2024-11-19 20:51:28,289 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:51:28" (1/1) ... [2024-11-19 20:51:28,291 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:51:28" (1/1) ... [2024-11-19 20:51:28,294 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 20:51:28,295 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 20:51:28,295 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 20:51:28,295 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 20:51:28,299 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:51:28" (1/1) ... [2024-11-19 20:51:28,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 20:51:28,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 20:51:28,337 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) [2024-11-19 20:51:28,341 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 [2024-11-19 20:51:28,398 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-19 20:51:28,399 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-19 20:51:28,399 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-19 20:51:28,400 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-19 20:51:28,400 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-19 20:51:28,400 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-19 20:51:28,400 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2024-11-19 20:51:28,400 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2024-11-19 20:51:28,402 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-19 20:51:28,402 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 20:51:28,402 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-19 20:51:28,402 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-19 20:51:28,402 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-19 20:51:28,402 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-19 20:51:28,402 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-19 20:51:28,402 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-19 20:51:28,403 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-19 20:51:28,403 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-19 20:51:28,403 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-19 20:51:28,403 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-19 20:51:28,403 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-19 20:51:28,403 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 20:51:28,403 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-19 20:51:28,403 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-19 20:51:28,403 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 20:51:28,404 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 20:51:28,559 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 20:51:28,561 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 20:51:28,816 INFO L? ?]: Removed 39 outVars from TransFormulas that were not future-live. [2024-11-19 20:51:28,816 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 20:51:28,829 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 20:51:28,829 INFO L316 CfgBuilder]: Removed 3 assume(true) statements. [2024-11-19 20:51:28,830 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 08:51:28 BoogieIcfgContainer [2024-11-19 20:51:28,830 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 20:51:28,833 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 20:51:28,833 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 20:51:28,837 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 20:51:28,837 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 08:51:27" (1/3) ... [2024-11-19 20:51:28,838 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70e4263d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 08:51:28, skipping insertion in model container [2024-11-19 20:51:28,838 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:51:28" (2/3) ... [2024-11-19 20:51:28,838 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70e4263d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 08:51:28, skipping insertion in model container [2024-11-19 20:51:28,838 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 08:51:28" (3/3) ... [2024-11-19 20:51:28,840 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2n_prepend_equal.i [2024-11-19 20:51:28,856 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 20:51:28,856 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-19 20:51:28,914 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 20:51:28,923 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@17a67d62, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 20:51:28,923 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-19 20:51:28,927 INFO L276 IsEmpty]: Start isEmpty. Operand has 27 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 23 states have internal predecessors, (32), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 20:51:28,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-19 20:51:28,934 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 20:51:28,934 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 20:51:28,935 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 20:51:28,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 20:51:28,939 INFO L85 PathProgramCache]: Analyzing trace with hash 845524335, now seen corresponding path program 1 times [2024-11-19 20:51:28,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 20:51:28,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21132722] [2024-11-19 20:51:28,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:51:28,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 20:51:29,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:51:29,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-19 20:51:29,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:51:29,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 20:51:29,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 20:51:29,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21132722] [2024-11-19 20:51:29,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [21132722] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 20:51:29,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 20:51:29,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 20:51:29,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017123745] [2024-11-19 20:51:29,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 20:51:29,197 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 20:51:29,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 20:51:29,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 20:51:29,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 20:51:29,219 INFO L87 Difference]: Start difference. First operand has 27 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 23 states have internal predecessors, (32), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 2 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 20:51:29,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 20:51:29,274 INFO L93 Difference]: Finished difference Result 48 states and 63 transitions. [2024-11-19 20:51:29,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 20:51:29,277 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 2 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2024-11-19 20:51:29,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 20:51:29,283 INFO L225 Difference]: With dead ends: 48 [2024-11-19 20:51:29,283 INFO L226 Difference]: Without dead ends: 21 [2024-11-19 20:51:29,286 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 20:51:29,291 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 0 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 20:51:29,292 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 52 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 20:51:29,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2024-11-19 20:51:29,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2024-11-19 20:51:29,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 states have internal predecessors, (20), 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) [2024-11-19 20:51:29,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2024-11-19 20:51:29,321 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 16 [2024-11-19 20:51:29,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 20:51:29,322 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2024-11-19 20:51:29,322 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 2 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 20:51:29,323 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2024-11-19 20:51:29,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-19 20:51:29,324 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 20:51:29,324 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 20:51:29,324 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 20:51:29,325 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 20:51:29,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 20:51:29,326 INFO L85 PathProgramCache]: Analyzing trace with hash 595026039, now seen corresponding path program 1 times [2024-11-19 20:51:29,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 20:51:29,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662449382] [2024-11-19 20:51:29,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:51:29,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 20:51:29,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:51:29,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-19 20:51:29,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:51:29,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 20:51:29,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 20:51:29,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662449382] [2024-11-19 20:51:29,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [662449382] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 20:51:29,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 20:51:29,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 20:51:29,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826464208] [2024-11-19 20:51:29,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 20:51:29,558 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 20:51:29,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 20:51:29,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 20:51:29,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 20:51:29,560 INFO L87 Difference]: Start difference. First operand 21 states and 24 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 20:51:29,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 20:51:29,602 INFO L93 Difference]: Finished difference Result 40 states and 46 transitions. [2024-11-19 20:51:29,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 20:51:29,604 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2024-11-19 20:51:29,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 20:51:29,604 INFO L225 Difference]: With dead ends: 40 [2024-11-19 20:51:29,605 INFO L226 Difference]: Without dead ends: 25 [2024-11-19 20:51:29,605 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 20:51:29,607 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 2 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 20:51:29,608 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 52 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 20:51:29,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2024-11-19 20:51:29,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 22. [2024-11-19 20:51:29,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 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) [2024-11-19 20:51:29,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2024-11-19 20:51:29,618 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 16 [2024-11-19 20:51:29,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 20:51:29,618 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2024-11-19 20:51:29,619 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 20:51:29,619 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2024-11-19 20:51:29,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-19 20:51:29,621 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 20:51:29,621 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 20:51:29,621 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 20:51:29,621 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 20:51:29,622 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 20:51:29,622 INFO L85 PathProgramCache]: Analyzing trace with hash -190501289, now seen corresponding path program 1 times [2024-11-19 20:51:29,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 20:51:29,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887287941] [2024-11-19 20:51:29,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:51:29,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 20:51:29,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:51:29,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 20:51:29,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:51:29,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-19 20:51:29,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:51:29,840 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-19 20:51:29,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 20:51:29,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887287941] [2024-11-19 20:51:29,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [887287941] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 20:51:29,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1545074900] [2024-11-19 20:51:29,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:51:29,841 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 20:51:29,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 20:51:29,844 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) [2024-11-19 20:51:29,845 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-19 20:51:29,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:51:29,976 INFO L255 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-19 20:51:29,982 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 20:51:30,037 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 20:51:30,039 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 20:51:30,092 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-19 20:51:30,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1545074900] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 20:51:30,094 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 20:51:30,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 6 [2024-11-19 20:51:30,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040645234] [2024-11-19 20:51:30,096 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 20:51:30,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 20:51:30,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 20:51:30,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 20:51:30,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-19 20:51:30,098 INFO L87 Difference]: Start difference. First operand 22 states and 25 transitions. Second operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-19 20:51:30,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 20:51:30,146 INFO L93 Difference]: Finished difference Result 41 states and 47 transitions. [2024-11-19 20:51:30,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 20:51:30,146 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 25 [2024-11-19 20:51:30,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 20:51:30,147 INFO L225 Difference]: With dead ends: 41 [2024-11-19 20:51:30,149 INFO L226 Difference]: Without dead ends: 26 [2024-11-19 20:51:30,149 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 50 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-19 20:51:30,150 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 2 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 20:51:30,151 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 51 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 20:51:30,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-11-19 20:51:30,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2024-11-19 20:51:30,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 21 states have internal predecessors, (24), 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) [2024-11-19 20:51:30,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2024-11-19 20:51:30,160 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 25 [2024-11-19 20:51:30,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 20:51:30,160 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2024-11-19 20:51:30,161 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-19 20:51:30,161 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2024-11-19 20:51:30,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-19 20:51:30,162 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 20:51:30,162 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 20:51:30,172 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-19 20:51:30,363 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 20:51:30,364 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 20:51:30,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 20:51:30,364 INFO L85 PathProgramCache]: Analyzing trace with hash -1242497929, now seen corresponding path program 2 times [2024-11-19 20:51:30,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 20:51:30,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591371362] [2024-11-19 20:51:30,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:51:30,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 20:51:30,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:51:30,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 20:51:30,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:51:30,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 20:51:30,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:51:31,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-19 20:51:31,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:51:31,074 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-19 20:51:31,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 20:51:31,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591371362] [2024-11-19 20:51:31,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1591371362] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 20:51:31,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 20:51:31,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-19 20:51:31,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643932700] [2024-11-19 20:51:31,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 20:51:31,077 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-19 20:51:31,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 20:51:31,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-19 20:51:31,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-19 20:51:31,078 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 8 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 20:51:31,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 20:51:31,204 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2024-11-19 20:51:31,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-19 20:51:31,205 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 8 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 34 [2024-11-19 20:51:31,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 20:51:31,206 INFO L225 Difference]: With dead ends: 32 [2024-11-19 20:51:31,206 INFO L226 Difference]: Without dead ends: 30 [2024-11-19 20:51:31,208 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2024-11-19 20:51:31,209 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 9 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 20:51:31,209 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 92 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 20:51:31,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-11-19 20:51:31,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2024-11-19 20:51:31,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.173913043478261) internal successors, (27), 23 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) [2024-11-19 20:51:31,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 33 transitions. [2024-11-19 20:51:31,219 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 33 transitions. Word has length 34 [2024-11-19 20:51:31,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 20:51:31,221 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 33 transitions. [2024-11-19 20:51:31,221 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 8 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 20:51:31,221 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 33 transitions. [2024-11-19 20:51:31,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-19 20:51:31,222 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 20:51:31,222 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 20:51:31,222 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-19 20:51:31,222 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 20:51:31,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 20:51:31,223 INFO L85 PathProgramCache]: Analyzing trace with hash -1242499603, now seen corresponding path program 1 times [2024-11-19 20:51:31,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 20:51:31,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440648449] [2024-11-19 20:51:31,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:51:31,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 20:51:31,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:51:31,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 20:51:31,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:51:31,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 20:51:31,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:51:31,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-19 20:51:31,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:51:31,499 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-19 20:51:31,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 20:51:31,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440648449] [2024-11-19 20:51:31,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [440648449] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 20:51:31,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 20:51:31,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-19 20:51:31,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048028822] [2024-11-19 20:51:31,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 20:51:31,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 20:51:31,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 20:51:31,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 20:51:31,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-19 20:51:31,505 INFO L87 Difference]: Start difference. First operand 28 states and 33 transitions. Second operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 20:51:31,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 20:51:31,560 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2024-11-19 20:51:31,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 20:51:31,561 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 34 [2024-11-19 20:51:31,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 20:51:31,562 INFO L225 Difference]: With dead ends: 31 [2024-11-19 20:51:31,562 INFO L226 Difference]: Without dead ends: 28 [2024-11-19 20:51:31,562 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-11-19 20:51:31,563 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 8 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 20:51:31,564 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 121 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 20:51:31,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-11-19 20:51:31,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2024-11-19 20:51:31,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 23 states have internal predecessors, (26), 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) [2024-11-19 20:51:31,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2024-11-19 20:51:31,568 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 34 [2024-11-19 20:51:31,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 20:51:31,568 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2024-11-19 20:51:31,568 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 20:51:31,568 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2024-11-19 20:51:31,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-19 20:51:31,569 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 20:51:31,569 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 20:51:31,570 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-19 20:51:31,570 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 20:51:31,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 20:51:31,570 INFO L85 PathProgramCache]: Analyzing trace with hash -39567630, now seen corresponding path program 1 times [2024-11-19 20:51:31,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 20:51:31,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150133142] [2024-11-19 20:51:31,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:51:31,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 20:51:31,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:51:32,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 20:51:32,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:51:32,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 20:51:32,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:51:32,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-19 20:51:32,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:51:32,841 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 8 proven. 10 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-19 20:51:32,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 20:51:32,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150133142] [2024-11-19 20:51:32,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [150133142] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 20:51:32,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1987258311] [2024-11-19 20:51:32,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:51:32,842 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 20:51:32,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 20:51:32,844 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) [2024-11-19 20:51:32,846 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-19 20:51:33,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:51:33,011 INFO L255 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 101 conjuncts are in the unsatisfiable core [2024-11-19 20:51:33,020 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 20:51:33,109 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-19 20:51:33,136 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-19 20:51:33,213 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-19 20:51:33,395 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2024-11-19 20:51:33,399 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-19 20:51:33,633 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-11-19 20:51:33,634 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 23 [2024-11-19 20:51:33,664 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-11-19 20:51:33,664 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2024-11-19 20:51:33,756 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2024-11-19 20:51:33,762 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 15 [2024-11-19 20:51:33,766 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 27 [2024-11-19 20:51:33,787 INFO L349 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2024-11-19 20:51:33,788 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 21 [2024-11-19 20:51:33,798 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-11-19 20:51:33,876 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 30 [2024-11-19 20:51:33,944 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2024-11-19 20:51:33,948 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-19 20:51:34,061 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 10 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-19 20:51:34,061 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 20:51:34,209 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 208 treesize of output 178 [2024-11-19 20:51:34,213 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 314 treesize of output 254 [2024-11-19 20:51:34,340 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse10 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_prepend_~head#1.base|)) (.cse11 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_prepend_~head#1.base|))) (let ((.cse2 (select .cse11 |c_ULTIMATE.start_sll_prepend_~head#1.offset|)) (.cse3 (select .cse10 |c_ULTIMATE.start_sll_prepend_~head#1.offset|))) (let ((.cse0 (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_prepend_~head#1.base| (store .cse11 |c_ULTIMATE.start_sll_prepend_~head#1.offset| |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|)) (.cse4 (= |c_ULTIMATE.start_sll_prepend_#t~ret7#1.offset| (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_prepend_~head#1.base| (store .cse10 |c_ULTIMATE.start_sll_prepend_~head#1.offset| |c_ULTIMATE.start_sll_prepend_#t~ret7#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (.cse1 (and (forall ((v_arrayElimCell_14 Int) (v_arrayElimCell_15 Int) (v_ArrVal_554 (Array Int Int))) (let ((.cse9 (select (store |c_#memory_int#2| |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base| v_ArrVal_554) v_arrayElimCell_14))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse9 .cse3)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse9 v_arrayElimCell_15))))) (forall ((v_arrayElimCell_14 Int) (v_arrayElimCell_15 Int) (v_ArrVal_554 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int#2| |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base| v_ArrVal_554) v_arrayElimCell_14) v_arrayElimCell_15))))) (.cse5 (forall ((v_arrayElimCell_14 Int) (v_arrayElimCell_15 Int) (v_ArrVal_554 (Array Int Int))) (let ((.cse8 (store |c_#memory_int#2| |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base| v_ArrVal_554))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse8 .cse2) .cse3)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse8 v_arrayElimCell_14) v_arrayElimCell_15))))))) (and (or .cse0 .cse1) (or (forall ((v_ArrVal_554 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int#2| |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base| v_ArrVal_554) .cse2) .cse3))) (not .cse0) (not .cse4)) (or .cse4 .cse1) (or .cse5 (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) |c_ULTIMATE.start_sll_prepend_#t~ret7#1.offset|)) (or .cse5 (= (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|)) (forall ((v_ArrVal_554 (Array Int Int))) (let ((.cse6 (store |c_#memory_int#2| |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base| v_ArrVal_554))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse6 .cse2) .cse3)) (forall ((v_arrayElimCell_14 Int) (v_arrayElimCell_15 Int)) (let ((.cse7 (select .cse6 v_arrayElimCell_14))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse7 .cse3)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse7 v_arrayElimCell_15)))))))))))) is different from false [2024-11-19 20:51:34,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1987258311] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 20:51:34,788 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 20:51:34,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 32 [2024-11-19 20:51:34,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974430836] [2024-11-19 20:51:34,789 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 20:51:34,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-11-19 20:51:34,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 20:51:34,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-11-19 20:51:34,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=1171, Unknown=1, NotChecked=68, Total=1332 [2024-11-19 20:51:34,791 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand has 32 states, 30 states have (on average 1.6666666666666667) internal successors, (50), 26 states have internal predecessors, (50), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-19 20:51:35,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 20:51:35,636 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2024-11-19 20:51:35,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-19 20:51:35,637 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 30 states have (on average 1.6666666666666667) internal successors, (50), 26 states have internal predecessors, (50), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 36 [2024-11-19 20:51:35,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 20:51:35,639 INFO L225 Difference]: With dead ends: 39 [2024-11-19 20:51:35,640 INFO L226 Difference]: Without dead ends: 37 [2024-11-19 20:51:35,641 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 347 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=164, Invalid=2095, Unknown=1, NotChecked=92, Total=2352 [2024-11-19 20:51:35,642 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 26 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 550 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 550 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 550 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 20:51:35,642 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 243 Invalid, 550 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 550 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-19 20:51:35,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-11-19 20:51:35,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 35. [2024-11-19 20:51:35,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 29 states have internal predecessors, (33), 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) [2024-11-19 20:51:35,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2024-11-19 20:51:35,656 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 36 [2024-11-19 20:51:35,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 20:51:35,656 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2024-11-19 20:51:35,656 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 30 states have (on average 1.6666666666666667) internal successors, (50), 26 states have internal predecessors, (50), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-19 20:51:35,656 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2024-11-19 20:51:35,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-19 20:51:35,659 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 20:51:35,659 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 20:51:35,669 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-19 20:51:35,860 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-19 20:51:35,860 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 20:51:35,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 20:51:35,861 INFO L85 PathProgramCache]: Analyzing trace with hash -39569304, now seen corresponding path program 1 times [2024-11-19 20:51:35,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 20:51:35,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565127151] [2024-11-19 20:51:35,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:51:35,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 20:51:35,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:51:36,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 20:51:36,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:51:36,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 20:51:36,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:51:36,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-19 20:51:36,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:51:36,399 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-19 20:51:36,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 20:51:36,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565127151] [2024-11-19 20:51:36,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1565127151] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 20:51:36,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1635766017] [2024-11-19 20:51:36,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:51:36,400 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 20:51:36,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 20:51:36,402 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) [2024-11-19 20:51:36,405 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-19 20:51:36,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:51:36,549 INFO L255 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 80 conjuncts are in the unsatisfiable core [2024-11-19 20:51:36,555 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 20:51:36,580 INFO L378 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 [2024-11-19 20:51:36,679 INFO L378 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 15 treesize of output 1 [2024-11-19 20:51:36,814 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 4 [2024-11-19 20:51:36,818 INFO L378 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 [2024-11-19 20:51:37,000 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-11-19 20:51:37,000 INFO L378 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 [2024-11-19 20:51:37,016 INFO L378 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 21 treesize of output 16 [2024-11-19 20:51:37,085 INFO L378 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 36 treesize of output 31 [2024-11-19 20:51:37,135 INFO L349 Elim1Store]: treesize reduction 48, result has 49.5 percent of original size [2024-11-19 20:51:37,136 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 71 treesize of output 82 [2024-11-19 20:51:37,177 INFO L349 Elim1Store]: treesize reduction 52, result has 22.4 percent of original size [2024-11-19 20:51:37,177 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 28 [2024-11-19 20:51:37,556 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 20:51:37,556 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 186 treesize of output 278 [2024-11-19 20:51:37,662 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 20:51:37,663 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 126 treesize of output 258 [2024-11-19 20:51:47,589 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 20:51:47,589 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 34 [2024-11-19 20:51:47,594 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 12 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 20:51:47,595 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 20:51:47,836 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 20:51:47,837 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 48 [2024-11-19 20:51:47,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1635766017] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 20:51:47,902 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 20:51:47,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 20] total 28 [2024-11-19 20:51:47,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964015860] [2024-11-19 20:51:47,903 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 20:51:47,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-19 20:51:47,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 20:51:47,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-19 20:51:47,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=908, Unknown=0, NotChecked=0, Total=992 [2024-11-19 20:51:47,904 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand has 28 states, 26 states have (on average 1.8076923076923077) internal successors, (47), 22 states have internal predecessors, (47), 4 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2024-11-19 20:51:48,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 20:51:48,542 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2024-11-19 20:51:48,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-19 20:51:48,547 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 26 states have (on average 1.8076923076923077) internal successors, (47), 22 states have internal predecessors, (47), 4 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 36 [2024-11-19 20:51:48,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 20:51:48,548 INFO L225 Difference]: With dead ends: 39 [2024-11-19 20:51:48,549 INFO L226 Difference]: Without dead ends: 36 [2024-11-19 20:51:48,549 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 239 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=135, Invalid=1425, Unknown=0, NotChecked=0, Total=1560 [2024-11-19 20:51:48,550 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 21 mSDsluCounter, 340 mSDsCounter, 0 mSdLazyCounter, 369 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 361 SdHoareTripleChecker+Invalid, 369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 369 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 20:51:48,550 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 361 Invalid, 369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 369 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 20:51:48,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-11-19 20:51:48,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2024-11-19 20:51:48,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 29 states have (on average 1.103448275862069) internal successors, (32), 29 states have internal predecessors, (32), 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) [2024-11-19 20:51:48,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2024-11-19 20:51:48,563 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 38 transitions. Word has length 36 [2024-11-19 20:51:48,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 20:51:48,563 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 38 transitions. [2024-11-19 20:51:48,563 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 26 states have (on average 1.8076923076923077) internal successors, (47), 22 states have internal predecessors, (47), 4 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2024-11-19 20:51:48,563 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2024-11-19 20:51:48,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-19 20:51:48,564 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 20:51:48,565 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 20:51:48,575 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-19 20:51:48,766 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 20:51:48,766 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 20:51:48,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 20:51:48,767 INFO L85 PathProgramCache]: Analyzing trace with hash 630247085, now seen corresponding path program 2 times [2024-11-19 20:51:48,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 20:51:48,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764534438] [2024-11-19 20:51:48,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:51:48,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 20:51:48,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:51:50,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 20:51:50,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:51:50,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 20:51:50,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:51:50,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-19 20:51:50,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:51:50,937 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-19 20:51:50,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 20:51:50,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764534438] [2024-11-19 20:51:50,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1764534438] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 20:51:50,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [696173724] [2024-11-19 20:51:50,938 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 20:51:50,938 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 20:51:50,938 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 20:51:50,939 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) [2024-11-19 20:51:50,940 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-19 20:51:51,076 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 20:51:51,076 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 20:51:51,078 INFO L255 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 149 conjuncts are in the unsatisfiable core [2024-11-19 20:51:51,084 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 20:51:51,127 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-19 20:51:51,134 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-19 20:51:51,183 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-19 20:51:51,364 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-19 20:51:51,364 INFO L378 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 [2024-11-19 20:51:51,373 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-19 20:51:51,428 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2024-11-19 20:51:51,433 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-19 20:51:51,445 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-19 20:51:51,658 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 21 [2024-11-19 20:51:51,667 INFO L378 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 [2024-11-19 20:51:51,672 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2024-11-19 20:51:51,676 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-19 20:51:51,941 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-11-19 20:51:51,941 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 23 [2024-11-19 20:51:51,962 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 20:51:51,963 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 36 [2024-11-19 20:51:51,980 INFO L349 Elim1Store]: treesize reduction 29, result has 46.3 percent of original size [2024-11-19 20:51:51,981 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 31 [2024-11-19 20:51:52,009 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2024-11-19 20:51:52,009 INFO L378 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 [2024-11-19 20:51:52,136 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 50 [2024-11-19 20:51:52,142 INFO L378 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 31 treesize of output 26 [2024-11-19 20:51:52,147 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 101 treesize of output 58 [2024-11-19 20:51:52,153 INFO L378 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 36 treesize of output 23 [2024-11-19 20:51:52,180 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2024-11-19 20:51:52,180 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 21 [2024-11-19 20:51:52,264 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 65 [2024-11-19 20:51:52,488 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-19 20:51:52,488 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 33 [2024-11-19 20:51:52,492 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-19 20:51:52,606 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 3 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 20:51:52,606 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 20:51:52,855 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_909 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse7 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_prepend_~head#1.base|)) (.cse8 (+ |c_ULTIMATE.start_sll_prepend_#t~ret7#1.offset| 4)) (.cse6 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_prepend_~head#1.base|))) (let ((.cse3 (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base| (store (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|) .cse8 (select .cse6 |c_ULTIMATE.start_sll_prepend_~head#1.offset|)))) (.cse0 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base| (store (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|) .cse8 (select .cse7 |c_ULTIMATE.start_sll_prepend_~head#1.offset|)))) (.cse4 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_prepend_~head#1.base| (store .cse7 |c_ULTIMATE.start_sll_prepend_~head#1.offset| |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse5 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_prepend_~head#1.base| (store .cse6 |c_ULTIMATE.start_sll_prepend_~head#1.offset| |c_ULTIMATE.start_sll_prepend_#t~ret7#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (let ((.cse1 (select (select .cse0 .cse4) .cse5)) (.cse2 (+ (select (select .cse3 .cse4) .cse5) 4))) (select (select (store |c_#memory_int#2| |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base| v_ArrVal_909) (select (select .cse0 .cse1) .cse2)) (select (select .cse3 .cse1) .cse2))))))) is different from false [2024-11-19 20:51:52,926 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 20:51:52,927 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 202 treesize of output 192 [2024-11-19 20:51:52,948 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 20:51:52,951 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 181 treesize of output 171 [2024-11-19 20:51:53,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [696173724] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 20:51:53,091 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 20:51:53,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 25] total 45 [2024-11-19 20:51:53,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745617566] [2024-11-19 20:51:53,092 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 20:51:53,092 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2024-11-19 20:51:53,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 20:51:53,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2024-11-19 20:51:53,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=2519, Unknown=1, NotChecked=100, Total=2756 [2024-11-19 20:51:53,094 INFO L87 Difference]: Start difference. First operand 35 states and 38 transitions. Second operand has 45 states, 43 states have (on average 1.372093023255814) internal successors, (59), 36 states have internal predecessors, (59), 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) [2024-11-19 20:51:54,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 20:51:54,529 INFO L93 Difference]: Finished difference Result 43 states and 47 transitions. [2024-11-19 20:51:54,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-19 20:51:54,530 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 43 states have (on average 1.372093023255814) internal successors, (59), 36 states have internal predecessors, (59), 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 38 [2024-11-19 20:51:54,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 20:51:54,530 INFO L225 Difference]: With dead ends: 43 [2024-11-19 20:51:54,530 INFO L226 Difference]: Without dead ends: 41 [2024-11-19 20:51:54,532 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 843 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=278, Invalid=4555, Unknown=1, NotChecked=136, Total=4970 [2024-11-19 20:51:54,533 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 24 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 773 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 317 SdHoareTripleChecker+Invalid, 777 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 773 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-19 20:51:54,534 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 317 Invalid, 777 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 773 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-19 20:51:54,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-11-19 20:51:54,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 37. [2024-11-19 20:51:54,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 31 states have (on average 1.1290322580645162) internal successors, (35), 31 states have internal predecessors, (35), 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) [2024-11-19 20:51:54,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2024-11-19 20:51:54,547 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 38 [2024-11-19 20:51:54,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 20:51:54,548 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2024-11-19 20:51:54,548 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 43 states have (on average 1.372093023255814) internal successors, (59), 36 states have internal predecessors, (59), 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) [2024-11-19 20:51:54,548 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2024-11-19 20:51:54,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-19 20:51:54,551 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 20:51:54,551 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 20:51:54,560 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-19 20:51:54,752 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 20:51:54,752 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 20:51:54,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 20:51:54,752 INFO L85 PathProgramCache]: Analyzing trace with hash 630245411, now seen corresponding path program 2 times [2024-11-19 20:51:54,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 20:51:54,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621134625] [2024-11-19 20:51:54,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:51:54,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 20:51:54,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:51:55,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 20:51:55,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:51:55,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 20:51:55,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:51:55,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-19 20:51:55,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:51:55,760 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 3 proven. 19 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-19 20:51:55,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 20:51:55,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621134625] [2024-11-19 20:51:55,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1621134625] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 20:51:55,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [764945681] [2024-11-19 20:51:55,761 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 20:51:55,762 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 20:51:55,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 20:51:55,764 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) [2024-11-19 20:51:55,766 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-19 20:51:55,924 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 20:51:55,924 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 20:51:55,930 INFO L255 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 95 conjuncts are in the unsatisfiable core [2024-11-19 20:51:55,934 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 20:51:56,010 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-19 20:51:56,054 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-19 20:51:56,173 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 4 [2024-11-19 20:51:56,176 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-19 20:51:56,317 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-11-19 20:51:56,317 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 24 [2024-11-19 20:51:56,332 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-11-19 20:51:56,333 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2024-11-19 20:51:56,402 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2024-11-19 20:51:56,403 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 21 [2024-11-19 20:51:56,408 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-11-19 20:51:56,413 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2024-11-19 20:51:56,415 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 28 [2024-11-19 20:51:56,474 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 31 [2024-11-19 20:51:56,517 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-19 20:51:56,621 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-19 20:51:56,621 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 15 [2024-11-19 20:51:56,624 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 19 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 20:51:56,624 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 20:51:56,757 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 236 treesize of output 206 [2024-11-19 20:51:56,899 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 20:51:56,900 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 176 treesize of output 159 [2024-11-19 20:51:57,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [764945681] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 20:51:57,153 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 20:51:57,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 23] total 37 [2024-11-19 20:51:57,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291582470] [2024-11-19 20:51:57,154 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 20:51:57,154 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2024-11-19 20:51:57,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 20:51:57,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2024-11-19 20:51:57,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=1686, Unknown=1, NotChecked=0, Total=1806 [2024-11-19 20:51:57,156 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand has 37 states, 35 states have (on average 1.5142857142857142) internal successors, (53), 29 states have internal predecessors, (53), 6 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-19 20:51:58,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 20:51:58,000 INFO L93 Difference]: Finished difference Result 41 states and 45 transitions. [2024-11-19 20:51:58,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-19 20:51:58,001 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 35 states have (on average 1.5142857142857142) internal successors, (53), 29 states have internal predecessors, (53), 6 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 38 [2024-11-19 20:51:58,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 20:51:58,002 INFO L225 Difference]: With dead ends: 41 [2024-11-19 20:51:58,002 INFO L226 Difference]: Without dead ends: 38 [2024-11-19 20:51:58,003 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 431 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=204, Invalid=2765, Unknown=1, NotChecked=0, Total=2970 [2024-11-19 20:51:58,005 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 16 mSDsluCounter, 419 mSDsCounter, 0 mSdLazyCounter, 640 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 439 SdHoareTripleChecker+Invalid, 640 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 640 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 20:51:58,005 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 439 Invalid, 640 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 640 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-19 20:51:58,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-11-19 20:51:58,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2024-11-19 20:51:58,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 31 states have (on average 1.096774193548387) internal successors, (34), 31 states have internal predecessors, (34), 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) [2024-11-19 20:51:58,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 40 transitions. [2024-11-19 20:51:58,017 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 40 transitions. Word has length 38 [2024-11-19 20:51:58,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 20:51:58,018 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 40 transitions. [2024-11-19 20:51:58,018 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 35 states have (on average 1.5142857142857142) internal successors, (53), 29 states have internal predecessors, (53), 6 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-19 20:51:58,018 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 40 transitions. [2024-11-19 20:51:58,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-19 20:51:58,019 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 20:51:58,019 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 20:51:58,028 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-19 20:51:58,223 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 20:51:58,223 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 20:51:58,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 20:51:58,224 INFO L85 PathProgramCache]: Analyzing trace with hash 77093800, now seen corresponding path program 3 times [2024-11-19 20:51:58,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 20:51:58,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425243115] [2024-11-19 20:51:58,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:51:58,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 20:51:58,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:51:59,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 20:51:59,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:51:59,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 20:51:59,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:52:00,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-19 20:52:00,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:52:00,184 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 7 proven. 23 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-19 20:52:00,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 20:52:00,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425243115] [2024-11-19 20:52:00,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1425243115] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 20:52:00,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [886376721] [2024-11-19 20:52:00,185 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 20:52:00,185 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 20:52:00,185 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 20:52:00,186 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) [2024-11-19 20:52:00,187 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-19 20:52:00,514 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-11-19 20:52:00,514 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 20:52:00,519 INFO L255 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 145 conjuncts are in the unsatisfiable core [2024-11-19 20:52:00,525 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 20:52:00,532 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-19 20:52:00,554 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-19 20:52:00,559 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-19 20:52:00,751 WARN L851 $PredicateComparison]: unable to prove that (and (or (= (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0) (exists ((|v_#memory_$Pointer$#2.base_BEFORE_CALL_8| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_$Pointer$#2.base_BEFORE_CALL_8| |c_#memory_$Pointer$#2.base|))) (and (= (store |v_#memory_$Pointer$#2.base_BEFORE_CALL_8| .cse0 (select |c_#memory_$Pointer$#2.base| .cse0)) |c_#memory_$Pointer$#2.base|) (= (select (select |v_#memory_$Pointer$#2.base_BEFORE_CALL_8| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0) (= |c_ULTIMATE.start_sll_create_#t~ret4#1.base| .cse0))))) (exists ((|v_#valid_BEFORE_CALL_12| (Array Int Int))) (and (= |c_#valid| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_12| |c_#valid|))) (store |v_#valid_BEFORE_CALL_12| .cse1 (select |c_#valid| .cse1)))) (= (select |v_#valid_BEFORE_CALL_12| |c_ULTIMATE.start_sll_create_#t~ret4#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_12| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1))) (or (exists ((|v_#memory_$Pointer$#2.offset_BEFORE_CALL_4| (Array Int (Array Int Int)))) (let ((.cse2 (@diff |v_#memory_$Pointer$#2.offset_BEFORE_CALL_4| |c_#memory_$Pointer$#2.offset|))) (and (= 0 (select (select |v_#memory_$Pointer$#2.offset_BEFORE_CALL_4| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4)) (= |c_#memory_$Pointer$#2.offset| (store |v_#memory_$Pointer$#2.offset_BEFORE_CALL_4| .cse2 (select |c_#memory_$Pointer$#2.offset| .cse2))) (= .cse2 |c_ULTIMATE.start_sll_create_#t~ret4#1.base|)))) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0)) (= |c_ULTIMATE.start_sll_create_#t~ret4#1.offset| 0) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_#t~ret4#1.base|) 1)) is different from false [2024-11-19 20:52:00,759 WARN L873 $PredicateComparison]: unable to prove that (and (or (= (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0) (exists ((|v_#memory_$Pointer$#2.base_BEFORE_CALL_8| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_$Pointer$#2.base_BEFORE_CALL_8| |c_#memory_$Pointer$#2.base|))) (and (= (store |v_#memory_$Pointer$#2.base_BEFORE_CALL_8| .cse0 (select |c_#memory_$Pointer$#2.base| .cse0)) |c_#memory_$Pointer$#2.base|) (= (select (select |v_#memory_$Pointer$#2.base_BEFORE_CALL_8| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0) (= |c_ULTIMATE.start_sll_create_#t~ret4#1.base| .cse0))))) (exists ((|v_#valid_BEFORE_CALL_12| (Array Int Int))) (and (= |c_#valid| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_12| |c_#valid|))) (store |v_#valid_BEFORE_CALL_12| .cse1 (select |c_#valid| .cse1)))) (= (select |v_#valid_BEFORE_CALL_12| |c_ULTIMATE.start_sll_create_#t~ret4#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_12| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1))) (or (exists ((|v_#memory_$Pointer$#2.offset_BEFORE_CALL_4| (Array Int (Array Int Int)))) (let ((.cse2 (@diff |v_#memory_$Pointer$#2.offset_BEFORE_CALL_4| |c_#memory_$Pointer$#2.offset|))) (and (= 0 (select (select |v_#memory_$Pointer$#2.offset_BEFORE_CALL_4| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4)) (= |c_#memory_$Pointer$#2.offset| (store |v_#memory_$Pointer$#2.offset_BEFORE_CALL_4| .cse2 (select |c_#memory_$Pointer$#2.offset| .cse2))) (= .cse2 |c_ULTIMATE.start_sll_create_#t~ret4#1.base|)))) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0)) (= |c_ULTIMATE.start_sll_create_#t~ret4#1.offset| 0) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_#t~ret4#1.base|) 1)) is different from true [2024-11-19 20:52:00,797 INFO L349 Elim1Store]: treesize reduction 29, result has 27.5 percent of original size [2024-11-19 20:52:00,798 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2024-11-19 20:52:00,832 INFO L349 Elim1Store]: treesize reduction 25, result has 43.2 percent of original size [2024-11-19 20:52:00,833 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 23 [2024-11-19 20:52:00,868 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4))) (and (or (= .cse0 |c_ULTIMATE.start_sll_create_~head~0#1.base|) (= (select (select |c_#memory_$Pointer$#2.base| .cse0) 4) 0) (exists ((|v_#memory_$Pointer$#2.base_62| (Array Int (Array Int Int)))) (and (= (store |v_#memory_$Pointer$#2.base_62| |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select |v_#memory_$Pointer$#2.base_62| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4 .cse0)) |c_#memory_$Pointer$#2.base|) (exists ((|v_#memory_$Pointer$#2.base_BEFORE_CALL_8| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_#memory_$Pointer$#2.base_BEFORE_CALL_8| |v_#memory_$Pointer$#2.base_62|))) (and (= (store |v_#memory_$Pointer$#2.base_BEFORE_CALL_8| .cse1 (select |v_#memory_$Pointer$#2.base_62| .cse1)) |v_#memory_$Pointer$#2.base_62|) (= (select (select |v_#memory_$Pointer$#2.base_BEFORE_CALL_8| .cse0) 4) 0) (= .cse1 |c_ULTIMATE.start_sll_create_~head~0#1.base|))))))) (or (exists ((|v_#memory_$Pointer$#2.offset_53| (Array Int (Array Int Int)))) (and (exists ((|v_#memory_$Pointer$#2.offset_BEFORE_CALL_4| (Array Int (Array Int Int)))) (let ((.cse2 (@diff |v_#memory_$Pointer$#2.offset_BEFORE_CALL_4| |v_#memory_$Pointer$#2.offset_53|))) (and (= (select (select |v_#memory_$Pointer$#2.offset_BEFORE_CALL_4| .cse0) 4) 0) (= .cse2 |c_ULTIMATE.start_sll_create_~head~0#1.base|) (= |v_#memory_$Pointer$#2.offset_53| (store |v_#memory_$Pointer$#2.offset_BEFORE_CALL_4| .cse2 (select |v_#memory_$Pointer$#2.offset_53| .cse2)))))) (= (store |v_#memory_$Pointer$#2.offset_53| |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select |v_#memory_$Pointer$#2.offset_53| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4 0)) |c_#memory_$Pointer$#2.offset|))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0))) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (exists ((|v_#valid_BEFORE_CALL_12| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_12| .cse0) 1) (= |c_#valid| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_12| |c_#valid|))) (store |v_#valid_BEFORE_CALL_12| .cse3 (select |c_#valid| .cse3)))) (= (select |v_#valid_BEFORE_CALL_12| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0))) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0))) is different from false [2024-11-19 20:52:00,873 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4))) (and (or (= .cse0 |c_ULTIMATE.start_sll_create_~head~0#1.base|) (= (select (select |c_#memory_$Pointer$#2.base| .cse0) 4) 0) (exists ((|v_#memory_$Pointer$#2.base_62| (Array Int (Array Int Int)))) (and (= (store |v_#memory_$Pointer$#2.base_62| |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select |v_#memory_$Pointer$#2.base_62| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4 .cse0)) |c_#memory_$Pointer$#2.base|) (exists ((|v_#memory_$Pointer$#2.base_BEFORE_CALL_8| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_#memory_$Pointer$#2.base_BEFORE_CALL_8| |v_#memory_$Pointer$#2.base_62|))) (and (= (store |v_#memory_$Pointer$#2.base_BEFORE_CALL_8| .cse1 (select |v_#memory_$Pointer$#2.base_62| .cse1)) |v_#memory_$Pointer$#2.base_62|) (= (select (select |v_#memory_$Pointer$#2.base_BEFORE_CALL_8| .cse0) 4) 0) (= .cse1 |c_ULTIMATE.start_sll_create_~head~0#1.base|))))))) (or (exists ((|v_#memory_$Pointer$#2.offset_53| (Array Int (Array Int Int)))) (and (exists ((|v_#memory_$Pointer$#2.offset_BEFORE_CALL_4| (Array Int (Array Int Int)))) (let ((.cse2 (@diff |v_#memory_$Pointer$#2.offset_BEFORE_CALL_4| |v_#memory_$Pointer$#2.offset_53|))) (and (= (select (select |v_#memory_$Pointer$#2.offset_BEFORE_CALL_4| .cse0) 4) 0) (= .cse2 |c_ULTIMATE.start_sll_create_~head~0#1.base|) (= |v_#memory_$Pointer$#2.offset_53| (store |v_#memory_$Pointer$#2.offset_BEFORE_CALL_4| .cse2 (select |v_#memory_$Pointer$#2.offset_53| .cse2)))))) (= (store |v_#memory_$Pointer$#2.offset_53| |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select |v_#memory_$Pointer$#2.offset_53| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4 0)) |c_#memory_$Pointer$#2.offset|))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0))) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (exists ((|v_#valid_BEFORE_CALL_12| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_12| .cse0) 1) (= |c_#valid| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_12| |c_#valid|))) (store |v_#valid_BEFORE_CALL_12| .cse3 (select |c_#valid| .cse3)))) (= (select |v_#valid_BEFORE_CALL_12| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0))) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0))) is different from true [2024-11-19 20:52:00,913 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4))) (and (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0) (exists ((|v_#valid_BEFORE_CALL_12| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_12| .cse0) 1) (= |c_#valid| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_12| |c_#valid|))) (store |v_#valid_BEFORE_CALL_12| .cse1 (select |c_#valid| .cse1)))) (= (select |v_#valid_BEFORE_CALL_12| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0))) (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0) (or (= .cse0 |c_ULTIMATE.start_sll_create_~head~0#1.base|) (= (select (select |c_#memory_$Pointer$#2.base| .cse0) 4) 0)) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0))) is different from false [2024-11-19 20:52:00,915 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4))) (and (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0) (exists ((|v_#valid_BEFORE_CALL_12| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_12| .cse0) 1) (= |c_#valid| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_12| |c_#valid|))) (store |v_#valid_BEFORE_CALL_12| .cse1 (select |c_#valid| .cse1)))) (= (select |v_#valid_BEFORE_CALL_12| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0))) (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0) (or (= .cse0 |c_ULTIMATE.start_sll_create_~head~0#1.base|) (= (select (select |c_#memory_$Pointer$#2.base| .cse0) 4) 0)) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0))) is different from true [2024-11-19 20:52:00,962 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_create_#res#1.base|) 4))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_create_#res#1.base|) 4) 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_#res#1.base|) 1) (exists ((|v_#valid_BEFORE_CALL_12| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_12| |c_ULTIMATE.start_sll_create_#res#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_12| .cse0) 1) (= |c_#valid| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_12| |c_#valid|))) (store |v_#valid_BEFORE_CALL_12| .cse1 (select |c_#valid| .cse1)))))) (or (= |c_ULTIMATE.start_sll_create_#res#1.base| .cse0) (= (select (select |c_#memory_$Pointer$#2.base| .cse0) 4) 0)) (= |c_ULTIMATE.start_sll_create_#res#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0))) is different from false [2024-11-19 20:52:00,964 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_create_#res#1.base|) 4))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_create_#res#1.base|) 4) 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_#res#1.base|) 1) (exists ((|v_#valid_BEFORE_CALL_12| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_12| |c_ULTIMATE.start_sll_create_#res#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_12| .cse0) 1) (= |c_#valid| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_12| |c_#valid|))) (store |v_#valid_BEFORE_CALL_12| .cse1 (select |c_#valid| .cse1)))))) (or (= |c_ULTIMATE.start_sll_create_#res#1.base| .cse0) (= (select (select |c_#memory_$Pointer$#2.base| .cse0) 4) 0)) (= |c_ULTIMATE.start_sll_create_#res#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0))) is different from true [2024-11-19 20:52:01,002 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| .cse2) 4))) (and (= |c_ULTIMATE.start_sll_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_12| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_12| .cse0) 1) (= |c_#valid| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_12| |c_#valid|))) (store |v_#valid_BEFORE_CALL_12| .cse1 (select |c_#valid| .cse1)))) (= (select |v_#valid_BEFORE_CALL_12| .cse2) 0))) (= (select (select |c_#memory_$Pointer$#2.offset| .cse2) 4) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0) (or (= .cse0 .cse2) (= (select (select |c_#memory_$Pointer$#2.base| .cse0) 4) 0)) (= |c_ULTIMATE.start_sll_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= (select |c_#valid| .cse2) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)))) is different from false [2024-11-19 20:52:01,004 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| .cse2) 4))) (and (= |c_ULTIMATE.start_sll_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_12| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_12| .cse0) 1) (= |c_#valid| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_12| |c_#valid|))) (store |v_#valid_BEFORE_CALL_12| .cse1 (select |c_#valid| .cse1)))) (= (select |v_#valid_BEFORE_CALL_12| .cse2) 0))) (= (select (select |c_#memory_$Pointer$#2.offset| .cse2) 4) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0) (or (= .cse0 .cse2) (= (select (select |c_#memory_$Pointer$#2.base| .cse0) 4) 0)) (= |c_ULTIMATE.start_sll_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= (select |c_#valid| .cse2) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)))) is different from true [2024-11-19 20:52:01,024 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-19 20:52:01,025 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 27 [2024-11-19 20:52:01,032 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 20:52:01,033 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2024-11-19 20:52:01,053 WARN L851 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimIndex_4 Int) (|v_#valid_BEFORE_CALL_12| (Array Int Int)) (|v_#valid_BEFORE_CALL_13| (Array Int Int)) (|v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_4| Int) (|v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_4|))) (and (= (select |v_#valid_BEFORE_CALL_12| v_arrayElimIndex_4) 1) (= (select |v_#valid_BEFORE_CALL_13| .cse0) 1) (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_12| |v_#valid_BEFORE_CALL_13|))) (store |v_#valid_BEFORE_CALL_12| .cse1 (select |v_#valid_BEFORE_CALL_13| .cse1))) |v_#valid_BEFORE_CALL_13|) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_4|) 0) (= 0 (select |v_#valid_BEFORE_CALL_12| .cse0))))) (= |c_#valid| |c_old(#valid)|) (= |c_#memory_$Pointer$#2.offset| |c_old(#memory_$Pointer$#2.offset)|) (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|)) is different from false [2024-11-19 20:52:01,055 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimIndex_4 Int) (|v_#valid_BEFORE_CALL_12| (Array Int Int)) (|v_#valid_BEFORE_CALL_13| (Array Int Int)) (|v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_4| Int) (|v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_4|))) (and (= (select |v_#valid_BEFORE_CALL_12| v_arrayElimIndex_4) 1) (= (select |v_#valid_BEFORE_CALL_13| .cse0) 1) (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_12| |v_#valid_BEFORE_CALL_13|))) (store |v_#valid_BEFORE_CALL_12| .cse1 (select |v_#valid_BEFORE_CALL_13| .cse1))) |v_#valid_BEFORE_CALL_13|) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_4|) 0) (= 0 (select |v_#valid_BEFORE_CALL_12| .cse0))))) (= |c_#valid| |c_old(#valid)|) (= |c_#memory_$Pointer$#2.offset| |c_old(#memory_$Pointer$#2.offset)|) (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|)) is different from true [2024-11-19 20:52:01,082 WARN L851 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimIndex_4 Int) (|v_#valid_BEFORE_CALL_12| (Array Int Int)) (|v_#valid_BEFORE_CALL_13| (Array Int Int)) (|v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_4| Int) (|v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_4|))) (and (= (select |v_#valid_BEFORE_CALL_12| v_arrayElimIndex_4) 1) (= (select |v_#valid_BEFORE_CALL_13| .cse0) 1) (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_12| |v_#valid_BEFORE_CALL_13|))) (store |v_#valid_BEFORE_CALL_12| .cse1 (select |v_#valid_BEFORE_CALL_13| .cse1))) |v_#valid_BEFORE_CALL_13|) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_4|) 0) (= 0 (select |v_#valid_BEFORE_CALL_12| .cse0))))) (= |c_node_create_~temp~0#1.offset| 0) (= |c_#memory_$Pointer$#2.offset| |c_old(#memory_$Pointer$#2.offset)|) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|)) is different from false [2024-11-19 20:52:01,085 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimIndex_4 Int) (|v_#valid_BEFORE_CALL_12| (Array Int Int)) (|v_#valid_BEFORE_CALL_13| (Array Int Int)) (|v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_4| Int) (|v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_4|))) (and (= (select |v_#valid_BEFORE_CALL_12| v_arrayElimIndex_4) 1) (= (select |v_#valid_BEFORE_CALL_13| .cse0) 1) (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_12| |v_#valid_BEFORE_CALL_13|))) (store |v_#valid_BEFORE_CALL_12| .cse1 (select |v_#valid_BEFORE_CALL_13| .cse1))) |v_#valid_BEFORE_CALL_13|) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_4|) 0) (= 0 (select |v_#valid_BEFORE_CALL_12| .cse0))))) (= |c_node_create_~temp~0#1.offset| 0) (= |c_#memory_$Pointer$#2.offset| |c_old(#memory_$Pointer$#2.offset)|) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|)) is different from true [2024-11-19 20:52:01,132 WARN L851 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimIndex_4 Int) (|v_#valid_BEFORE_CALL_12| (Array Int Int)) (|v_#valid_BEFORE_CALL_13| (Array Int Int)) (|v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_4| Int) (|v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_4|))) (and (= (select |v_#valid_BEFORE_CALL_12| v_arrayElimIndex_4) 1) (= (select |v_#valid_BEFORE_CALL_13| .cse0) 1) (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_12| |v_#valid_BEFORE_CALL_13|))) (store |v_#valid_BEFORE_CALL_12| .cse1 (select |v_#valid_BEFORE_CALL_13| .cse1))) |v_#valid_BEFORE_CALL_13|) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_4|) 0) (= 0 (select |v_#valid_BEFORE_CALL_12| .cse0))))) (= |c_node_create_#res#1.offset| 0) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (= (store |c_old(#memory_$Pointer$#2.offset)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#2.offset| |c_node_create_#res#1.base|)) |c_#memory_$Pointer$#2.offset|) (= (store |c_old(#memory_$Pointer$#2.base)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#2.base| |c_node_create_#res#1.base|)) |c_#memory_$Pointer$#2.base|)) is different from false [2024-11-19 20:52:01,134 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimIndex_4 Int) (|v_#valid_BEFORE_CALL_12| (Array Int Int)) (|v_#valid_BEFORE_CALL_13| (Array Int Int)) (|v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_4| Int) (|v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_4|))) (and (= (select |v_#valid_BEFORE_CALL_12| v_arrayElimIndex_4) 1) (= (select |v_#valid_BEFORE_CALL_13| .cse0) 1) (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_12| |v_#valid_BEFORE_CALL_13|))) (store |v_#valid_BEFORE_CALL_12| .cse1 (select |v_#valid_BEFORE_CALL_13| .cse1))) |v_#valid_BEFORE_CALL_13|) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_4|) 0) (= 0 (select |v_#valid_BEFORE_CALL_12| .cse0))))) (= |c_node_create_#res#1.offset| 0) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (= (store |c_old(#memory_$Pointer$#2.offset)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#2.offset| |c_node_create_#res#1.base|)) |c_#memory_$Pointer$#2.offset|) (= (store |c_old(#memory_$Pointer$#2.base)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#2.base| |c_node_create_#res#1.base|)) |c_#memory_$Pointer$#2.base|)) is different from true [2024-11-19 20:52:01,195 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 20:52:01,206 INFO L349 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2024-11-19 20:52:01,207 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 68 treesize of output 51 [2024-11-19 20:52:01,262 INFO L349 Elim1Store]: treesize reduction 48, result has 56.8 percent of original size [2024-11-19 20:52:01,262 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 73 [2024-11-19 20:52:01,323 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse4) 4))) (and (exists ((v_arrayElimIndex_4 Int) (|v_#valid_BEFORE_CALL_12| (Array Int Int)) (|v_#valid_BEFORE_CALL_13| (Array Int Int)) (|v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_4| Int) (|v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_4|))) (and (= (select |v_#valid_BEFORE_CALL_12| v_arrayElimIndex_4) 1) (= (select |v_#valid_BEFORE_CALL_13| .cse0) 1) (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_12| |v_#valid_BEFORE_CALL_13|))) (store |v_#valid_BEFORE_CALL_12| .cse1 (select |v_#valid_BEFORE_CALL_13| .cse1))) |v_#valid_BEFORE_CALL_13|) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_4|) 0) (= 0 (select |v_#valid_BEFORE_CALL_12| .cse0))))) (= |c_ULTIMATE.start_sll_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (let ((.cse3 (or (= (select (select |c_#memory_$Pointer$#2.offset| .cse4) 4) 0) (= .cse4 |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|)))) (or (and (= .cse2 |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|) .cse3) (and .cse3 (= (select (select |c_#memory_$Pointer$#2.offset| .cse2) 4) 0)))) (= |c_ULTIMATE.start_sll_prepend_#t~ret7#1.offset| 0) (or (= .cse2 .cse4) (= (select (select |c_#memory_$Pointer$#2.base| .cse2) 4) 0)) (= |c_ULTIMATE.start_sll_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (exists ((|v_#valid_BEFORE_CALL_15| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_17| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_17| |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_15| .cse4) 0) (= (select |v_old(#valid)_AFTER_CALL_17| .cse4) 1) (= (select |v_#valid_BEFORE_CALL_15| .cse2) 1) (= (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_15| |v_old(#valid)_AFTER_CALL_17|))) (store |v_#valid_BEFORE_CALL_15| .cse5 (select |v_old(#valid)_AFTER_CALL_17| .cse5))) |v_old(#valid)_AFTER_CALL_17|))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)))) is different from false [2024-11-19 20:52:01,327 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse4) 4))) (and (exists ((v_arrayElimIndex_4 Int) (|v_#valid_BEFORE_CALL_12| (Array Int Int)) (|v_#valid_BEFORE_CALL_13| (Array Int Int)) (|v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_4| Int) (|v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_4|))) (and (= (select |v_#valid_BEFORE_CALL_12| v_arrayElimIndex_4) 1) (= (select |v_#valid_BEFORE_CALL_13| .cse0) 1) (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_12| |v_#valid_BEFORE_CALL_13|))) (store |v_#valid_BEFORE_CALL_12| .cse1 (select |v_#valid_BEFORE_CALL_13| .cse1))) |v_#valid_BEFORE_CALL_13|) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_4|) 0) (= 0 (select |v_#valid_BEFORE_CALL_12| .cse0))))) (= |c_ULTIMATE.start_sll_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (let ((.cse3 (or (= (select (select |c_#memory_$Pointer$#2.offset| .cse4) 4) 0) (= .cse4 |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|)))) (or (and (= .cse2 |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|) .cse3) (and .cse3 (= (select (select |c_#memory_$Pointer$#2.offset| .cse2) 4) 0)))) (= |c_ULTIMATE.start_sll_prepend_#t~ret7#1.offset| 0) (or (= .cse2 .cse4) (= (select (select |c_#memory_$Pointer$#2.base| .cse2) 4) 0)) (= |c_ULTIMATE.start_sll_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (exists ((|v_#valid_BEFORE_CALL_15| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_17| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_17| |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_15| .cse4) 0) (= (select |v_old(#valid)_AFTER_CALL_17| .cse4) 1) (= (select |v_#valid_BEFORE_CALL_15| .cse2) 1) (= (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_15| |v_old(#valid)_AFTER_CALL_17|))) (store |v_#valid_BEFORE_CALL_15| .cse5 (select |v_old(#valid)_AFTER_CALL_17| .cse5))) |v_old(#valid)_AFTER_CALL_17|))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)))) is different from true [2024-11-19 20:52:01,486 INFO L349 Elim1Store]: treesize reduction 20, result has 58.3 percent of original size [2024-11-19 20:52:01,486 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 198 treesize of output 150 [2024-11-19 20:52:01,497 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 20:52:01,505 INFO L349 Elim1Store]: treesize reduction 49, result has 12.5 percent of original size [2024-11-19 20:52:01,506 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 191 treesize of output 125 [2024-11-19 20:52:01,536 INFO L349 Elim1Store]: treesize reduction 72, result has 57.9 percent of original size [2024-11-19 20:52:01,536 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 123 treesize of output 173 [2024-11-19 20:52:01,593 INFO L349 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2024-11-19 20:52:01,594 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 21 [2024-11-19 20:52:01,920 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse2) 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| .cse1) 4))) (and (or (= (select (select |c_#memory_$Pointer$#2.base| .cse0) 4) 0) (= .cse1 .cse0)) (exists ((|v_#valid_BEFORE_CALL_15| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_17| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_15| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_17| .cse2) 0) (= 1 (select |v_old(#valid)_AFTER_CALL_17| .cse1)) (= (select |v_#valid_BEFORE_CALL_15| .cse1) 0) (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_15| |v_old(#valid)_AFTER_CALL_17|))) (store |v_#valid_BEFORE_CALL_15| .cse3 (select |v_old(#valid)_AFTER_CALL_17| .cse3))) |v_old(#valid)_AFTER_CALL_17|))) (= (select (select |c_#memory_$Pointer$#2.offset| .cse2) 4) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) 4) 0) (or (exists ((v_arrayElimIndex_4 Int) (|v_#valid_BEFORE_CALL_12| (Array Int Int)) (|v_#valid_BEFORE_CALL_13| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_12| v_arrayElimIndex_4) 1) (= (select |v_#valid_BEFORE_CALL_12| .cse1) 0) (= (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_12| |v_#valid_BEFORE_CALL_13|))) (store |v_#valid_BEFORE_CALL_12| .cse4 (select |v_#valid_BEFORE_CALL_13| .cse4))) |v_#valid_BEFORE_CALL_13|) (= (select |v_#valid_BEFORE_CALL_13| .cse1) 1))) (exists ((v_arrayElimIndex_4 Int) (|v_#valid_BEFORE_CALL_12| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_12| v_arrayElimIndex_4) 1) (exists ((|v_#valid_BEFORE_CALL_13| (Array Int Int))) (and (exists ((|v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_4| Int) (|v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5| Int)) (let ((.cse5 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_4|))) (and (= (select |v_#valid_BEFORE_CALL_13| .cse5) 1) (not (= |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5| |c_ULTIMATE.start_main_~#s~0#1.base|)) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_4|) 0) (= 0 (select |v_#valid_BEFORE_CALL_12| .cse5))))) (= (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_12| |v_#valid_BEFORE_CALL_13|))) (store |v_#valid_BEFORE_CALL_12| .cse6 (select |v_#valid_BEFORE_CALL_13| .cse6))) |v_#valid_BEFORE_CALL_13|))))) (exists ((v_arrayElimIndex_4 Int) (|v_#valid_BEFORE_CALL_12| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_12| v_arrayElimIndex_4) 1) (exists ((|v_#valid_BEFORE_CALL_13| (Array Int Int))) (and (exists ((|v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_4| Int) (|v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5| Int)) (let ((.cse7 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_4|))) (and (not (= |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_4| |c_ULTIMATE.start_main_~#s~0#1.offset|)) (= (select |v_#valid_BEFORE_CALL_13| .cse7) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_4|) 0) (= 0 (select |v_#valid_BEFORE_CALL_12| .cse7))))) (= (let ((.cse8 (@diff |v_#valid_BEFORE_CALL_12| |v_#valid_BEFORE_CALL_13|))) (store |v_#valid_BEFORE_CALL_12| .cse8 (select |v_#valid_BEFORE_CALL_13| .cse8))) |v_#valid_BEFORE_CALL_13|)))))) (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0))))) is different from false [2024-11-19 20:52:01,924 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse2) 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| .cse1) 4))) (and (or (= (select (select |c_#memory_$Pointer$#2.base| .cse0) 4) 0) (= .cse1 .cse0)) (exists ((|v_#valid_BEFORE_CALL_15| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_17| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_15| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_17| .cse2) 0) (= 1 (select |v_old(#valid)_AFTER_CALL_17| .cse1)) (= (select |v_#valid_BEFORE_CALL_15| .cse1) 0) (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_15| |v_old(#valid)_AFTER_CALL_17|))) (store |v_#valid_BEFORE_CALL_15| .cse3 (select |v_old(#valid)_AFTER_CALL_17| .cse3))) |v_old(#valid)_AFTER_CALL_17|))) (= (select (select |c_#memory_$Pointer$#2.offset| .cse2) 4) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) 4) 0) (or (exists ((v_arrayElimIndex_4 Int) (|v_#valid_BEFORE_CALL_12| (Array Int Int)) (|v_#valid_BEFORE_CALL_13| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_12| v_arrayElimIndex_4) 1) (= (select |v_#valid_BEFORE_CALL_12| .cse1) 0) (= (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_12| |v_#valid_BEFORE_CALL_13|))) (store |v_#valid_BEFORE_CALL_12| .cse4 (select |v_#valid_BEFORE_CALL_13| .cse4))) |v_#valid_BEFORE_CALL_13|) (= (select |v_#valid_BEFORE_CALL_13| .cse1) 1))) (exists ((v_arrayElimIndex_4 Int) (|v_#valid_BEFORE_CALL_12| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_12| v_arrayElimIndex_4) 1) (exists ((|v_#valid_BEFORE_CALL_13| (Array Int Int))) (and (exists ((|v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_4| Int) (|v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5| Int)) (let ((.cse5 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_4|))) (and (= (select |v_#valid_BEFORE_CALL_13| .cse5) 1) (not (= |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5| |c_ULTIMATE.start_main_~#s~0#1.base|)) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_4|) 0) (= 0 (select |v_#valid_BEFORE_CALL_12| .cse5))))) (= (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_12| |v_#valid_BEFORE_CALL_13|))) (store |v_#valid_BEFORE_CALL_12| .cse6 (select |v_#valid_BEFORE_CALL_13| .cse6))) |v_#valid_BEFORE_CALL_13|))))) (exists ((v_arrayElimIndex_4 Int) (|v_#valid_BEFORE_CALL_12| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_12| v_arrayElimIndex_4) 1) (exists ((|v_#valid_BEFORE_CALL_13| (Array Int Int))) (and (exists ((|v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_4| Int) (|v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5| Int)) (let ((.cse7 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_4|))) (and (not (= |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_4| |c_ULTIMATE.start_main_~#s~0#1.offset|)) (= (select |v_#valid_BEFORE_CALL_13| .cse7) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_4|) 0) (= 0 (select |v_#valid_BEFORE_CALL_12| .cse7))))) (= (let ((.cse8 (@diff |v_#valid_BEFORE_CALL_12| |v_#valid_BEFORE_CALL_13|))) (store |v_#valid_BEFORE_CALL_12| .cse8 (select |v_#valid_BEFORE_CALL_13| .cse8))) |v_#valid_BEFORE_CALL_13|)))))) (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0))))) is different from true [2024-11-19 20:52:02,004 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 20:52:02,004 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 287 treesize of output 255 [2024-11-19 20:52:02,046 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 20:52:02,046 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 123 treesize of output 147 [2024-11-19 20:52:02,764 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| .cse1) 4))) (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (or (= (select (select |c_#memory_$Pointer$#2.base| .cse0) 4) 0) (= .cse1 .cse0)) (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) 4) 0) (exists ((|v_#valid_BEFORE_CALL_15| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_17| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_17| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_17| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_15| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_15| .cse1) 0) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_15| |v_old(#valid)_AFTER_CALL_17|))) (store |v_#valid_BEFORE_CALL_15| .cse2 (select |v_old(#valid)_AFTER_CALL_17| .cse2))) |v_old(#valid)_AFTER_CALL_17|)))))) is different from false [2024-11-19 20:52:02,766 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| .cse1) 4))) (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (or (= (select (select |c_#memory_$Pointer$#2.base| .cse0) 4) 0) (= .cse1 .cse0)) (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) 4) 0) (exists ((|v_#valid_BEFORE_CALL_15| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_17| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_17| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_17| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_15| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_15| .cse1) 0) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_15| |v_old(#valid)_AFTER_CALL_17|))) (store |v_#valid_BEFORE_CALL_15| .cse2 (select |v_old(#valid)_AFTER_CALL_17| .cse2))) |v_old(#valid)_AFTER_CALL_17|)))))) is different from true [2024-11-19 20:52:02,817 WARN L851 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~ptr~0#1.base_29| Int) (|v_#valid_BEFORE_CALL_15| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_17| (Array Int Int))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_main_~ptr~0#1.base_29|) 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| .cse1) 4))) (and (= (select (select |c_#memory_$Pointer$#2.base| .cse0) 4) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) 4) 0) (= (select |v_#valid_BEFORE_CALL_15| .cse1) 0) (= |c_ULTIMATE.start_main_~temp~2#1.base| .cse1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_main_~ptr~0#1.base_29|) 4) 0) (= (select |v_old(#valid)_AFTER_CALL_17| |v_ULTIMATE.start_main_~ptr~0#1.base_29|) 0) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_15| |v_old(#valid)_AFTER_CALL_17|))) (store |v_#valid_BEFORE_CALL_15| .cse2 (select |v_old(#valid)_AFTER_CALL_17| .cse2))) |v_old(#valid)_AFTER_CALL_17|) (= (select |v_#valid_BEFORE_CALL_15| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_17| .cse1) 1))))) (= |c_ULTIMATE.start_main_~temp~2#1.offset| 0)) is different from false [2024-11-19 20:52:02,819 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~ptr~0#1.base_29| Int) (|v_#valid_BEFORE_CALL_15| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_17| (Array Int Int))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_main_~ptr~0#1.base_29|) 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| .cse1) 4))) (and (= (select (select |c_#memory_$Pointer$#2.base| .cse0) 4) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) 4) 0) (= (select |v_#valid_BEFORE_CALL_15| .cse1) 0) (= |c_ULTIMATE.start_main_~temp~2#1.base| .cse1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_main_~ptr~0#1.base_29|) 4) 0) (= (select |v_old(#valid)_AFTER_CALL_17| |v_ULTIMATE.start_main_~ptr~0#1.base_29|) 0) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_15| |v_old(#valid)_AFTER_CALL_17|))) (store |v_#valid_BEFORE_CALL_15| .cse2 (select |v_old(#valid)_AFTER_CALL_17| .cse2))) |v_old(#valid)_AFTER_CALL_17|) (= (select |v_#valid_BEFORE_CALL_15| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_17| .cse1) 1))))) (= |c_ULTIMATE.start_main_~temp~2#1.offset| 0)) is different from true [2024-11-19 20:52:02,846 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (exists ((|v_ULTIMATE.start_main_~ptr~0#1.base_29| Int) (|v_#valid_BEFORE_CALL_15| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_17| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_main_~ptr~0#1.base_29|) 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse0) 4))) (and (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse0) (= (select (select |c_#memory_$Pointer$#2.base| .cse1) 4) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) 4) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0) (= (select |v_#valid_BEFORE_CALL_15| .cse0) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_main_~ptr~0#1.base_29|) 4) 0) (= (select |v_old(#valid)_AFTER_CALL_17| |v_ULTIMATE.start_main_~ptr~0#1.base_29|) 0) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_15| |v_old(#valid)_AFTER_CALL_17|))) (store |v_#valid_BEFORE_CALL_15| .cse2 (select |v_old(#valid)_AFTER_CALL_17| .cse2))) |v_old(#valid)_AFTER_CALL_17|) (= (select |v_#valid_BEFORE_CALL_15| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_17| .cse0) 1)))))) is different from false [2024-11-19 20:52:02,848 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (exists ((|v_ULTIMATE.start_main_~ptr~0#1.base_29| Int) (|v_#valid_BEFORE_CALL_15| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_17| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_main_~ptr~0#1.base_29|) 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse0) 4))) (and (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse0) (= (select (select |c_#memory_$Pointer$#2.base| .cse1) 4) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) 4) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0) (= (select |v_#valid_BEFORE_CALL_15| .cse0) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_main_~ptr~0#1.base_29|) 4) 0) (= (select |v_old(#valid)_AFTER_CALL_17| |v_ULTIMATE.start_main_~ptr~0#1.base_29|) 0) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_15| |v_old(#valid)_AFTER_CALL_17|))) (store |v_#valid_BEFORE_CALL_15| .cse2 (select |v_old(#valid)_AFTER_CALL_17| .cse2))) |v_old(#valid)_AFTER_CALL_17|) (= (select |v_#valid_BEFORE_CALL_15| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_17| .cse0) 1)))))) is different from true [2024-11-19 20:52:02,880 WARN L851 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~ptr~0#1.base_29| Int) (|v_old(#valid)_AFTER_CALL_17| (Array Int Int)) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_main_~ptr~0#1.base_29|) 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| .cse1) 4))) (and (= (select (select |c_#memory_$Pointer$#2.base| .cse0) 4) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) 4) 0) (= |c_ULTIMATE.start_main_~temp~2#1.base| .cse0) (= (select |v_#valid_BEFORE_CALL_15| .cse1) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_main_~ptr~0#1.base_29|) 4) 0) (= (select |v_old(#valid)_AFTER_CALL_17| |v_ULTIMATE.start_main_~ptr~0#1.base_29|) 0) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_15| |v_old(#valid)_AFTER_CALL_17|))) (store |v_#valid_BEFORE_CALL_15| .cse2 (select |v_old(#valid)_AFTER_CALL_17| .cse2))) |v_old(#valid)_AFTER_CALL_17|) (= (select |v_#valid_BEFORE_CALL_15| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_17| .cse1) 1))))) (= |c_ULTIMATE.start_main_~temp~2#1.offset| 0)) is different from false [2024-11-19 20:52:02,881 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~ptr~0#1.base_29| Int) (|v_old(#valid)_AFTER_CALL_17| (Array Int Int)) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_main_~ptr~0#1.base_29|) 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| .cse1) 4))) (and (= (select (select |c_#memory_$Pointer$#2.base| .cse0) 4) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) 4) 0) (= |c_ULTIMATE.start_main_~temp~2#1.base| .cse0) (= (select |v_#valid_BEFORE_CALL_15| .cse1) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_main_~ptr~0#1.base_29|) 4) 0) (= (select |v_old(#valid)_AFTER_CALL_17| |v_ULTIMATE.start_main_~ptr~0#1.base_29|) 0) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_15| |v_old(#valid)_AFTER_CALL_17|))) (store |v_#valid_BEFORE_CALL_15| .cse2 (select |v_old(#valid)_AFTER_CALL_17| .cse2))) |v_old(#valid)_AFTER_CALL_17|) (= (select |v_#valid_BEFORE_CALL_15| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_17| .cse1) 1))))) (= |c_ULTIMATE.start_main_~temp~2#1.offset| 0)) is different from true [2024-11-19 20:52:02,909 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (exists ((|v_ULTIMATE.start_main_~ptr~0#1.base_29| Int) (|v_#valid_BEFORE_CALL_15| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_17| (Array Int Int))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_main_~ptr~0#1.base_29|) 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| .cse1) 4))) (and (= (select (select |c_#memory_$Pointer$#2.base| .cse0) 4) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) 4) 0) (= (select |v_#valid_BEFORE_CALL_15| .cse1) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_main_~ptr~0#1.base_29|) 4) 0) (= (select |v_old(#valid)_AFTER_CALL_17| |v_ULTIMATE.start_main_~ptr~0#1.base_29|) 0) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse0) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_15| |v_old(#valid)_AFTER_CALL_17|))) (store |v_#valid_BEFORE_CALL_15| .cse2 (select |v_old(#valid)_AFTER_CALL_17| .cse2))) |v_old(#valid)_AFTER_CALL_17|) (= (select |v_#valid_BEFORE_CALL_15| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_17| .cse1) 1)))))) is different from false [2024-11-19 20:52:02,910 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (exists ((|v_ULTIMATE.start_main_~ptr~0#1.base_29| Int) (|v_#valid_BEFORE_CALL_15| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_17| (Array Int Int))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_main_~ptr~0#1.base_29|) 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| .cse1) 4))) (and (= (select (select |c_#memory_$Pointer$#2.base| .cse0) 4) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) 4) 0) (= (select |v_#valid_BEFORE_CALL_15| .cse1) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_main_~ptr~0#1.base_29|) 4) 0) (= (select |v_old(#valid)_AFTER_CALL_17| |v_ULTIMATE.start_main_~ptr~0#1.base_29|) 0) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse0) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_15| |v_old(#valid)_AFTER_CALL_17|))) (store |v_#valid_BEFORE_CALL_15| .cse2 (select |v_old(#valid)_AFTER_CALL_17| .cse2))) |v_old(#valid)_AFTER_CALL_17|) (= (select |v_#valid_BEFORE_CALL_15| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_17| .cse1) 1)))))) is different from true [2024-11-19 20:52:02,925 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 22 not checked. [2024-11-19 20:52:02,925 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 20:52:03,242 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 20:52:03,243 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 423 treesize of output 385 [2024-11-19 20:52:03,249 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 20:52:03,249 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 374 treesize of output 336 [2024-11-19 20:52:03,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [886376721] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 20:52:03,450 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 20:52:03,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 27] total 41 [2024-11-19 20:52:03,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317074711] [2024-11-19 20:52:03,451 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 20:52:03,451 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2024-11-19 20:52:03,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 20:52:03,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2024-11-19 20:52:03,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=1042, Unknown=30, NotChecked=1170, Total=2352 [2024-11-19 20:52:03,453 INFO L87 Difference]: Start difference. First operand 37 states and 40 transitions. Second operand has 41 states, 39 states have (on average 1.3333333333333333) internal successors, (52), 33 states have internal predecessors, (52), 4 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2024-11-19 20:52:03,575 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0)) (.cse2 (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0))) (and .cse0 (not (= |c_ULTIMATE.start_sll_create_#t~ret4#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (or .cse0 (exists ((|v_#memory_$Pointer$#2.base_BEFORE_CALL_8| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_#memory_$Pointer$#2.base_BEFORE_CALL_8| |c_#memory_$Pointer$#2.base|))) (and (= (store |v_#memory_$Pointer$#2.base_BEFORE_CALL_8| .cse1 (select |c_#memory_$Pointer$#2.base| .cse1)) |c_#memory_$Pointer$#2.base|) (= (select (select |v_#memory_$Pointer$#2.base_BEFORE_CALL_8| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0) (= |c_ULTIMATE.start_sll_create_#t~ret4#1.base| .cse1))))) .cse2 (exists ((|v_#valid_BEFORE_CALL_12| (Array Int Int))) (and (= |c_#valid| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_12| |c_#valid|))) (store |v_#valid_BEFORE_CALL_12| .cse3 (select |c_#valid| .cse3)))) (= (select |v_#valid_BEFORE_CALL_12| |c_ULTIMATE.start_sll_create_#t~ret4#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_12| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1))) (or (exists ((|v_#memory_$Pointer$#2.offset_BEFORE_CALL_4| (Array Int (Array Int Int)))) (let ((.cse4 (@diff |v_#memory_$Pointer$#2.offset_BEFORE_CALL_4| |c_#memory_$Pointer$#2.offset|))) (and (= 0 (select (select |v_#memory_$Pointer$#2.offset_BEFORE_CALL_4| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4)) (= |c_#memory_$Pointer$#2.offset| (store |v_#memory_$Pointer$#2.offset_BEFORE_CALL_4| .cse4 (select |c_#memory_$Pointer$#2.offset| .cse4))) (= .cse4 |c_ULTIMATE.start_sll_create_#t~ret4#1.base|)))) .cse2) (= |c_ULTIMATE.start_sll_create_#t~ret4#1.offset| 0) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_#t~ret4#1.base|) 1))) is different from false [2024-11-19 20:52:03,578 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0)) (.cse2 (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0))) (and .cse0 (not (= |c_ULTIMATE.start_sll_create_#t~ret4#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (or .cse0 (exists ((|v_#memory_$Pointer$#2.base_BEFORE_CALL_8| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_#memory_$Pointer$#2.base_BEFORE_CALL_8| |c_#memory_$Pointer$#2.base|))) (and (= (store |v_#memory_$Pointer$#2.base_BEFORE_CALL_8| .cse1 (select |c_#memory_$Pointer$#2.base| .cse1)) |c_#memory_$Pointer$#2.base|) (= (select (select |v_#memory_$Pointer$#2.base_BEFORE_CALL_8| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0) (= |c_ULTIMATE.start_sll_create_#t~ret4#1.base| .cse1))))) .cse2 (exists ((|v_#valid_BEFORE_CALL_12| (Array Int Int))) (and (= |c_#valid| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_12| |c_#valid|))) (store |v_#valid_BEFORE_CALL_12| .cse3 (select |c_#valid| .cse3)))) (= (select |v_#valid_BEFORE_CALL_12| |c_ULTIMATE.start_sll_create_#t~ret4#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_12| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1))) (or (exists ((|v_#memory_$Pointer$#2.offset_BEFORE_CALL_4| (Array Int (Array Int Int)))) (let ((.cse4 (@diff |v_#memory_$Pointer$#2.offset_BEFORE_CALL_4| |c_#memory_$Pointer$#2.offset|))) (and (= 0 (select (select |v_#memory_$Pointer$#2.offset_BEFORE_CALL_4| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4)) (= |c_#memory_$Pointer$#2.offset| (store |v_#memory_$Pointer$#2.offset_BEFORE_CALL_4| .cse4 (select |c_#memory_$Pointer$#2.offset| .cse4))) (= .cse4 |c_ULTIMATE.start_sll_create_#t~ret4#1.base|)))) .cse2) (= |c_ULTIMATE.start_sll_create_#t~ret4#1.offset| 0) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_#t~ret4#1.base|) 1))) is different from true [2024-11-19 20:52:03,584 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4))) (let ((.cse1 (= (select (select |c_#memory_$Pointer$#2.base| .cse0) 4) 0)) (.cse4 (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0)) (.cse5 (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0))) (and (or (= .cse0 |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse1 (exists ((|v_#memory_$Pointer$#2.base_62| (Array Int (Array Int Int)))) (and (= (store |v_#memory_$Pointer$#2.base_62| |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select |v_#memory_$Pointer$#2.base_62| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4 .cse0)) |c_#memory_$Pointer$#2.base|) (exists ((|v_#memory_$Pointer$#2.base_BEFORE_CALL_8| (Array Int (Array Int Int)))) (let ((.cse2 (@diff |v_#memory_$Pointer$#2.base_BEFORE_CALL_8| |v_#memory_$Pointer$#2.base_62|))) (and (= (store |v_#memory_$Pointer$#2.base_BEFORE_CALL_8| .cse2 (select |v_#memory_$Pointer$#2.base_62| .cse2)) |v_#memory_$Pointer$#2.base_62|) (= (select (select |v_#memory_$Pointer$#2.base_BEFORE_CALL_8| .cse0) 4) 0) (= .cse2 |c_ULTIMATE.start_sll_create_~head~0#1.base|))))))) (or (exists ((|v_#memory_$Pointer$#2.offset_53| (Array Int (Array Int Int)))) (and (exists ((|v_#memory_$Pointer$#2.offset_BEFORE_CALL_4| (Array Int (Array Int Int)))) (let ((.cse3 (@diff |v_#memory_$Pointer$#2.offset_BEFORE_CALL_4| |v_#memory_$Pointer$#2.offset_53|))) (and (= (select (select |v_#memory_$Pointer$#2.offset_BEFORE_CALL_4| .cse0) 4) 0) (= .cse3 |c_ULTIMATE.start_sll_create_~head~0#1.base|) (= |v_#memory_$Pointer$#2.offset_53| (store |v_#memory_$Pointer$#2.offset_BEFORE_CALL_4| .cse3 (select |v_#memory_$Pointer$#2.offset_53| .cse3)))))) (= (store |v_#memory_$Pointer$#2.offset_53| |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select |v_#memory_$Pointer$#2.offset_53| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4 0)) |c_#memory_$Pointer$#2.offset|))) (and .cse4 .cse5)) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) .cse1 .cse4 (exists ((|v_#valid_BEFORE_CALL_12| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_12| .cse0) 1) (= |c_#valid| (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_12| |c_#valid|))) (store |v_#valid_BEFORE_CALL_12| .cse6 (select |c_#valid| .cse6)))) (= (select |v_#valid_BEFORE_CALL_12| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0))) (= (select |c_#valid| .cse0) 1) .cse5 (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0)))) is different from false [2024-11-19 20:52:03,587 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4))) (let ((.cse1 (= (select (select |c_#memory_$Pointer$#2.base| .cse0) 4) 0)) (.cse4 (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0)) (.cse5 (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0))) (and (or (= .cse0 |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse1 (exists ((|v_#memory_$Pointer$#2.base_62| (Array Int (Array Int Int)))) (and (= (store |v_#memory_$Pointer$#2.base_62| |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select |v_#memory_$Pointer$#2.base_62| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4 .cse0)) |c_#memory_$Pointer$#2.base|) (exists ((|v_#memory_$Pointer$#2.base_BEFORE_CALL_8| (Array Int (Array Int Int)))) (let ((.cse2 (@diff |v_#memory_$Pointer$#2.base_BEFORE_CALL_8| |v_#memory_$Pointer$#2.base_62|))) (and (= (store |v_#memory_$Pointer$#2.base_BEFORE_CALL_8| .cse2 (select |v_#memory_$Pointer$#2.base_62| .cse2)) |v_#memory_$Pointer$#2.base_62|) (= (select (select |v_#memory_$Pointer$#2.base_BEFORE_CALL_8| .cse0) 4) 0) (= .cse2 |c_ULTIMATE.start_sll_create_~head~0#1.base|))))))) (or (exists ((|v_#memory_$Pointer$#2.offset_53| (Array Int (Array Int Int)))) (and (exists ((|v_#memory_$Pointer$#2.offset_BEFORE_CALL_4| (Array Int (Array Int Int)))) (let ((.cse3 (@diff |v_#memory_$Pointer$#2.offset_BEFORE_CALL_4| |v_#memory_$Pointer$#2.offset_53|))) (and (= (select (select |v_#memory_$Pointer$#2.offset_BEFORE_CALL_4| .cse0) 4) 0) (= .cse3 |c_ULTIMATE.start_sll_create_~head~0#1.base|) (= |v_#memory_$Pointer$#2.offset_53| (store |v_#memory_$Pointer$#2.offset_BEFORE_CALL_4| .cse3 (select |v_#memory_$Pointer$#2.offset_53| .cse3)))))) (= (store |v_#memory_$Pointer$#2.offset_53| |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select |v_#memory_$Pointer$#2.offset_53| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4 0)) |c_#memory_$Pointer$#2.offset|))) (and .cse4 .cse5)) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) .cse1 .cse4 (exists ((|v_#valid_BEFORE_CALL_12| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_12| .cse0) 1) (= |c_#valid| (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_12| |c_#valid|))) (store |v_#valid_BEFORE_CALL_12| .cse6 (select |c_#valid| .cse6)))) (= (select |v_#valid_BEFORE_CALL_12| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0))) (= (select |c_#valid| .cse0) 1) .cse5 (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0)))) is different from true [2024-11-19 20:52:03,590 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4))) (let ((.cse0 (= (select (select |c_#memory_$Pointer$#2.base| .cse1) 4) 0))) (and (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) .cse0 (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0) (exists ((|v_#valid_BEFORE_CALL_12| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_12| .cse1) 1) (= |c_#valid| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_12| |c_#valid|))) (store |v_#valid_BEFORE_CALL_12| .cse2 (select |c_#valid| .cse2)))) (= (select |v_#valid_BEFORE_CALL_12| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0))) (= (select |c_#valid| .cse1) 1) (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) 4) 0) (or (= .cse1 |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse0) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0)))) is different from false [2024-11-19 20:52:03,592 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4))) (let ((.cse0 (= (select (select |c_#memory_$Pointer$#2.base| .cse1) 4) 0))) (and (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) .cse0 (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0) (exists ((|v_#valid_BEFORE_CALL_12| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_12| .cse1) 1) (= |c_#valid| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_12| |c_#valid|))) (store |v_#valid_BEFORE_CALL_12| .cse2 (select |c_#valid| .cse2)))) (= (select |v_#valid_BEFORE_CALL_12| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0))) (= (select |c_#valid| .cse1) 1) (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) 4) 0) (or (= .cse1 |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse0) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0)))) is different from true [2024-11-19 20:52:03,596 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_create_#res#1.base|) 4))) (let ((.cse2 (= (select (select |c_#memory_$Pointer$#2.base| .cse0) 4) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_create_#res#1.base|) 4) 0) (= (select |c_#valid| .cse0) 1) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_#res#1.base|) 1) (exists ((|v_#valid_BEFORE_CALL_12| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_12| |c_ULTIMATE.start_sll_create_#res#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_12| .cse0) 1) (= |c_#valid| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_12| |c_#valid|))) (store |v_#valid_BEFORE_CALL_12| .cse1 (select |c_#valid| .cse1)))))) .cse2 (or (= |c_ULTIMATE.start_sll_create_#res#1.base| .cse0) .cse2) (= |c_ULTIMATE.start_sll_create_#res#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0)))) is different from false [2024-11-19 20:52:03,598 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_create_#res#1.base|) 4))) (let ((.cse2 (= (select (select |c_#memory_$Pointer$#2.base| .cse0) 4) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_create_#res#1.base|) 4) 0) (= (select |c_#valid| .cse0) 1) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_#res#1.base|) 1) (exists ((|v_#valid_BEFORE_CALL_12| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_12| |c_ULTIMATE.start_sll_create_#res#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_12| .cse0) 1) (= |c_#valid| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_12| |c_#valid|))) (store |v_#valid_BEFORE_CALL_12| .cse1 (select |c_#valid| .cse1)))))) .cse2 (or (= |c_ULTIMATE.start_sll_create_#res#1.base| .cse0) .cse2) (= |c_ULTIMATE.start_sll_create_#res#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0)))) is different from true [2024-11-19 20:52:03,601 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_prepend_~head#1.base|) |c_ULTIMATE.start_sll_prepend_~head#1.offset|)) (.cse3 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse3) 4)) (.cse0 (select (select |c_#memory_$Pointer$#2.base| .cse4) 4))) (and (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0) (= |c_ULTIMATE.start_sll_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_12| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_12| .cse1) 1) (= |c_#valid| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_12| |c_#valid|))) (store |v_#valid_BEFORE_CALL_12| .cse2 (select |c_#valid| .cse2)))) (= (select |v_#valid_BEFORE_CALL_12| .cse3) 0))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_prepend_~head#1.base|) |c_ULTIMATE.start_sll_prepend_~head#1.offset|) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse3) 4) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) 4) 0) (or (= .cse1 .cse3) (= (select (select |c_#memory_$Pointer$#2.base| .cse1) 4) 0)) (= (select |c_#valid| .cse0) 1) (= (select (select |c_#memory_$Pointer$#2.offset| .cse4) 4) 0) (= (select (select |c_#memory_$Pointer$#2.base| .cse0) 4) 0) (= |c_ULTIMATE.start_sll_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= (select |c_#valid| .cse3) 1) (= (select |c_#valid| .cse4) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)))) is different from false [2024-11-19 20:52:03,603 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_prepend_~head#1.base|) |c_ULTIMATE.start_sll_prepend_~head#1.offset|)) (.cse3 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse3) 4)) (.cse0 (select (select |c_#memory_$Pointer$#2.base| .cse4) 4))) (and (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0) (= |c_ULTIMATE.start_sll_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_12| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_12| .cse1) 1) (= |c_#valid| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_12| |c_#valid|))) (store |v_#valid_BEFORE_CALL_12| .cse2 (select |c_#valid| .cse2)))) (= (select |v_#valid_BEFORE_CALL_12| .cse3) 0))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_prepend_~head#1.base|) |c_ULTIMATE.start_sll_prepend_~head#1.offset|) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse3) 4) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) 4) 0) (or (= .cse1 .cse3) (= (select (select |c_#memory_$Pointer$#2.base| .cse1) 4) 0)) (= (select |c_#valid| .cse0) 1) (= (select (select |c_#memory_$Pointer$#2.offset| .cse4) 4) 0) (= (select (select |c_#memory_$Pointer$#2.base| .cse0) 4) 0) (= |c_ULTIMATE.start_sll_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= (select |c_#valid| .cse3) 1) (= (select |c_#valid| .cse4) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)))) is different from true [2024-11-19 20:52:03,606 WARN L851 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimIndex_4 Int) (|v_#valid_BEFORE_CALL_12| (Array Int Int)) (|v_#valid_BEFORE_CALL_13| (Array Int Int)) (|v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_4| Int) (|v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_4|))) (and (= (select |v_#valid_BEFORE_CALL_12| v_arrayElimIndex_4) 1) (= (select |v_#valid_BEFORE_CALL_13| .cse0) 1) (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_12| |v_#valid_BEFORE_CALL_13|))) (store |v_#valid_BEFORE_CALL_12| .cse1 (select |v_#valid_BEFORE_CALL_13| .cse1))) |v_#valid_BEFORE_CALL_13|) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_4|) 0) (= 0 (select |v_#valid_BEFORE_CALL_12| .cse0))))) (= |c_#valid| |c_old(#valid)|) (= |c_#memory_$Pointer$#2.offset| |c_old(#memory_$Pointer$#2.offset)|) (= |c_old(#length)| |c_#length|) (= |c_old(#memory_int#2)| |c_#memory_int#2|) (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|)) is different from false [2024-11-19 20:52:03,607 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimIndex_4 Int) (|v_#valid_BEFORE_CALL_12| (Array Int Int)) (|v_#valid_BEFORE_CALL_13| (Array Int Int)) (|v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_4| Int) (|v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_4|))) (and (= (select |v_#valid_BEFORE_CALL_12| v_arrayElimIndex_4) 1) (= (select |v_#valid_BEFORE_CALL_13| .cse0) 1) (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_12| |v_#valid_BEFORE_CALL_13|))) (store |v_#valid_BEFORE_CALL_12| .cse1 (select |v_#valid_BEFORE_CALL_13| .cse1))) |v_#valid_BEFORE_CALL_13|) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_4|) 0) (= 0 (select |v_#valid_BEFORE_CALL_12| .cse0))))) (= |c_#valid| |c_old(#valid)|) (= |c_#memory_$Pointer$#2.offset| |c_old(#memory_$Pointer$#2.offset)|) (= |c_old(#length)| |c_#length|) (= |c_old(#memory_int#2)| |c_#memory_int#2|) (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|)) is different from true [2024-11-19 20:52:03,611 WARN L851 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimIndex_4 Int) (|v_#valid_BEFORE_CALL_12| (Array Int Int)) (|v_#valid_BEFORE_CALL_13| (Array Int Int)) (|v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_4| Int) (|v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_4|))) (and (= (select |v_#valid_BEFORE_CALL_12| v_arrayElimIndex_4) 1) (= (select |v_#valid_BEFORE_CALL_13| .cse0) 1) (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_12| |v_#valid_BEFORE_CALL_13|))) (store |v_#valid_BEFORE_CALL_12| .cse1 (select |v_#valid_BEFORE_CALL_13| .cse1))) |v_#valid_BEFORE_CALL_13|) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_4|) 0) (= 0 (select |v_#valid_BEFORE_CALL_12| .cse0))))) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| 1)) (= |c_node_create_~temp~0#1.offset| 0) (= |c_#memory_$Pointer$#2.offset| |c_old(#memory_$Pointer$#2.offset)|) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|)) is different from false [2024-11-19 20:52:03,613 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimIndex_4 Int) (|v_#valid_BEFORE_CALL_12| (Array Int Int)) (|v_#valid_BEFORE_CALL_13| (Array Int Int)) (|v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_4| Int) (|v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_4|))) (and (= (select |v_#valid_BEFORE_CALL_12| v_arrayElimIndex_4) 1) (= (select |v_#valid_BEFORE_CALL_13| .cse0) 1) (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_12| |v_#valid_BEFORE_CALL_13|))) (store |v_#valid_BEFORE_CALL_12| .cse1 (select |v_#valid_BEFORE_CALL_13| .cse1))) |v_#valid_BEFORE_CALL_13|) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_4|) 0) (= 0 (select |v_#valid_BEFORE_CALL_12| .cse0))))) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| 1)) (= |c_node_create_~temp~0#1.offset| 0) (= |c_#memory_$Pointer$#2.offset| |c_old(#memory_$Pointer$#2.offset)|) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|)) is different from true [2024-11-19 20:52:03,619 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (@diff |c_old(#memory_$Pointer$#2.offset)| |c_#memory_$Pointer$#2.offset|)) (.cse2 (@diff |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|))) (and (exists ((v_arrayElimIndex_4 Int) (|v_#valid_BEFORE_CALL_12| (Array Int Int)) (|v_#valid_BEFORE_CALL_13| (Array Int Int)) (|v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_4| Int) (|v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_4|))) (and (= (select |v_#valid_BEFORE_CALL_12| v_arrayElimIndex_4) 1) (= (select |v_#valid_BEFORE_CALL_13| .cse0) 1) (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_12| |v_#valid_BEFORE_CALL_13|))) (store |v_#valid_BEFORE_CALL_12| .cse1 (select |v_#valid_BEFORE_CALL_13| .cse1))) |v_#valid_BEFORE_CALL_13|) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_4|) 0) (= 0 (select |v_#valid_BEFORE_CALL_12| .cse0))))) (= |c_node_create_#res#1.offset| 0) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (= (store |c_old(#memory_$Pointer$#2.offset)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#2.offset| |c_node_create_#res#1.base|)) |c_#memory_$Pointer$#2.offset|) (or (= .cse2 |c_node_create_#res#1.base|) (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|)) (= (select |c_#valid| |c_node_create_#res#1.base|) 1) (= (store |c_old(#memory_$Pointer$#2.offset)| .cse3 (select |c_#memory_$Pointer$#2.offset| .cse3)) |c_#memory_$Pointer$#2.offset|) (= (store |c_old(#memory_$Pointer$#2.base)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#2.base| |c_node_create_#res#1.base|)) |c_#memory_$Pointer$#2.base|) (or (= |c_#memory_$Pointer$#2.offset| |c_old(#memory_$Pointer$#2.offset)|) (= .cse3 |c_node_create_#res#1.base|)) (= |c_#valid| (let ((.cse4 (@diff |c_old(#valid)| |c_#valid|))) (store |c_old(#valid)| .cse4 (select |c_#valid| .cse4)))) (= (store |c_old(#memory_$Pointer$#2.base)| .cse2 (select |c_#memory_$Pointer$#2.base| .cse2)) |c_#memory_$Pointer$#2.base|))) is different from false [2024-11-19 20:52:03,623 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse3 (@diff |c_old(#memory_$Pointer$#2.offset)| |c_#memory_$Pointer$#2.offset|)) (.cse2 (@diff |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|))) (and (exists ((v_arrayElimIndex_4 Int) (|v_#valid_BEFORE_CALL_12| (Array Int Int)) (|v_#valid_BEFORE_CALL_13| (Array Int Int)) (|v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_4| Int) (|v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_4|))) (and (= (select |v_#valid_BEFORE_CALL_12| v_arrayElimIndex_4) 1) (= (select |v_#valid_BEFORE_CALL_13| .cse0) 1) (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_12| |v_#valid_BEFORE_CALL_13|))) (store |v_#valid_BEFORE_CALL_12| .cse1 (select |v_#valid_BEFORE_CALL_13| .cse1))) |v_#valid_BEFORE_CALL_13|) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_4|) 0) (= 0 (select |v_#valid_BEFORE_CALL_12| .cse0))))) (= |c_node_create_#res#1.offset| 0) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (= (store |c_old(#memory_$Pointer$#2.offset)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#2.offset| |c_node_create_#res#1.base|)) |c_#memory_$Pointer$#2.offset|) (or (= .cse2 |c_node_create_#res#1.base|) (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|)) (= (select |c_#valid| |c_node_create_#res#1.base|) 1) (= (store |c_old(#memory_$Pointer$#2.offset)| .cse3 (select |c_#memory_$Pointer$#2.offset| .cse3)) |c_#memory_$Pointer$#2.offset|) (= (store |c_old(#memory_$Pointer$#2.base)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#2.base| |c_node_create_#res#1.base|)) |c_#memory_$Pointer$#2.base|) (or (= |c_#memory_$Pointer$#2.offset| |c_old(#memory_$Pointer$#2.offset)|) (= .cse3 |c_node_create_#res#1.base|)) (= |c_#valid| (let ((.cse4 (@diff |c_old(#valid)| |c_#valid|))) (store |c_old(#valid)| .cse4 (select |c_#valid| .cse4)))) (= (store |c_old(#memory_$Pointer$#2.base)| .cse2 (select |c_#memory_$Pointer$#2.base| .cse2)) |c_#memory_$Pointer$#2.base|))) is different from true [2024-11-19 20:52:03,631 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse6 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_prepend_~head#1.base|) |c_ULTIMATE.start_sll_prepend_~head#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| .cse3) 4)) (.cse4 (select (select |c_#memory_$Pointer$#2.base| .cse6) 4))) (and (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0) (exists ((v_arrayElimIndex_4 Int) (|v_#valid_BEFORE_CALL_12| (Array Int Int)) (|v_#valid_BEFORE_CALL_13| (Array Int Int)) (|v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_4| Int) (|v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5| Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_4|))) (and (= (select |v_#valid_BEFORE_CALL_12| v_arrayElimIndex_4) 1) (= (select |v_#valid_BEFORE_CALL_13| .cse1) 1) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_12| |v_#valid_BEFORE_CALL_13|))) (store |v_#valid_BEFORE_CALL_12| .cse2 (select |v_#valid_BEFORE_CALL_13| .cse2))) |v_#valid_BEFORE_CALL_13|) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_4|) 0) (= 0 (select |v_#valid_BEFORE_CALL_12| .cse1))))) (= |c_ULTIMATE.start_sll_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= .cse3 |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|)) (let ((.cse5 (or (= (select (select |c_#memory_$Pointer$#2.offset| .cse6) 4) 0) (= .cse6 |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|)))) (or (and (= .cse4 |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|) .cse5) (and .cse5 (= (select (select |c_#memory_$Pointer$#2.offset| .cse4) 4) 0)))) (not (= .cse0 |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|)) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_prepend_~head#1.base|) |c_ULTIMATE.start_sll_prepend_~head#1.offset|) 0) (= |c_ULTIMATE.start_sll_prepend_#t~ret7#1.offset| 0) (or (= .cse4 .cse6) (= (select (select |c_#memory_$Pointer$#2.base| .cse4) 4) 0)) (= (select (select |c_#memory_$Pointer$#2.offset| .cse3) 4) 0) (= (select (select |c_#memory_$Pointer$#2.base| .cse0) 4) 0) (= |c_ULTIMATE.start_sll_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (exists ((|v_#valid_BEFORE_CALL_15| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_17| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_17| |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_15| .cse6) 0) (= (select |v_old(#valid)_AFTER_CALL_17| .cse6) 1) (= (select |v_#valid_BEFORE_CALL_15| .cse4) 1) (= (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_15| |v_old(#valid)_AFTER_CALL_17|))) (store |v_#valid_BEFORE_CALL_15| .cse7 (select |v_old(#valid)_AFTER_CALL_17| .cse7))) |v_old(#valid)_AFTER_CALL_17|))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)))) is different from false [2024-11-19 20:52:03,634 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse6 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_prepend_~head#1.base|) |c_ULTIMATE.start_sll_prepend_~head#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| .cse3) 4)) (.cse4 (select (select |c_#memory_$Pointer$#2.base| .cse6) 4))) (and (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0) (exists ((v_arrayElimIndex_4 Int) (|v_#valid_BEFORE_CALL_12| (Array Int Int)) (|v_#valid_BEFORE_CALL_13| (Array Int Int)) (|v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_4| Int) (|v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5| Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_4|))) (and (= (select |v_#valid_BEFORE_CALL_12| v_arrayElimIndex_4) 1) (= (select |v_#valid_BEFORE_CALL_13| .cse1) 1) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_12| |v_#valid_BEFORE_CALL_13|))) (store |v_#valid_BEFORE_CALL_12| .cse2 (select |v_#valid_BEFORE_CALL_13| .cse2))) |v_#valid_BEFORE_CALL_13|) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_4|) 0) (= 0 (select |v_#valid_BEFORE_CALL_12| .cse1))))) (= |c_ULTIMATE.start_sll_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= .cse3 |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|)) (let ((.cse5 (or (= (select (select |c_#memory_$Pointer$#2.offset| .cse6) 4) 0) (= .cse6 |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|)))) (or (and (= .cse4 |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|) .cse5) (and .cse5 (= (select (select |c_#memory_$Pointer$#2.offset| .cse4) 4) 0)))) (not (= .cse0 |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|)) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_prepend_~head#1.base|) |c_ULTIMATE.start_sll_prepend_~head#1.offset|) 0) (= |c_ULTIMATE.start_sll_prepend_#t~ret7#1.offset| 0) (or (= .cse4 .cse6) (= (select (select |c_#memory_$Pointer$#2.base| .cse4) 4) 0)) (= (select (select |c_#memory_$Pointer$#2.offset| .cse3) 4) 0) (= (select (select |c_#memory_$Pointer$#2.base| .cse0) 4) 0) (= |c_ULTIMATE.start_sll_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (exists ((|v_#valid_BEFORE_CALL_15| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_17| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_17| |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_15| .cse6) 0) (= (select |v_old(#valid)_AFTER_CALL_17| .cse6) 1) (= (select |v_#valid_BEFORE_CALL_15| .cse4) 1) (= (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_15| |v_old(#valid)_AFTER_CALL_17|))) (store |v_#valid_BEFORE_CALL_15| .cse7 (select |v_old(#valid)_AFTER_CALL_17| .cse7))) |v_old(#valid)_AFTER_CALL_17|))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)))) is different from true [2024-11-19 20:52:03,743 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse3) 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse1) 4))) (let ((.cse0 (= (select (select |c_#memory_$Pointer$#2.base| .cse2) 4) 0))) (and (or .cse0 (= .cse1 .cse2)) (exists ((|v_#valid_BEFORE_CALL_15| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_17| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_15| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_17| .cse3) 0) (= 1 (select |v_old(#valid)_AFTER_CALL_17| .cse1)) (= (select |v_#valid_BEFORE_CALL_15| .cse1) 0) (= (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_15| |v_old(#valid)_AFTER_CALL_17|))) (store |v_#valid_BEFORE_CALL_15| .cse4 (select |v_old(#valid)_AFTER_CALL_17| .cse4))) |v_old(#valid)_AFTER_CALL_17|))) (= (select (select |c_#memory_$Pointer$#2.offset| .cse3) 4) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) 4) 0) (or (exists ((v_arrayElimIndex_4 Int) (|v_#valid_BEFORE_CALL_12| (Array Int Int)) (|v_#valid_BEFORE_CALL_13| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_12| v_arrayElimIndex_4) 1) (= (select |v_#valid_BEFORE_CALL_12| .cse1) 0) (= (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_12| |v_#valid_BEFORE_CALL_13|))) (store |v_#valid_BEFORE_CALL_12| .cse5 (select |v_#valid_BEFORE_CALL_13| .cse5))) |v_#valid_BEFORE_CALL_13|) (= (select |v_#valid_BEFORE_CALL_13| .cse1) 1))) (exists ((v_arrayElimIndex_4 Int) (|v_#valid_BEFORE_CALL_12| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_12| v_arrayElimIndex_4) 1) (exists ((|v_#valid_BEFORE_CALL_13| (Array Int Int))) (and (exists ((|v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_4| Int) (|v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5| Int)) (let ((.cse6 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_4|))) (and (= (select |v_#valid_BEFORE_CALL_13| .cse6) 1) (not (= |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5| |c_ULTIMATE.start_main_~#s~0#1.base|)) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_4|) 0) (= 0 (select |v_#valid_BEFORE_CALL_12| .cse6))))) (= (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_12| |v_#valid_BEFORE_CALL_13|))) (store |v_#valid_BEFORE_CALL_12| .cse7 (select |v_#valid_BEFORE_CALL_13| .cse7))) |v_#valid_BEFORE_CALL_13|))))) (exists ((v_arrayElimIndex_4 Int) (|v_#valid_BEFORE_CALL_12| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_12| v_arrayElimIndex_4) 1) (exists ((|v_#valid_BEFORE_CALL_13| (Array Int Int))) (and (exists ((|v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_4| Int) (|v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5| Int)) (let ((.cse8 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_4|))) (and (not (= |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_4| |c_ULTIMATE.start_main_~#s~0#1.offset|)) (= (select |v_#valid_BEFORE_CALL_13| .cse8) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_4|) 0) (= 0 (select |v_#valid_BEFORE_CALL_12| .cse8))))) (= (let ((.cse9 (@diff |v_#valid_BEFORE_CALL_12| |v_#valid_BEFORE_CALL_13|))) (store |v_#valid_BEFORE_CALL_12| .cse9 (select |v_#valid_BEFORE_CALL_13| .cse9))) |v_#valid_BEFORE_CALL_13|)))))) .cse0 (= (select (select |c_#memory_$Pointer$#2.offset| .cse2) 4) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)))))) is different from false [2024-11-19 20:52:03,746 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse3) 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse1) 4))) (let ((.cse0 (= (select (select |c_#memory_$Pointer$#2.base| .cse2) 4) 0))) (and (or .cse0 (= .cse1 .cse2)) (exists ((|v_#valid_BEFORE_CALL_15| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_17| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_15| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_17| .cse3) 0) (= 1 (select |v_old(#valid)_AFTER_CALL_17| .cse1)) (= (select |v_#valid_BEFORE_CALL_15| .cse1) 0) (= (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_15| |v_old(#valid)_AFTER_CALL_17|))) (store |v_#valid_BEFORE_CALL_15| .cse4 (select |v_old(#valid)_AFTER_CALL_17| .cse4))) |v_old(#valid)_AFTER_CALL_17|))) (= (select (select |c_#memory_$Pointer$#2.offset| .cse3) 4) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) 4) 0) (or (exists ((v_arrayElimIndex_4 Int) (|v_#valid_BEFORE_CALL_12| (Array Int Int)) (|v_#valid_BEFORE_CALL_13| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_12| v_arrayElimIndex_4) 1) (= (select |v_#valid_BEFORE_CALL_12| .cse1) 0) (= (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_12| |v_#valid_BEFORE_CALL_13|))) (store |v_#valid_BEFORE_CALL_12| .cse5 (select |v_#valid_BEFORE_CALL_13| .cse5))) |v_#valid_BEFORE_CALL_13|) (= (select |v_#valid_BEFORE_CALL_13| .cse1) 1))) (exists ((v_arrayElimIndex_4 Int) (|v_#valid_BEFORE_CALL_12| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_12| v_arrayElimIndex_4) 1) (exists ((|v_#valid_BEFORE_CALL_13| (Array Int Int))) (and (exists ((|v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_4| Int) (|v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5| Int)) (let ((.cse6 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_4|))) (and (= (select |v_#valid_BEFORE_CALL_13| .cse6) 1) (not (= |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5| |c_ULTIMATE.start_main_~#s~0#1.base|)) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_4|) 0) (= 0 (select |v_#valid_BEFORE_CALL_12| .cse6))))) (= (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_12| |v_#valid_BEFORE_CALL_13|))) (store |v_#valid_BEFORE_CALL_12| .cse7 (select |v_#valid_BEFORE_CALL_13| .cse7))) |v_#valid_BEFORE_CALL_13|))))) (exists ((v_arrayElimIndex_4 Int) (|v_#valid_BEFORE_CALL_12| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_12| v_arrayElimIndex_4) 1) (exists ((|v_#valid_BEFORE_CALL_13| (Array Int Int))) (and (exists ((|v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_4| Int) (|v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5| Int)) (let ((.cse8 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_4|))) (and (not (= |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_4| |c_ULTIMATE.start_main_~#s~0#1.offset|)) (= (select |v_#valid_BEFORE_CALL_13| .cse8) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_4|) 0) (= 0 (select |v_#valid_BEFORE_CALL_12| .cse8))))) (= (let ((.cse9 (@diff |v_#valid_BEFORE_CALL_12| |v_#valid_BEFORE_CALL_13|))) (store |v_#valid_BEFORE_CALL_12| .cse9 (select |v_#valid_BEFORE_CALL_13| .cse9))) |v_#valid_BEFORE_CALL_13|)))))) .cse0 (= (select (select |c_#memory_$Pointer$#2.offset| .cse2) 4) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)))))) is different from true [2024-11-19 20:52:03,749 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse1) 4))) (let ((.cse0 (= (select (select |c_#memory_$Pointer$#2.base| .cse2) 4) 0))) (and .cse0 (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (or .cse0 (= .cse1 .cse2)) (= (select (select |c_#memory_$Pointer$#2.offset| .cse2) 4) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) 4) 0) (exists ((|v_#valid_BEFORE_CALL_15| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_17| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_17| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_17| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_15| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_15| .cse1) 0) (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_15| |v_old(#valid)_AFTER_CALL_17|))) (store |v_#valid_BEFORE_CALL_15| .cse3 (select |v_old(#valid)_AFTER_CALL_17| .cse3))) |v_old(#valid)_AFTER_CALL_17|))))))) is different from false [2024-11-19 20:52:03,751 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse1) 4))) (let ((.cse0 (= (select (select |c_#memory_$Pointer$#2.base| .cse2) 4) 0))) (and .cse0 (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (or .cse0 (= .cse1 .cse2)) (= (select (select |c_#memory_$Pointer$#2.offset| .cse2) 4) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) 4) 0) (exists ((|v_#valid_BEFORE_CALL_15| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_17| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_17| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_17| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_15| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_15| .cse1) 0) (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_15| |v_old(#valid)_AFTER_CALL_17|))) (store |v_#valid_BEFORE_CALL_15| .cse3 (select |v_old(#valid)_AFTER_CALL_17| .cse3))) |v_old(#valid)_AFTER_CALL_17|))))))) is different from true [2024-11-19 20:52:03,758 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~temp~2#1.base|) 4))) (and (= 0 (select (select |c_#memory_$Pointer$#2.base| .cse0) 4)) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~temp~2#1.base|) 4) 0) (exists ((|v_ULTIMATE.start_main_~ptr~0#1.base_29| Int) (|v_#valid_BEFORE_CALL_15| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_17| (Array Int Int))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_main_~ptr~0#1.base_29|) 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse2) 4))) (and (= (select (select |c_#memory_$Pointer$#2.base| .cse1) 4) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) 4) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse2) 4) 0) (= (select |v_#valid_BEFORE_CALL_15| .cse2) 0) (= |c_ULTIMATE.start_main_~temp~2#1.base| .cse2) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_main_~ptr~0#1.base_29|) 4) 0) (= (select |v_old(#valid)_AFTER_CALL_17| |v_ULTIMATE.start_main_~ptr~0#1.base_29|) 0) (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_15| |v_old(#valid)_AFTER_CALL_17|))) (store |v_#valid_BEFORE_CALL_15| .cse3 (select |v_old(#valid)_AFTER_CALL_17| .cse3))) |v_old(#valid)_AFTER_CALL_17|) (= (select |v_#valid_BEFORE_CALL_15| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_17| .cse2) 1))))) (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0) (= |c_ULTIMATE.start_main_~temp~2#1.offset| 0))) is different from false [2024-11-19 20:52:03,760 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~temp~2#1.base|) 4))) (and (= 0 (select (select |c_#memory_$Pointer$#2.base| .cse0) 4)) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~temp~2#1.base|) 4) 0) (exists ((|v_ULTIMATE.start_main_~ptr~0#1.base_29| Int) (|v_#valid_BEFORE_CALL_15| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_17| (Array Int Int))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_main_~ptr~0#1.base_29|) 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse2) 4))) (and (= (select (select |c_#memory_$Pointer$#2.base| .cse1) 4) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) 4) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse2) 4) 0) (= (select |v_#valid_BEFORE_CALL_15| .cse2) 0) (= |c_ULTIMATE.start_main_~temp~2#1.base| .cse2) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_main_~ptr~0#1.base_29|) 4) 0) (= (select |v_old(#valid)_AFTER_CALL_17| |v_ULTIMATE.start_main_~ptr~0#1.base_29|) 0) (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_15| |v_old(#valid)_AFTER_CALL_17|))) (store |v_#valid_BEFORE_CALL_15| .cse3 (select |v_old(#valid)_AFTER_CALL_17| .cse3))) |v_old(#valid)_AFTER_CALL_17|) (= (select |v_#valid_BEFORE_CALL_15| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_17| .cse2) 1))))) (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0) (= |c_ULTIMATE.start_main_~temp~2#1.offset| 0))) is different from true [2024-11-19 20:52:03,763 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4))) (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.base| .cse0) 4) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4) 0) (exists ((|v_ULTIMATE.start_main_~ptr~0#1.base_29| Int) (|v_#valid_BEFORE_CALL_15| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_17| (Array Int Int))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_main_~ptr~0#1.base_29|) 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse1) 4))) (and (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse1) (= (select (select |c_#memory_$Pointer$#2.base| .cse2) 4) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse2) 4) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) 4) 0) (= (select |v_#valid_BEFORE_CALL_15| .cse1) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_main_~ptr~0#1.base_29|) 4) 0) (= (select |v_old(#valid)_AFTER_CALL_17| |v_ULTIMATE.start_main_~ptr~0#1.base_29|) 0) (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_15| |v_old(#valid)_AFTER_CALL_17|))) (store |v_#valid_BEFORE_CALL_15| .cse3 (select |v_old(#valid)_AFTER_CALL_17| .cse3))) |v_old(#valid)_AFTER_CALL_17|) (= (select |v_#valid_BEFORE_CALL_15| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_17| .cse1) 1))))) (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0))) is different from false [2024-11-19 20:52:03,765 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4))) (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.base| .cse0) 4) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4) 0) (exists ((|v_ULTIMATE.start_main_~ptr~0#1.base_29| Int) (|v_#valid_BEFORE_CALL_15| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_17| (Array Int Int))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_main_~ptr~0#1.base_29|) 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse1) 4))) (and (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse1) (= (select (select |c_#memory_$Pointer$#2.base| .cse2) 4) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse2) 4) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) 4) 0) (= (select |v_#valid_BEFORE_CALL_15| .cse1) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_main_~ptr~0#1.base_29|) 4) 0) (= (select |v_old(#valid)_AFTER_CALL_17| |v_ULTIMATE.start_main_~ptr~0#1.base_29|) 0) (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_15| |v_old(#valid)_AFTER_CALL_17|))) (store |v_#valid_BEFORE_CALL_15| .cse3 (select |v_old(#valid)_AFTER_CALL_17| .cse3))) |v_old(#valid)_AFTER_CALL_17|) (= (select |v_#valid_BEFORE_CALL_15| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_17| .cse1) 1))))) (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0))) is different from true [2024-11-19 20:52:03,770 WARN L851 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~temp~2#1.base|) 4) 0) (= (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~temp~2#1.base|) 4) 0) (exists ((|v_ULTIMATE.start_main_~ptr~0#1.base_29| Int) (|v_old(#valid)_AFTER_CALL_17| (Array Int Int)) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_main_~ptr~0#1.base_29|) 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| .cse1) 4))) (and (= (select (select |c_#memory_$Pointer$#2.base| .cse0) 4) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) 4) 0) (= |c_ULTIMATE.start_main_~temp~2#1.base| .cse0) (= (select |v_#valid_BEFORE_CALL_15| .cse1) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_main_~ptr~0#1.base_29|) 4) 0) (= (select |v_old(#valid)_AFTER_CALL_17| |v_ULTIMATE.start_main_~ptr~0#1.base_29|) 0) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_15| |v_old(#valid)_AFTER_CALL_17|))) (store |v_#valid_BEFORE_CALL_15| .cse2 (select |v_old(#valid)_AFTER_CALL_17| .cse2))) |v_old(#valid)_AFTER_CALL_17|) (= (select |v_#valid_BEFORE_CALL_15| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_17| .cse1) 1))))) (= |c_ULTIMATE.start_main_~temp~2#1.offset| 0)) is different from false [2024-11-19 20:52:03,772 WARN L873 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~temp~2#1.base|) 4) 0) (= (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~temp~2#1.base|) 4) 0) (exists ((|v_ULTIMATE.start_main_~ptr~0#1.base_29| Int) (|v_old(#valid)_AFTER_CALL_17| (Array Int Int)) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_main_~ptr~0#1.base_29|) 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| .cse1) 4))) (and (= (select (select |c_#memory_$Pointer$#2.base| .cse0) 4) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) 4) 0) (= |c_ULTIMATE.start_main_~temp~2#1.base| .cse0) (= (select |v_#valid_BEFORE_CALL_15| .cse1) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_main_~ptr~0#1.base_29|) 4) 0) (= (select |v_old(#valid)_AFTER_CALL_17| |v_ULTIMATE.start_main_~ptr~0#1.base_29|) 0) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_15| |v_old(#valid)_AFTER_CALL_17|))) (store |v_#valid_BEFORE_CALL_15| .cse2 (select |v_old(#valid)_AFTER_CALL_17| .cse2))) |v_old(#valid)_AFTER_CALL_17|) (= (select |v_#valid_BEFORE_CALL_15| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_17| .cse1) 1))))) (= |c_ULTIMATE.start_main_~temp~2#1.offset| 0)) is different from true [2024-11-19 20:52:03,775 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (exists ((|v_ULTIMATE.start_main_~ptr~0#1.base_29| Int) (|v_#valid_BEFORE_CALL_15| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_17| (Array Int Int))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_main_~ptr~0#1.base_29|) 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| .cse1) 4))) (and (= (select (select |c_#memory_$Pointer$#2.base| .cse0) 4) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) 4) 0) (= (select |v_#valid_BEFORE_CALL_15| .cse1) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_main_~ptr~0#1.base_29|) 4) 0) (= (select |v_old(#valid)_AFTER_CALL_17| |v_ULTIMATE.start_main_~ptr~0#1.base_29|) 0) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse0) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_15| |v_old(#valid)_AFTER_CALL_17|))) (store |v_#valid_BEFORE_CALL_15| .cse2 (select |v_old(#valid)_AFTER_CALL_17| .cse2))) |v_old(#valid)_AFTER_CALL_17|) (= (select |v_#valid_BEFORE_CALL_15| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_17| .cse1) 1))))) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4) 0) (= (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4) 0)) is different from false [2024-11-19 20:52:03,777 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (exists ((|v_ULTIMATE.start_main_~ptr~0#1.base_29| Int) (|v_#valid_BEFORE_CALL_15| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_17| (Array Int Int))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_main_~ptr~0#1.base_29|) 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| .cse1) 4))) (and (= (select (select |c_#memory_$Pointer$#2.base| .cse0) 4) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) 4) 0) (= (select |v_#valid_BEFORE_CALL_15| .cse1) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_main_~ptr~0#1.base_29|) 4) 0) (= (select |v_old(#valid)_AFTER_CALL_17| |v_ULTIMATE.start_main_~ptr~0#1.base_29|) 0) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse0) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_15| |v_old(#valid)_AFTER_CALL_17|))) (store |v_#valid_BEFORE_CALL_15| .cse2 (select |v_old(#valid)_AFTER_CALL_17| .cse2))) |v_old(#valid)_AFTER_CALL_17|) (= (select |v_#valid_BEFORE_CALL_15| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_17| .cse1) 1))))) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4) 0) (= (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4) 0)) is different from true [2024-11-19 20:52:03,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 20:52:03,920 INFO L93 Difference]: Finished difference Result 63 states and 70 transitions. [2024-11-19 20:52:03,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-19 20:52:03,920 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 39 states have (on average 1.3333333333333333) internal successors, (52), 33 states have internal predecessors, (52), 4 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 40 [2024-11-19 20:52:03,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 20:52:03,921 INFO L225 Difference]: With dead ends: 63 [2024-11-19 20:52:03,921 INFO L226 Difference]: Without dead ends: 58 [2024-11-19 20:52:03,922 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 62 ConstructedPredicates, 30 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=140, Invalid=1042, Unknown=60, NotChecked=2790, Total=4032 [2024-11-19 20:52:03,923 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 0 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 299 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 1527 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 299 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1226 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 20:52:03,923 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 304 Invalid, 1527 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 299 Invalid, 0 Unknown, 1226 Unchecked, 0.2s Time] [2024-11-19 20:52:03,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2024-11-19 20:52:03,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2024-11-19 20:52:03,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 49 states have (on average 1.0816326530612246) internal successors, (53), 49 states have internal predecessors, (53), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-19 20:52:03,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 63 transitions. [2024-11-19 20:52:03,937 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 63 transitions. Word has length 40 [2024-11-19 20:52:03,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 20:52:03,937 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 63 transitions. [2024-11-19 20:52:03,937 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 39 states have (on average 1.3333333333333333) internal successors, (52), 33 states have internal predecessors, (52), 4 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2024-11-19 20:52:03,938 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 63 transitions. [2024-11-19 20:52:03,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-19 20:52:03,938 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 20:52:03,938 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 20:52:03,950 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-19 20:52:04,142 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 20:52:04,143 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 20:52:04,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 20:52:04,143 INFO L85 PathProgramCache]: Analyzing trace with hash 77092126, now seen corresponding path program 3 times [2024-11-19 20:52:04,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 20:52:04,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249798868] [2024-11-19 20:52:04,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:52:04,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 20:52:04,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:52:04,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 20:52:04,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:52:04,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 20:52:04,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:52:04,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-19 20:52:04,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:52:04,324 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-19 20:52:04,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 20:52:04,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249798868] [2024-11-19 20:52:04,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [249798868] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 20:52:04,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [614012255] [2024-11-19 20:52:04,327 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 20:52:04,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 20:52:04,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 20:52:04,330 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 20:52:04,332 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-19 20:52:04,581 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-11-19 20:52:04,581 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 20:52:04,583 INFO L255 TraceCheckSpWp]: Trace formula consists of 357 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-19 20:52:04,584 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 20:52:04,617 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-19 20:52:04,617 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 20:52:04,666 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-19 20:52:04,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [614012255] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 20:52:04,666 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 20:52:04,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 12 [2024-11-19 20:52:04,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274505343] [2024-11-19 20:52:04,667 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 20:52:04,667 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-19 20:52:04,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 20:52:04,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-19 20:52:04,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-11-19 20:52:04,668 INFO L87 Difference]: Start difference. First operand 58 states and 63 transitions. Second operand has 12 states, 12 states have (on average 2.75) internal successors, (33), 11 states have internal predecessors, (33), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 20:52:04,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 20:52:04,738 INFO L93 Difference]: Finished difference Result 67 states and 71 transitions. [2024-11-19 20:52:04,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 20:52:04,738 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.75) internal successors, (33), 11 states have internal predecessors, (33), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 40 [2024-11-19 20:52:04,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 20:52:04,739 INFO L225 Difference]: With dead ends: 67 [2024-11-19 20:52:04,739 INFO L226 Difference]: Without dead ends: 47 [2024-11-19 20:52:04,739 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-11-19 20:52:04,740 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 12 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 20:52:04,740 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 158 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 20:52:04,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-11-19 20:52:04,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 42. [2024-11-19 20:52:04,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 35 states have (on average 1.0857142857142856) internal successors, (38), 35 states have internal predecessors, (38), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-19 20:52:04,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2024-11-19 20:52:04,750 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 40 [2024-11-19 20:52:04,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 20:52:04,750 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2024-11-19 20:52:04,750 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.75) internal successors, (33), 11 states have internal predecessors, (33), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 20:52:04,750 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2024-11-19 20:52:04,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-19 20:52:04,751 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 20:52:04,751 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 20:52:04,763 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-19 20:52:04,951 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 20:52:04,952 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 20:52:04,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 20:52:04,952 INFO L85 PathProgramCache]: Analyzing trace with hash -1229813368, now seen corresponding path program 4 times [2024-11-19 20:52:04,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 20:52:04,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554240949] [2024-11-19 20:52:04,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:52:04,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 20:52:04,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:52:05,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 20:52:05,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:52:05,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 20:52:05,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:52:05,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-19 20:52:05,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:52:05,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-19 20:52:05,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:52:05,095 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2024-11-19 20:52:05,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 20:52:05,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554240949] [2024-11-19 20:52:05,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1554240949] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 20:52:05,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [90448442] [2024-11-19 20:52:05,095 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-19 20:52:05,095 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 20:52:05,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 20:52:05,098 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 20:52:05,100 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-19 20:52:05,303 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-19 20:52:05,304 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 20:52:05,305 INFO L255 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-19 20:52:05,308 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 20:52:05,330 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-19 20:52:05,331 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 20:52:05,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [90448442] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 20:52:05,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 20:52:05,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2024-11-19 20:52:05,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381837037] [2024-11-19 20:52:05,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 20:52:05,332 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 20:52:05,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 20:52:05,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 20:52:05,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-19 20:52:05,333 INFO L87 Difference]: Start difference. First operand 42 states and 46 transitions. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-19 20:52:05,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 20:52:05,348 INFO L93 Difference]: Finished difference Result 47 states and 50 transitions. [2024-11-19 20:52:05,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 20:52:05,348 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 49 [2024-11-19 20:52:05,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 20:52:05,349 INFO L225 Difference]: With dead ends: 47 [2024-11-19 20:52:05,349 INFO L226 Difference]: Without dead ends: 0 [2024-11-19 20:52:05,349 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-19 20:52:05,349 INFO L432 NwaCegarLoop]: 12 mSDtfsCounter, 0 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 20:52:05,350 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 28 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 20:52:05,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-19 20:52:05,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-19 20:52:05,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 20:52:05,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-19 20:52:05,350 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 49 [2024-11-19 20:52:05,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 20:52:05,350 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-19 20:52:05,351 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-19 20:52:05,351 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-19 20:52:05,351 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-19 20:52:05,354 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-19 20:52:05,364 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-19 20:52:05,555 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-11-19 20:52:05,558 INFO L407 BasicCegarLoop]: Path program histogram: [4, 3, 2, 1, 1, 1] [2024-11-19 20:52:05,560 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-19 20:52:07,049 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-19 20:52:07,060 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.IllegalArgumentException: unknown symbol (@diff (Array Int Int) (Array Int Int) Int) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.getBinaryOperator(Term2Expression.java:587) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:280) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translateStore(Term2Expression.java:355) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:173) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:173) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:480) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:143) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:173) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:173) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:137) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:401) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:1) at de.uni_freiburg.informatik.ultimate.core.lib.translation.DefaultTranslator.translateExpressionWithContext(DefaultTranslator.java:166) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpressionWithContext(ModelTranslationContainer.java:102) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpressionWithContextToString(ModelTranslationContainer.java:92) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.BacktranslationService.translateExpressionWithContextToString(BacktranslationService.java:105) at de.uni_freiburg.informatik.ultimate.core.lib.results.InvariantResult.(InvariantResult.java:57) at de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.FloydHoareUtils.createInvariantResults(FloydHoareUtils.java:123) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2024-11-19 20:52:07,064 INFO L158 Benchmark]: Toolchain (without parser) took 39304.19ms. Allocated memory was 157.3MB in the beginning and 780.1MB in the end (delta: 622.9MB). Free memory was 100.4MB in the beginning and 382.3MB in the end (delta: -281.8MB). Peak memory consumption was 341.5MB. Max. memory is 16.1GB. [2024-11-19 20:52:07,065 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 157.3MB. Free memory was 118.5MB in the beginning and 118.3MB in the end (delta: 167.8kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 20:52:07,065 INFO L158 Benchmark]: CACSL2BoogieTranslator took 427.01ms. Allocated memory is still 157.3MB. Free memory was 100.4MB in the beginning and 80.6MB in the end (delta: 19.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-19 20:52:07,065 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.15ms. Allocated memory is still 157.3MB. Free memory was 80.6MB in the beginning and 78.2MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 20:52:07,065 INFO L158 Benchmark]: Boogie Preprocessor took 61.36ms. Allocated memory is still 157.3MB. Free memory was 78.2MB in the beginning and 75.7MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 20:52:07,065 INFO L158 Benchmark]: RCFGBuilder took 535.62ms. Allocated memory was 157.3MB in the beginning and 216.0MB in the end (delta: 58.7MB). Free memory was 75.3MB in the beginning and 180.5MB in the end (delta: -105.2MB). Peak memory consumption was 22.1MB. Max. memory is 16.1GB. [2024-11-19 20:52:07,066 INFO L158 Benchmark]: TraceAbstraction took 38230.93ms. Allocated memory was 216.0MB in the beginning and 780.1MB in the end (delta: 564.1MB). Free memory was 180.5MB in the beginning and 382.3MB in the end (delta: -201.8MB). Peak memory consumption was 361.3MB. Max. memory is 16.1GB. [2024-11-19 20:52:07,067 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 157.3MB. Free memory was 118.5MB in the beginning and 118.3MB in the end (delta: 167.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 427.01ms. Allocated memory is still 157.3MB. Free memory was 100.4MB in the beginning and 80.6MB in the end (delta: 19.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.15ms. Allocated memory is still 157.3MB. Free memory was 80.6MB in the beginning and 78.2MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 61.36ms. Allocated memory is still 157.3MB. Free memory was 78.2MB in the beginning and 75.7MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 535.62ms. Allocated memory was 157.3MB in the beginning and 216.0MB in the end (delta: 58.7MB). Free memory was 75.3MB in the beginning and 180.5MB in the end (delta: -105.2MB). Peak memory consumption was 22.1MB. Max. memory is 16.1GB. * TraceAbstraction took 38230.93ms. Allocated memory was 216.0MB in the beginning and 780.1MB in the end (delta: 564.1MB). Free memory was 180.5MB in the beginning and 382.3MB in the end (delta: -201.8MB). Peak memory consumption was 361.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 624]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 27 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 36.7s, OverallIterations: 12, TraceHistogramMax: 4, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 4.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 124 SdHoareTripleChecker+Valid, 2.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 120 mSDsluCounter, 2218 SdHoareTripleChecker+Invalid, 2.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 1226 IncrementalHoareTripleChecker+Unchecked, 1988 mSDsCounter, 14 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2925 IncrementalHoareTripleChecker+Invalid, 4165 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 14 mSolverCounterUnsat, 230 mSDtfsCounter, 2925 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 662 GetRequests, 349 SyntacticMatches, 3 SemanticMatches, 310 ConstructedPredicates, 32 IntricatePredicates, 0 DeprecatedPredicates, 2042 ImplicationChecksByTransitivity, 8.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=58occurred in iteration=10, InterpolantAutomatonStates: 153, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 12 MinimizatonAttempts, 18 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 28.0s InterpolantComputationTime, 704 NumberOfCodeBlocks, 703 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 747 ConstructedInterpolants, 50 QuantifiedInterpolants, 9406 SizeOfPredicates, 35 NumberOfNonLiveVariables, 2721 ConjunctsInSsa, 592 ConjunctsInUnsatCore, 22 InterpolantComputations, 5 PerfectInterpolantSequences, 322/524 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 593]: Loop Invariant Derived loop invariant: 1 - ExceptionOrErrorResult: IllegalArgumentException: unknown symbol (@diff (Array Int Int) (Array Int Int) Int) de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IllegalArgumentException: unknown symbol (@diff (Array Int Int) (Array Int Int) Int): de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.getBinaryOperator(Term2Expression.java:587) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2024-11-19 20:52:07,166 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/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.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2n_prepend_equal.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.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 e4cb0386e6b22b9d67dd4f4c4c33eb167dcf1836f99794e4424c5e73e6fc14d4 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-19 20:52:09,284 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 20:52:09,368 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-19 20:52:09,373 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 20:52:09,374 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 20:52:09,402 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 20:52:09,403 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 20:52:09,403 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 20:52:09,404 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 20:52:09,404 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 20:52:09,405 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 20:52:09,405 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 20:52:09,405 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 20:52:09,406 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 20:52:09,406 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 20:52:09,407 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 20:52:09,407 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 20:52:09,408 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 20:52:09,408 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 20:52:09,408 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 20:52:09,409 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 20:52:09,409 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 20:52:09,409 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 20:52:09,409 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-19 20:52:09,410 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-19 20:52:09,410 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 20:52:09,410 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-19 20:52:09,411 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 20:52:09,411 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 20:52:09,411 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 20:52:09,411 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 20:52:09,412 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 20:52:09,412 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 20:52:09,412 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 20:52:09,412 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 20:52:09,413 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 20:52:09,413 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 20:52:09,413 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 20:52:09,413 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-19 20:52:09,414 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-19 20:52:09,414 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 20:52:09,418 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 20:52:09,418 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 20:52:09,418 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 20:52:09,418 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 -> e4cb0386e6b22b9d67dd4f4c4c33eb167dcf1836f99794e4424c5e73e6fc14d4 [2024-11-19 20:52:09,741 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 20:52:09,763 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 20:52:09,767 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 20:52:09,768 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 20:52:09,769 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 20:52:09,770 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2n_prepend_equal.i [2024-11-19 20:52:11,218 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 20:52:11,450 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 20:52:11,450 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2n_prepend_equal.i [2024-11-19 20:52:11,462 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2a018512b/181217a8890043f98bbc6c0d1fd56931/FLAGfd8560afd [2024-11-19 20:52:11,474 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2a018512b/181217a8890043f98bbc6c0d1fd56931 [2024-11-19 20:52:11,476 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 20:52:11,478 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 20:52:11,479 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 20:52:11,479 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 20:52:11,484 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 20:52:11,485 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 08:52:11" (1/1) ... [2024-11-19 20:52:11,486 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7586e0c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:52:11, skipping insertion in model container [2024-11-19 20:52:11,486 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 08:52:11" (1/1) ... [2024-11-19 20:52:11,528 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 20:52:11,883 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2n_prepend_equal.i[24076,24089] [2024-11-19 20:52:11,888 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 20:52:11,900 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 20:52:11,959 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2n_prepend_equal.i[24076,24089] [2024-11-19 20:52:11,960 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 20:52:12,007 INFO L204 MainTranslator]: Completed translation [2024-11-19 20:52:12,008 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:52:12 WrapperNode [2024-11-19 20:52:12,008 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 20:52:12,009 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 20:52:12,009 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 20:52:12,009 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 20:52:12,015 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:52:12" (1/1) ... [2024-11-19 20:52:12,040 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:52:12" (1/1) ... [2024-11-19 20:52:12,066 INFO L138 Inliner]: procedures = 130, calls = 30, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 106 [2024-11-19 20:52:12,068 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 20:52:12,069 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 20:52:12,069 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 20:52:12,070 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 20:52:12,080 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:52:12" (1/1) ... [2024-11-19 20:52:12,081 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:52:12" (1/1) ... [2024-11-19 20:52:12,084 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:52:12" (1/1) ... [2024-11-19 20:52:12,117 INFO L175 MemorySlicer]: Split 14 memory accesses to 3 slices as follows [2, 7, 5]. 50 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 0, 1]. The 5 writes are split as follows [0, 4, 1]. [2024-11-19 20:52:12,119 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:52:12" (1/1) ... [2024-11-19 20:52:12,119 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:52:12" (1/1) ... [2024-11-19 20:52:12,132 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:52:12" (1/1) ... [2024-11-19 20:52:12,136 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:52:12" (1/1) ... [2024-11-19 20:52:12,139 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:52:12" (1/1) ... [2024-11-19 20:52:12,143 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:52:12" (1/1) ... [2024-11-19 20:52:12,151 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 20:52:12,152 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 20:52:12,156 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 20:52:12,156 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 20:52:12,157 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:52:12" (1/1) ... [2024-11-19 20:52:12,163 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 20:52:12,174 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 20:52:12,194 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) [2024-11-19 20:52:12,201 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 [2024-11-19 20:52:12,249 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-19 20:52:12,249 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-19 20:52:12,250 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-19 20:52:12,250 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2024-11-19 20:52:12,250 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2024-11-19 20:52:12,250 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-19 20:52:12,250 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 20:52:12,251 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-19 20:52:12,251 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-19 20:52:12,251 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-19 20:52:12,251 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-19 20:52:12,251 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-19 20:52:12,251 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-19 20:52:12,251 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-19 20:52:12,251 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-19 20:52:12,251 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-19 20:52:12,252 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-19 20:52:12,252 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-19 20:52:12,252 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-19 20:52:12,252 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-19 20:52:12,252 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-19 20:52:12,252 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-19 20:52:12,252 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-19 20:52:12,252 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-19 20:52:12,252 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 20:52:12,252 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 20:52:12,400 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 20:52:12,403 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 20:52:12,654 INFO L? ?]: Removed 39 outVars from TransFormulas that were not future-live. [2024-11-19 20:52:12,654 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 20:52:12,669 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 20:52:12,670 INFO L316 CfgBuilder]: Removed 3 assume(true) statements. [2024-11-19 20:52:12,670 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 08:52:12 BoogieIcfgContainer [2024-11-19 20:52:12,670 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 20:52:12,672 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 20:52:12,672 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 20:52:12,675 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 20:52:12,675 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 08:52:11" (1/3) ... [2024-11-19 20:52:12,676 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18825c41 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 08:52:12, skipping insertion in model container [2024-11-19 20:52:12,677 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:52:12" (2/3) ... [2024-11-19 20:52:12,677 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18825c41 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 08:52:12, skipping insertion in model container [2024-11-19 20:52:12,677 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 08:52:12" (3/3) ... [2024-11-19 20:52:12,678 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2n_prepend_equal.i [2024-11-19 20:52:12,695 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 20:52:12,696 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-19 20:52:12,756 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 20:52:12,762 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@445cc340, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 20:52:12,763 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-19 20:52:12,766 INFO L276 IsEmpty]: Start isEmpty. Operand has 27 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 23 states have internal predecessors, (32), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 20:52:12,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-19 20:52:12,773 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 20:52:12,774 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 20:52:12,774 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 20:52:12,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 20:52:12,781 INFO L85 PathProgramCache]: Analyzing trace with hash 845524335, now seen corresponding path program 1 times [2024-11-19 20:52:12,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 20:52:12,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [555464442] [2024-11-19 20:52:12,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:52:12,796 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 20:52:12,796 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 20:52:12,800 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 20:52:12,826 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-19 20:52:12,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:52:12,980 INFO L255 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-19 20:52:12,984 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 20:52:13,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 20:52:13,006 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 20:52:13,006 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 20:52:13,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [555464442] [2024-11-19 20:52:13,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [555464442] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 20:52:13,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 20:52:13,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 20:52:13,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469472078] [2024-11-19 20:52:13,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 20:52:13,014 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-19 20:52:13,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 20:52:13,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-19 20:52:13,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 20:52:13,040 INFO L87 Difference]: Start difference. First operand has 27 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 23 states have internal predecessors, (32), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 20:52:13,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 20:52:13,054 INFO L93 Difference]: Finished difference Result 48 states and 63 transitions. [2024-11-19 20:52:13,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-19 20:52:13,057 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2024-11-19 20:52:13,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 20:52:13,062 INFO L225 Difference]: With dead ends: 48 [2024-11-19 20:52:13,062 INFO L226 Difference]: Without dead ends: 21 [2024-11-19 20:52:13,065 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 20:52:13,068 INFO L432 NwaCegarLoop]: 32 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, 32 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 [2024-11-19 20:52:13,068 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 20:52:13,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2024-11-19 20:52:13,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2024-11-19 20:52:13,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 states have internal predecessors, (20), 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) [2024-11-19 20:52:13,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2024-11-19 20:52:13,101 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 16 [2024-11-19 20:52:13,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 20:52:13,101 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2024-11-19 20:52:13,101 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 20:52:13,102 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2024-11-19 20:52:13,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-19 20:52:13,103 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 20:52:13,103 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 20:52:13,108 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-19 20:52:13,307 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 20:52:13,307 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 20:52:13,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 20:52:13,308 INFO L85 PathProgramCache]: Analyzing trace with hash 595026039, now seen corresponding path program 1 times [2024-11-19 20:52:13,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 20:52:13,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1669658441] [2024-11-19 20:52:13,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:52:13,309 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 20:52:13,309 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 20:52:13,313 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 20:52:13,314 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-19 20:52:13,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:52:13,425 INFO L255 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 20:52:13,428 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 20:52:13,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 20:52:13,484 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 20:52:13,484 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 20:52:13,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1669658441] [2024-11-19 20:52:13,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1669658441] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 20:52:13,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 20:52:13,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 20:52:13,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997175310] [2024-11-19 20:52:13,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 20:52:13,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 20:52:13,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 20:52:13,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 20:52:13,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 20:52:13,492 INFO L87 Difference]: Start difference. First operand 21 states and 24 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 20:52:13,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 20:52:13,514 INFO L93 Difference]: Finished difference Result 40 states and 46 transitions. [2024-11-19 20:52:13,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 20:52:13,515 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2024-11-19 20:52:13,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 20:52:13,515 INFO L225 Difference]: With dead ends: 40 [2024-11-19 20:52:13,516 INFO L226 Difference]: Without dead ends: 25 [2024-11-19 20:52:13,517 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 20:52:13,518 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 2 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 20:52:13,519 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 41 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 20:52:13,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2024-11-19 20:52:13,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 22. [2024-11-19 20:52:13,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 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) [2024-11-19 20:52:13,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2024-11-19 20:52:13,534 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 16 [2024-11-19 20:52:13,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 20:52:13,536 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2024-11-19 20:52:13,536 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 20:52:13,536 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2024-11-19 20:52:13,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-19 20:52:13,538 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 20:52:13,538 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 20:52:13,543 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-19 20:52:13,738 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 20:52:13,739 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 20:52:13,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 20:52:13,740 INFO L85 PathProgramCache]: Analyzing trace with hash -190501289, now seen corresponding path program 1 times [2024-11-19 20:52:13,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 20:52:13,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1226721973] [2024-11-19 20:52:13,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:52:13,740 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 20:52:13,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 20:52:13,744 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 20:52:13,745 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-19 20:52:13,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:52:13,900 INFO L255 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-19 20:52:13,904 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 20:52:13,934 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 20:52:13,934 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 20:52:13,992 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-19 20:52:13,993 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 20:52:13,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1226721973] [2024-11-19 20:52:13,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1226721973] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 20:52:13,996 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 20:52:13,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2024-11-19 20:52:13,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404785996] [2024-11-19 20:52:13,997 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 20:52:13,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 20:52:13,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 20:52:13,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 20:52:14,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-19 20:52:14,000 INFO L87 Difference]: Start difference. First operand 22 states and 25 transitions. Second operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-19 20:52:14,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 20:52:14,041 INFO L93 Difference]: Finished difference Result 44 states and 51 transitions. [2024-11-19 20:52:14,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 20:52:14,043 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 25 [2024-11-19 20:52:14,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 20:52:14,045 INFO L225 Difference]: With dead ends: 44 [2024-11-19 20:52:14,045 INFO L226 Difference]: Without dead ends: 29 [2024-11-19 20:52:14,045 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-19 20:52:14,046 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 5 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 20:52:14,047 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 63 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 20:52:14,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-11-19 20:52:14,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 26. [2024-11-19 20:52:14,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 21 states have internal predecessors, (24), 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) [2024-11-19 20:52:14,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2024-11-19 20:52:14,076 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 25 [2024-11-19 20:52:14,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 20:52:14,077 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2024-11-19 20:52:14,077 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-19 20:52:14,077 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2024-11-19 20:52:14,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-19 20:52:14,083 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 20:52:14,083 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 20:52:14,093 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-19 20:52:14,283 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 20:52:14,284 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 20:52:14,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 20:52:14,285 INFO L85 PathProgramCache]: Analyzing trace with hash -1242497929, now seen corresponding path program 2 times [2024-11-19 20:52:14,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 20:52:14,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [672516606] [2024-11-19 20:52:14,285 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 20:52:14,286 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 20:52:14,286 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 20:52:14,289 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 20:52:14,290 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-19 20:52:14,417 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-19 20:52:14,418 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 20:52:14,422 INFO L255 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-19 20:52:14,429 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 20:52:14,523 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-19 20:52:14,649 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-19 20:52:14,655 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 15 [2024-11-19 20:52:14,667 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-19 20:52:14,710 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-11-19 20:52:14,744 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-19 20:52:14,764 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-19 20:52:14,765 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 20:52:14,765 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 20:52:14,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [672516606] [2024-11-19 20:52:14,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [672516606] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 20:52:14,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 20:52:14,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-19 20:52:14,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230060956] [2024-11-19 20:52:14,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 20:52:14,766 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 20:52:14,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 20:52:14,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 20:52:14,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-19 20:52:14,767 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 20:52:15,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 20:52:15,257 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2024-11-19 20:52:15,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 20:52:15,258 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 34 [2024-11-19 20:52:15,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 20:52:15,259 INFO L225 Difference]: With dead ends: 32 [2024-11-19 20:52:15,259 INFO L226 Difference]: Without dead ends: 30 [2024-11-19 20:52:15,259 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-11-19 20:52:15,260 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 9 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 20:52:15,260 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 90 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-19 20:52:15,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-11-19 20:52:15,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2024-11-19 20:52:15,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.173913043478261) internal successors, (27), 23 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) [2024-11-19 20:52:15,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 33 transitions. [2024-11-19 20:52:15,270 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 33 transitions. Word has length 34 [2024-11-19 20:52:15,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 20:52:15,271 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 33 transitions. [2024-11-19 20:52:15,271 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 20:52:15,271 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 33 transitions. [2024-11-19 20:52:15,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-19 20:52:15,272 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 20:52:15,272 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 20:52:15,279 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-19 20:52:15,473 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 20:52:15,473 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 20:52:15,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 20:52:15,474 INFO L85 PathProgramCache]: Analyzing trace with hash -1242499603, now seen corresponding path program 1 times [2024-11-19 20:52:15,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 20:52:15,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1973320121] [2024-11-19 20:52:15,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:52:15,474 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 20:52:15,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 20:52:15,477 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 20:52:15,478 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-19 20:52:15,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:52:15,644 INFO L255 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-19 20:52:15,648 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 20:52:15,733 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-19 20:52:15,760 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2024-11-19 20:52:15,777 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-19 20:52:15,778 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 20:52:15,778 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 20:52:15,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1973320121] [2024-11-19 20:52:15,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1973320121] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 20:52:15,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 20:52:15,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 20:52:15,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801175183] [2024-11-19 20:52:15,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 20:52:15,779 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 20:52:15,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 20:52:15,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 20:52:15,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-19 20:52:15,780 INFO L87 Difference]: Start difference. First operand 28 states and 33 transitions. Second operand has 8 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 20:52:16,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 20:52:16,022 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2024-11-19 20:52:16,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 20:52:16,022 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 34 [2024-11-19 20:52:16,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 20:52:16,023 INFO L225 Difference]: With dead ends: 31 [2024-11-19 20:52:16,023 INFO L226 Difference]: Without dead ends: 28 [2024-11-19 20:52:16,024 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-19 20:52:16,024 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 8 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 20:52:16,025 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 114 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 20:52:16,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-11-19 20:52:16,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2024-11-19 20:52:16,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 23 states have internal predecessors, (26), 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) [2024-11-19 20:52:16,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2024-11-19 20:52:16,030 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 34 [2024-11-19 20:52:16,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 20:52:16,030 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2024-11-19 20:52:16,030 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 20:52:16,030 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2024-11-19 20:52:16,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-19 20:52:16,031 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 20:52:16,034 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 20:52:16,042 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-19 20:52:16,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 20:52:16,235 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 20:52:16,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 20:52:16,235 INFO L85 PathProgramCache]: Analyzing trace with hash -39567630, now seen corresponding path program 1 times [2024-11-19 20:52:16,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 20:52:16,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1227465560] [2024-11-19 20:52:16,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:52:16,236 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 20:52:16,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 20:52:16,237 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 20:52:16,238 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-19 20:52:16,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:52:16,426 INFO L255 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 57 conjuncts are in the unsatisfiable core [2024-11-19 20:52:16,432 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 20:52:16,505 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-19 20:52:16,578 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-19 20:52:16,712 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2024-11-19 20:52:16,918 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-11-19 20:52:16,918 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 23 [2024-11-19 20:52:17,060 INFO L349 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2024-11-19 20:52:17,061 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 21 [2024-11-19 20:52:17,076 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2024-11-19 20:52:17,083 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 27 [2024-11-19 20:52:17,117 INFO L349 Elim1Store]: treesize reduction 37, result has 43.9 percent of original size [2024-11-19 20:52:17,117 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 51 [2024-11-19 20:52:17,132 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-11-19 20:52:17,242 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 30 [2024-11-19 20:52:17,347 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2024-11-19 20:52:17,353 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-19 20:52:17,521 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 10 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-19 20:52:17,521 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 20:52:17,844 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 208 treesize of output 178 [2024-11-19 20:52:17,861 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 314 treesize of output 254 [2024-11-19 20:52:18,351 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse17 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_prepend_~head#1.base|)) (.cse18 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_prepend_~head#1.base|))) (let ((.cse11 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse8 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_prepend_~head#1.base| (store .cse18 |c_ULTIMATE.start_sll_prepend_~head#1.offset| |c_ULTIMATE.start_sll_prepend_#t~ret7#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$#2.offset| |c_ULTIMATE.start_sll_prepend_~head#1.base| (store .cse17 |c_ULTIMATE.start_sll_prepend_~head#1.offset| |c_ULTIMATE.start_sll_prepend_#t~ret7#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse5 (select .cse18 |c_ULTIMATE.start_sll_prepend_~head#1.offset|)) (.cse6 (select .cse17 |c_ULTIMATE.start_sll_prepend_~head#1.offset|))) (let ((.cse7 (forall ((v_ArrVal_299 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_16 (_ BitVec 32)) (v_arrayElimCell_15 (_ BitVec 32))) (let ((.cse16 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base| v_ArrVal_299))) (or (not (= (select (select .cse16 .cse3) .cse4) |c_ULTIMATE.start_main_~data~0#1|)) (= (select (select .cse16 .cse5) .cse6) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse16 v_arrayElimCell_15) v_arrayElimCell_16)))))) (.cse1 (= |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base| .cse3)) (.cse12 (and (forall ((v_ArrVal_299 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse14 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base| v_ArrVal_299))) (or (forall ((v_arrayElimCell_16 (_ BitVec 32)) (v_arrayElimCell_15 (_ BitVec 32))) (let ((.cse13 (select .cse14 v_arrayElimCell_15))) (or (= (select .cse13 .cse6) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse13 v_arrayElimCell_16))))) (not (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse14 .cse11) .cse8)))))) (forall ((v_ArrVal_299 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_16 (_ BitVec 32)) (v_arrayElimCell_15 (_ BitVec 32))) (let ((.cse15 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base| v_ArrVal_299))) (or (not (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse15 .cse11) .cse8))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse15 v_arrayElimCell_15) v_arrayElimCell_16))))))) (.cse0 (= .cse4 |c_ULTIMATE.start_sll_prepend_#t~ret7#1.offset|))) (and (or (not .cse0) (not .cse1) (forall ((v_ArrVal_299 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base| v_ArrVal_299))) (or (not (= (select (select .cse2 .cse3) .cse4) |c_ULTIMATE.start_main_~data~0#1|)) (= (select (select .cse2 .cse5) .cse6) |c_ULTIMATE.start_main_~data~0#1|))))) (or .cse7 (= .cse8 |c_ULTIMATE.start_sll_prepend_#t~ret7#1.offset|)) (forall ((v_ArrVal_299 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse10 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base| v_ArrVal_299))) (or (forall ((v_arrayElimCell_16 (_ BitVec 32)) (v_arrayElimCell_15 (_ BitVec 32))) (let ((.cse9 (select .cse10 v_arrayElimCell_15))) (or (= (select .cse9 .cse6) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse9 v_arrayElimCell_16))))) (not (= (select (select .cse10 .cse3) .cse4) |c_ULTIMATE.start_main_~data~0#1|)) (= (select (select .cse10 .cse5) .cse6) |c_ULTIMATE.start_main_~data~0#1|)))) (or .cse7 (= .cse11 |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|)) (or .cse1 .cse12) (or .cse12 .cse0))))) is different from false [2024-11-19 20:52:18,834 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse19 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_prepend_~head#1.base|))) (let ((.cse10 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_prepend_~head#1.base|)) (.cse13 (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_prepend_~head#1.base| (store .cse19 |c_ULTIMATE.start_sll_prepend_~head#1.offset| (_ bv0 32))) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (= (_ bv0 32) .cse13)) (.cse8 (select .cse10 |c_ULTIMATE.start_sll_prepend_~head#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse6 (select .cse19 |c_ULTIMATE.start_sll_prepend_~head#1.offset|))) (and (or .cse0 (and (forall ((v_ArrVal_299 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_16 (_ BitVec 32)) (v_arrayElimCell_15 (_ BitVec 32)) (|v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_16| (_ BitVec 32))) (let ((.cse1 (store |c_#memory_int#1| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_16| v_ArrVal_299))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse1 v_arrayElimCell_15) v_arrayElimCell_16)) (not (= (select (select .cse1 .cse2) .cse3) |c_ULTIMATE.start_main_~data~0#1|))))) (forall ((v_ArrVal_299 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_16| (_ BitVec 32))) (let ((.cse4 (store |c_#memory_int#1| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_16| v_ArrVal_299))) (or (not (= (select (select .cse4 .cse2) .cse3) |c_ULTIMATE.start_main_~data~0#1|)) (forall ((v_arrayElimCell_16 (_ BitVec 32)) (v_arrayElimCell_15 (_ BitVec 32))) (let ((.cse5 (select .cse4 v_arrayElimCell_15))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse5 v_arrayElimCell_16)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse5 .cse6)))))))))) (or (forall ((v_ArrVal_299 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_16| (_ BitVec 32))) (let ((.cse7 (store |c_#memory_int#1| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_16| v_ArrVal_299)) (.cse9 (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_prepend_~head#1.base| (store .cse10 |c_ULTIMATE.start_sll_prepend_~head#1.offset| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_16|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= (select (select .cse7 .cse8) .cse6) |c_ULTIMATE.start_main_~data~0#1|) (not (= .cse9 |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_16|)) (not (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse7 .cse9) (_ bv0 32))))))) (not .cse0)) (forall ((v_ArrVal_299 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_16| (_ BitVec 32))) (let ((.cse11 (store |c_#memory_int#1| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_16| v_ArrVal_299))) (or (= (select (select .cse11 .cse8) .cse6) |c_ULTIMATE.start_main_~data~0#1|) (forall ((v_arrayElimCell_16 (_ BitVec 32)) (v_arrayElimCell_15 (_ BitVec 32))) (let ((.cse12 (select .cse11 v_arrayElimCell_15))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse12 v_arrayElimCell_16)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse12 .cse6))))) (not (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse11 (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_prepend_~head#1.base| (store .cse10 |c_ULTIMATE.start_sll_prepend_~head#1.offset| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_16|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse13)))))) (forall ((|v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_16| (_ BitVec 32))) (or (forall ((v_ArrVal_299 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_16 (_ BitVec 32)) (v_arrayElimCell_15 (_ BitVec 32))) (let ((.cse14 (store |c_#memory_int#1| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_16| v_ArrVal_299))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse14 v_arrayElimCell_15) v_arrayElimCell_16)) (not (= (select (select .cse14 .cse2) .cse3) |c_ULTIMATE.start_main_~data~0#1|))))) (= (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_prepend_~head#1.base| (store .cse10 |c_ULTIMATE.start_sll_prepend_~head#1.offset| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_16|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_16|))) (forall ((|v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_16| (_ BitVec 32))) (or (= .cse2 |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_16|) (forall ((v_ArrVal_299 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_16 (_ BitVec 32)) (v_arrayElimCell_15 (_ BitVec 32))) (let ((.cse15 (store |c_#memory_int#1| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_16| v_ArrVal_299))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse15 v_arrayElimCell_15) v_arrayElimCell_16)) (= (select (select .cse15 .cse8) .cse6) |c_ULTIMATE.start_main_~data~0#1|) (not (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse15 (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_prepend_~head#1.base| (store .cse10 |c_ULTIMATE.start_sll_prepend_~head#1.offset| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_16|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse13)))))))) (or (= (_ bv0 32) .cse3) (forall ((v_ArrVal_299 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_16 (_ BitVec 32)) (v_arrayElimCell_15 (_ BitVec 32)) (|v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_16| (_ BitVec 32))) (let ((.cse16 (store |c_#memory_int#1| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_16| v_ArrVal_299))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse16 v_arrayElimCell_15) v_arrayElimCell_16)) (= (select (select .cse16 .cse8) .cse6) |c_ULTIMATE.start_main_~data~0#1|) (not (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse16 (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_prepend_~head#1.base| (store .cse10 |c_ULTIMATE.start_sll_prepend_~head#1.offset| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_16|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse13))))))) (forall ((|v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_16| (_ BitVec 32))) (or (forall ((v_ArrVal_299 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse17 (store |c_#memory_int#1| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_16| v_ArrVal_299))) (or (not (= (select (select .cse17 .cse2) .cse3) |c_ULTIMATE.start_main_~data~0#1|)) (forall ((v_arrayElimCell_16 (_ BitVec 32)) (v_arrayElimCell_15 (_ BitVec 32))) (let ((.cse18 (select .cse17 v_arrayElimCell_15))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse18 v_arrayElimCell_16)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse18 .cse6)))))))) (= (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_prepend_~head#1.base| (store .cse10 |c_ULTIMATE.start_sll_prepend_~head#1.offset| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_16|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_16|))))))) is different from false [2024-11-19 20:52:19,109 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 20:52:19,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1227465560] [2024-11-19 20:52:19,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1227465560] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 20:52:19,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2107011287] [2024-11-19 20:52:19,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:52:19,110 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-19 20:52:19,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-19 20:52:19,114 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-19 20:52:19,115 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (8)] Waiting until timeout for monitored process [2024-11-19 20:52:19,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:52:19,433 INFO L255 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 61 conjuncts are in the unsatisfiable core [2024-11-19 20:52:19,441 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 20:52:19,545 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-19 20:52:19,631 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-19 20:52:19,807 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-19 20:52:20,175 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2024-11-19 20:52:20,180 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 5 [2024-11-19 20:52:20,555 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-11-19 20:52:20,556 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 23 [2024-11-19 20:52:20,582 INFO L349 Elim1Store]: treesize reduction 6, result has 57.1 percent of original size [2024-11-19 20:52:20,582 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 17 [2024-11-19 20:52:20,754 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2024-11-19 20:52:20,754 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 21 [2024-11-19 20:52:20,770 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2024-11-19 20:52:20,775 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 27 [2024-11-19 20:52:20,783 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 19 [2024-11-19 20:52:20,796 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-11-19 20:52:20,946 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 30 [2024-11-19 20:52:21,053 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2024-11-19 20:52:21,062 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-19 20:52:21,162 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 10 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-19 20:52:21,163 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 20:52:21,423 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 208 treesize of output 178 [2024-11-19 20:52:21,427 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 314 treesize of output 254 [2024-11-19 20:52:22,961 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse11 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_prepend_~head#1.base|)) (.cse6 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_prepend_~head#1.base|))) (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1 (select .cse6 |c_ULTIMATE.start_sll_prepend_~head#1.offset|)) (.cse2 (select .cse11 |c_ULTIMATE.start_sll_prepend_~head#1.offset|)) (.cse5 (= (_ bv0 32) (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_prepend_~head#1.base| (store .cse11 |c_ULTIMATE.start_sll_prepend_~head#1.offset| (_ bv0 32))) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (and (forall ((|v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_20| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_20|))) (forall ((v_ArrVal_377 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_31 (_ BitVec 32)) (v_arrayElimCell_30 (_ BitVec 32))) (let ((.cse0 (store |c_#memory_int#1| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_20| v_ArrVal_377))) (let ((.cse3 (select .cse0 v_arrayElimCell_30))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse0 .cse1) .cse2)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse3 v_arrayElimCell_31)) (= (select .cse3 .cse2) |c_ULTIMATE.start_main_~data~0#1|))))))) (or (forall ((v_ArrVal_377 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_20| (_ BitVec 32)) (v_arrayElimCell_31 (_ BitVec 32)) (v_arrayElimCell_30 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_20|))) (= .cse4 |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_20|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int#1| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_20| v_ArrVal_377) v_arrayElimCell_30) v_arrayElimCell_31)))) .cse5) (forall ((|v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_20| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_20|))) (= |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_20| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_prepend_~head#1.base| (store .cse6 |c_ULTIMATE.start_sll_prepend_~head#1.offset| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_20|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (forall ((v_ArrVal_377 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_31 (_ BitVec 32)) (v_arrayElimCell_30 (_ BitVec 32))) (let ((.cse7 (select (store |c_#memory_int#1| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_20| v_ArrVal_377) v_arrayElimCell_30))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse7 v_arrayElimCell_31)) (= (select .cse7 .cse2) |c_ULTIMATE.start_main_~data~0#1|)))))) (forall ((|v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_20| (_ BitVec 32))) (or (forall ((v_ArrVal_377 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_31 (_ BitVec 32)) (v_arrayElimCell_30 (_ BitVec 32))) (let ((.cse8 (store |c_#memory_int#1| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_20| v_ArrVal_377))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse8 .cse1) .cse2)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse8 v_arrayElimCell_30) v_arrayElimCell_31))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_20|))) (= .cse4 |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_20|))) (or (and (or .cse5 (forall ((v_ArrVal_377 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_20| (_ BitVec 32)) (v_arrayElimCell_31 (_ BitVec 32)) (v_arrayElimCell_30 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_20|))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int#1| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_20| v_ArrVal_377) v_arrayElimCell_30) v_arrayElimCell_31))))) (forall ((|v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_20| (_ BitVec 32))) (or (forall ((v_ArrVal_377 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_31 (_ BitVec 32)) (v_arrayElimCell_30 (_ BitVec 32))) (let ((.cse9 (store |c_#memory_int#1| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_20| v_ArrVal_377))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse9 .cse1) .cse2)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse9 v_arrayElimCell_30) v_arrayElimCell_31))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_20|)))))) (= (_ bv0 32) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_ArrVal_377 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_20| (_ BitVec 32))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int#1| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_20| v_ArrVal_377) .cse1) .cse2)) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_20|))) (not (= |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_20| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_prepend_~head#1.base| (store .cse6 |c_ULTIMATE.start_sll_prepend_~head#1.offset| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_20|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (not .cse5)) (or (forall ((v_ArrVal_377 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_20| (_ BitVec 32)) (v_arrayElimCell_31 (_ BitVec 32)) (v_arrayElimCell_30 (_ BitVec 32))) (let ((.cse10 (select (store |c_#memory_int#1| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_20| v_ArrVal_377) v_arrayElimCell_30))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_20|))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse10 v_arrayElimCell_31)) (= (select .cse10 .cse2) |c_ULTIMATE.start_main_~data~0#1|)))) .cse5) (forall ((|v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_20| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_20|))) (= |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_20| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_prepend_~head#1.base| (store .cse6 |c_ULTIMATE.start_sll_prepend_~head#1.offset| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_20|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (forall ((v_ArrVal_377 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_31 (_ BitVec 32)) (v_arrayElimCell_30 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int#1| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_20| v_ArrVal_377) v_arrayElimCell_30) v_arrayElimCell_31)))))))) is different from false [2024-11-19 20:52:22,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2107011287] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 20:52:22,976 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 20:52:22,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 32 [2024-11-19 20:52:22,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725312290] [2024-11-19 20:52:22,976 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 20:52:22,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-11-19 20:52:22,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 20:52:22,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-11-19 20:52:22,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=1499, Unknown=37, NotChecked=240, Total=1892 [2024-11-19 20:52:22,979 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand has 32 states, 30 states have (on average 1.6666666666666667) internal successors, (50), 26 states have internal predecessors, (50), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-19 20:52:24,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 20:52:24,965 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2024-11-19 20:52:24,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-19 20:52:24,966 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 30 states have (on average 1.6666666666666667) internal successors, (50), 26 states have internal predecessors, (50), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 36 [2024-11-19 20:52:24,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 20:52:24,967 INFO L225 Difference]: With dead ends: 39 [2024-11-19 20:52:24,967 INFO L226 Difference]: Without dead ends: 37 [2024-11-19 20:52:24,968 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 443 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=183, Invalid=2236, Unknown=43, NotChecked=294, Total=2756 [2024-11-19 20:52:24,969 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 28 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 447 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 447 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 447 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-19 20:52:24,969 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 228 Invalid, 447 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 447 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-19 20:52:24,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-11-19 20:52:24,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 35. [2024-11-19 20:52:24,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 29 states have internal predecessors, (33), 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) [2024-11-19 20:52:24,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2024-11-19 20:52:24,978 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 36 [2024-11-19 20:52:24,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 20:52:24,979 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2024-11-19 20:52:24,979 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 30 states have (on average 1.6666666666666667) internal successors, (50), 26 states have internal predecessors, (50), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-19 20:52:24,980 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2024-11-19 20:52:24,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-19 20:52:24,981 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 20:52:24,981 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 20:52:24,991 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-11-19 20:52:25,187 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (8)] Forceful destruction successful, exit code 0 [2024-11-19 20:52:25,383 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-11-19 20:52:25,384 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 20:52:25,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 20:52:25,385 INFO L85 PathProgramCache]: Analyzing trace with hash -39569304, now seen corresponding path program 1 times [2024-11-19 20:52:25,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 20:52:25,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1258077888] [2024-11-19 20:52:25,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:52:25,385 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 20:52:25,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 20:52:25,386 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 20:52:25,387 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-19 20:52:25,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:52:25,539 INFO L255 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-19 20:52:25,543 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 20:52:25,704 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-19 20:52:25,711 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2024-11-19 20:52:25,765 INFO L349 Elim1Store]: treesize reduction 20, result has 58.3 percent of original size [2024-11-19 20:52:25,765 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 47 [2024-11-19 20:52:25,850 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2024-11-19 20:52:25,880 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2024-11-19 20:52:25,909 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 14 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-19 20:52:25,910 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 20:52:25,971 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 78 [2024-11-19 20:52:25,974 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21 [2024-11-19 20:52:25,989 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 20:52:25,990 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 20:52:26,057 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 5 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-19 20:52:26,057 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 20:52:26,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1258077888] [2024-11-19 20:52:26,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1258077888] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 20:52:26,057 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 20:52:26,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 12] total 18 [2024-11-19 20:52:26,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958635618] [2024-11-19 20:52:26,058 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 20:52:26,058 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-19 20:52:26,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 20:52:26,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-19 20:52:26,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=266, Unknown=0, NotChecked=0, Total=306 [2024-11-19 20:52:26,060 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 15 states have internal predecessors, (32), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-19 20:52:30,193 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-19 20:52:34,241 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-19 20:52:35,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 20:52:35,031 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2024-11-19 20:52:35,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-19 20:52:35,032 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 15 states have internal predecessors, (32), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) Word has length 36 [2024-11-19 20:52:35,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 20:52:35,032 INFO L225 Difference]: With dead ends: 38 [2024-11-19 20:52:35,033 INFO L226 Difference]: Without dead ends: 35 [2024-11-19 20:52:35,033 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=70, Invalid=482, Unknown=0, NotChecked=0, Total=552 [2024-11-19 20:52:35,034 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 11 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 0 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.8s IncrementalHoareTripleChecker+Time [2024-11-19 20:52:35,034 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 245 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 199 Invalid, 2 Unknown, 0 Unchecked, 8.8s Time] [2024-11-19 20:52:35,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-11-19 20:52:35,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2024-11-19 20:52:35,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 29 states have (on average 1.103448275862069) internal successors, (32), 29 states have internal predecessors, (32), 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) [2024-11-19 20:52:35,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2024-11-19 20:52:35,041 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 38 transitions. Word has length 36 [2024-11-19 20:52:35,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 20:52:35,041 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 38 transitions. [2024-11-19 20:52:35,042 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 15 states have internal predecessors, (32), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-19 20:52:35,042 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2024-11-19 20:52:35,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-19 20:52:35,043 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 20:52:35,043 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 20:52:35,051 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-11-19 20:52:35,243 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 20:52:35,244 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 20:52:35,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 20:52:35,244 INFO L85 PathProgramCache]: Analyzing trace with hash 630247085, now seen corresponding path program 2 times [2024-11-19 20:52:35,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 20:52:35,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [952216768] [2024-11-19 20:52:35,245 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 20:52:35,245 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 20:52:35,245 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 20:52:35,267 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 20:52:35,268 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-11-19 20:52:35,512 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 20:52:35,512 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 20:52:35,518 INFO L255 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 92 conjuncts are in the unsatisfiable core [2024-11-19 20:52:35,523 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 20:52:35,539 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-19 20:52:35,566 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-19 20:52:35,637 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-19 20:52:35,801 INFO L349 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2024-11-19 20:52:35,801 INFO L378 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 21 treesize of output 20 [2024-11-19 20:52:35,813 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-19 20:52:35,880 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-19 20:52:35,888 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-19 20:52:35,903 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2024-11-19 20:52:36,185 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 23 [2024-11-19 20:52:36,194 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2024-11-19 20:52:36,201 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-19 20:52:36,209 INFO L378 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 7 treesize of output 5 [2024-11-19 20:52:36,467 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-11-19 20:52:36,468 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 23 [2024-11-19 20:52:36,517 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-11-19 20:52:36,517 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 46 [2024-11-19 20:52:36,532 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 20:52:36,533 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-19 20:52:36,552 INFO L349 Elim1Store]: treesize reduction 6, result has 50.0 percent of original size [2024-11-19 20:52:36,552 INFO L378 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 [2024-11-19 20:52:36,572 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2024-11-19 20:52:36,770 INFO L349 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2024-11-19 20:52:36,771 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 21 [2024-11-19 20:52:36,787 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 138 treesize of output 87 [2024-11-19 20:52:36,817 INFO L349 Elim1Store]: treesize reduction 33, result has 48.4 percent of original size [2024-11-19 20:52:36,817 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 62 [2024-11-19 20:52:36,907 INFO L349 Elim1Store]: treesize reduction 84, result has 37.8 percent of original size [2024-11-19 20:52:36,908 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 117 treesize of output 135 [2024-11-19 20:52:36,948 INFO L349 Elim1Store]: treesize reduction 41, result has 43.1 percent of original size [2024-11-19 20:52:36,949 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 149 treesize of output 105 [2024-11-19 20:52:37,273 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 191 treesize of output 131 [2024-11-19 20:52:38,332 INFO L349 Elim1Store]: treesize reduction 8, result has 93.4 percent of original size [2024-11-19 20:52:38,332 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 15 case distinctions, treesize of input 189 treesize of output 228 [2024-11-19 20:52:38,704 INFO L349 Elim1Store]: treesize reduction 8, result has 93.4 percent of original size [2024-11-19 20:52:38,705 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 117 treesize of output 205