./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/list-simple/sll2n_append_unequal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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 ../sv-benchmarks/c/list-simple/sll2n_append_unequal.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-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 ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 742ffe63db70127807dbc7584eb0c51633a9ed1be5f19fa1a247e43392d52dab --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 10:21:53,713 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 10:21:53,775 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-11-19 10:21:53,779 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 10:21:53,779 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 10:21:53,807 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 10:21:53,808 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 10:21:53,808 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 10:21:53,809 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 10:21:53,810 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 10:21:53,811 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 10:21:53,812 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 10:21:53,812 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 10:21:53,815 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 10:21:53,816 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 10:21:53,816 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 10:21:53,816 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 10:21:53,816 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 10:21:53,817 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 10:21:53,817 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 10:21:53,817 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 10:21:53,819 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 10:21:53,819 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 10:21:53,819 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 10:21:53,820 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 10:21:53,820 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-19 10:21:53,820 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 10:21:53,820 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 10:21:53,821 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 10:21:53,821 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 10:21:53,822 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 10:21:53,822 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 10:21:53,822 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 10:21:53,823 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 10:21:53,823 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 10:21:53,823 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 10:21:53,823 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 10:21:53,824 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 10:21:53,824 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 10:21:53,824 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 10:21:53,824 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 10:21:53,825 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 10:21:53,825 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 10:21:53,825 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 10:21:53,825 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 ! overflow) ) 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 -> 742ffe63db70127807dbc7584eb0c51633a9ed1be5f19fa1a247e43392d52dab [2024-11-19 10:21:54,085 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 10:21:54,110 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 10:21:54,113 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 10:21:54,115 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 10:21:54,115 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 10:21:54,117 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/sll2n_append_unequal.i [2024-11-19 10:21:55,557 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 10:21:55,795 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 10:21:55,796 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2n_append_unequal.i [2024-11-19 10:21:55,808 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0ec86b630/26537e6c03224130b7d2dd70eb337304/FLAG516edd432 [2024-11-19 10:21:55,822 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0ec86b630/26537e6c03224130b7d2dd70eb337304 [2024-11-19 10:21:55,824 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 10:21:55,826 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 10:21:55,827 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 10:21:55,828 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 10:21:55,833 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 10:21:55,834 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 10:21:55" (1/1) ... [2024-11-19 10:21:55,835 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e96be9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:21:55, skipping insertion in model container [2024-11-19 10:21:55,835 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 10:21:55" (1/1) ... [2024-11-19 10:21:55,881 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 10:21:56,243 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 10:21:56,257 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 10:21:56,307 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 10:21:56,339 INFO L204 MainTranslator]: Completed translation [2024-11-19 10:21:56,339 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:21:56 WrapperNode [2024-11-19 10:21:56,339 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 10:21:56,341 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 10:21:56,341 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 10:21:56,341 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 10:21:56,348 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:21:56" (1/1) ... [2024-11-19 10:21:56,360 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:21:56" (1/1) ... [2024-11-19 10:21:56,391 INFO L138 Inliner]: procedures = 127, calls = 37, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 147 [2024-11-19 10:21:56,393 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 10:21:56,393 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 10:21:56,393 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 10:21:56,394 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 10:21:56,401 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:21:56" (1/1) ... [2024-11-19 10:21:56,402 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:21:56" (1/1) ... [2024-11-19 10:21:56,405 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:21:56" (1/1) ... [2024-11-19 10:21:56,426 INFO L175 MemorySlicer]: Split 20 memory accesses to 3 slices as follows [2, 6, 12]. 60 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 10:21:56,426 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:21:56" (1/1) ... [2024-11-19 10:21:56,427 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:21:56" (1/1) ... [2024-11-19 10:21:56,440 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:21:56" (1/1) ... [2024-11-19 10:21:56,444 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:21:56" (1/1) ... [2024-11-19 10:21:56,446 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:21:56" (1/1) ... [2024-11-19 10:21:56,447 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:21:56" (1/1) ... [2024-11-19 10:21:56,452 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 10:21:56,453 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 10:21:56,454 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 10:21:56,454 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 10:21:56,455 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:21:56" (1/1) ... [2024-11-19 10:21:56,461 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 10:21:56,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 10:21:56,495 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 10:21:56,498 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 10:21:56,552 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-19 10:21:56,552 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-19 10:21:56,552 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-19 10:21:56,553 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-19 10:21:56,553 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-19 10:21:56,553 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-19 10:21:56,553 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2024-11-19 10:21:56,553 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2024-11-19 10:21:56,553 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-19 10:21:56,555 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 10:21:56,555 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-19 10:21:56,555 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-19 10:21:56,555 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-19 10:21:56,556 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-19 10:21:56,556 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-19 10:21:56,556 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-19 10:21:56,556 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-19 10:21:56,557 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-19 10:21:56,557 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-19 10:21:56,557 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-19 10:21:56,557 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-19 10:21:56,558 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 10:21:56,558 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-19 10:21:56,558 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-19 10:21:56,558 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 10:21:56,558 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 10:21:56,727 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 10:21:56,729 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 10:21:56,999 INFO L? ?]: Removed 58 outVars from TransFormulas that were not future-live. [2024-11-19 10:21:56,999 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 10:21:57,020 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 10:21:57,021 INFO L316 CfgBuilder]: Removed 4 assume(true) statements. [2024-11-19 10:21:57,021 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:21:57 BoogieIcfgContainer [2024-11-19 10:21:57,022 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 10:21:57,025 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 10:21:57,025 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 10:21:57,028 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 10:21:57,028 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 10:21:55" (1/3) ... [2024-11-19 10:21:57,029 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a779e2b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 10:21:57, skipping insertion in model container [2024-11-19 10:21:57,029 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:21:56" (2/3) ... [2024-11-19 10:21:57,031 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a779e2b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 10:21:57, skipping insertion in model container [2024-11-19 10:21:57,031 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:21:57" (3/3) ... [2024-11-19 10:21:57,032 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2n_append_unequal.i [2024-11-19 10:21:57,050 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 10:21:57,050 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2024-11-19 10:21:57,111 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 10:21:57,117 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;@6de69611, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 10:21:57,117 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2024-11-19 10:21:57,121 INFO L276 IsEmpty]: Start isEmpty. Operand has 52 states, 40 states have (on average 1.575) internal successors, (63), 48 states have internal predecessors, (63), 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 10:21:57,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-19 10:21:57,127 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:21:57,127 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:21:57,128 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-19 10:21:57,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:21:57,133 INFO L85 PathProgramCache]: Analyzing trace with hash 516959884, now seen corresponding path program 1 times [2024-11-19 10:21:57,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:21:57,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076735069] [2024-11-19 10:21:57,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:21:57,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:21:57,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:21:57,551 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 10:21:57,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:21:57,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076735069] [2024-11-19 10:21:57,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2076735069] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:21:57,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:21:57,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 10:21:57,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112498507] [2024-11-19 10:21:57,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:21:57,561 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 10:21:57,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:21:57,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 10:21:57,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 10:21:57,581 INFO L87 Difference]: Start difference. First operand has 52 states, 40 states have (on average 1.575) internal successors, (63), 48 states have internal predecessors, (63), 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 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 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 10:21:57,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:21:57,642 INFO L93 Difference]: Finished difference Result 100 states and 131 transitions. [2024-11-19 10:21:57,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 10:21:57,647 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 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 12 [2024-11-19 10:21:57,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:21:57,673 INFO L225 Difference]: With dead ends: 100 [2024-11-19 10:21:57,677 INFO L226 Difference]: Without dead ends: 48 [2024-11-19 10:21:57,682 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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 10:21:57,686 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 1 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 10:21:57,691 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 159 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 10:21:57,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-11-19 10:21:57,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 47. [2024-11-19 10:21:57,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 35 states have (on average 1.3428571428571427) internal successors, (47), 42 states have internal predecessors, (47), 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 10:21:57,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 53 transitions. [2024-11-19 10:21:57,745 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 53 transitions. Word has length 12 [2024-11-19 10:21:57,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:21:57,746 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 53 transitions. [2024-11-19 10:21:57,747 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 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 10:21:57,747 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 53 transitions. [2024-11-19 10:21:57,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-19 10:21:57,749 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:21:57,750 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:21:57,750 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 10:21:57,750 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-19 10:21:57,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:21:57,751 INFO L85 PathProgramCache]: Analyzing trace with hash -1154112732, now seen corresponding path program 1 times [2024-11-19 10:21:57,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:21:57,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099058248] [2024-11-19 10:21:57,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:21:57,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:21:57,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:21:57,869 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 10:21:57,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:21:57,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099058248] [2024-11-19 10:21:57,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2099058248] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:21:57,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:21:57,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 10:21:57,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613761691] [2024-11-19 10:21:57,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:21:57,872 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 10:21:57,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:21:57,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 10:21:57,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 10:21:57,873 INFO L87 Difference]: Start difference. First operand 47 states and 53 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 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 10:21:57,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:21:57,904 INFO L93 Difference]: Finished difference Result 49 states and 55 transitions. [2024-11-19 10:21:57,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 10:21:57,907 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 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 13 [2024-11-19 10:21:57,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:21:57,907 INFO L225 Difference]: With dead ends: 49 [2024-11-19 10:21:57,907 INFO L226 Difference]: Without dead ends: 48 [2024-11-19 10:21:57,908 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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 10:21:57,909 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 0 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 10:21:57,910 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 122 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 10:21:57,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-11-19 10:21:57,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2024-11-19 10:21:57,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 36 states have (on average 1.3333333333333333) internal successors, (48), 43 states have internal predecessors, (48), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 10:21:57,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 54 transitions. [2024-11-19 10:21:57,917 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 54 transitions. Word has length 13 [2024-11-19 10:21:57,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:21:57,918 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 54 transitions. [2024-11-19 10:21:57,918 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 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 10:21:57,918 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 54 transitions. [2024-11-19 10:21:57,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-19 10:21:57,919 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:21:57,920 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2024-11-19 10:21:57,920 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 10:21:57,921 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-19 10:21:57,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:21:57,922 INFO L85 PathProgramCache]: Analyzing trace with hash 643267438, now seen corresponding path program 1 times [2024-11-19 10:21:57,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:21:57,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129859143] [2024-11-19 10:21:57,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:21:57,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:21:57,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:21:58,038 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-19 10:21:58,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:21:58,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129859143] [2024-11-19 10:21:58,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1129859143] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:21:58,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:21:58,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 10:21:58,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312375413] [2024-11-19 10:21:58,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:21:58,043 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 10:21:58,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:21:58,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 10:21:58,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 10:21:58,044 INFO L87 Difference]: Start difference. First operand 48 states and 54 transitions. Second operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 10:21:58,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:21:58,079 INFO L93 Difference]: Finished difference Result 48 states and 54 transitions. [2024-11-19 10:21:58,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 10:21:58,082 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 23 [2024-11-19 10:21:58,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:21:58,083 INFO L225 Difference]: With dead ends: 48 [2024-11-19 10:21:58,083 INFO L226 Difference]: Without dead ends: 47 [2024-11-19 10:21:58,084 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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 10:21:58,085 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 1 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 10:21:58,086 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 116 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 10:21:58,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-11-19 10:21:58,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2024-11-19 10:21:58,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 36 states have (on average 1.3055555555555556) internal successors, (47), 42 states have internal predecessors, (47), 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 10:21:58,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 53 transitions. [2024-11-19 10:21:58,096 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 53 transitions. Word has length 23 [2024-11-19 10:21:58,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:21:58,097 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 53 transitions. [2024-11-19 10:21:58,097 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 10:21:58,097 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 53 transitions. [2024-11-19 10:21:58,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-19 10:21:58,099 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:21:58,100 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2024-11-19 10:21:58,100 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 10:21:58,100 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-19 10:21:58,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:21:58,101 INFO L85 PathProgramCache]: Analyzing trace with hash -1533545854, now seen corresponding path program 1 times [2024-11-19 10:21:58,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:21:58,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184728950] [2024-11-19 10:21:58,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:21:58,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:21:58,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:21:58,331 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-19 10:21:58,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:21:58,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184728950] [2024-11-19 10:21:58,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1184728950] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 10:21:58,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [655485379] [2024-11-19 10:21:58,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:21:58,333 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 10:21:58,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 10:21:58,336 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 10:21:58,337 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 10:21:58,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:21:58,500 INFO L255 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-19 10:21:58,506 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 10:21:58,589 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-19 10:21:58,589 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 10:21:58,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [655485379] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:21:58,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 10:21:58,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2024-11-19 10:21:58,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654060129] [2024-11-19 10:21:58,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:21:58,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 10:21:58,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:21:58,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 10:21:58,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-19 10:21:58,596 INFO L87 Difference]: Start difference. First operand 47 states and 53 transitions. Second operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 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 10:21:58,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:21:58,642 INFO L93 Difference]: Finished difference Result 47 states and 53 transitions. [2024-11-19 10:21:58,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 10:21:58,643 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 24 [2024-11-19 10:21:58,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:21:58,644 INFO L225 Difference]: With dead ends: 47 [2024-11-19 10:21:58,644 INFO L226 Difference]: Without dead ends: 46 [2024-11-19 10:21:58,644 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-19 10:21:58,645 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 0 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 10:21:58,645 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 163 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 10:21:58,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-11-19 10:21:58,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 41. [2024-11-19 10:21:58,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 32 states have (on average 1.3125) internal successors, (42), 37 states have internal predecessors, (42), 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 10:21:58,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 46 transitions. [2024-11-19 10:21:58,657 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 46 transitions. Word has length 24 [2024-11-19 10:21:58,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:21:58,658 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 46 transitions. [2024-11-19 10:21:58,658 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 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 10:21:58,658 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2024-11-19 10:21:58,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-19 10:21:58,659 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:21:58,659 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, 1, 1] [2024-11-19 10:21:58,678 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-19 10:21:58,860 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 10:21:58,861 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-19 10:21:58,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:21:58,862 INFO L85 PathProgramCache]: Analyzing trace with hash -933782033, now seen corresponding path program 1 times [2024-11-19 10:21:58,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:21:58,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552916448] [2024-11-19 10:21:58,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:21:58,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:21:58,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:21:59,188 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 10:21:59,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:21:59,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552916448] [2024-11-19 10:21:59,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [552916448] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 10:21:59,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1291177206] [2024-11-19 10:21:59,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:21:59,189 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 10:21:59,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 10:21:59,192 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 10:21:59,194 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 10:21:59,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:21:59,331 INFO L255 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 10:21:59,333 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 10:21:59,374 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-19 10:21:59,375 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 10:21:59,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1291177206] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:21:59,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 10:21:59,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [9] total 10 [2024-11-19 10:21:59,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898575643] [2024-11-19 10:21:59,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:21:59,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 10:21:59,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:21:59,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 10:21:59,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-19 10:21:59,379 INFO L87 Difference]: Start difference. First operand 41 states and 46 transitions. Second operand has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 10:21:59,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:21:59,387 INFO L93 Difference]: Finished difference Result 41 states and 46 transitions. [2024-11-19 10:21:59,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 10:21:59,387 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 27 [2024-11-19 10:21:59,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:21:59,389 INFO L225 Difference]: With dead ends: 41 [2024-11-19 10:21:59,389 INFO L226 Difference]: Without dead ends: 40 [2024-11-19 10:21:59,390 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-19 10:21:59,390 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 21 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 10:21:59,391 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 49 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 10:21:59,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-11-19 10:21:59,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2024-11-19 10:21:59,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 32 states have (on average 1.28125) internal successors, (41), 36 states have internal predecessors, (41), 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 10:21:59,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 45 transitions. [2024-11-19 10:21:59,400 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 45 transitions. Word has length 27 [2024-11-19 10:21:59,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:21:59,400 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 45 transitions. [2024-11-19 10:21:59,400 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 10:21:59,401 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 45 transitions. [2024-11-19 10:21:59,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-19 10:21:59,401 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:21:59,401 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, 1, 1, 1] [2024-11-19 10:21:59,419 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-19 10:21:59,602 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 10:21:59,602 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-19 10:21:59,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:21:59,603 INFO L85 PathProgramCache]: Analyzing trace with hash 1117528168, now seen corresponding path program 1 times [2024-11-19 10:21:59,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:21:59,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820025347] [2024-11-19 10:21:59,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:21:59,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:21:59,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:21:59,839 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 10:21:59,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:21:59,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820025347] [2024-11-19 10:21:59,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [820025347] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 10:21:59,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1523118889] [2024-11-19 10:21:59,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:21:59,841 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 10:21:59,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 10:21:59,843 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 10:21:59,844 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 10:21:59,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:21:59,968 INFO L255 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 10:21:59,970 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 10:22:00,037 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-19 10:22:00,037 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 10:22:00,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1523118889] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:22:00,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 10:22:00,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [9] total 10 [2024-11-19 10:22:00,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36237383] [2024-11-19 10:22:00,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:22:00,038 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 10:22:00,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:22:00,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 10:22:00,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-19 10:22:00,039 INFO L87 Difference]: Start difference. First operand 40 states and 45 transitions. Second operand has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 10:22:00,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:22:00,042 INFO L93 Difference]: Finished difference Result 40 states and 45 transitions. [2024-11-19 10:22:00,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 10:22:00,043 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 28 [2024-11-19 10:22:00,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:22:00,043 INFO L225 Difference]: With dead ends: 40 [2024-11-19 10:22:00,043 INFO L226 Difference]: Without dead ends: 37 [2024-11-19 10:22:00,044 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-19 10:22:00,045 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 20 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 10:22:00,045 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 49 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 10:22:00,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-11-19 10:22:00,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2024-11-19 10:22:00,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 33 states have internal predecessors, (37), 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 10:22:00,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2024-11-19 10:22:00,050 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 28 [2024-11-19 10:22:00,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:22:00,050 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2024-11-19 10:22:00,050 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 10:22:00,051 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2024-11-19 10:22:00,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-19 10:22:00,051 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:22:00,052 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, 1, 1, 1, 1, 1] [2024-11-19 10:22:00,069 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-19 10:22:00,252 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 10:22:00,253 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-19 10:22:00,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:22:00,253 INFO L85 PathProgramCache]: Analyzing trace with hash 170367595, now seen corresponding path program 1 times [2024-11-19 10:22:00,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:22:00,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118379083] [2024-11-19 10:22:00,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:22:00,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:22:00,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:22:00,342 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 10:22:00,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:22:00,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118379083] [2024-11-19 10:22:00,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2118379083] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 10:22:00,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1994613342] [2024-11-19 10:22:00,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:22:00,343 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 10:22:00,343 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 10:22:00,344 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 10:22:00,346 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 10:22:00,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:22:00,475 INFO L255 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-19 10:22:00,477 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 10:22:00,510 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 10:22:00,511 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 10:22:00,565 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 10:22:00,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1994613342] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 10:22:00,567 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 10:22:00,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2024-11-19 10:22:00,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732153842] [2024-11-19 10:22:00,568 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 10:22:00,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 10:22:00,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:22:00,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 10:22:00,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-19 10:22:00,569 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 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 10:22:00,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:22:00,611 INFO L93 Difference]: Finished difference Result 71 states and 79 transitions. [2024-11-19 10:22:00,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 10:22:00,612 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 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 30 [2024-11-19 10:22:00,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:22:00,613 INFO L225 Difference]: With dead ends: 71 [2024-11-19 10:22:00,616 INFO L226 Difference]: Without dead ends: 43 [2024-11-19 10:22:00,617 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 55 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-19 10:22:00,617 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 2 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 10:22:00,618 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 168 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 10:22:00,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-11-19 10:22:00,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2024-11-19 10:22:00,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 35 states have (on average 1.2) internal successors, (42), 38 states have internal predecessors, (42), 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 10:22:00,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2024-11-19 10:22:00,628 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 30 [2024-11-19 10:22:00,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:22:00,629 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2024-11-19 10:22:00,629 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 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 10:22:00,629 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2024-11-19 10:22:00,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-19 10:22:00,630 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:22:00,630 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, 1, 1, 1] [2024-11-19 10:22:00,652 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-19 10:22:00,836 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 10:22:00,837 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-19 10:22:00,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:22:00,838 INFO L85 PathProgramCache]: Analyzing trace with hash 56505037, now seen corresponding path program 2 times [2024-11-19 10:22:00,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:22:00,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124861611] [2024-11-19 10:22:00,838 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 10:22:00,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:22:00,865 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-19 10:22:00,865 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 10:22:00,900 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-11-19 10:22:00,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:22:00,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124861611] [2024-11-19 10:22:00,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1124861611] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:22:00,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:22:00,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 10:22:00,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279999254] [2024-11-19 10:22:00,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:22:00,902 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 10:22:00,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:22:00,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 10:22:00,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 10:22:00,903 INFO L87 Difference]: Start difference. First operand 43 states and 48 transitions. Second operand has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 10:22:00,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:22:00,922 INFO L93 Difference]: Finished difference Result 52 states and 58 transitions. [2024-11-19 10:22:00,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 10:22:00,923 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 41 [2024-11-19 10:22:00,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:22:00,924 INFO L225 Difference]: With dead ends: 52 [2024-11-19 10:22:00,924 INFO L226 Difference]: Without dead ends: 50 [2024-11-19 10:22:00,924 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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 10:22:00,925 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 3 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 10:22:00,929 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 102 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 10:22:00,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2024-11-19 10:22:00,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 48. [2024-11-19 10:22:00,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 40 states have (on average 1.2) internal successors, (48), 43 states have internal predecessors, (48), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 10:22:00,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 54 transitions. [2024-11-19 10:22:00,938 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 54 transitions. Word has length 41 [2024-11-19 10:22:00,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:22:00,939 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 54 transitions. [2024-11-19 10:22:00,939 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 10:22:00,939 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 54 transitions. [2024-11-19 10:22:00,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-19 10:22:00,940 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:22:00,940 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, 1, 1, 1, 1] [2024-11-19 10:22:00,940 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-19 10:22:00,940 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-19 10:22:00,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:22:00,941 INFO L85 PathProgramCache]: Analyzing trace with hash 1751604704, now seen corresponding path program 1 times [2024-11-19 10:22:00,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:22:00,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560241119] [2024-11-19 10:22:00,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:22:00,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:22:00,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:22:01,035 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-11-19 10:22:01,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:22:01,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560241119] [2024-11-19 10:22:01,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1560241119] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:22:01,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:22:01,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 10:22:01,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136094969] [2024-11-19 10:22:01,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:22:01,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 10:22:01,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:22:01,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 10:22:01,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 10:22:01,041 INFO L87 Difference]: Start difference. First operand 48 states and 54 transitions. Second operand has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 10:22:01,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:22:01,061 INFO L93 Difference]: Finished difference Result 54 states and 59 transitions. [2024-11-19 10:22:01,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 10:22:01,062 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 42 [2024-11-19 10:22:01,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:22:01,063 INFO L225 Difference]: With dead ends: 54 [2024-11-19 10:22:01,065 INFO L226 Difference]: Without dead ends: 48 [2024-11-19 10:22:01,066 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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 10:22:01,066 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 2 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 10:22:01,067 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 104 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 10:22:01,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-11-19 10:22:01,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2024-11-19 10:22:01,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 40 states have (on average 1.175) internal successors, (47), 43 states have internal predecessors, (47), 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 10:22:01,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 53 transitions. [2024-11-19 10:22:01,072 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 53 transitions. Word has length 42 [2024-11-19 10:22:01,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:22:01,072 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 53 transitions. [2024-11-19 10:22:01,072 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 10:22:01,073 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 53 transitions. [2024-11-19 10:22:01,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-19 10:22:01,074 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:22:01,074 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:22:01,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-19 10:22:01,074 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-19 10:22:01,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:22:01,074 INFO L85 PathProgramCache]: Analyzing trace with hash 488480125, now seen corresponding path program 1 times [2024-11-19 10:22:01,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:22:01,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959338297] [2024-11-19 10:22:01,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:22:01,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:22:01,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:22:01,374 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-19 10:22:01,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:22:01,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959338297] [2024-11-19 10:22:01,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [959338297] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 10:22:01,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [830907244] [2024-11-19 10:22:01,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:22:01,375 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 10:22:01,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 10:22:01,379 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 10:22:01,382 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 10:22:01,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:22:01,539 INFO L255 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 10:22:01,541 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 10:22:01,592 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-11-19 10:22:01,592 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 10:22:01,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [830907244] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:22:01,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 10:22:01,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 12 [2024-11-19 10:22:01,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48187014] [2024-11-19 10:22:01,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:22:01,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 10:22:01,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:22:01,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 10:22:01,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2024-11-19 10:22:01,595 INFO L87 Difference]: Start difference. First operand 48 states and 53 transitions. Second operand has 5 states, 4 states have (on average 6.75) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 10:22:01,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:22:01,620 INFO L93 Difference]: Finished difference Result 48 states and 53 transitions. [2024-11-19 10:22:01,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 10:22:01,621 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.75) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 46 [2024-11-19 10:22:01,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:22:01,622 INFO L225 Difference]: With dead ends: 48 [2024-11-19 10:22:01,623 INFO L226 Difference]: Without dead ends: 47 [2024-11-19 10:22:01,623 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2024-11-19 10:22:01,624 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 4 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 10:22:01,624 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 94 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 10:22:01,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-11-19 10:22:01,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2024-11-19 10:22:01,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 40 states have (on average 1.15) internal successors, (46), 42 states have internal predecessors, (46), 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 10:22:01,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 52 transitions. [2024-11-19 10:22:01,634 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 52 transitions. Word has length 46 [2024-11-19 10:22:01,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:22:01,634 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 52 transitions. [2024-11-19 10:22:01,634 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.75) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 10:22:01,635 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 52 transitions. [2024-11-19 10:22:01,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-19 10:22:01,637 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:22:01,637 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:22:01,654 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 10:22:01,837 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-19 10:22:01,838 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-19 10:22:01,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:22:01,838 INFO L85 PathProgramCache]: Analyzing trace with hash -2037036752, now seen corresponding path program 1 times [2024-11-19 10:22:01,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:22:01,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147852914] [2024-11-19 10:22:01,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:22:01,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:22:01,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:22:02,068 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-19 10:22:02,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:22:02,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147852914] [2024-11-19 10:22:02,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [147852914] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 10:22:02,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [732251037] [2024-11-19 10:22:02,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:22:02,069 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 10:22:02,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 10:22:02,071 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 10:22:02,073 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 10:22:02,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:22:02,235 INFO L255 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 10:22:02,238 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 10:22:02,292 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-11-19 10:22:02,292 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 10:22:02,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [732251037] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:22:02,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 10:22:02,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 12 [2024-11-19 10:22:02,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056231488] [2024-11-19 10:22:02,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:22:02,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 10:22:02,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:22:02,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 10:22:02,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2024-11-19 10:22:02,296 INFO L87 Difference]: Start difference. First operand 47 states and 52 transitions. Second operand has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 10:22:02,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:22:02,324 INFO L93 Difference]: Finished difference Result 47 states and 52 transitions. [2024-11-19 10:22:02,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 10:22:02,325 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 47 [2024-11-19 10:22:02,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:22:02,326 INFO L225 Difference]: With dead ends: 47 [2024-11-19 10:22:02,326 INFO L226 Difference]: Without dead ends: 46 [2024-11-19 10:22:02,326 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2024-11-19 10:22:02,327 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 3 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 10:22:02,327 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 115 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 10:22:02,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-11-19 10:22:02,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2024-11-19 10:22:02,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 40 states have (on average 1.125) internal successors, (45), 41 states have internal predecessors, (45), 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 10:22:02,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 51 transitions. [2024-11-19 10:22:02,333 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 51 transitions. Word has length 47 [2024-11-19 10:22:02,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:22:02,333 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 51 transitions. [2024-11-19 10:22:02,333 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 10:22:02,334 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 51 transitions. [2024-11-19 10:22:02,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-19 10:22:02,334 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:22:02,334 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:22:02,352 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-19 10:22:02,535 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 10:22:02,535 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-19 10:22:02,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:22:02,536 INFO L85 PathProgramCache]: Analyzing trace with hash -2036985210, now seen corresponding path program 1 times [2024-11-19 10:22:02,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:22:02,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101579237] [2024-11-19 10:22:02,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:22:02,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:22:02,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:22:02,750 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-19 10:22:02,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:22:02,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101579237] [2024-11-19 10:22:02,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1101579237] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 10:22:02,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2016146848] [2024-11-19 10:22:02,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:22:02,751 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 10:22:02,751 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 10:22:02,753 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 10:22:02,754 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 10:22:02,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:22:02,918 INFO L255 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-19 10:22:02,920 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 10:22:02,981 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-11-19 10:22:02,982 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 10:22:03,068 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-11-19 10:22:03,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2016146848] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 10:22:03,068 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 10:22:03,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5, 5] total 17 [2024-11-19 10:22:03,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182509225] [2024-11-19 10:22:03,069 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 10:22:03,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-19 10:22:03,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:22:03,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-19 10:22:03,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2024-11-19 10:22:03,071 INFO L87 Difference]: Start difference. First operand 46 states and 51 transitions. Second operand has 17 states, 17 states have (on average 3.588235294117647) internal successors, (61), 16 states have internal predecessors, (61), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-19 10:22:03,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:22:03,204 INFO L93 Difference]: Finished difference Result 85 states and 96 transitions. [2024-11-19 10:22:03,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-19 10:22:03,205 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.588235294117647) internal successors, (61), 16 states have internal predecessors, (61), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 47 [2024-11-19 10:22:03,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:22:03,206 INFO L225 Difference]: With dead ends: 85 [2024-11-19 10:22:03,206 INFO L226 Difference]: Without dead ends: 67 [2024-11-19 10:22:03,207 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2024-11-19 10:22:03,207 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 10 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 10:22:03,208 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 299 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 10:22:03,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-11-19 10:22:03,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 61. [2024-11-19 10:22:03,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 55 states have (on average 1.1272727272727272) internal successors, (62), 56 states have internal predecessors, (62), 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 10:22:03,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 68 transitions. [2024-11-19 10:22:03,217 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 68 transitions. Word has length 47 [2024-11-19 10:22:03,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:22:03,217 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 68 transitions. [2024-11-19 10:22:03,217 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.588235294117647) internal successors, (61), 16 states have internal predecessors, (61), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-19 10:22:03,217 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 68 transitions. [2024-11-19 10:22:03,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-19 10:22:03,218 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:22:03,218 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:22:03,232 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-19 10:22:03,422 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 10:22:03,423 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-19 10:22:03,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:22:03,423 INFO L85 PathProgramCache]: Analyzing trace with hash -792688064, now seen corresponding path program 1 times [2024-11-19 10:22:03,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:22:03,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466081967] [2024-11-19 10:22:03,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:22:03,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:22:03,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:22:03,536 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-11-19 10:22:03,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:22:03,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466081967] [2024-11-19 10:22:03,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [466081967] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 10:22:03,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1620166970] [2024-11-19 10:22:03,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:22:03,537 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 10:22:03,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 10:22:03,539 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 10:22:03,540 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 10:22:03,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:22:03,704 INFO L255 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-19 10:22:03,706 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 10:22:03,747 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-11-19 10:22:03,747 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 10:22:03,805 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-11-19 10:22:03,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1620166970] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 10:22:03,805 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 10:22:03,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2024-11-19 10:22:03,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390227371] [2024-11-19 10:22:03,806 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 10:22:03,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-19 10:22:03,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:22:03,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-19 10:22:03,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2024-11-19 10:22:03,807 INFO L87 Difference]: Start difference. First operand 61 states and 68 transitions. Second operand has 12 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 12 states have internal predecessors, (52), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 10:22:03,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:22:03,852 INFO L93 Difference]: Finished difference Result 70 states and 76 transitions. [2024-11-19 10:22:03,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 10:22:03,853 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 12 states have internal predecessors, (52), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 51 [2024-11-19 10:22:03,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:22:03,853 INFO L225 Difference]: With dead ends: 70 [2024-11-19 10:22:03,853 INFO L226 Difference]: Without dead ends: 61 [2024-11-19 10:22:03,854 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2024-11-19 10:22:03,854 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 2 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 10:22:03,854 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 218 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 10:22:03,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2024-11-19 10:22:03,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2024-11-19 10:22:03,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 55 states have (on average 1.0909090909090908) internal successors, (60), 56 states have internal predecessors, (60), 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 10:22:03,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 66 transitions. [2024-11-19 10:22:03,860 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 66 transitions. Word has length 51 [2024-11-19 10:22:03,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:22:03,860 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 66 transitions. [2024-11-19 10:22:03,861 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 12 states have internal predecessors, (52), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 10:22:03,861 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 66 transitions. [2024-11-19 10:22:03,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-11-19 10:22:03,861 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:22:03,862 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:22:03,879 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 10:22:04,062 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,SelfDestructingSolverStorable12 [2024-11-19 10:22:04,063 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-19 10:22:04,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:22:04,063 INFO L85 PathProgramCache]: Analyzing trace with hash 223697984, now seen corresponding path program 2 times [2024-11-19 10:22:04,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:22:04,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078761506] [2024-11-19 10:22:04,064 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 10:22:04,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:22:04,097 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 10:22:04,097 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 10:22:04,293 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-11-19 10:22:04,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:22:04,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078761506] [2024-11-19 10:22:04,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1078761506] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 10:22:04,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [467839134] [2024-11-19 10:22:04,293 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 10:22:04,294 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 10:22:04,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 10:22:04,295 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 10:22:04,297 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-19 10:22:04,488 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 10:22:04,489 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 10:22:04,491 INFO L255 TraceCheckSpWp]: Trace formula consists of 411 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-19 10:22:04,494 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 10:22:04,562 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-11-19 10:22:04,563 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 10:22:04,686 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-11-19 10:22:04,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [467839134] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 10:22:04,686 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 10:22:04,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 19 [2024-11-19 10:22:04,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005568470] [2024-11-19 10:22:04,687 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 10:22:04,687 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-19 10:22:04,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:22:04,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-19 10:22:04,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=285, Unknown=0, NotChecked=0, Total=380 [2024-11-19 10:22:04,688 INFO L87 Difference]: Start difference. First operand 61 states and 66 transitions. Second operand has 20 states, 19 states have (on average 3.789473684210526) internal successors, (72), 20 states have internal predecessors, (72), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 10:22:04,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:22:04,752 INFO L93 Difference]: Finished difference Result 88 states and 96 transitions. [2024-11-19 10:22:04,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-19 10:22:04,753 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 3.789473684210526) internal successors, (72), 20 states have internal predecessors, (72), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 61 [2024-11-19 10:22:04,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:22:04,754 INFO L225 Difference]: With dead ends: 88 [2024-11-19 10:22:04,754 INFO L226 Difference]: Without dead ends: 74 [2024-11-19 10:22:04,754 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=285, Unknown=0, NotChecked=0, Total=380 [2024-11-19 10:22:04,755 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 6 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 10:22:04,755 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 223 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 10:22:04,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2024-11-19 10:22:04,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 73. [2024-11-19 10:22:04,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 67 states have (on average 1.0597014925373134) internal successors, (71), 68 states have internal predecessors, (71), 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 10:22:04,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 77 transitions. [2024-11-19 10:22:04,761 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 77 transitions. Word has length 61 [2024-11-19 10:22:04,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:22:04,761 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 77 transitions. [2024-11-19 10:22:04,762 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 3.789473684210526) internal successors, (72), 20 states have internal predecessors, (72), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 10:22:04,762 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 77 transitions. [2024-11-19 10:22:04,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-19 10:22:04,762 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:22:04,763 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 6, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:22:04,779 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-11-19 10:22:04,966 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-11-19 10:22:04,967 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-19 10:22:04,967 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:22:04,967 INFO L85 PathProgramCache]: Analyzing trace with hash -1525806538, now seen corresponding path program 1 times [2024-11-19 10:22:04,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:22:04,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466769890] [2024-11-19 10:22:04,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:22:04,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:22:04,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:22:05,256 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-11-19 10:22:05,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:22:05,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466769890] [2024-11-19 10:22:05,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1466769890] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 10:22:05,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1027483396] [2024-11-19 10:22:05,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:22:05,257 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 10:22:05,257 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 10:22:05,260 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 10:22:05,261 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-19 10:22:05,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:22:05,449 INFO L255 TraceCheckSpWp]: Trace formula consists of 485 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-19 10:22:05,451 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 10:22:05,526 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-11-19 10:22:05,526 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 10:22:05,841 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-11-19 10:22:05,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1027483396] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 10:22:05,841 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 10:22:05,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 31 [2024-11-19 10:22:05,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492674339] [2024-11-19 10:22:05,842 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 10:22:05,842 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-11-19 10:22:05,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:22:05,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-11-19 10:22:05,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=271, Invalid=721, Unknown=0, NotChecked=0, Total=992 [2024-11-19 10:22:05,845 INFO L87 Difference]: Start difference. First operand 73 states and 77 transitions. Second operand has 32 states, 31 states have (on average 3.225806451612903) internal successors, (100), 32 states have internal predecessors, (100), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 10:22:05,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:22:05,934 INFO L93 Difference]: Finished difference Result 126 states and 144 transitions. [2024-11-19 10:22:05,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-11-19 10:22:05,935 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 3.225806451612903) internal successors, (100), 32 states have internal predecessors, (100), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 75 [2024-11-19 10:22:05,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:22:05,936 INFO L225 Difference]: With dead ends: 126 [2024-11-19 10:22:05,936 INFO L226 Difference]: Without dead ends: 125 [2024-11-19 10:22:05,937 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 295 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=271, Invalid=721, Unknown=0, NotChecked=0, Total=992 [2024-11-19 10:22:05,938 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 26 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 10:22:05,938 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 318 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 10:22:05,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2024-11-19 10:22:05,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 111. [2024-11-19 10:22:05,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 105 states have (on average 1.1047619047619048) internal successors, (116), 106 states have internal predecessors, (116), 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 10:22:05,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 122 transitions. [2024-11-19 10:22:05,947 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 122 transitions. Word has length 75 [2024-11-19 10:22:05,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:22:05,947 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 122 transitions. [2024-11-19 10:22:05,948 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 3.225806451612903) internal successors, (100), 32 states have internal predecessors, (100), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 10:22:05,948 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 122 transitions. [2024-11-19 10:22:05,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-19 10:22:05,949 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:22:05,949 INFO L215 NwaCegarLoop]: trace histogram [8, 7, 7, 7, 7, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:22:05,967 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-11-19 10:22:06,153 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-11-19 10:22:06,154 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-19 10:22:06,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:22:06,154 INFO L85 PathProgramCache]: Analyzing trace with hash -545030080, now seen corresponding path program 3 times [2024-11-19 10:22:06,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:22:06,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776460957] [2024-11-19 10:22:06,155 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 10:22:06,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:22:06,216 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-19 10:22:06,216 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 10:22:06,977 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 5 proven. 17 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2024-11-19 10:22:06,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:22:06,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776460957] [2024-11-19 10:22:06,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1776460957] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 10:22:06,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [415864237] [2024-11-19 10:22:06,978 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 10:22:06,978 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 10:22:06,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 10:22:06,980 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 10:22:06,982 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-19 10:22:07,200 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-19 10:22:07,200 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 10:22:07,205 INFO L255 TraceCheckSpWp]: Trace formula consists of 388 conjuncts, 67 conjuncts are in the unsatisfiable core [2024-11-19 10:22:07,208 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 10:22:07,338 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 10:22:07,409 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 10:22:07,583 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 10:22:07,590 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 10:22:07,767 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_1| Int)) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_1|) 0) 0)) (exists ((|v_node_create_~temp~0#1.base_49| Int)) (and (= (select |c_old(#valid)| |v_node_create_~temp~0#1.base_49|) 0) (= |c_#memory_$Pointer$#2.base| (store |c_old(#memory_$Pointer$#2.base)| |v_node_create_~temp~0#1.base_49| (select |c_#memory_$Pointer$#2.base| |v_node_create_~temp~0#1.base_49|)))))) is different from true [2024-11-19 10:22:07,809 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 10:22:07,810 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 21 treesize of output 16 [2024-11-19 10:22:07,828 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-11-19 10:22:07,829 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 10:22:07,994 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 24 treesize of output 8 [2024-11-19 10:22:08,039 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 5 proven. 13 refuted. 0 times theorem prover too weak. 120 trivial. 4 not checked. [2024-11-19 10:22:08,039 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 10:22:08,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [415864237] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 10:22:08,212 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 10:22:08,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 19] total 31 [2024-11-19 10:22:08,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114781432] [2024-11-19 10:22:08,213 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 10:22:08,213 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-11-19 10:22:08,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:22:08,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-11-19 10:22:08,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=1016, Unknown=4, NotChecked=64, Total=1190 [2024-11-19 10:22:08,215 INFO L87 Difference]: Start difference. First operand 111 states and 122 transitions. Second operand has 31 states, 29 states have (on average 2.2758620689655173) internal successors, (66), 25 states have internal predecessors, (66), 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 10:22:08,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:22:08,732 INFO L93 Difference]: Finished difference Result 203 states and 222 transitions. [2024-11-19 10:22:08,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-19 10:22:08,733 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 29 states have (on average 2.2758620689655173) internal successors, (66), 25 states have internal predecessors, (66), 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 81 [2024-11-19 10:22:08,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:22:08,735 INFO L225 Difference]: With dead ends: 203 [2024-11-19 10:22:08,735 INFO L226 Difference]: Without dead ends: 119 [2024-11-19 10:22:08,736 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 262 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=156, Invalid=1484, Unknown=4, NotChecked=78, Total=1722 [2024-11-19 10:22:08,736 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 23 mSDsluCounter, 471 mSDsCounter, 0 mSdLazyCounter, 385 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 505 SdHoareTripleChecker+Invalid, 439 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 385 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 51 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 10:22:08,737 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 505 Invalid, 439 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 385 Invalid, 0 Unknown, 51 Unchecked, 0.3s Time] [2024-11-19 10:22:08,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2024-11-19 10:22:08,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 118. [2024-11-19 10:22:08,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 111 states have (on average 1.0990990990990992) internal successors, (122), 112 states have internal predecessors, (122), 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 10:22:08,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 128 transitions. [2024-11-19 10:22:08,753 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 128 transitions. Word has length 81 [2024-11-19 10:22:08,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:22:08,753 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 128 transitions. [2024-11-19 10:22:08,753 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 29 states have (on average 2.2758620689655173) internal successors, (66), 25 states have internal predecessors, (66), 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 10:22:08,753 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 128 transitions. [2024-11-19 10:22:08,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-19 10:22:08,754 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:22:08,754 INFO L215 NwaCegarLoop]: trace histogram [8, 7, 7, 7, 7, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:22:08,773 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-11-19 10:22:08,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-11-19 10:22:08,959 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-19 10:22:08,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:22:08,960 INFO L85 PathProgramCache]: Analyzing trace with hash 1052095109, now seen corresponding path program 1 times [2024-11-19 10:22:08,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:22:08,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438807829] [2024-11-19 10:22:08,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:22:08,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:22:09,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:22:09,532 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 119 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-11-19 10:22:09,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:22:09,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438807829] [2024-11-19 10:22:09,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438807829] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 10:22:09,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [876858668] [2024-11-19 10:22:09,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:22:09,534 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 10:22:09,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 10:22:09,535 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 10:22:09,537 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-19 10:22:09,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:22:09,749 INFO L255 TraceCheckSpWp]: Trace formula consists of 512 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-19 10:22:09,752 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 10:22:09,827 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 119 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-11-19 10:22:09,827 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 10:22:10,153 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 119 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-11-19 10:22:10,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [876858668] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 10:22:10,154 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 10:22:10,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 35 [2024-11-19 10:22:10,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538089565] [2024-11-19 10:22:10,154 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 10:22:10,155 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2024-11-19 10:22:10,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:22:10,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2024-11-19 10:22:10,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=311, Invalid=949, Unknown=0, NotChecked=0, Total=1260 [2024-11-19 10:22:10,157 INFO L87 Difference]: Start difference. First operand 118 states and 128 transitions. Second operand has 36 states, 35 states have (on average 3.2285714285714286) internal successors, (113), 36 states have internal predecessors, (113), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 10:22:10,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:22:10,251 INFO L93 Difference]: Finished difference Result 142 states and 152 transitions. [2024-11-19 10:22:10,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-11-19 10:22:10,252 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 3.2285714285714286) internal successors, (113), 36 states have internal predecessors, (113), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 83 [2024-11-19 10:22:10,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:22:10,253 INFO L225 Difference]: With dead ends: 142 [2024-11-19 10:22:10,253 INFO L226 Difference]: Without dead ends: 121 [2024-11-19 10:22:10,254 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 379 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=311, Invalid=949, Unknown=0, NotChecked=0, Total=1260 [2024-11-19 10:22:10,254 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 28 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 10:22:10,254 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 306 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 10:22:10,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2024-11-19 10:22:10,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 120. [2024-11-19 10:22:10,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 113 states have (on average 1.0353982300884956) internal successors, (117), 114 states have internal predecessors, (117), 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 10:22:10,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 123 transitions. [2024-11-19 10:22:10,262 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 123 transitions. Word has length 83 [2024-11-19 10:22:10,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:22:10,262 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 123 transitions. [2024-11-19 10:22:10,262 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 3.2285714285714286) internal successors, (113), 36 states have internal predecessors, (113), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 10:22:10,263 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 123 transitions. [2024-11-19 10:22:10,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-19 10:22:10,264 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:22:10,264 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 15, 14, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:22:10,282 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2024-11-19 10:22:10,464 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-19 10:22:10,465 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-19 10:22:10,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:22:10,465 INFO L85 PathProgramCache]: Analyzing trace with hash 1273213755, now seen corresponding path program 1 times [2024-11-19 10:22:10,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:22:10,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052860235] [2024-11-19 10:22:10,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:22:10,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:22:10,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:22:11,303 INFO L134 CoverageAnalysis]: Checked inductivity of 550 backedges. 0 proven. 525 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-11-19 10:22:11,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:22:11,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052860235] [2024-11-19 10:22:11,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2052860235] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 10:22:11,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1551223091] [2024-11-19 10:22:11,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:22:11,303 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 10:22:11,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 10:22:11,305 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 10:22:11,307 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-19 10:22:11,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:22:11,543 INFO L255 TraceCheckSpWp]: Trace formula consists of 678 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-19 10:22:11,562 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 10:22:11,688 INFO L134 CoverageAnalysis]: Checked inductivity of 550 backedges. 0 proven. 525 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-11-19 10:22:11,688 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 10:22:12,574 INFO L134 CoverageAnalysis]: Checked inductivity of 550 backedges. 0 proven. 525 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-11-19 10:22:12,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1551223091] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 10:22:12,574 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 10:22:12,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 63 [2024-11-19 10:22:12,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209327328] [2024-11-19 10:22:12,575 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 10:22:12,575 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2024-11-19 10:22:12,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:22:12,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2024-11-19 10:22:12,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1055, Invalid=2977, Unknown=0, NotChecked=0, Total=4032 [2024-11-19 10:22:12,579 INFO L87 Difference]: Start difference. First operand 120 states and 123 transitions. Second operand has 64 states, 63 states have (on average 2.873015873015873) internal successors, (181), 64 states have internal predecessors, (181), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 10:22:12,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:22:12,934 INFO L93 Difference]: Finished difference Result 229 states and 262 transitions. [2024-11-19 10:22:12,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2024-11-19 10:22:12,935 INFO L78 Accepts]: Start accepts. Automaton has has 64 states, 63 states have (on average 2.873015873015873) internal successors, (181), 64 states have internal predecessors, (181), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 117 [2024-11-19 10:22:12,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:22:12,937 INFO L225 Difference]: With dead ends: 229 [2024-11-19 10:22:12,937 INFO L226 Difference]: Without dead ends: 228 [2024-11-19 10:22:12,938 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 201 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1239 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1055, Invalid=2977, Unknown=0, NotChecked=0, Total=4032 [2024-11-19 10:22:12,939 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 78 mSDsluCounter, 357 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 390 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 10:22:12,939 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 390 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 10:22:12,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2024-11-19 10:22:12,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 198. [2024-11-19 10:22:12,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 191 states have (on average 1.0994764397905759) internal successors, (210), 192 states have internal predecessors, (210), 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 10:22:12,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 216 transitions. [2024-11-19 10:22:12,949 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 216 transitions. Word has length 117 [2024-11-19 10:22:12,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:22:12,950 INFO L471 AbstractCegarLoop]: Abstraction has 198 states and 216 transitions. [2024-11-19 10:22:12,950 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 64 states, 63 states have (on average 2.873015873015873) internal successors, (181), 64 states have internal predecessors, (181), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 10:22:12,950 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 216 transitions. [2024-11-19 10:22:12,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-19 10:22:12,952 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:22:12,954 INFO L215 NwaCegarLoop]: trace histogram [16, 15, 15, 15, 15, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:22:12,973 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2024-11-19 10:22:13,154 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-11-19 10:22:13,154 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-19 10:22:13,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:22:13,155 INFO L85 PathProgramCache]: Analyzing trace with hash 1479905669, now seen corresponding path program 2 times [2024-11-19 10:22:13,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:22:13,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744191066] [2024-11-19 10:22:13,155 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 10:22:13,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:22:13,191 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 10:22:13,191 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 10:22:13,950 INFO L134 CoverageAnalysis]: Checked inductivity of 580 backedges. 0 proven. 555 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-11-19 10:22:13,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:22:13,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744191066] [2024-11-19 10:22:13,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [744191066] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 10:22:13,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [76753127] [2024-11-19 10:22:13,951 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 10:22:13,951 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 10:22:13,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 10:22:13,952 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 10:22:13,953 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-11-19 10:22:14,185 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 10:22:14,185 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 10:22:14,189 INFO L255 TraceCheckSpWp]: Trace formula consists of 696 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-11-19 10:22:14,192 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 10:22:14,337 INFO L134 CoverageAnalysis]: Checked inductivity of 580 backedges. 0 proven. 555 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-11-19 10:22:14,337 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 10:22:15,187 INFO L134 CoverageAnalysis]: Checked inductivity of 580 backedges. 0 proven. 555 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-11-19 10:22:15,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [76753127] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 10:22:15,187 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 10:22:15,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 67 [2024-11-19 10:22:15,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836436518] [2024-11-19 10:22:15,188 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 10:22:15,188 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 68 states [2024-11-19 10:22:15,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:22:15,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2024-11-19 10:22:15,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1127, Invalid=3429, Unknown=0, NotChecked=0, Total=4556 [2024-11-19 10:22:15,191 INFO L87 Difference]: Start difference. First operand 198 states and 216 transitions. Second operand has 68 states, 67 states have (on average 2.8805970149253732) internal successors, (193), 68 states have internal predecessors, (193), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 10:22:15,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:22:15,338 INFO L93 Difference]: Finished difference Result 238 states and 256 transitions. [2024-11-19 10:22:15,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2024-11-19 10:22:15,338 INFO L78 Accepts]: Start accepts. Automaton has has 68 states, 67 states have (on average 2.8805970149253732) internal successors, (193), 68 states have internal predecessors, (193), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 123 [2024-11-19 10:22:15,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:22:15,340 INFO L225 Difference]: With dead ends: 238 [2024-11-19 10:22:15,340 INFO L226 Difference]: Without dead ends: 201 [2024-11-19 10:22:15,341 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 277 GetRequests, 211 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1411 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1127, Invalid=3429, Unknown=0, NotChecked=0, Total=4556 [2024-11-19 10:22:15,342 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 58 mSDsluCounter, 381 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 413 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 10:22:15,346 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 413 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 10:22:15,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2024-11-19 10:22:15,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 200. [2024-11-19 10:22:15,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 193 states have (on average 1.0207253886010363) internal successors, (197), 194 states have internal predecessors, (197), 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 10:22:15,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 203 transitions. [2024-11-19 10:22:15,366 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 203 transitions. Word has length 123 [2024-11-19 10:22:15,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:22:15,367 INFO L471 AbstractCegarLoop]: Abstraction has 200 states and 203 transitions. [2024-11-19 10:22:15,367 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 68 states, 67 states have (on average 2.8805970149253732) internal successors, (193), 68 states have internal predecessors, (193), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 10:22:15,367 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 203 transitions. [2024-11-19 10:22:15,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2024-11-19 10:22:15,369 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:22:15,369 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 31, 30, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:22:15,403 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2024-11-19 10:22:15,572 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 10:22:15,573 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-19 10:22:15,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:22:15,574 INFO L85 PathProgramCache]: Analyzing trace with hash -626462405, now seen corresponding path program 2 times [2024-11-19 10:22:15,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:22:15,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627656377] [2024-11-19 10:22:15,574 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 10:22:15,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:22:15,619 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 10:22:15,619 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 10:22:18,194 INFO L134 CoverageAnalysis]: Checked inductivity of 2350 backedges. 0 proven. 2325 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-11-19 10:22:18,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:22:18,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627656377] [2024-11-19 10:22:18,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1627656377] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 10:22:18,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2070452228] [2024-11-19 10:22:18,194 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 10:22:18,194 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 10:22:18,194 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 10:22:18,195 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 10:22:18,197 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-11-19 10:22:18,528 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 10:22:18,529 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 10:22:18,533 INFO L255 TraceCheckSpWp]: Trace formula consists of 1046 conjuncts, 63 conjuncts are in the unsatisfiable core [2024-11-19 10:22:18,537 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 10:22:18,760 INFO L134 CoverageAnalysis]: Checked inductivity of 2350 backedges. 0 proven. 2325 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-11-19 10:22:18,761 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 10:22:21,703 INFO L134 CoverageAnalysis]: Checked inductivity of 2350 backedges. 0 proven. 2325 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-11-19 10:22:21,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2070452228] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 10:22:21,703 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 10:22:21,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63, 63] total 127 [2024-11-19 10:22:21,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215615615] [2024-11-19 10:22:21,704 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 10:22:21,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 128 states [2024-11-19 10:22:21,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:22:21,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 128 interpolants. [2024-11-19 10:22:21,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4159, Invalid=12097, Unknown=0, NotChecked=0, Total=16256 [2024-11-19 10:22:21,710 INFO L87 Difference]: Start difference. First operand 200 states and 203 transitions. Second operand has 128 states, 127 states have (on average 2.6850393700787403) internal successors, (341), 128 states have internal predecessors, (341), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 10:22:22,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:22:22,035 INFO L93 Difference]: Finished difference Result 421 states and 486 transitions. [2024-11-19 10:22:22,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 126 states. [2024-11-19 10:22:22,036 INFO L78 Accepts]: Start accepts. Automaton has has 128 states, 127 states have (on average 2.6850393700787403) internal successors, (341), 128 states have internal predecessors, (341), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 197 [2024-11-19 10:22:22,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:22:22,039 INFO L225 Difference]: With dead ends: 421 [2024-11-19 10:22:22,039 INFO L226 Difference]: Without dead ends: 420 [2024-11-19 10:22:22,043 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 455 GetRequests, 329 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5047 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=4159, Invalid=12097, Unknown=0, NotChecked=0, Total=16256 [2024-11-19 10:22:22,043 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 254 mSDsluCounter, 367 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 400 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 10:22:22,043 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [254 Valid, 400 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 10:22:22,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2024-11-19 10:22:22,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 358. [2024-11-19 10:22:22,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 358 states, 351 states have (on average 1.0997150997150997) internal successors, (386), 352 states have internal predecessors, (386), 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 10:22:22,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 392 transitions. [2024-11-19 10:22:22,060 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 392 transitions. Word has length 197 [2024-11-19 10:22:22,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:22:22,061 INFO L471 AbstractCegarLoop]: Abstraction has 358 states and 392 transitions. [2024-11-19 10:22:22,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 128 states, 127 states have (on average 2.6850393700787403) internal successors, (341), 128 states have internal predecessors, (341), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 10:22:22,061 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 392 transitions. [2024-11-19 10:22:22,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2024-11-19 10:22:22,064 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:22:22,064 INFO L215 NwaCegarLoop]: trace histogram [32, 31, 31, 31, 31, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:22:22,079 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2024-11-19 10:22:22,264 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 10:22:22,265 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-19 10:22:22,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:22:22,266 INFO L85 PathProgramCache]: Analyzing trace with hash -1047244923, now seen corresponding path program 3 times [2024-11-19 10:22:22,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:22:22,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974692800] [2024-11-19 10:22:22,266 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 10:22:22,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:22:22,397 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2024-11-19 10:22:22,397 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 10:22:26,063 INFO L134 CoverageAnalysis]: Checked inductivity of 2412 backedges. 363 proven. 19 refuted. 0 times theorem prover too weak. 2030 trivial. 0 not checked. [2024-11-19 10:22:26,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:22:26,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974692800] [2024-11-19 10:22:26,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [974692800] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 10:22:26,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [848602206] [2024-11-19 10:22:26,064 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 10:22:26,064 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 10:22:26,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 10:22:26,066 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 10:22:26,067 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2024-11-19 10:22:26,830 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2024-11-19 10:22:26,830 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 10:22:26,835 INFO L255 TraceCheckSpWp]: Trace formula consists of 627 conjuncts, 137 conjuncts are in the unsatisfiable core [2024-11-19 10:22:26,841 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 10:22:26,871 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 10:22:27,070 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-19 10:22:27,070 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 10:22:27,139 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 10:22:27,146 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 10:22:27,361 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 30 treesize of output 14 [2024-11-19 10:22:27,366 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 10:22:27,369 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 10:22:27,608 INFO L349 Elim1Store]: treesize reduction 29, result has 27.5 percent of original size [2024-11-19 10:22:27,608 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 30 treesize of output 22 [2024-11-19 10:22:27,617 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 10:22:27,618 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 48 treesize of output 32 [2024-11-19 10:22:27,646 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2024-11-19 10:22:27,647 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 10:22:28,410 INFO L349 Elim1Store]: treesize reduction 64, result has 22.9 percent of original size [2024-11-19 10:22:28,410 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 180 treesize of output 100 [2024-11-19 10:22:28,419 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 10:22:28,420 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 55 [2024-11-19 10:22:28,521 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 116 treesize of output 80 [2024-11-19 10:22:29,199 INFO L134 CoverageAnalysis]: Checked inductivity of 2412 backedges. 363 proven. 19 refuted. 0 times theorem prover too weak. 2030 trivial. 0 not checked. [2024-11-19 10:22:29,199 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 10:22:30,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [848602206] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 10:22:30,928 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 10:22:30,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 30] total 54 [2024-11-19 10:22:30,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474324825] [2024-11-19 10:22:30,929 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 10:22:30,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2024-11-19 10:22:30,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:22:30,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2024-11-19 10:22:30,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=211, Invalid=4211, Unknown=0, NotChecked=0, Total=4422 [2024-11-19 10:22:30,932 INFO L87 Difference]: Start difference. First operand 358 states and 392 transitions. Second operand has 54 states, 52 states have (on average 1.9423076923076923) internal successors, (101), 45 states have internal predecessors, (101), 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 10:22:33,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:22:33,226 INFO L93 Difference]: Finished difference Result 686 states and 753 transitions. [2024-11-19 10:22:33,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-11-19 10:22:33,228 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 52 states have (on average 1.9423076923076923) internal successors, (101), 45 states have internal predecessors, (101), 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 203 [2024-11-19 10:22:33,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:22:33,233 INFO L225 Difference]: With dead ends: 686 [2024-11-19 10:22:33,233 INFO L226 Difference]: Without dead ends: 362 [2024-11-19 10:22:33,235 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 422 GetRequests, 339 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1517 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=362, Invalid=6778, Unknown=0, NotChecked=0, Total=7140 [2024-11-19 10:22:33,235 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 43 mSDsluCounter, 876 mSDsCounter, 0 mSdLazyCounter, 1193 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 906 SdHoareTripleChecker+Invalid, 1199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-19 10:22:33,236 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 906 Invalid, 1199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1193 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-19 10:22:33,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2024-11-19 10:22:33,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 360. [2024-11-19 10:22:33,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 360 states, 353 states have (on average 1.0991501416430596) internal successors, (388), 354 states have internal predecessors, (388), 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 10:22:33,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 394 transitions. [2024-11-19 10:22:33,268 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 394 transitions. Word has length 203 [2024-11-19 10:22:33,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:22:33,268 INFO L471 AbstractCegarLoop]: Abstraction has 360 states and 394 transitions. [2024-11-19 10:22:33,268 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 52 states have (on average 1.9423076923076923) internal successors, (101), 45 states have internal predecessors, (101), 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 10:22:33,272 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 394 transitions. [2024-11-19 10:22:33,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2024-11-19 10:22:33,274 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:22:33,274 INFO L215 NwaCegarLoop]: trace histogram [32, 31, 31, 31, 31, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:22:33,298 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2024-11-19 10:22:33,474 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 10:22:33,475 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-19 10:22:33,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:22:33,475 INFO L85 PathProgramCache]: Analyzing trace with hash -168719990, now seen corresponding path program 4 times [2024-11-19 10:22:33,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:22:33,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087135348] [2024-11-19 10:22:33,476 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-19 10:22:33,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:22:33,540 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-19 10:22:33,540 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 10:22:35,890 INFO L134 CoverageAnalysis]: Checked inductivity of 2416 backedges. 10 proven. 18 refuted. 0 times theorem prover too weak. 2388 trivial. 0 not checked. [2024-11-19 10:22:35,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:22:35,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087135348] [2024-11-19 10:22:35,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1087135348] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 10:22:35,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [889113370] [2024-11-19 10:22:35,891 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-19 10:22:35,891 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 10:22:35,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 10:22:35,892 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 10:22:35,893 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2024-11-19 10:22:36,200 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-19 10:22:36,201 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 10:22:36,205 INFO L255 TraceCheckSpWp]: Trace formula consists of 924 conjuncts, 146 conjuncts are in the unsatisfiable core [2024-11-19 10:22:36,211 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 10:22:36,249 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 10:22:36,345 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 11 treesize of output 7 [2024-11-19 10:22:36,353 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 11 treesize of output 7 [2024-11-19 10:22:40,545 WARN L851 $PredicateComparison]: unable to prove that (and (exists ((|v_old(#valid)_AFTER_CALL_46| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_46| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_46| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_46| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_46| |c_ULTIMATE.start_sll_create_#t~ret4#1.base|) 0))) (not (= |c_ULTIMATE.start_sll_create_~head~0#1.base| 0)) (<= |c_ULTIMATE.start_main_~data~0#1| 1) (or (exists ((|v_#memory_$Pointer$#2.offset_BEFORE_CALL_4| (Array Int (Array Int Int)))) (let ((.cse1 (@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| .cse1 (select |c_#memory_$Pointer$#2.offset| .cse1))) (= .cse1 |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)) (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_6| (Array Int (Array Int Int)))) (let ((.cse2 (@diff |v_#memory_$Pointer$#2.base_BEFORE_CALL_6| |c_#memory_$Pointer$#2.base|))) (and (= (store |v_#memory_$Pointer$#2.base_BEFORE_CALL_6| .cse2 (select |c_#memory_$Pointer$#2.base| .cse2)) |c_#memory_$Pointer$#2.base|) (= .cse2 |c_ULTIMATE.start_sll_create_#t~ret4#1.base|) (= (select (select |v_#memory_$Pointer$#2.base_BEFORE_CALL_6| |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 10:22:40,548 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_old(#valid)_AFTER_CALL_46| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_46| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_46| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_46| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_46| |c_ULTIMATE.start_sll_create_#t~ret4#1.base|) 0))) (not (= |c_ULTIMATE.start_sll_create_~head~0#1.base| 0)) (<= |c_ULTIMATE.start_main_~data~0#1| 1) (or (exists ((|v_#memory_$Pointer$#2.offset_BEFORE_CALL_4| (Array Int (Array Int Int)))) (let ((.cse1 (@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| .cse1 (select |c_#memory_$Pointer$#2.offset| .cse1))) (= .cse1 |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)) (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_6| (Array Int (Array Int Int)))) (let ((.cse2 (@diff |v_#memory_$Pointer$#2.base_BEFORE_CALL_6| |c_#memory_$Pointer$#2.base|))) (and (= (store |v_#memory_$Pointer$#2.base_BEFORE_CALL_6| .cse2 (select |c_#memory_$Pointer$#2.base| .cse2)) |c_#memory_$Pointer$#2.base|) (= .cse2 |c_ULTIMATE.start_sll_create_#t~ret4#1.base|) (= (select (select |v_#memory_$Pointer$#2.base_BEFORE_CALL_6| |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 10:22:40,599 INFO L349 Elim1Store]: treesize reduction 29, result has 27.5 percent of original size [2024-11-19 10:22:40,599 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 23 treesize of output 22 [2024-11-19 10:22:40,633 INFO L349 Elim1Store]: treesize reduction 25, result has 43.2 percent of original size [2024-11-19 10:22:40,634 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 27 treesize of output 23 [2024-11-19 10:22:44,650 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))) (and (or (exists ((|v_#memory_$Pointer$#2.offset_116| (Array Int (Array Int Int)))) (and (= |c_#memory_$Pointer$#2.offset| (store |v_#memory_$Pointer$#2.offset_116| |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select |v_#memory_$Pointer$#2.offset_116| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4 0))) (exists ((|v_#memory_$Pointer$#2.offset_BEFORE_CALL_4| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_$Pointer$#2.offset_BEFORE_CALL_4| |v_#memory_$Pointer$#2.offset_116|))) (and (= .cse0 |c_ULTIMATE.start_sll_create_~head~0#1.base|) (= (store |v_#memory_$Pointer$#2.offset_BEFORE_CALL_4| .cse0 (select |v_#memory_$Pointer$#2.offset_116| .cse0)) |v_#memory_$Pointer$#2.offset_116|) (= (select (select |v_#memory_$Pointer$#2.offset_BEFORE_CALL_4| .cse1) 4) 0)))))) (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| .cse1) 4) 0))) (exists ((|v_old(#valid)_AFTER_CALL_46| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_46| .cse1) 1) (= |c_#valid| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_46| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_46| .cse2 (select |c_#valid| .cse2)))) (= (select |v_old(#valid)_AFTER_CALL_46| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0))) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (or (exists ((|v_#memory_$Pointer$#2.base_120| (Array Int (Array Int Int)))) (and (exists ((|v_#memory_$Pointer$#2.base_BEFORE_CALL_6| (Array Int (Array Int Int)))) (let ((.cse3 (@diff |v_#memory_$Pointer$#2.base_BEFORE_CALL_6| |v_#memory_$Pointer$#2.base_120|))) (and (= (store |v_#memory_$Pointer$#2.base_BEFORE_CALL_6| .cse3 (select |v_#memory_$Pointer$#2.base_120| .cse3)) |v_#memory_$Pointer$#2.base_120|) (= |c_ULTIMATE.start_sll_create_~head~0#1.base| .cse3) (= (select (select |v_#memory_$Pointer$#2.base_BEFORE_CALL_6| .cse1) 4) 0)))) (= |c_#memory_$Pointer$#2.base| (store |v_#memory_$Pointer$#2.base_120| |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select |v_#memory_$Pointer$#2.base_120| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4 .cse1))))) (= .cse1 |c_ULTIMATE.start_sll_create_~head~0#1.base|) (= (select (select |c_#memory_$Pointer$#2.base| .cse1) 4) 0)) (<= |c_ULTIMATE.start_main_~data~0#1| 1) (not (= .cse1 0)) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0))) is different from false [2024-11-19 10:22:44,663 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))) (and (or (exists ((|v_#memory_$Pointer$#2.offset_116| (Array Int (Array Int Int)))) (and (= |c_#memory_$Pointer$#2.offset| (store |v_#memory_$Pointer$#2.offset_116| |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select |v_#memory_$Pointer$#2.offset_116| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4 0))) (exists ((|v_#memory_$Pointer$#2.offset_BEFORE_CALL_4| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_$Pointer$#2.offset_BEFORE_CALL_4| |v_#memory_$Pointer$#2.offset_116|))) (and (= .cse0 |c_ULTIMATE.start_sll_create_~head~0#1.base|) (= (store |v_#memory_$Pointer$#2.offset_BEFORE_CALL_4| .cse0 (select |v_#memory_$Pointer$#2.offset_116| .cse0)) |v_#memory_$Pointer$#2.offset_116|) (= (select (select |v_#memory_$Pointer$#2.offset_BEFORE_CALL_4| .cse1) 4) 0)))))) (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| .cse1) 4) 0))) (exists ((|v_old(#valid)_AFTER_CALL_46| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_46| .cse1) 1) (= |c_#valid| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_46| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_46| .cse2 (select |c_#valid| .cse2)))) (= (select |v_old(#valid)_AFTER_CALL_46| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0))) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (or (exists ((|v_#memory_$Pointer$#2.base_120| (Array Int (Array Int Int)))) (and (exists ((|v_#memory_$Pointer$#2.base_BEFORE_CALL_6| (Array Int (Array Int Int)))) (let ((.cse3 (@diff |v_#memory_$Pointer$#2.base_BEFORE_CALL_6| |v_#memory_$Pointer$#2.base_120|))) (and (= (store |v_#memory_$Pointer$#2.base_BEFORE_CALL_6| .cse3 (select |v_#memory_$Pointer$#2.base_120| .cse3)) |v_#memory_$Pointer$#2.base_120|) (= |c_ULTIMATE.start_sll_create_~head~0#1.base| .cse3) (= (select (select |v_#memory_$Pointer$#2.base_BEFORE_CALL_6| .cse1) 4) 0)))) (= |c_#memory_$Pointer$#2.base| (store |v_#memory_$Pointer$#2.base_120| |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select |v_#memory_$Pointer$#2.base_120| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4 .cse1))))) (= .cse1 |c_ULTIMATE.start_sll_create_~head~0#1.base|) (= (select (select |c_#memory_$Pointer$#2.base| .cse1) 4) 0)) (<= |c_ULTIMATE.start_main_~data~0#1| 1) (not (= .cse1 0)) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0))) is different from true [2024-11-19 10:22:44,746 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 (exists ((|v_old(#valid)_AFTER_CALL_46| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_46| .cse0) 1) (= |c_#valid| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_46| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_46| .cse1 (select |c_#valid| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_46| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0))) (= (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) (<= |c_ULTIMATE.start_main_~data~0#1| 1) (not (= .cse0 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 10:22:44,749 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 (exists ((|v_old(#valid)_AFTER_CALL_46| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_46| .cse0) 1) (= |c_#valid| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_46| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_46| .cse1 (select |c_#valid| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_46| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0))) (= (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) (<= |c_ULTIMATE.start_main_~data~0#1| 1) (not (= .cse0 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 10:22:44,971 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) (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) (not (= .cse0 0)) (<= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_old(#valid)_AFTER_CALL_46| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_46| .cse0) 1) (= |c_#valid| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_46| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_46| .cse1 (select |c_#valid| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_46| |c_ULTIMATE.start_sll_create_#res#1.base|) 0))) (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0))) is different from false [2024-11-19 10:22:44,974 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) (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) (not (= .cse0 0)) (<= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_old(#valid)_AFTER_CALL_46| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_46| .cse0) 1) (= |c_#valid| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_46| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_46| .cse1 (select |c_#valid| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_46| |c_ULTIMATE.start_sll_create_#res#1.base|) 0))) (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0))) is different from true [2024-11-19 10:22:45,055 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| .cse1) 4))) (and (not (= .cse0 0)) (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) 4) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0) (or (= .cse0 .cse1) (= (select (select |c_#memory_$Pointer$#2.base| .cse0) 4) 0)) (exists ((|v_old(#valid)_AFTER_CALL_46| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_46| .cse1) 0) (= (select |v_old(#valid)_AFTER_CALL_46| .cse0) 1) (= |c_#valid| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_46| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_46| .cse2 (select |c_#valid| .cse2)))))) (<= 5 |c_ULTIMATE.start_sll_append_~data#1|) (<= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select |c_#valid| .cse1) 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 10:22:45,061 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| .cse1) 4))) (and (not (= .cse0 0)) (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) 4) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0) (or (= .cse0 .cse1) (= (select (select |c_#memory_$Pointer$#2.base| .cse0) 4) 0)) (exists ((|v_old(#valid)_AFTER_CALL_46| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_46| .cse1) 0) (= (select |v_old(#valid)_AFTER_CALL_46| .cse0) 1) (= |c_#valid| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_46| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_46| .cse2 (select |c_#valid| .cse2)))))) (<= 5 |c_ULTIMATE.start_sll_append_~data#1|) (<= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select |c_#valid| .cse1) 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 10:22:45,097 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-19 10:22:45,101 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 72 treesize of output 31 [2024-11-19 10:22:45,113 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 10:22:45,114 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2024-11-19 10:22:45,170 WARN L851 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimIndex_3 Int) (|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_46| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_7| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_3| Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_3|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_7|))) (and (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_46| |v_#valid_BEFORE_CALL_9|))) (store |v_old(#valid)_AFTER_CALL_46| .cse0 (select |v_#valid_BEFORE_CALL_9| .cse0))) |v_#valid_BEFORE_CALL_9|) (not (= v_arrayElimIndex_3 0)) (= (select |v_#valid_BEFORE_CALL_9| .cse1) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_3|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_7|) 0) (= (select |v_old(#valid)_AFTER_CALL_46| v_arrayElimIndex_3) 1) (= (select |v_old(#valid)_AFTER_CALL_46| .cse1) 0)))) (= |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 10:22:45,177 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimIndex_3 Int) (|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_46| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_7| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_3| Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_3|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_7|))) (and (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_46| |v_#valid_BEFORE_CALL_9|))) (store |v_old(#valid)_AFTER_CALL_46| .cse0 (select |v_#valid_BEFORE_CALL_9| .cse0))) |v_#valid_BEFORE_CALL_9|) (not (= v_arrayElimIndex_3 0)) (= (select |v_#valid_BEFORE_CALL_9| .cse1) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_3|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_7|) 0) (= (select |v_old(#valid)_AFTER_CALL_46| v_arrayElimIndex_3) 1) (= (select |v_old(#valid)_AFTER_CALL_46| .cse1) 0)))) (= |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 10:22:45,248 WARN L851 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimIndex_3 Int) (|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_46| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_7| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_3| Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_3|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_7|))) (and (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_46| |v_#valid_BEFORE_CALL_9|))) (store |v_old(#valid)_AFTER_CALL_46| .cse0 (select |v_#valid_BEFORE_CALL_9| .cse0))) |v_#valid_BEFORE_CALL_9|) (not (= v_arrayElimIndex_3 0)) (= (select |v_#valid_BEFORE_CALL_9| .cse1) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_3|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_7|) 0) (= (select |v_old(#valid)_AFTER_CALL_46| v_arrayElimIndex_3) 1) (= (select |v_old(#valid)_AFTER_CALL_46| .cse1) 0)))) (<= |c_node_create_#in~data#1| |c_node_create_~data#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 10:22:45,254 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimIndex_3 Int) (|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_46| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_7| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_3| Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_3|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_7|))) (and (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_46| |v_#valid_BEFORE_CALL_9|))) (store |v_old(#valid)_AFTER_CALL_46| .cse0 (select |v_#valid_BEFORE_CALL_9| .cse0))) |v_#valid_BEFORE_CALL_9|) (not (= v_arrayElimIndex_3 0)) (= (select |v_#valid_BEFORE_CALL_9| .cse1) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_3|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_7|) 0) (= (select |v_old(#valid)_AFTER_CALL_46| v_arrayElimIndex_3) 1) (= (select |v_old(#valid)_AFTER_CALL_46| .cse1) 0)))) (<= |c_node_create_#in~data#1| |c_node_create_~data#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 10:22:45,405 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 10:22:45,423 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_node_create_#res#1.offset| 0) (exists ((v_arrayElimIndex_3 Int) (|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_46| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_7| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_3| Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_3|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_7|))) (and (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_46| |v_#valid_BEFORE_CALL_9|))) (store |v_old(#valid)_AFTER_CALL_46| .cse0 (select |v_#valid_BEFORE_CALL_9| .cse0))) |v_#valid_BEFORE_CALL_9|) (not (= v_arrayElimIndex_3 0)) (= (select |v_#valid_BEFORE_CALL_9| .cse1) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_3|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_7|) 0) (= (select |v_old(#valid)_AFTER_CALL_46| v_arrayElimIndex_3) 1) (= (select |v_old(#valid)_AFTER_CALL_46| .cse1) 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|) (<= |c_node_create_#in~data#1| (select (select |c_#memory_int#2| |c_node_create_#res#1.base|) 0))) is different from false [2024-11-19 10:22:45,429 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_node_create_#res#1.offset| 0) (exists ((v_arrayElimIndex_3 Int) (|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_46| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_7| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_3| Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_3|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_7|))) (and (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_46| |v_#valid_BEFORE_CALL_9|))) (store |v_old(#valid)_AFTER_CALL_46| .cse0 (select |v_#valid_BEFORE_CALL_9| .cse0))) |v_#valid_BEFORE_CALL_9|) (not (= v_arrayElimIndex_3 0)) (= (select |v_#valid_BEFORE_CALL_9| .cse1) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_3|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_7|) 0) (= (select |v_old(#valid)_AFTER_CALL_46| v_arrayElimIndex_3) 1) (= (select |v_old(#valid)_AFTER_CALL_46| .cse1) 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|) (<= |c_node_create_#in~data#1| (select (select |c_#memory_int#2| |c_node_create_#res#1.base|) 0))) is different from true [2024-11-19 10:22:45,557 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 10:22:45,580 INFO L349 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2024-11-19 10:22:45,580 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 80 treesize of output 57 [2024-11-19 10:22:45,665 INFO L349 Elim1Store]: treesize reduction 48, result has 56.8 percent of original size [2024-11-19 10:22:45,668 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 73 [2024-11-19 10:22:45,758 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 ((.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse3) 4))) (and (exists ((v_arrayElimIndex_3 Int) (|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_46| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_7| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_3| Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_3|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_7|))) (and (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_46| |v_#valid_BEFORE_CALL_9|))) (store |v_old(#valid)_AFTER_CALL_46| .cse0 (select |v_#valid_BEFORE_CALL_9| .cse0))) |v_#valid_BEFORE_CALL_9|) (not (= v_arrayElimIndex_3 0)) (= (select |v_#valid_BEFORE_CALL_9| .cse1) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_3|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_7|) 0) (= (select |v_old(#valid)_AFTER_CALL_46| v_arrayElimIndex_3) 1) (= (select |v_old(#valid)_AFTER_CALL_46| .cse1) 0)))) (not (= .cse2 0)) (exists ((|v_old(#valid)_AFTER_CALL_47| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_48| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_48| .cse3) 0) (= (select |v_old(#valid)_AFTER_CALL_48| .cse2) 1) (= |v_old(#valid)_AFTER_CALL_47| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_48| |v_old(#valid)_AFTER_CALL_47|))) (store |v_old(#valid)_AFTER_CALL_48| .cse4 (select |v_old(#valid)_AFTER_CALL_47| .cse4)))) (= (select |v_old(#valid)_AFTER_CALL_47| |c_ULTIMATE.start_sll_append_#t~ret7#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_47| .cse3) 1))) (= |c_ULTIMATE.start_sll_append_#t~ret7#1.offset| 0) (or (= .cse2 .cse3) (= (select (select |c_#memory_$Pointer$#2.base| .cse2) 4) 0)) (<= 5 (select (select |c_#memory_int#2| |c_ULTIMATE.start_sll_append_#t~ret7#1.base|) 0)) (<= |c_ULTIMATE.start_main_~data~0#1| 1) (let ((.cse5 (or (= (select (select |c_#memory_$Pointer$#2.offset| .cse2) 4) 0) (= |c_ULTIMATE.start_sll_append_#t~ret7#1.base| .cse2)))) (or (and (= |c_ULTIMATE.start_sll_append_#t~ret7#1.base| .cse3) .cse5) (and (= (select (select |c_#memory_$Pointer$#2.offset| .cse3) 4) 0) .cse5))) (= (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 10:22:45,762 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 ((.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse3) 4))) (and (exists ((v_arrayElimIndex_3 Int) (|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_46| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_7| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_3| Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_3|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_7|))) (and (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_46| |v_#valid_BEFORE_CALL_9|))) (store |v_old(#valid)_AFTER_CALL_46| .cse0 (select |v_#valid_BEFORE_CALL_9| .cse0))) |v_#valid_BEFORE_CALL_9|) (not (= v_arrayElimIndex_3 0)) (= (select |v_#valid_BEFORE_CALL_9| .cse1) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_3|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_7|) 0) (= (select |v_old(#valid)_AFTER_CALL_46| v_arrayElimIndex_3) 1) (= (select |v_old(#valid)_AFTER_CALL_46| .cse1) 0)))) (not (= .cse2 0)) (exists ((|v_old(#valid)_AFTER_CALL_47| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_48| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_48| .cse3) 0) (= (select |v_old(#valid)_AFTER_CALL_48| .cse2) 1) (= |v_old(#valid)_AFTER_CALL_47| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_48| |v_old(#valid)_AFTER_CALL_47|))) (store |v_old(#valid)_AFTER_CALL_48| .cse4 (select |v_old(#valid)_AFTER_CALL_47| .cse4)))) (= (select |v_old(#valid)_AFTER_CALL_47| |c_ULTIMATE.start_sll_append_#t~ret7#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_47| .cse3) 1))) (= |c_ULTIMATE.start_sll_append_#t~ret7#1.offset| 0) (or (= .cse2 .cse3) (= (select (select |c_#memory_$Pointer$#2.base| .cse2) 4) 0)) (<= 5 (select (select |c_#memory_int#2| |c_ULTIMATE.start_sll_append_#t~ret7#1.base|) 0)) (<= |c_ULTIMATE.start_main_~data~0#1| 1) (let ((.cse5 (or (= (select (select |c_#memory_$Pointer$#2.offset| .cse2) 4) 0) (= |c_ULTIMATE.start_sll_append_#t~ret7#1.base| .cse2)))) (or (and (= |c_ULTIMATE.start_sll_append_#t~ret7#1.base| .cse3) .cse5) (and (= (select (select |c_#memory_$Pointer$#2.offset| .cse3) 4) 0) .cse5))) (= (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 10:22:45,877 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 ((.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse3) 4))) (and (exists ((v_arrayElimIndex_3 Int) (|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_46| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_7| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_3| Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_3|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_7|))) (and (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_46| |v_#valid_BEFORE_CALL_9|))) (store |v_old(#valid)_AFTER_CALL_46| .cse0 (select |v_#valid_BEFORE_CALL_9| .cse0))) |v_#valid_BEFORE_CALL_9|) (not (= v_arrayElimIndex_3 0)) (= (select |v_#valid_BEFORE_CALL_9| .cse1) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_3|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_7|) 0) (= (select |v_old(#valid)_AFTER_CALL_46| v_arrayElimIndex_3) 1) (= (select |v_old(#valid)_AFTER_CALL_46| .cse1) 0)))) (not (= .cse2 0)) (<= 5 (select (select |c_#memory_int#2| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) 0)) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.offset| 0) (or (= .cse2 .cse3) (= (select (select |c_#memory_$Pointer$#2.base| .cse2) 4) 0)) (<= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_old(#valid)_AFTER_CALL_47| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_48| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_48| .cse3) 0) (= (select |v_old(#valid)_AFTER_CALL_48| .cse2) 1) (= |v_old(#valid)_AFTER_CALL_47| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_48| |v_old(#valid)_AFTER_CALL_47|))) (store |v_old(#valid)_AFTER_CALL_48| .cse4 (select |v_old(#valid)_AFTER_CALL_47| .cse4)))) (= (select |v_old(#valid)_AFTER_CALL_47| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_47| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) 0))) (let ((.cse5 (or (= (select (select |c_#memory_$Pointer$#2.offset| .cse2) 4) 0) (= .cse2 |c_ULTIMATE.start_sll_append_~new_last~0#1.base|)))) (or (and (= (select (select |c_#memory_$Pointer$#2.offset| .cse3) 4) 0) .cse5) (and (= |c_ULTIMATE.start_sll_append_~new_last~0#1.base| .cse3) .cse5))) (= (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 10:22:45,881 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 ((.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse3) 4))) (and (exists ((v_arrayElimIndex_3 Int) (|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_46| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_7| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_3| Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_3|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_7|))) (and (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_46| |v_#valid_BEFORE_CALL_9|))) (store |v_old(#valid)_AFTER_CALL_46| .cse0 (select |v_#valid_BEFORE_CALL_9| .cse0))) |v_#valid_BEFORE_CALL_9|) (not (= v_arrayElimIndex_3 0)) (= (select |v_#valid_BEFORE_CALL_9| .cse1) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_3|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_7|) 0) (= (select |v_old(#valid)_AFTER_CALL_46| v_arrayElimIndex_3) 1) (= (select |v_old(#valid)_AFTER_CALL_46| .cse1) 0)))) (not (= .cse2 0)) (<= 5 (select (select |c_#memory_int#2| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) 0)) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.offset| 0) (or (= .cse2 .cse3) (= (select (select |c_#memory_$Pointer$#2.base| .cse2) 4) 0)) (<= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_old(#valid)_AFTER_CALL_47| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_48| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_48| .cse3) 0) (= (select |v_old(#valid)_AFTER_CALL_48| .cse2) 1) (= |v_old(#valid)_AFTER_CALL_47| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_48| |v_old(#valid)_AFTER_CALL_47|))) (store |v_old(#valid)_AFTER_CALL_48| .cse4 (select |v_old(#valid)_AFTER_CALL_47| .cse4)))) (= (select |v_old(#valid)_AFTER_CALL_47| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_47| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) 0))) (let ((.cse5 (or (= (select (select |c_#memory_$Pointer$#2.offset| .cse2) 4) 0) (= .cse2 |c_ULTIMATE.start_sll_append_~new_last~0#1.base|)))) (or (and (= (select (select |c_#memory_$Pointer$#2.offset| .cse3) 4) 0) .cse5) (and (= |c_ULTIMATE.start_sll_append_~new_last~0#1.base| .cse3) .cse5))) (= (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 10:22:46,463 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 ((.cse0 (+ |c_ULTIMATE.start_sll_append_~last~0#1.offset| 4)) (.cse3 (select (select |c_#memory_$Pointer$#2.base| .cse4) 4))) (and (= (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_append_~last~0#1.base|) .cse0) |c_ULTIMATE.start_sll_append_#t~mem10#1.base|) (exists ((v_arrayElimIndex_3 Int) (|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_46| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_7| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_3| Int)) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_3|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_7|))) (and (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_46| |v_#valid_BEFORE_CALL_9|))) (store |v_old(#valid)_AFTER_CALL_46| .cse1 (select |v_#valid_BEFORE_CALL_9| .cse1))) |v_#valid_BEFORE_CALL_9|) (not (= v_arrayElimIndex_3 0)) (= (select |v_#valid_BEFORE_CALL_9| .cse2) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_3|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_7|) 0) (= (select |v_old(#valid)_AFTER_CALL_46| v_arrayElimIndex_3) 1) (= (select |v_old(#valid)_AFTER_CALL_46| .cse2) 0)))) (not (= .cse3 0)) (<= 5 (select (select |c_#memory_int#2| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) 0)) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base|) .cse0) |c_ULTIMATE.start_sll_append_#t~mem10#1.offset|) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.offset| 0) (or (= .cse3 .cse4) (= (select (select |c_#memory_$Pointer$#2.base| .cse3) 4) 0)) (<= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_old(#valid)_AFTER_CALL_47| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_48| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_48| .cse4) 0) (= (select |v_old(#valid)_AFTER_CALL_48| .cse3) 1) (= |v_old(#valid)_AFTER_CALL_47| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_48| |v_old(#valid)_AFTER_CALL_47|))) (store |v_old(#valid)_AFTER_CALL_48| .cse5 (select |v_old(#valid)_AFTER_CALL_47| .cse5)))) (= (select |v_old(#valid)_AFTER_CALL_47| .cse4) 1) (= (select |v_old(#valid)_AFTER_CALL_47| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) 0))) (let ((.cse6 (or (= (select (select |c_#memory_$Pointer$#2.offset| .cse3) 4) 0) (= .cse3 |c_ULTIMATE.start_sll_append_~new_last~0#1.base|)))) (or (and (= (select (select |c_#memory_$Pointer$#2.offset| .cse4) 4) 0) .cse6) (and (= |c_ULTIMATE.start_sll_append_~new_last~0#1.base| .cse4) .cse6))) (= (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 10:22:46,467 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 ((.cse0 (+ |c_ULTIMATE.start_sll_append_~last~0#1.offset| 4)) (.cse3 (select (select |c_#memory_$Pointer$#2.base| .cse4) 4))) (and (= (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_append_~last~0#1.base|) .cse0) |c_ULTIMATE.start_sll_append_#t~mem10#1.base|) (exists ((v_arrayElimIndex_3 Int) (|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_46| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_7| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_3| Int)) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_3|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_7|))) (and (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_46| |v_#valid_BEFORE_CALL_9|))) (store |v_old(#valid)_AFTER_CALL_46| .cse1 (select |v_#valid_BEFORE_CALL_9| .cse1))) |v_#valid_BEFORE_CALL_9|) (not (= v_arrayElimIndex_3 0)) (= (select |v_#valid_BEFORE_CALL_9| .cse2) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_3|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_7|) 0) (= (select |v_old(#valid)_AFTER_CALL_46| v_arrayElimIndex_3) 1) (= (select |v_old(#valid)_AFTER_CALL_46| .cse2) 0)))) (not (= .cse3 0)) (<= 5 (select (select |c_#memory_int#2| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) 0)) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base|) .cse0) |c_ULTIMATE.start_sll_append_#t~mem10#1.offset|) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.offset| 0) (or (= .cse3 .cse4) (= (select (select |c_#memory_$Pointer$#2.base| .cse3) 4) 0)) (<= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_old(#valid)_AFTER_CALL_47| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_48| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_48| .cse4) 0) (= (select |v_old(#valid)_AFTER_CALL_48| .cse3) 1) (= |v_old(#valid)_AFTER_CALL_47| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_48| |v_old(#valid)_AFTER_CALL_47|))) (store |v_old(#valid)_AFTER_CALL_48| .cse5 (select |v_old(#valid)_AFTER_CALL_47| .cse5)))) (= (select |v_old(#valid)_AFTER_CALL_47| .cse4) 1) (= (select |v_old(#valid)_AFTER_CALL_47| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) 0))) (let ((.cse6 (or (= (select (select |c_#memory_$Pointer$#2.offset| .cse3) 4) 0) (= .cse3 |c_ULTIMATE.start_sll_append_~new_last~0#1.base|)))) (or (and (= (select (select |c_#memory_$Pointer$#2.offset| .cse4) 4) 0) .cse6) (and (= |c_ULTIMATE.start_sll_append_~new_last~0#1.base| .cse4) .cse6))) (= (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 10:22:46,581 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 ((.cse3 (+ |c_ULTIMATE.start_sll_append_~last~0#1.offset| 4)) (.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse4) 4))) (and (exists ((v_arrayElimIndex_3 Int) (|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_46| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_7| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_3| Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_3|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_7|))) (and (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_46| |v_#valid_BEFORE_CALL_9|))) (store |v_old(#valid)_AFTER_CALL_46| .cse0 (select |v_#valid_BEFORE_CALL_9| .cse0))) |v_#valid_BEFORE_CALL_9|) (not (= v_arrayElimIndex_3 0)) (= (select |v_#valid_BEFORE_CALL_9| .cse1) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_3|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_7|) 0) (= (select |v_old(#valid)_AFTER_CALL_46| v_arrayElimIndex_3) 1) (= (select |v_old(#valid)_AFTER_CALL_46| .cse1) 0)))) (not (= .cse2 0)) (= (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_append_~last~0#1.base|) .cse3) 0) (<= 5 (select (select |c_#memory_int#2| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) 0)) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.offset| 0) (or (= .cse2 .cse4) (= (select (select |c_#memory_$Pointer$#2.base| .cse2) 4) 0)) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base|) .cse3) 0) (<= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_old(#valid)_AFTER_CALL_47| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_48| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_48| .cse4) 0) (= (select |v_old(#valid)_AFTER_CALL_48| .cse2) 1) (= |v_old(#valid)_AFTER_CALL_47| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_48| |v_old(#valid)_AFTER_CALL_47|))) (store |v_old(#valid)_AFTER_CALL_48| .cse5 (select |v_old(#valid)_AFTER_CALL_47| .cse5)))) (= (select |v_old(#valid)_AFTER_CALL_47| .cse4) 1) (= (select |v_old(#valid)_AFTER_CALL_47| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) 0))) (let ((.cse6 (or (= (select (select |c_#memory_$Pointer$#2.offset| .cse2) 4) 0) (= .cse2 |c_ULTIMATE.start_sll_append_~new_last~0#1.base|)))) (or (and (= (select (select |c_#memory_$Pointer$#2.offset| .cse4) 4) 0) .cse6) (and (= |c_ULTIMATE.start_sll_append_~new_last~0#1.base| .cse4) .cse6))) (= (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 10:22:46,585 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 ((.cse3 (+ |c_ULTIMATE.start_sll_append_~last~0#1.offset| 4)) (.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse4) 4))) (and (exists ((v_arrayElimIndex_3 Int) (|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_46| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_7| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_3| Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_3|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_7|))) (and (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_46| |v_#valid_BEFORE_CALL_9|))) (store |v_old(#valid)_AFTER_CALL_46| .cse0 (select |v_#valid_BEFORE_CALL_9| .cse0))) |v_#valid_BEFORE_CALL_9|) (not (= v_arrayElimIndex_3 0)) (= (select |v_#valid_BEFORE_CALL_9| .cse1) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_3|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_7|) 0) (= (select |v_old(#valid)_AFTER_CALL_46| v_arrayElimIndex_3) 1) (= (select |v_old(#valid)_AFTER_CALL_46| .cse1) 0)))) (not (= .cse2 0)) (= (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_append_~last~0#1.base|) .cse3) 0) (<= 5 (select (select |c_#memory_int#2| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) 0)) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.offset| 0) (or (= .cse2 .cse4) (= (select (select |c_#memory_$Pointer$#2.base| .cse2) 4) 0)) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base|) .cse3) 0) (<= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_old(#valid)_AFTER_CALL_47| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_48| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_48| .cse4) 0) (= (select |v_old(#valid)_AFTER_CALL_48| .cse2) 1) (= |v_old(#valid)_AFTER_CALL_47| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_48| |v_old(#valid)_AFTER_CALL_47|))) (store |v_old(#valid)_AFTER_CALL_48| .cse5 (select |v_old(#valid)_AFTER_CALL_47| .cse5)))) (= (select |v_old(#valid)_AFTER_CALL_47| .cse4) 1) (= (select |v_old(#valid)_AFTER_CALL_47| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) 0))) (let ((.cse6 (or (= (select (select |c_#memory_$Pointer$#2.offset| .cse2) 4) 0) (= .cse2 |c_ULTIMATE.start_sll_append_~new_last~0#1.base|)))) (or (and (= (select (select |c_#memory_$Pointer$#2.offset| .cse4) 4) 0) .cse6) (and (= |c_ULTIMATE.start_sll_append_~new_last~0#1.base| .cse4) .cse6))) (= (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 10:22:46,698 INFO L349 Elim1Store]: treesize reduction 104, result has 20.6 percent of original size [2024-11-19 10:22:46,699 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 4 new quantified variables, introduced 5 case distinctions, treesize of input 178 treesize of output 114 [2024-11-19 10:22:46,712 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 10:22:46,743 INFO L349 Elim1Store]: treesize reduction 120, result has 18.4 percent of original size [2024-11-19 10:22:46,744 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 116 treesize of output 100 [2024-11-19 10:22:46,770 INFO L349 Elim1Store]: treesize reduction 25, result has 45.7 percent of original size [2024-11-19 10:22:46,770 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 22 treesize of output 27 [2024-11-19 10:22:47,211 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse6 (select (select |c_#memory_$Pointer$#2.base| .cse5) 4))) (and (exists ((v_arrayElimIndex_3 Int) (|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_46| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_7| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_3| Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_3|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_7|))) (and (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_46| |v_#valid_BEFORE_CALL_9|))) (store |v_old(#valid)_AFTER_CALL_46| .cse0 (select |v_#valid_BEFORE_CALL_9| .cse0))) |v_#valid_BEFORE_CALL_9|) (not (= v_arrayElimIndex_3 0)) (= (select |v_#valid_BEFORE_CALL_9| .cse1) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_3|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_7|) 0) (= (select |v_old(#valid)_AFTER_CALL_46| v_arrayElimIndex_3) 1) (= (select |v_old(#valid)_AFTER_CALL_46| .cse1) 0)))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse6) 4)) (.cse3 (= (select (select |c_#memory_$Pointer$#2.offset| .cse5) 4) 0)) (.cse4 (= (select (select |c_#memory_$Pointer$#2.offset| .cse6) 4) 0))) (or (and (<= 5 (select (select |c_#memory_int#2| .cse2) 0)) .cse3 .cse4 (exists ((|v_old(#valid)_AFTER_CALL_47| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_48| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_48| .cse5) 0) (= (select |v_old(#valid)_AFTER_CALL_48| .cse6) 1) (= (select |v_old(#valid)_AFTER_CALL_47| .cse2) 0) (= |v_old(#valid)_AFTER_CALL_47| (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_48| |v_old(#valid)_AFTER_CALL_47|))) (store |v_old(#valid)_AFTER_CALL_48| .cse7 (select |v_old(#valid)_AFTER_CALL_47| .cse7)))) (= (select |v_old(#valid)_AFTER_CALL_47| .cse5) 1)))) (and (= .cse2 0) (or (exists ((|v_old(#valid)_AFTER_CALL_48| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_48| .cse5) 0) (= (select |v_old(#valid)_AFTER_CALL_48| .cse6) 1) (exists ((|v_old(#valid)_AFTER_CALL_47| (Array Int Int))) (and (= |v_old(#valid)_AFTER_CALL_47| (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_48| |v_old(#valid)_AFTER_CALL_47|))) (store |v_old(#valid)_AFTER_CALL_48| .cse8 (select |v_old(#valid)_AFTER_CALL_47| .cse8)))) (exists ((|v_ULTIMATE.start_sll_append_~last~0#1.base_26| Int) (|v_ULTIMATE.start_sll_append_~last~0#1.offset_26| Int)) (let ((.cse10 (+ |v_ULTIMATE.start_sll_append_~last~0#1.offset_26| 4))) (let ((.cse9 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_~last~0#1.base_26|) .cse10))) (and (<= 5 (select (select |c_#memory_int#2| .cse9) 0)) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_~last~0#1.base_26|) .cse10) 0) (= (select |v_old(#valid)_AFTER_CALL_47| .cse9) 0))))) (= (select |v_old(#valid)_AFTER_CALL_47| .cse5) 1))))) (exists ((|v_old(#valid)_AFTER_CALL_48| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_48| .cse5) 0) (= (select |v_old(#valid)_AFTER_CALL_48| .cse6) 1) (exists ((|v_old(#valid)_AFTER_CALL_47| (Array Int Int))) (and (= |v_old(#valid)_AFTER_CALL_47| (let ((.cse11 (@diff |v_old(#valid)_AFTER_CALL_48| |v_old(#valid)_AFTER_CALL_47|))) (store |v_old(#valid)_AFTER_CALL_48| .cse11 (select |v_old(#valid)_AFTER_CALL_47| .cse11)))) (exists ((|v_ULTIMATE.start_sll_append_~last~0#1.base_26| Int) (|v_ULTIMATE.start_sll_append_~last~0#1.offset_26| Int)) (let ((.cse13 (+ |v_ULTIMATE.start_sll_append_~last~0#1.offset_26| 4))) (let ((.cse12 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_~last~0#1.base_26|) .cse13))) (and (= .cse12 |v_ULTIMATE.start_sll_append_~last~0#1.base_26|) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_~last~0#1.base_26|) .cse13) 0) (= (select |v_old(#valid)_AFTER_CALL_47| .cse12) 0))))) (= (select |v_old(#valid)_AFTER_CALL_47| .cse5) 1)))))) .cse3 .cse4))) (not (= .cse6 0)) (<= |c_ULTIMATE.start_main_~data~0#1| 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 10:22:47,216 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse5 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse6 (select (select |c_#memory_$Pointer$#2.base| .cse5) 4))) (and (exists ((v_arrayElimIndex_3 Int) (|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_46| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_7| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_3| Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_3|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_7|))) (and (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_46| |v_#valid_BEFORE_CALL_9|))) (store |v_old(#valid)_AFTER_CALL_46| .cse0 (select |v_#valid_BEFORE_CALL_9| .cse0))) |v_#valid_BEFORE_CALL_9|) (not (= v_arrayElimIndex_3 0)) (= (select |v_#valid_BEFORE_CALL_9| .cse1) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_3|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_7|) 0) (= (select |v_old(#valid)_AFTER_CALL_46| v_arrayElimIndex_3) 1) (= (select |v_old(#valid)_AFTER_CALL_46| .cse1) 0)))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse6) 4)) (.cse3 (= (select (select |c_#memory_$Pointer$#2.offset| .cse5) 4) 0)) (.cse4 (= (select (select |c_#memory_$Pointer$#2.offset| .cse6) 4) 0))) (or (and (<= 5 (select (select |c_#memory_int#2| .cse2) 0)) .cse3 .cse4 (exists ((|v_old(#valid)_AFTER_CALL_47| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_48| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_48| .cse5) 0) (= (select |v_old(#valid)_AFTER_CALL_48| .cse6) 1) (= (select |v_old(#valid)_AFTER_CALL_47| .cse2) 0) (= |v_old(#valid)_AFTER_CALL_47| (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_48| |v_old(#valid)_AFTER_CALL_47|))) (store |v_old(#valid)_AFTER_CALL_48| .cse7 (select |v_old(#valid)_AFTER_CALL_47| .cse7)))) (= (select |v_old(#valid)_AFTER_CALL_47| .cse5) 1)))) (and (= .cse2 0) (or (exists ((|v_old(#valid)_AFTER_CALL_48| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_48| .cse5) 0) (= (select |v_old(#valid)_AFTER_CALL_48| .cse6) 1) (exists ((|v_old(#valid)_AFTER_CALL_47| (Array Int Int))) (and (= |v_old(#valid)_AFTER_CALL_47| (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_48| |v_old(#valid)_AFTER_CALL_47|))) (store |v_old(#valid)_AFTER_CALL_48| .cse8 (select |v_old(#valid)_AFTER_CALL_47| .cse8)))) (exists ((|v_ULTIMATE.start_sll_append_~last~0#1.base_26| Int) (|v_ULTIMATE.start_sll_append_~last~0#1.offset_26| Int)) (let ((.cse10 (+ |v_ULTIMATE.start_sll_append_~last~0#1.offset_26| 4))) (let ((.cse9 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_~last~0#1.base_26|) .cse10))) (and (<= 5 (select (select |c_#memory_int#2| .cse9) 0)) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_~last~0#1.base_26|) .cse10) 0) (= (select |v_old(#valid)_AFTER_CALL_47| .cse9) 0))))) (= (select |v_old(#valid)_AFTER_CALL_47| .cse5) 1))))) (exists ((|v_old(#valid)_AFTER_CALL_48| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_48| .cse5) 0) (= (select |v_old(#valid)_AFTER_CALL_48| .cse6) 1) (exists ((|v_old(#valid)_AFTER_CALL_47| (Array Int Int))) (and (= |v_old(#valid)_AFTER_CALL_47| (let ((.cse11 (@diff |v_old(#valid)_AFTER_CALL_48| |v_old(#valid)_AFTER_CALL_47|))) (store |v_old(#valid)_AFTER_CALL_48| .cse11 (select |v_old(#valid)_AFTER_CALL_47| .cse11)))) (exists ((|v_ULTIMATE.start_sll_append_~last~0#1.base_26| Int) (|v_ULTIMATE.start_sll_append_~last~0#1.offset_26| Int)) (let ((.cse13 (+ |v_ULTIMATE.start_sll_append_~last~0#1.offset_26| 4))) (let ((.cse12 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_~last~0#1.base_26|) .cse13))) (and (= .cse12 |v_ULTIMATE.start_sll_append_~last~0#1.base_26|) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_~last~0#1.base_26|) .cse13) 0) (= (select |v_old(#valid)_AFTER_CALL_47| .cse12) 0))))) (= (select |v_old(#valid)_AFTER_CALL_47| .cse5) 1)))))) .cse3 .cse4))) (not (= .cse6 0)) (<= |c_ULTIMATE.start_main_~data~0#1| 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 10:22:47,302 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 10:22:47,302 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 338 treesize of output 270 [2024-11-19 10:22:47,317 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-19 10:22:47,318 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 7 [2024-11-19 10:22:47,429 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) (<= |c_ULTIMATE.start_main_~data~0#1| 1) (not (= .cse0 0)) (let ((.cse2 (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4) 0)) (.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse0) 4)) (.cse9 (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0))) (or (and (= .cse1 0) .cse2 (or (exists ((v_prenex_19 (Array Int Int)) (v_prenex_20 (Array Int Int)) (|v_ULTIMATE.start_sll_append_~last~0#1.base_26| Int) (|v_ULTIMATE.start_sll_append_~last~0#1.offset_26| Int)) (let ((.cse4 (+ |v_ULTIMATE.start_sll_append_~last~0#1.offset_26| 4))) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_~last~0#1.base_26|) .cse4))) (and (<= 5 (select (select |c_#memory_int#2| .cse3) 0)) (= (select v_prenex_20 |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_~last~0#1.base_26|) .cse4) 0) (= (let ((.cse5 (@diff v_prenex_20 v_prenex_19))) (store v_prenex_20 .cse5 (select v_prenex_19 .cse5))) v_prenex_19) (= (select v_prenex_19 .cse3) 0) (= (select v_prenex_19 |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (select v_prenex_20 .cse0) 1))))) (exists ((v_prenex_18 Int) (v_prenex_17 Int) (v_prenex_16 (Array Int Int)) (v_prenex_15 (Array Int Int))) (let ((.cse7 (+ v_prenex_18 4))) (let ((.cse8 (select (select |c_#memory_$Pointer$#2.base| v_prenex_17) .cse7))) (and (= (select v_prenex_16 |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (let ((.cse6 (@diff v_prenex_16 v_prenex_15))) (store v_prenex_16 .cse6 (select v_prenex_15 .cse6))) v_prenex_15) (= (select (select |c_#memory_$Pointer$#2.offset| v_prenex_17) .cse7) 0) (= (select v_prenex_15 |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= v_prenex_17 .cse8) (= (select v_prenex_16 .cse0) 1) (= (select v_prenex_15 .cse8) 0)))))) .cse9) (and (exists ((|v_old(#valid)_AFTER_CALL_47| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_48| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_48| .cse0) 1) (= |v_old(#valid)_AFTER_CALL_47| (let ((.cse10 (@diff |v_old(#valid)_AFTER_CALL_48| |v_old(#valid)_AFTER_CALL_47|))) (store |v_old(#valid)_AFTER_CALL_48| .cse10 (select |v_old(#valid)_AFTER_CALL_47| .cse10)))) (= (select |v_old(#valid)_AFTER_CALL_47| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_47| .cse1) 0) (= (select |v_old(#valid)_AFTER_CALL_48| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0))) .cse2 (<= 5 (select (select |c_#memory_int#2| .cse1) 0)) .cse9))))) is different from false [2024-11-19 10:22:47,433 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) (<= |c_ULTIMATE.start_main_~data~0#1| 1) (not (= .cse0 0)) (let ((.cse2 (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4) 0)) (.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse0) 4)) (.cse9 (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0))) (or (and (= .cse1 0) .cse2 (or (exists ((v_prenex_19 (Array Int Int)) (v_prenex_20 (Array Int Int)) (|v_ULTIMATE.start_sll_append_~last~0#1.base_26| Int) (|v_ULTIMATE.start_sll_append_~last~0#1.offset_26| Int)) (let ((.cse4 (+ |v_ULTIMATE.start_sll_append_~last~0#1.offset_26| 4))) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_~last~0#1.base_26|) .cse4))) (and (<= 5 (select (select |c_#memory_int#2| .cse3) 0)) (= (select v_prenex_20 |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_~last~0#1.base_26|) .cse4) 0) (= (let ((.cse5 (@diff v_prenex_20 v_prenex_19))) (store v_prenex_20 .cse5 (select v_prenex_19 .cse5))) v_prenex_19) (= (select v_prenex_19 .cse3) 0) (= (select v_prenex_19 |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (select v_prenex_20 .cse0) 1))))) (exists ((v_prenex_18 Int) (v_prenex_17 Int) (v_prenex_16 (Array Int Int)) (v_prenex_15 (Array Int Int))) (let ((.cse7 (+ v_prenex_18 4))) (let ((.cse8 (select (select |c_#memory_$Pointer$#2.base| v_prenex_17) .cse7))) (and (= (select v_prenex_16 |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (let ((.cse6 (@diff v_prenex_16 v_prenex_15))) (store v_prenex_16 .cse6 (select v_prenex_15 .cse6))) v_prenex_15) (= (select (select |c_#memory_$Pointer$#2.offset| v_prenex_17) .cse7) 0) (= (select v_prenex_15 |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= v_prenex_17 .cse8) (= (select v_prenex_16 .cse0) 1) (= (select v_prenex_15 .cse8) 0)))))) .cse9) (and (exists ((|v_old(#valid)_AFTER_CALL_47| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_48| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_48| .cse0) 1) (= |v_old(#valid)_AFTER_CALL_47| (let ((.cse10 (@diff |v_old(#valid)_AFTER_CALL_48| |v_old(#valid)_AFTER_CALL_47|))) (store |v_old(#valid)_AFTER_CALL_48| .cse10 (select |v_old(#valid)_AFTER_CALL_47| .cse10)))) (= (select |v_old(#valid)_AFTER_CALL_47| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_47| .cse1) 0) (= (select |v_old(#valid)_AFTER_CALL_48| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0))) .cse2 (<= 5 (select (select |c_#memory_int#2| .cse1) 0)) .cse9))))) is different from true [2024-11-19 10:22:47,763 WARN L851 $PredicateComparison]: unable to prove that (and (let ((.cse3 (= |c_ULTIMATE.start_main_~temp~2#1.offset| 0))) (or (and (exists ((|v_old(#valid)_AFTER_CALL_47| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_48| (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.base_142| Int)) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_main_~ptr~0#1.base_142|) 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| .cse2) 4))) (and (= (select |v_old(#valid)_AFTER_CALL_47| |v_ULTIMATE.start_main_~ptr~0#1.base_142|) 1) (= (select |v_old(#valid)_AFTER_CALL_48| |v_ULTIMATE.start_main_~ptr~0#1.base_142|) 0) (<= 5 (select (select |c_#memory_int#2| .cse0) 0)) (= |v_old(#valid)_AFTER_CALL_47| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_48| |v_old(#valid)_AFTER_CALL_47|))) (store |v_old(#valid)_AFTER_CALL_48| .cse1 (select |v_old(#valid)_AFTER_CALL_47| .cse1)))) (= .cse2 |c_ULTIMATE.start_main_~temp~2#1.base|) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_main_~ptr~0#1.base_142|) 4) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse2) 4) 0) (= (select |v_old(#valid)_AFTER_CALL_47| .cse0) 0) (not (= .cse2 0)) (= (select |v_old(#valid)_AFTER_CALL_48| .cse2) 1))))) .cse3) (and .cse3 (or (exists ((|v_ULTIMATE.start_main_~ptr~0#1.base_142| Int)) (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_main_~ptr~0#1.base_142|) 4))) (and (= (select (select |c_#memory_$Pointer$#2.base| .cse4) 4) 0) (exists ((v_prenex_19 (Array Int Int)) (v_prenex_20 (Array Int Int)) (|v_ULTIMATE.start_sll_append_~last~0#1.base_26| Int) (|v_ULTIMATE.start_sll_append_~last~0#1.offset_26| Int)) (let ((.cse6 (+ |v_ULTIMATE.start_sll_append_~last~0#1.offset_26| 4))) (let ((.cse5 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_~last~0#1.base_26|) .cse6))) (and (<= 5 (select (select |c_#memory_int#2| .cse5) 0)) (= (select v_prenex_19 |v_ULTIMATE.start_main_~ptr~0#1.base_142|) 1) (= (select v_prenex_20 .cse4) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_~last~0#1.base_26|) .cse6) 0) (= (let ((.cse7 (@diff v_prenex_20 v_prenex_19))) (store v_prenex_20 .cse7 (select v_prenex_19 .cse7))) v_prenex_19) (= (select v_prenex_19 .cse5) 0) (= (select v_prenex_20 |v_ULTIMATE.start_main_~ptr~0#1.base_142|) 0))))) (= .cse4 |c_ULTIMATE.start_main_~temp~2#1.base|) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_main_~ptr~0#1.base_142|) 4) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse4) 4) 0) (not (= .cse4 0))))) (exists ((|v_ULTIMATE.start_main_~ptr~0#1.base_142| Int)) (let ((.cse8 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_main_~ptr~0#1.base_142|) 4))) (and (= (select (select |c_#memory_$Pointer$#2.base| .cse8) 4) 0) (= .cse8 |c_ULTIMATE.start_main_~temp~2#1.base|) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_main_~ptr~0#1.base_142|) 4) 0) (exists ((v_prenex_18 Int) (v_prenex_17 Int) (v_prenex_16 (Array Int Int)) (v_prenex_15 (Array Int Int))) (let ((.cse10 (+ v_prenex_18 4))) (let ((.cse11 (select (select |c_#memory_$Pointer$#2.base| v_prenex_17) .cse10))) (and (= (let ((.cse9 (@diff v_prenex_16 v_prenex_15))) (store v_prenex_16 .cse9 (select v_prenex_15 .cse9))) v_prenex_15) (= (select (select |c_#memory_$Pointer$#2.offset| v_prenex_17) .cse10) 0) (= (select v_prenex_16 .cse8) 1) (= 0 (select v_prenex_16 |v_ULTIMATE.start_main_~ptr~0#1.base_142|)) (= v_prenex_17 .cse11) (= (select v_prenex_15 .cse11) 0) (= (select v_prenex_15 |v_ULTIMATE.start_main_~ptr~0#1.base_142|) 1))))) (= (select (select |c_#memory_$Pointer$#2.offset| .cse8) 4) 0) (not (= .cse8 0))))))))) (<= |c_ULTIMATE.start_main_~data~0#1| 1)) is different from false [2024-11-19 10:22:47,766 WARN L873 $PredicateComparison]: unable to prove that (and (let ((.cse3 (= |c_ULTIMATE.start_main_~temp~2#1.offset| 0))) (or (and (exists ((|v_old(#valid)_AFTER_CALL_47| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_48| (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.base_142| Int)) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_main_~ptr~0#1.base_142|) 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| .cse2) 4))) (and (= (select |v_old(#valid)_AFTER_CALL_47| |v_ULTIMATE.start_main_~ptr~0#1.base_142|) 1) (= (select |v_old(#valid)_AFTER_CALL_48| |v_ULTIMATE.start_main_~ptr~0#1.base_142|) 0) (<= 5 (select (select |c_#memory_int#2| .cse0) 0)) (= |v_old(#valid)_AFTER_CALL_47| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_48| |v_old(#valid)_AFTER_CALL_47|))) (store |v_old(#valid)_AFTER_CALL_48| .cse1 (select |v_old(#valid)_AFTER_CALL_47| .cse1)))) (= .cse2 |c_ULTIMATE.start_main_~temp~2#1.base|) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_main_~ptr~0#1.base_142|) 4) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse2) 4) 0) (= (select |v_old(#valid)_AFTER_CALL_47| .cse0) 0) (not (= .cse2 0)) (= (select |v_old(#valid)_AFTER_CALL_48| .cse2) 1))))) .cse3) (and .cse3 (or (exists ((|v_ULTIMATE.start_main_~ptr~0#1.base_142| Int)) (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_main_~ptr~0#1.base_142|) 4))) (and (= (select (select |c_#memory_$Pointer$#2.base| .cse4) 4) 0) (exists ((v_prenex_19 (Array Int Int)) (v_prenex_20 (Array Int Int)) (|v_ULTIMATE.start_sll_append_~last~0#1.base_26| Int) (|v_ULTIMATE.start_sll_append_~last~0#1.offset_26| Int)) (let ((.cse6 (+ |v_ULTIMATE.start_sll_append_~last~0#1.offset_26| 4))) (let ((.cse5 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_~last~0#1.base_26|) .cse6))) (and (<= 5 (select (select |c_#memory_int#2| .cse5) 0)) (= (select v_prenex_19 |v_ULTIMATE.start_main_~ptr~0#1.base_142|) 1) (= (select v_prenex_20 .cse4) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_~last~0#1.base_26|) .cse6) 0) (= (let ((.cse7 (@diff v_prenex_20 v_prenex_19))) (store v_prenex_20 .cse7 (select v_prenex_19 .cse7))) v_prenex_19) (= (select v_prenex_19 .cse5) 0) (= (select v_prenex_20 |v_ULTIMATE.start_main_~ptr~0#1.base_142|) 0))))) (= .cse4 |c_ULTIMATE.start_main_~temp~2#1.base|) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_main_~ptr~0#1.base_142|) 4) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse4) 4) 0) (not (= .cse4 0))))) (exists ((|v_ULTIMATE.start_main_~ptr~0#1.base_142| Int)) (let ((.cse8 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_main_~ptr~0#1.base_142|) 4))) (and (= (select (select |c_#memory_$Pointer$#2.base| .cse8) 4) 0) (= .cse8 |c_ULTIMATE.start_main_~temp~2#1.base|) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_main_~ptr~0#1.base_142|) 4) 0) (exists ((v_prenex_18 Int) (v_prenex_17 Int) (v_prenex_16 (Array Int Int)) (v_prenex_15 (Array Int Int))) (let ((.cse10 (+ v_prenex_18 4))) (let ((.cse11 (select (select |c_#memory_$Pointer$#2.base| v_prenex_17) .cse10))) (and (= (let ((.cse9 (@diff v_prenex_16 v_prenex_15))) (store v_prenex_16 .cse9 (select v_prenex_15 .cse9))) v_prenex_15) (= (select (select |c_#memory_$Pointer$#2.offset| v_prenex_17) .cse10) 0) (= (select v_prenex_16 .cse8) 1) (= 0 (select v_prenex_16 |v_ULTIMATE.start_main_~ptr~0#1.base_142|)) (= v_prenex_17 .cse11) (= (select v_prenex_15 .cse11) 0) (= (select v_prenex_15 |v_ULTIMATE.start_main_~ptr~0#1.base_142|) 1))))) (= (select (select |c_#memory_$Pointer$#2.offset| .cse8) 4) 0) (not (= .cse8 0))))))))) (<= |c_ULTIMATE.start_main_~data~0#1| 1)) is different from true [2024-11-19 10:22:47,926 WARN L851 $PredicateComparison]: unable to prove that (and (let ((.cse0 (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0))) (or (and .cse0 (or (exists ((|v_ULTIMATE.start_main_~ptr~0#1.base_142| Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_main_~ptr~0#1.base_142|) 4))) (and (= (select (select |c_#memory_$Pointer$#2.base| .cse1) 4) 0) (exists ((v_prenex_19 (Array Int Int)) (v_prenex_20 (Array Int Int)) (|v_ULTIMATE.start_sll_append_~last~0#1.base_26| Int) (|v_ULTIMATE.start_sll_append_~last~0#1.offset_26| Int)) (let ((.cse3 (+ |v_ULTIMATE.start_sll_append_~last~0#1.offset_26| 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_~last~0#1.base_26|) .cse3))) (and (<= 5 (select (select |c_#memory_int#2| .cse2) 0)) (= (select v_prenex_19 |v_ULTIMATE.start_main_~ptr~0#1.base_142|) 1) (= (select v_prenex_20 .cse1) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_~last~0#1.base_26|) .cse3) 0) (= (let ((.cse4 (@diff v_prenex_20 v_prenex_19))) (store v_prenex_20 .cse4 (select v_prenex_19 .cse4))) v_prenex_19) (= (select v_prenex_19 .cse2) 0) (= (select v_prenex_20 |v_ULTIMATE.start_main_~ptr~0#1.base_142|) 0))))) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_main_~ptr~0#1.base_142|) 4) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) 4) 0) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse1) (not (= .cse1 0))))) (exists ((|v_ULTIMATE.start_main_~ptr~0#1.base_142| Int)) (let ((.cse5 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_main_~ptr~0#1.base_142|) 4))) (and (= (select (select |c_#memory_$Pointer$#2.base| .cse5) 4) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_main_~ptr~0#1.base_142|) 4) 0) (exists ((v_prenex_18 Int) (v_prenex_17 Int) (v_prenex_16 (Array Int Int)) (v_prenex_15 (Array Int Int))) (let ((.cse7 (+ v_prenex_18 4))) (let ((.cse8 (select (select |c_#memory_$Pointer$#2.base| v_prenex_17) .cse7))) (and (= (let ((.cse6 (@diff v_prenex_16 v_prenex_15))) (store v_prenex_16 .cse6 (select v_prenex_15 .cse6))) v_prenex_15) (= (select (select |c_#memory_$Pointer$#2.offset| v_prenex_17) .cse7) 0) (= (select v_prenex_16 .cse5) 1) (= 0 (select v_prenex_16 |v_ULTIMATE.start_main_~ptr~0#1.base_142|)) (= v_prenex_17 .cse8) (= (select v_prenex_15 .cse8) 0) (= (select v_prenex_15 |v_ULTIMATE.start_main_~ptr~0#1.base_142|) 1))))) (= (select (select |c_#memory_$Pointer$#2.offset| .cse5) 4) 0) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse5) (not (= .cse5 0))))))) (and .cse0 (exists ((|v_old(#valid)_AFTER_CALL_47| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_48| (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.base_142| Int)) (let ((.cse11 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_main_~ptr~0#1.base_142|) 4))) (let ((.cse9 (select (select |c_#memory_$Pointer$#2.base| .cse11) 4))) (and (= (select |v_old(#valid)_AFTER_CALL_47| |v_ULTIMATE.start_main_~ptr~0#1.base_142|) 1) (= (select |v_old(#valid)_AFTER_CALL_48| |v_ULTIMATE.start_main_~ptr~0#1.base_142|) 0) (<= 5 (select (select |c_#memory_int#2| .cse9) 0)) (= |v_old(#valid)_AFTER_CALL_47| (let ((.cse10 (@diff |v_old(#valid)_AFTER_CALL_48| |v_old(#valid)_AFTER_CALL_47|))) (store |v_old(#valid)_AFTER_CALL_48| .cse10 (select |v_old(#valid)_AFTER_CALL_47| .cse10)))) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_main_~ptr~0#1.base_142|) 4) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse11) 4) 0) (= (select |v_old(#valid)_AFTER_CALL_47| .cse9) 0) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse11) (not (= .cse11 0)) (= (select |v_old(#valid)_AFTER_CALL_48| .cse11) 1)))))))) (<= |c_ULTIMATE.start_main_~data~0#1| 1)) is different from false [2024-11-19 10:22:47,930 WARN L873 $PredicateComparison]: unable to prove that (and (let ((.cse0 (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0))) (or (and .cse0 (or (exists ((|v_ULTIMATE.start_main_~ptr~0#1.base_142| Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_main_~ptr~0#1.base_142|) 4))) (and (= (select (select |c_#memory_$Pointer$#2.base| .cse1) 4) 0) (exists ((v_prenex_19 (Array Int Int)) (v_prenex_20 (Array Int Int)) (|v_ULTIMATE.start_sll_append_~last~0#1.base_26| Int) (|v_ULTIMATE.start_sll_append_~last~0#1.offset_26| Int)) (let ((.cse3 (+ |v_ULTIMATE.start_sll_append_~last~0#1.offset_26| 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_~last~0#1.base_26|) .cse3))) (and (<= 5 (select (select |c_#memory_int#2| .cse2) 0)) (= (select v_prenex_19 |v_ULTIMATE.start_main_~ptr~0#1.base_142|) 1) (= (select v_prenex_20 .cse1) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_~last~0#1.base_26|) .cse3) 0) (= (let ((.cse4 (@diff v_prenex_20 v_prenex_19))) (store v_prenex_20 .cse4 (select v_prenex_19 .cse4))) v_prenex_19) (= (select v_prenex_19 .cse2) 0) (= (select v_prenex_20 |v_ULTIMATE.start_main_~ptr~0#1.base_142|) 0))))) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_main_~ptr~0#1.base_142|) 4) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) 4) 0) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse1) (not (= .cse1 0))))) (exists ((|v_ULTIMATE.start_main_~ptr~0#1.base_142| Int)) (let ((.cse5 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_main_~ptr~0#1.base_142|) 4))) (and (= (select (select |c_#memory_$Pointer$#2.base| .cse5) 4) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_main_~ptr~0#1.base_142|) 4) 0) (exists ((v_prenex_18 Int) (v_prenex_17 Int) (v_prenex_16 (Array Int Int)) (v_prenex_15 (Array Int Int))) (let ((.cse7 (+ v_prenex_18 4))) (let ((.cse8 (select (select |c_#memory_$Pointer$#2.base| v_prenex_17) .cse7))) (and (= (let ((.cse6 (@diff v_prenex_16 v_prenex_15))) (store v_prenex_16 .cse6 (select v_prenex_15 .cse6))) v_prenex_15) (= (select (select |c_#memory_$Pointer$#2.offset| v_prenex_17) .cse7) 0) (= (select v_prenex_16 .cse5) 1) (= 0 (select v_prenex_16 |v_ULTIMATE.start_main_~ptr~0#1.base_142|)) (= v_prenex_17 .cse8) (= (select v_prenex_15 .cse8) 0) (= (select v_prenex_15 |v_ULTIMATE.start_main_~ptr~0#1.base_142|) 1))))) (= (select (select |c_#memory_$Pointer$#2.offset| .cse5) 4) 0) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse5) (not (= .cse5 0))))))) (and .cse0 (exists ((|v_old(#valid)_AFTER_CALL_47| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_48| (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.base_142| Int)) (let ((.cse11 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_main_~ptr~0#1.base_142|) 4))) (let ((.cse9 (select (select |c_#memory_$Pointer$#2.base| .cse11) 4))) (and (= (select |v_old(#valid)_AFTER_CALL_47| |v_ULTIMATE.start_main_~ptr~0#1.base_142|) 1) (= (select |v_old(#valid)_AFTER_CALL_48| |v_ULTIMATE.start_main_~ptr~0#1.base_142|) 0) (<= 5 (select (select |c_#memory_int#2| .cse9) 0)) (= |v_old(#valid)_AFTER_CALL_47| (let ((.cse10 (@diff |v_old(#valid)_AFTER_CALL_48| |v_old(#valid)_AFTER_CALL_47|))) (store |v_old(#valid)_AFTER_CALL_48| .cse10 (select |v_old(#valid)_AFTER_CALL_47| .cse10)))) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_main_~ptr~0#1.base_142|) 4) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse11) 4) 0) (= (select |v_old(#valid)_AFTER_CALL_47| .cse9) 0) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse11) (not (= .cse11 0)) (= (select |v_old(#valid)_AFTER_CALL_48| .cse11) 1)))))))) (<= |c_ULTIMATE.start_main_~data~0#1| 1)) is different from true [2024-11-19 10:22:48,391 WARN L851 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4) |c_ULTIMATE.start_main_#t~mem15#1.offset|) (let ((.cse0 (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0))) (or (and .cse0 (or (exists ((|v_ULTIMATE.start_main_~ptr~0#1.base_142| Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_main_~ptr~0#1.base_142|) 4))) (and (= (select (select |c_#memory_$Pointer$#2.base| .cse1) 4) 0) (exists ((v_prenex_19 (Array Int Int)) (v_prenex_20 (Array Int Int)) (|v_ULTIMATE.start_sll_append_~last~0#1.base_26| Int) (|v_ULTIMATE.start_sll_append_~last~0#1.offset_26| Int)) (let ((.cse3 (+ |v_ULTIMATE.start_sll_append_~last~0#1.offset_26| 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_~last~0#1.base_26|) .cse3))) (and (<= 5 (select (select |c_#memory_int#2| .cse2) 0)) (= (select v_prenex_19 |v_ULTIMATE.start_main_~ptr~0#1.base_142|) 1) (= (select v_prenex_20 .cse1) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_~last~0#1.base_26|) .cse3) 0) (= (let ((.cse4 (@diff v_prenex_20 v_prenex_19))) (store v_prenex_20 .cse4 (select v_prenex_19 .cse4))) v_prenex_19) (= (select v_prenex_19 .cse2) 0) (= (select v_prenex_20 |v_ULTIMATE.start_main_~ptr~0#1.base_142|) 0))))) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_main_~ptr~0#1.base_142|) 4) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) 4) 0) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse1) (not (= .cse1 0))))) (exists ((|v_ULTIMATE.start_main_~ptr~0#1.base_142| Int)) (let ((.cse5 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_main_~ptr~0#1.base_142|) 4))) (and (= (select (select |c_#memory_$Pointer$#2.base| .cse5) 4) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_main_~ptr~0#1.base_142|) 4) 0) (exists ((v_prenex_18 Int) (v_prenex_17 Int) (v_prenex_16 (Array Int Int)) (v_prenex_15 (Array Int Int))) (let ((.cse7 (+ v_prenex_18 4))) (let ((.cse8 (select (select |c_#memory_$Pointer$#2.base| v_prenex_17) .cse7))) (and (= (let ((.cse6 (@diff v_prenex_16 v_prenex_15))) (store v_prenex_16 .cse6 (select v_prenex_15 .cse6))) v_prenex_15) (= (select (select |c_#memory_$Pointer$#2.offset| v_prenex_17) .cse7) 0) (= (select v_prenex_16 .cse5) 1) (= 0 (select v_prenex_16 |v_ULTIMATE.start_main_~ptr~0#1.base_142|)) (= v_prenex_17 .cse8) (= (select v_prenex_15 .cse8) 0) (= (select v_prenex_15 |v_ULTIMATE.start_main_~ptr~0#1.base_142|) 1))))) (= (select (select |c_#memory_$Pointer$#2.offset| .cse5) 4) 0) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse5) (not (= .cse5 0))))))) (and .cse0 (exists ((|v_old(#valid)_AFTER_CALL_47| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_48| (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.base_142| Int)) (let ((.cse11 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_main_~ptr~0#1.base_142|) 4))) (let ((.cse9 (select (select |c_#memory_$Pointer$#2.base| .cse11) 4))) (and (= (select |v_old(#valid)_AFTER_CALL_47| |v_ULTIMATE.start_main_~ptr~0#1.base_142|) 1) (= (select |v_old(#valid)_AFTER_CALL_48| |v_ULTIMATE.start_main_~ptr~0#1.base_142|) 0) (<= 5 (select (select |c_#memory_int#2| .cse9) 0)) (= |v_old(#valid)_AFTER_CALL_47| (let ((.cse10 (@diff |v_old(#valid)_AFTER_CALL_48| |v_old(#valid)_AFTER_CALL_47|))) (store |v_old(#valid)_AFTER_CALL_48| .cse10 (select |v_old(#valid)_AFTER_CALL_47| .cse10)))) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_main_~ptr~0#1.base_142|) 4) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse11) 4) 0) (= (select |v_old(#valid)_AFTER_CALL_47| .cse9) 0) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse11) (not (= .cse11 0)) (= (select |v_old(#valid)_AFTER_CALL_48| .cse11) 1)))))))) (<= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4) |c_ULTIMATE.start_main_#t~mem15#1.base|)) is different from false [2024-11-19 10:22:48,397 WARN L873 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4) |c_ULTIMATE.start_main_#t~mem15#1.offset|) (let ((.cse0 (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0))) (or (and .cse0 (or (exists ((|v_ULTIMATE.start_main_~ptr~0#1.base_142| Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_main_~ptr~0#1.base_142|) 4))) (and (= (select (select |c_#memory_$Pointer$#2.base| .cse1) 4) 0) (exists ((v_prenex_19 (Array Int Int)) (v_prenex_20 (Array Int Int)) (|v_ULTIMATE.start_sll_append_~last~0#1.base_26| Int) (|v_ULTIMATE.start_sll_append_~last~0#1.offset_26| Int)) (let ((.cse3 (+ |v_ULTIMATE.start_sll_append_~last~0#1.offset_26| 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_~last~0#1.base_26|) .cse3))) (and (<= 5 (select (select |c_#memory_int#2| .cse2) 0)) (= (select v_prenex_19 |v_ULTIMATE.start_main_~ptr~0#1.base_142|) 1) (= (select v_prenex_20 .cse1) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_~last~0#1.base_26|) .cse3) 0) (= (let ((.cse4 (@diff v_prenex_20 v_prenex_19))) (store v_prenex_20 .cse4 (select v_prenex_19 .cse4))) v_prenex_19) (= (select v_prenex_19 .cse2) 0) (= (select v_prenex_20 |v_ULTIMATE.start_main_~ptr~0#1.base_142|) 0))))) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_main_~ptr~0#1.base_142|) 4) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) 4) 0) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse1) (not (= .cse1 0))))) (exists ((|v_ULTIMATE.start_main_~ptr~0#1.base_142| Int)) (let ((.cse5 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_main_~ptr~0#1.base_142|) 4))) (and (= (select (select |c_#memory_$Pointer$#2.base| .cse5) 4) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_main_~ptr~0#1.base_142|) 4) 0) (exists ((v_prenex_18 Int) (v_prenex_17 Int) (v_prenex_16 (Array Int Int)) (v_prenex_15 (Array Int Int))) (let ((.cse7 (+ v_prenex_18 4))) (let ((.cse8 (select (select |c_#memory_$Pointer$#2.base| v_prenex_17) .cse7))) (and (= (let ((.cse6 (@diff v_prenex_16 v_prenex_15))) (store v_prenex_16 .cse6 (select v_prenex_15 .cse6))) v_prenex_15) (= (select (select |c_#memory_$Pointer$#2.offset| v_prenex_17) .cse7) 0) (= (select v_prenex_16 .cse5) 1) (= 0 (select v_prenex_16 |v_ULTIMATE.start_main_~ptr~0#1.base_142|)) (= v_prenex_17 .cse8) (= (select v_prenex_15 .cse8) 0) (= (select v_prenex_15 |v_ULTIMATE.start_main_~ptr~0#1.base_142|) 1))))) (= (select (select |c_#memory_$Pointer$#2.offset| .cse5) 4) 0) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse5) (not (= .cse5 0))))))) (and .cse0 (exists ((|v_old(#valid)_AFTER_CALL_47| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_48| (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.base_142| Int)) (let ((.cse11 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_main_~ptr~0#1.base_142|) 4))) (let ((.cse9 (select (select |c_#memory_$Pointer$#2.base| .cse11) 4))) (and (= (select |v_old(#valid)_AFTER_CALL_47| |v_ULTIMATE.start_main_~ptr~0#1.base_142|) 1) (= (select |v_old(#valid)_AFTER_CALL_48| |v_ULTIMATE.start_main_~ptr~0#1.base_142|) 0) (<= 5 (select (select |c_#memory_int#2| .cse9) 0)) (= |v_old(#valid)_AFTER_CALL_47| (let ((.cse10 (@diff |v_old(#valid)_AFTER_CALL_48| |v_old(#valid)_AFTER_CALL_47|))) (store |v_old(#valid)_AFTER_CALL_48| .cse10 (select |v_old(#valid)_AFTER_CALL_47| .cse10)))) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_main_~ptr~0#1.base_142|) 4) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse11) 4) 0) (= (select |v_old(#valid)_AFTER_CALL_47| .cse9) 0) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse11) (not (= .cse11 0)) (= (select |v_old(#valid)_AFTER_CALL_48| .cse11) 1)))))))) (<= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4) |c_ULTIMATE.start_main_#t~mem15#1.base|)) is different from true [2024-11-19 10:22:48,873 INFO L349 Elim1Store]: treesize reduction 77, result has 77.9 percent of original size [2024-11-19 10:22:48,874 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 12 new quantified variables, introduced 36 case distinctions, treesize of input 341 treesize of output 509 [2024-11-19 10:22:49,274 INFO L349 Elim1Store]: treesize reduction 77, result has 77.9 percent of original size [2024-11-19 10:22:49,275 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 233 treesize of output 460 [2024-11-19 10:22:50,990 WARN L851 $PredicateComparison]: unable to prove that (and (exists ((v_prenex_22 Int) (|v_old(#valid)_AFTER_CALL_47| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_48| (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.base_143| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_47| v_prenex_22) 1) (= |v_old(#valid)_AFTER_CALL_47| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_48| |v_old(#valid)_AFTER_CALL_47|))) (store |v_old(#valid)_AFTER_CALL_48| .cse0 (select |v_old(#valid)_AFTER_CALL_47| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_48| |v_ULTIMATE.start_main_~ptr~0#1.base_143|) 1) (= (select |v_old(#valid)_AFTER_CALL_47| |c_ULTIMATE.start_main_~temp~2#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_48| v_prenex_22) 0) (not (= |v_ULTIMATE.start_main_~ptr~0#1.base_143| 0)))) (<= |c_ULTIMATE.start_main_~data~0#1| 1) (<= 5 (select (select |c_#memory_int#2| |c_ULTIMATE.start_main_~temp~2#1.base|) 0)) (not (= |c_ULTIMATE.start_main_~temp~2#1.base| 0)) (= |c_ULTIMATE.start_main_~temp~2#1.offset| 0)) is different from false [2024-11-19 10:22:50,993 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((v_prenex_22 Int) (|v_old(#valid)_AFTER_CALL_47| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_48| (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.base_143| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_47| v_prenex_22) 1) (= |v_old(#valid)_AFTER_CALL_47| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_48| |v_old(#valid)_AFTER_CALL_47|))) (store |v_old(#valid)_AFTER_CALL_48| .cse0 (select |v_old(#valid)_AFTER_CALL_47| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_48| |v_ULTIMATE.start_main_~ptr~0#1.base_143|) 1) (= (select |v_old(#valid)_AFTER_CALL_47| |c_ULTIMATE.start_main_~temp~2#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_48| v_prenex_22) 0) (not (= |v_ULTIMATE.start_main_~ptr~0#1.base_143| 0)))) (<= |c_ULTIMATE.start_main_~data~0#1| 1) (<= 5 (select (select |c_#memory_int#2| |c_ULTIMATE.start_main_~temp~2#1.base|) 0)) (not (= |c_ULTIMATE.start_main_~temp~2#1.base| 0)) (= |c_ULTIMATE.start_main_~temp~2#1.offset| 0)) is different from true [2024-11-19 10:22:51,025 WARN L851 $PredicateComparison]: unable to prove that (and (exists ((v_prenex_22 Int) (|v_old(#valid)_AFTER_CALL_47| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_48| (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.base_143| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_47| v_prenex_22) 1) (= |v_old(#valid)_AFTER_CALL_47| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_48| |v_old(#valid)_AFTER_CALL_47|))) (store |v_old(#valid)_AFTER_CALL_48| .cse0 (select |v_old(#valid)_AFTER_CALL_47| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_48| |v_ULTIMATE.start_main_~ptr~0#1.base_143|) 1) (= (select |v_old(#valid)_AFTER_CALL_47| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_48| v_prenex_22) 0) (not (= |v_ULTIMATE.start_main_~ptr~0#1.base_143| 0)))) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (<= 5 (select (select |c_#memory_int#2| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0)) (not (= |c_ULTIMATE.start_main_~ptr~0#1.base| 0)) (<= |c_ULTIMATE.start_main_~data~0#1| 1)) is different from false [2024-11-19 10:22:51,027 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((v_prenex_22 Int) (|v_old(#valid)_AFTER_CALL_47| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_48| (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.base_143| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_47| v_prenex_22) 1) (= |v_old(#valid)_AFTER_CALL_47| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_48| |v_old(#valid)_AFTER_CALL_47|))) (store |v_old(#valid)_AFTER_CALL_48| .cse0 (select |v_old(#valid)_AFTER_CALL_47| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_48| |v_ULTIMATE.start_main_~ptr~0#1.base_143|) 1) (= (select |v_old(#valid)_AFTER_CALL_47| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_48| v_prenex_22) 0) (not (= |v_ULTIMATE.start_main_~ptr~0#1.base_143| 0)))) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (<= 5 (select (select |c_#memory_int#2| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0)) (not (= |c_ULTIMATE.start_main_~ptr~0#1.base| 0)) (<= |c_ULTIMATE.start_main_~data~0#1| 1)) is different from true [2024-11-19 10:22:51,118 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 15 treesize of output 7 [2024-11-19 10:22:51,161 INFO L134 CoverageAnalysis]: Checked inductivity of 2416 backedges. 376 proven. 6 refuted. 0 times theorem prover too weak. 2006 trivial. 28 not checked. [2024-11-19 10:22:51,162 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 10:23:00,394 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 10:23:00,394 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 589 treesize of output 582 [2024-11-19 10:23:00,480 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 10:23:00,480 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 1095 treesize of output 1444 [2024-11-19 10:23:00,497 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 759 treesize of output 675 [2024-11-19 10:23:00,511 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 675 treesize of output 591 [2024-11-19 10:23:08,218 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse29 (< |c_ULTIMATE.start_main_~data~0#1| |c_ULTIMATE.start_sll_append_~data#1|)) (.cse10 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse11 (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (and (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_37| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_37|) 0)) (forall ((v_prenex_29 Int) (v_prenex_30 Int) (v_ArrVal_2001 (Array Int Int)) (v_ArrVal_2000 (Array Int Int))) (let ((.cse8 (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_37| v_ArrVal_2000)) (.cse13 (+ v_prenex_30 4))) (let ((.cse0 (store .cse8 v_prenex_29 (store (select .cse8 v_prenex_29) .cse13 0))) (.cse12 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_37| v_ArrVal_2001))) (let ((.cse1 (select (select (store .cse12 v_prenex_29 (store (select .cse12 v_prenex_29) .cse13 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_37|)) .cse10) .cse11)) (.cse2 (+ (select (select .cse0 .cse10) .cse11) 4))) (or (= (select (select .cse0 .cse1) .cse2) 0) (forall ((|ULTIMATE.start_sll_append_~last~0#1.base| Int) (|ULTIMATE.start_sll_append_~last~0#1.offset| Int)) (let ((.cse9 (select .cse8 |ULTIMATE.start_sll_append_~last~0#1.base|)) (.cse4 (+ |ULTIMATE.start_sll_append_~last~0#1.offset| 4))) (let ((.cse5 (store .cse8 |ULTIMATE.start_sll_append_~last~0#1.base| (store .cse9 .cse4 0))) (.cse3 (select .cse12 |ULTIMATE.start_sll_append_~last~0#1.base|))) (let ((.cse6 (select (select (store .cse12 |ULTIMATE.start_sll_append_~last~0#1.base| (store .cse3 .cse4 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_37|)) .cse10) .cse11)) (.cse7 (+ (select (select .cse5 .cse10) .cse11) 4))) (or (not (= (select .cse3 .cse4) 0)) (= (select (select .cse5 .cse6) .cse7) 0) (= (select (select .cse8 .cse1) .cse2) (select (select .cse8 .cse6) .cse7)) (not (= (select .cse9 .cse4) 0)))))))))))))) (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_37| Int)) (or (forall ((|ULTIMATE.start_sll_append_~last~0#1.base| Int) (|ULTIMATE.start_sll_append_~last~0#1.offset| Int) (v_ArrVal_2001 (Array Int Int)) (v_ArrVal_2000 (Array Int Int))) (let ((.cse14 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_37| v_ArrVal_2001)) (.cse20 (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_37| v_ArrVal_2000))) (or (forall ((v_prenex_29 Int) (v_prenex_30 Int)) (let ((.cse17 (select .cse20 v_prenex_29)) (.cse19 (select .cse14 v_prenex_29)) (.cse18 (+ v_prenex_30 4))) (let ((.cse15 (select (select (store .cse14 v_prenex_29 (store .cse19 .cse18 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_37|)) .cse10) .cse11)) (.cse16 (+ (select (select (store .cse20 v_prenex_29 (store .cse17 .cse18 0)) .cse10) .cse11) 4))) (or (= (select (select .cse14 .cse15) .cse16) 0) (not (= (select .cse17 .cse18) 0)) (not (= (select .cse19 .cse18) 0)) (= (select (select .cse20 .cse15) .cse16) 0))))) (= |v_ULTIMATE.start_sll_append_#t~ret7#1.base_37| (let ((.cse22 (+ |ULTIMATE.start_sll_append_~last~0#1.offset| 4))) (select (let ((.cse21 (store .cse14 |ULTIMATE.start_sll_append_~last~0#1.base| (store (select .cse14 |ULTIMATE.start_sll_append_~last~0#1.base|) .cse22 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_37|)))) (select .cse21 (select (select .cse21 .cse10) .cse11))) (+ (select (select (store .cse20 |ULTIMATE.start_sll_append_~last~0#1.base| (store (select .cse20 |ULTIMATE.start_sll_append_~last~0#1.base|) .cse22 0)) .cse10) .cse11) 4))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_37|) 0)))) (or (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_37| Int) (|ULTIMATE.start_sll_append_~last~0#1.base| Int) (|ULTIMATE.start_sll_append_~last~0#1.offset| Int) (v_ArrVal_2001 (Array Int Int)) (v_ArrVal_2000 (Array Int Int))) (let ((.cse27 (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_37| v_ArrVal_2000)) (.cse26 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_37| v_ArrVal_2001))) (let ((.cse23 (select .cse26 |ULTIMATE.start_sll_append_~last~0#1.base|)) (.cse28 (select .cse27 |ULTIMATE.start_sll_append_~last~0#1.base|)) (.cse24 (+ |ULTIMATE.start_sll_append_~last~0#1.offset| 4))) (or (not (= (select .cse23 .cse24) 0)) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_37|) 0)) (= (let ((.cse25 (store .cse27 |ULTIMATE.start_sll_append_~last~0#1.base| (store .cse28 .cse24 0)))) (select (select .cse25 (select (select (store .cse26 |ULTIMATE.start_sll_append_~last~0#1.base| (store .cse23 .cse24 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_37|)) .cse10) .cse11)) (+ (select (select .cse25 .cse10) .cse11) 4))) 0) (not (= (select .cse28 .cse24) 0)))))) .cse29) (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_37| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_37|) 0)) (forall ((v_prenex_29 Int) (v_prenex_30 Int) (v_ArrVal_2001 (Array Int Int)) (v_ArrVal_2000 (Array Int Int))) (let ((.cse35 (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_37| v_ArrVal_2000)) (.cse41 (+ v_prenex_30 4))) (let ((.cse30 (store .cse35 v_prenex_29 (store (select .cse35 v_prenex_29) .cse41 0))) (.cse39 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_37| v_ArrVal_2001))) (let ((.cse31 (select (select (store .cse39 v_prenex_29 (store (select .cse39 v_prenex_29) .cse41 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_37|)) .cse10) .cse11)) (.cse32 (+ (select (select .cse30 .cse10) .cse11) 4))) (or (= (select (select .cse30 .cse31) .cse32) 0) (forall ((|ULTIMATE.start_sll_append_~last~0#1.base| Int) (|ULTIMATE.start_sll_append_~last~0#1.offset| Int)) (let ((.cse40 (select .cse35 |ULTIMATE.start_sll_append_~last~0#1.base|)) (.cse33 (select .cse39 |ULTIMATE.start_sll_append_~last~0#1.base|)) (.cse34 (+ |ULTIMATE.start_sll_append_~last~0#1.offset| 4))) (let ((.cse36 (select (select (store .cse39 |ULTIMATE.start_sll_append_~last~0#1.base| (store .cse33 .cse34 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_37|)) .cse10) .cse11)) (.cse37 (+ (select (select (store .cse35 |ULTIMATE.start_sll_append_~last~0#1.base| (store .cse40 .cse34 0)) .cse10) .cse11) 4))) (let ((.cse38 (select (select .cse39 .cse36) .cse37))) (or (not (= (select .cse33 .cse34) 0)) (= (select (select .cse35 .cse36) .cse37) 0) (= |v_ULTIMATE.start_sll_append_#t~ret7#1.base_37| .cse38) (= (select (select .cse39 .cse31) .cse32) .cse38) (not (= (select .cse40 .cse34) 0)))))))))))))) (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_37| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_37|) 0)) (forall ((v_prenex_29 Int) (|ULTIMATE.start_sll_append_~last~0#1.base| Int) (|ULTIMATE.start_sll_append_~last~0#1.offset| Int) (v_prenex_30 Int) (v_ArrVal_2001 (Array Int Int)) (v_ArrVal_2000 (Array Int Int))) (let ((.cse49 (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_37| v_ArrVal_2000)) (.cse47 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_37| v_ArrVal_2001))) (let ((.cse45 (select .cse47 v_prenex_29)) (.cse43 (select .cse49 v_prenex_29)) (.cse44 (+ v_prenex_30 4))) (let ((.cse42 (select (select .cse47 (select (select (store .cse47 v_prenex_29 (store .cse45 .cse44 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_37|)) .cse10) .cse11)) (+ (select (select (store .cse49 v_prenex_29 (store .cse43 .cse44 0)) .cse10) .cse11) 4)))) (or (= .cse42 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_37|) (= .cse42 0) (not (= (select .cse43 .cse44) 0)) (not (= (select .cse45 .cse44) 0)) (= .cse42 (let ((.cse48 (+ |ULTIMATE.start_sll_append_~last~0#1.offset| 4))) (select (let ((.cse46 (store .cse47 |ULTIMATE.start_sll_append_~last~0#1.base| (store (select .cse47 |ULTIMATE.start_sll_append_~last~0#1.base|) .cse48 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_37|)))) (select .cse46 (select (select .cse46 .cse10) .cse11))) (+ (select (select (store .cse49 |ULTIMATE.start_sll_append_~last~0#1.base| (store (select .cse49 |ULTIMATE.start_sll_append_~last~0#1.base|) .cse48 0)) .cse10) .cse11) 4))))))))))) (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_37| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_37|) 0)) (forall ((|ULTIMATE.start_sll_append_~last~0#1.base| Int) (|ULTIMATE.start_sll_append_~last~0#1.offset| Int) (v_ArrVal_2001 (Array Int Int)) (v_ArrVal_2000 (Array Int Int))) (let ((.cse55 (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_37| v_ArrVal_2000)) (.cse53 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_37| v_ArrVal_2001))) (let ((.cse50 (select .cse53 |ULTIMATE.start_sll_append_~last~0#1.base|)) (.cse56 (select .cse55 |ULTIMATE.start_sll_append_~last~0#1.base|)) (.cse51 (+ |ULTIMATE.start_sll_append_~last~0#1.offset| 4))) (or (not (= (select .cse50 .cse51) 0)) (forall ((v_prenex_29 Int) (v_prenex_30 Int)) (= (let ((.cse54 (+ v_prenex_30 4))) (let ((.cse52 (store .cse55 v_prenex_29 (store (select .cse55 v_prenex_29) .cse54 0)))) (select (select .cse52 (select (select (store .cse53 v_prenex_29 (store (select .cse53 v_prenex_29) .cse54 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_37|)) .cse10) .cse11)) (+ (select (select .cse52 .cse10) .cse11) 4)))) 0)) (= (select (select .cse55 (select (select (store .cse53 |ULTIMATE.start_sll_append_~last~0#1.base| (store .cse50 .cse51 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_37|)) .cse10) .cse11)) (+ (select (select (store .cse55 |ULTIMATE.start_sll_append_~last~0#1.base| (store .cse56 .cse51 0)) .cse10) .cse11) 4)) 0) (not (= (select .cse56 .cse51) 0)))))))) (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_37| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_37|) 0)) (forall ((v_prenex_29 Int) (v_prenex_30 Int) (v_ArrVal_2001 (Array Int Int)) (v_ArrVal_2000 (Array Int Int))) (let ((.cse63 (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_37| v_ArrVal_2000)) (.cse62 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_37| v_ArrVal_2001))) (let ((.cse60 (select .cse62 v_prenex_29)) (.cse58 (select .cse63 v_prenex_29)) (.cse59 (+ v_prenex_30 4))) (let ((.cse57 (select (let ((.cse61 (store .cse62 v_prenex_29 (store .cse60 .cse59 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_37|)))) (select .cse61 (select (select .cse61 .cse10) .cse11))) (+ (select (select (store .cse63 v_prenex_29 (store .cse58 .cse59 0)) .cse10) .cse11) 4)))) (or (= .cse57 0) (not (= (select .cse58 .cse59) 0)) (not (= (select .cse60 .cse59) 0)) (not (= .cse57 v_prenex_29))))))))) (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_37| Int)) (or (forall ((|ULTIMATE.start_sll_append_~last~0#1.base| Int) (|ULTIMATE.start_sll_append_~last~0#1.offset| Int) (v_ArrVal_2001 (Array Int Int)) (v_ArrVal_2000 (Array Int Int))) (let ((.cse66 (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_37| v_ArrVal_2000)) (.cse67 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_37| v_ArrVal_2001))) (let ((.cse64 (select .cse67 |ULTIMATE.start_sll_append_~last~0#1.base|)) (.cse68 (select .cse66 |ULTIMATE.start_sll_append_~last~0#1.base|)) (.cse65 (+ |ULTIMATE.start_sll_append_~last~0#1.offset| 4))) (or (not (= (select .cse64 .cse65) 0)) (= (select (select .cse66 (select (select (store .cse67 |ULTIMATE.start_sll_append_~last~0#1.base| (store .cse64 .cse65 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_37|)) .cse10) .cse11)) (+ (select (select (store .cse66 |ULTIMATE.start_sll_append_~last~0#1.base| (store .cse68 .cse65 0)) .cse10) .cse11) 4)) 0) (forall ((v_prenex_29 Int) (v_prenex_30 Int)) (= (let ((.cse70 (+ v_prenex_30 4))) (select (let ((.cse69 (store .cse67 v_prenex_29 (store (select .cse67 v_prenex_29) .cse70 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_37|)))) (select .cse69 (select (select .cse69 .cse10) .cse11))) (+ (select (select (store .cse66 v_prenex_29 (store (select .cse66 v_prenex_29) .cse70 0)) .cse10) .cse11) 4))) |v_ULTIMATE.start_sll_append_#t~ret7#1.base_37|)) (not (= (select .cse68 .cse65) 0)))))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_37|) 0)))) (or (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_37| Int) (v_prenex_29 Int) (|ULTIMATE.start_sll_append_~last~0#1.base| Int) (|ULTIMATE.start_sll_append_~last~0#1.offset| Int) (v_prenex_30 Int) (v_ArrVal_2001 (Array Int Int)) (v_ArrVal_2000 (Array Int Int))) (let ((.cse78 (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_37| v_ArrVal_2000)) (.cse76 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_37| v_ArrVal_2001))) (let ((.cse74 (select .cse76 v_prenex_29)) (.cse72 (select .cse78 v_prenex_29)) (.cse73 (+ v_prenex_30 4))) (let ((.cse71 (select (let ((.cse79 (store .cse76 v_prenex_29 (store .cse74 .cse73 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_37|)))) (select .cse79 (select (select .cse79 .cse10) .cse11))) (+ (select (select (store .cse78 v_prenex_29 (store .cse72 .cse73 0)) .cse10) .cse11) 4)))) (or (= .cse71 0) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_37|) 0)) (not (= (select .cse72 .cse73) 0)) (not (= (select .cse74 .cse73) 0)) (= .cse71 (let ((.cse77 (+ |ULTIMATE.start_sll_append_~last~0#1.offset| 4))) (select (let ((.cse75 (store .cse76 |ULTIMATE.start_sll_append_~last~0#1.base| (store (select .cse76 |ULTIMATE.start_sll_append_~last~0#1.base|) .cse77 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_37|)))) (select .cse75 (select (select .cse75 .cse10) .cse11))) (+ (select (select (store .cse78 |ULTIMATE.start_sll_append_~last~0#1.base| (store (select .cse78 |ULTIMATE.start_sll_append_~last~0#1.base|) .cse77 0)) .cse10) .cse11) 4))))))))) .cse29) (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_37| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_37|) 0)) (forall ((|ULTIMATE.start_sll_append_~last~0#1.base| Int) (|ULTIMATE.start_sll_append_~last~0#1.offset| Int) (v_ArrVal_2001 (Array Int Int)) (v_ArrVal_2000 (Array Int Int))) (let ((.cse87 (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_37| v_ArrVal_2000))) (let ((.cse82 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_37| v_ArrVal_2001)) (.cse86 (select .cse87 |ULTIMATE.start_sll_append_~last~0#1.base|)) (.cse81 (+ |ULTIMATE.start_sll_append_~last~0#1.offset| 4))) (let ((.cse85 (store .cse87 |ULTIMATE.start_sll_append_~last~0#1.base| (store .cse86 .cse81 0))) (.cse80 (select .cse82 |ULTIMATE.start_sll_append_~last~0#1.base|))) (let ((.cse83 (select (select (store .cse82 |ULTIMATE.start_sll_append_~last~0#1.base| (store .cse80 .cse81 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_37|)) .cse10) .cse11)) (.cse84 (+ (select (select .cse85 .cse10) .cse11) 4))) (or (not (= (select .cse80 .cse81) 0)) (not (= |ULTIMATE.start_sll_append_~last~0#1.base| (select (select .cse82 .cse83) .cse84))) (= (select (select .cse85 .cse83) .cse84) 0) (not (= (select .cse86 .cse81) 0)))))))))) (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_37| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_37|) 0)) (forall ((|ULTIMATE.start_sll_append_~last~0#1.base| Int) (|ULTIMATE.start_sll_append_~last~0#1.offset| Int) (v_ArrVal_2001 (Array Int Int)) (v_ArrVal_2000 (Array Int Int))) (let ((.cse92 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_37| v_ArrVal_2001)) (.cse93 (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_37| v_ArrVal_2000))) (or (forall ((v_prenex_29 Int) (v_prenex_30 Int)) (let ((.cse91 (select .cse92 v_prenex_29)) (.cse89 (select .cse93 v_prenex_29)) (.cse90 (+ v_prenex_30 4))) (let ((.cse88 (select (select .cse92 (select (select (store .cse92 v_prenex_29 (store .cse91 .cse90 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_37|)) .cse10) .cse11)) (+ (select (select (store .cse93 v_prenex_29 (store .cse89 .cse90 0)) .cse10) .cse11) 4)))) (or (= .cse88 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_37|) (= .cse88 0) (not (= (select .cse89 .cse90) 0)) (not (= (select .cse91 .cse90) 0)))))) (= (let ((.cse95 (+ |ULTIMATE.start_sll_append_~last~0#1.offset| 4))) (let ((.cse94 (store .cse93 |ULTIMATE.start_sll_append_~last~0#1.base| (store (select .cse93 |ULTIMATE.start_sll_append_~last~0#1.base|) .cse95 0)))) (select (select .cse94 (select (select (store .cse92 |ULTIMATE.start_sll_append_~last~0#1.base| (store (select .cse92 |ULTIMATE.start_sll_append_~last~0#1.base|) .cse95 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_37|)) .cse10) .cse11)) (+ (select (select .cse94 .cse10) .cse11) 4)))) 0)))))) (or .cse29 (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_37| Int) (v_prenex_29 Int) (v_prenex_30 Int) (v_ArrVal_2001 (Array Int Int)) (v_ArrVal_2000 (Array Int Int))) (let ((.cse97 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_37| v_ArrVal_2001)) (.cse100 (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_37| v_ArrVal_2000))) (let ((.cse101 (select .cse100 v_prenex_29)) (.cse98 (select .cse97 v_prenex_29)) (.cse99 (+ v_prenex_30 4))) (or (= (select (let ((.cse96 (store .cse97 v_prenex_29 (store .cse98 .cse99 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_37|)))) (select .cse96 (select (select .cse96 .cse10) .cse11))) (+ (select (select (store .cse100 v_prenex_29 (store .cse101 .cse99 0)) .cse10) .cse11) 4)) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_37|) 0)) (not (= (select .cse101 .cse99) 0)) (not (= (select .cse98 .cse99) 0))))))) (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_37| Int)) (or (forall ((v_prenex_29 Int) (|ULTIMATE.start_sll_append_~last~0#1.base| Int) (|ULTIMATE.start_sll_append_~last~0#1.offset| Int) (v_prenex_30 Int) (v_ArrVal_2001 (Array Int Int)) (v_ArrVal_2000 (Array Int Int))) (let ((.cse107 (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_37| v_ArrVal_2000))) (let ((.cse105 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_37| v_ArrVal_2001)) (.cse111 (select .cse107 |ULTIMATE.start_sll_append_~last~0#1.base|)) (.cse103 (+ |ULTIMATE.start_sll_append_~last~0#1.offset| 4))) (let ((.cse110 (store .cse107 |ULTIMATE.start_sll_append_~last~0#1.base| (store .cse111 .cse103 0))) (.cse102 (select .cse105 |ULTIMATE.start_sll_append_~last~0#1.base|))) (let ((.cse108 (select (select (store .cse105 |ULTIMATE.start_sll_append_~last~0#1.base| (store .cse102 .cse103 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_37|)) .cse10) .cse11)) (.cse109 (+ (select (select .cse110 .cse10) .cse11) 4))) (or (not (= (select .cse102 .cse103) 0)) (= (let ((.cse106 (+ v_prenex_30 4))) (select (let ((.cse104 (store .cse105 v_prenex_29 (store (select .cse105 v_prenex_29) .cse106 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_37|)))) (select .cse104 (select (select .cse104 .cse10) .cse11))) (+ (select (select (store .cse107 v_prenex_29 (store (select .cse107 v_prenex_29) .cse106 0)) .cse10) .cse11) 4))) (select (select .cse105 .cse108) .cse109)) (= (select (select .cse110 .cse108) .cse109) 0) (not (= (select .cse111 .cse103) 0)))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_37|) 0)))) (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_37| Int)) (or (forall ((|ULTIMATE.start_sll_append_~last~0#1.base| Int) (|ULTIMATE.start_sll_append_~last~0#1.offset| Int) (v_ArrVal_2001 (Array Int Int)) (v_ArrVal_2000 (Array Int Int))) (let ((.cse118 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_37| v_ArrVal_2001)) (.cse114 (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_37| v_ArrVal_2000))) (let ((.cse120 (select .cse114 |ULTIMATE.start_sll_append_~last~0#1.base|)) (.cse112 (select .cse118 |ULTIMATE.start_sll_append_~last~0#1.base|)) (.cse113 (+ |ULTIMATE.start_sll_append_~last~0#1.offset| 4))) (let ((.cse115 (select (select (store .cse118 |ULTIMATE.start_sll_append_~last~0#1.base| (store .cse112 .cse113 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_37|)) .cse10) .cse11)) (.cse116 (+ (select (select (store .cse114 |ULTIMATE.start_sll_append_~last~0#1.base| (store .cse120 .cse113 0)) .cse10) .cse11) 4))) (or (not (= (select .cse112 .cse113) 0)) (= (select (select .cse114 .cse115) .cse116) 0) (forall ((v_prenex_29 Int) (v_prenex_30 Int)) (= (let ((.cse119 (+ v_prenex_30 4))) (select (let ((.cse117 (store .cse118 v_prenex_29 (store (select .cse118 v_prenex_29) .cse119 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_37|)))) (select .cse117 (select (select .cse117 .cse10) .cse11))) (+ (select (select (store .cse114 v_prenex_29 (store (select .cse114 v_prenex_29) .cse119 0)) .cse10) .cse11) 4))) |v_ULTIMATE.start_sll_append_#t~ret7#1.base_37|)) (= |v_ULTIMATE.start_sll_append_#t~ret7#1.base_37| (select (select .cse118 .cse115) .cse116)) (not (= (select .cse120 .cse113) 0))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_37|) 0)))) (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_37| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_37|) 0)) (forall ((v_prenex_29 Int) (v_prenex_30 Int) (v_ArrVal_2001 (Array Int Int)) (v_ArrVal_2000 (Array Int Int))) (let ((.cse126 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_37| v_ArrVal_2001)) (.cse128 (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_37| v_ArrVal_2000))) (let ((.cse122 (select .cse128 v_prenex_29)) (.cse124 (select .cse126 v_prenex_29)) (.cse123 (+ v_prenex_30 4))) (let ((.cse129 (select (select (store .cse126 v_prenex_29 (store .cse124 .cse123 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_37|)) .cse10) .cse11)) (.cse130 (+ (select (select (store .cse128 v_prenex_29 (store .cse122 .cse123 0)) .cse10) .cse11) 4))) (let ((.cse121 (select (select .cse126 .cse129) .cse130))) (or (= .cse121 0) (not (= (select .cse122 .cse123) 0)) (not (= (select .cse124 .cse123) 0)) (forall ((|ULTIMATE.start_sll_append_~last~0#1.base| Int) (|ULTIMATE.start_sll_append_~last~0#1.offset| Int)) (= .cse121 (let ((.cse127 (+ |ULTIMATE.start_sll_append_~last~0#1.offset| 4))) (select (let ((.cse125 (store .cse126 |ULTIMATE.start_sll_append_~last~0#1.base| (store (select .cse126 |ULTIMATE.start_sll_append_~last~0#1.base|) .cse127 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_37|)))) (select .cse125 (select (select .cse125 .cse10) .cse11))) (+ (select (select (store .cse128 |ULTIMATE.start_sll_append_~last~0#1.base| (store (select .cse128 |ULTIMATE.start_sll_append_~last~0#1.base|) .cse127 0)) .cse10) .cse11) 4))))) (= (select (select .cse128 .cse129) .cse130) 0))))))))) (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_37| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_37|) 0)) (forall ((|ULTIMATE.start_sll_append_~last~0#1.base| Int) (|ULTIMATE.start_sll_append_~last~0#1.offset| Int) (v_ArrVal_2001 (Array Int Int)) (v_ArrVal_2000 (Array Int Int))) (let ((.cse131 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_37| v_ArrVal_2001)) (.cse137 (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_37| v_ArrVal_2000))) (or (forall ((v_prenex_29 Int) (v_prenex_30 Int)) (let ((.cse134 (select .cse137 v_prenex_29)) (.cse136 (select .cse131 v_prenex_29)) (.cse135 (+ v_prenex_30 4))) (let ((.cse132 (select (select (store .cse131 v_prenex_29 (store .cse136 .cse135 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_37|)) .cse10) .cse11)) (.cse133 (+ (select (select (store .cse137 v_prenex_29 (store .cse134 .cse135 0)) .cse10) .cse11) 4))) (or (= (select (select .cse131 .cse132) .cse133) 0) (not (= (select .cse134 .cse135) 0)) (not (= (select .cse136 .cse135) 0)) (= (select (select .cse137 .cse132) .cse133) 0))))) (= (let ((.cse139 (+ |ULTIMATE.start_sll_append_~last~0#1.offset| 4))) (let ((.cse138 (store .cse137 |ULTIMATE.start_sll_append_~last~0#1.base| (store (select .cse137 |ULTIMATE.start_sll_append_~last~0#1.base|) .cse139 0)))) (select (select .cse138 (select (select (store .cse131 |ULTIMATE.start_sll_append_~last~0#1.base| (store (select .cse131 |ULTIMATE.start_sll_append_~last~0#1.base|) .cse139 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_37|)) .cse10) .cse11)) (+ (select (select .cse138 .cse10) .cse11) 4)))) 0)))))) (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_37| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_37|) 0)) (forall ((|ULTIMATE.start_sll_append_~last~0#1.base| Int) (|ULTIMATE.start_sll_append_~last~0#1.offset| Int) (v_ArrVal_2001 (Array Int Int)) (v_ArrVal_2000 (Array Int Int))) (let ((.cse144 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_37| v_ArrVal_2001)) (.cse145 (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_37| v_ArrVal_2000))) (or (forall ((v_prenex_29 Int) (v_prenex_30 Int)) (let ((.cse143 (select .cse144 v_prenex_29)) (.cse141 (select .cse145 v_prenex_29)) (.cse142 (+ v_prenex_30 4))) (let ((.cse140 (select (select .cse144 (select (select (store .cse144 v_prenex_29 (store .cse143 .cse142 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_37|)) .cse10) .cse11)) (+ (select (select (store .cse145 v_prenex_29 (store .cse141 .cse142 0)) .cse10) .cse11) 4)))) (or (= .cse140 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_37|) (= .cse140 0) (not (= (select .cse141 .cse142) 0)) (not (= (select .cse143 .cse142) 0)))))) (= |v_ULTIMATE.start_sll_append_#t~ret7#1.base_37| (let ((.cse147 (+ |ULTIMATE.start_sll_append_~last~0#1.offset| 4))) (select (let ((.cse146 (store .cse144 |ULTIMATE.start_sll_append_~last~0#1.base| (store (select .cse144 |ULTIMATE.start_sll_append_~last~0#1.base|) .cse147 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_37|)))) (select .cse146 (select (select .cse146 .cse10) .cse11))) (+ (select (select (store .cse145 |ULTIMATE.start_sll_append_~last~0#1.base| (store (select .cse145 |ULTIMATE.start_sll_append_~last~0#1.base|) .cse147 0)) .cse10) .cse11) 4))))))))) (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_37| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_37|) 0)) (forall ((|ULTIMATE.start_sll_append_~last~0#1.base| Int) (|ULTIMATE.start_sll_append_~last~0#1.offset| Int) (v_ArrVal_2001 (Array Int Int)) (v_ArrVal_2000 (Array Int Int))) (let ((.cse151 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_37| v_ArrVal_2001)) (.cse153 (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_37| v_ArrVal_2000))) (let ((.cse156 (select .cse153 |ULTIMATE.start_sll_append_~last~0#1.base|)) (.cse148 (select .cse151 |ULTIMATE.start_sll_append_~last~0#1.base|)) (.cse149 (+ |ULTIMATE.start_sll_append_~last~0#1.offset| 4))) (let ((.cse154 (select (select (store .cse151 |ULTIMATE.start_sll_append_~last~0#1.base| (store .cse148 .cse149 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_37|)) .cse10) .cse11)) (.cse155 (+ (select (select (store .cse153 |ULTIMATE.start_sll_append_~last~0#1.base| (store .cse156 .cse149 0)) .cse10) .cse11) 4))) (or (not (= (select .cse148 .cse149) 0)) (forall ((v_prenex_29 Int) (v_prenex_30 Int)) (= (let ((.cse152 (+ v_prenex_30 4))) (let ((.cse150 (store .cse153 v_prenex_29 (store (select .cse153 v_prenex_29) .cse152 0)))) (select (select .cse150 (select (select (store .cse151 v_prenex_29 (store (select .cse151 v_prenex_29) .cse152 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_37|)) .cse10) .cse11)) (+ (select (select .cse150 .cse10) .cse11) 4)))) 0)) (= (select (select .cse153 .cse154) .cse155) 0) (= |v_ULTIMATE.start_sll_append_#t~ret7#1.base_37| (select (select .cse151 .cse154) .cse155)) (not (= (select .cse156 .cse149) 0))))))))) (or .cse29 (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_37| Int) (v_prenex_29 Int) (|ULTIMATE.start_sll_append_~last~0#1.base| Int) (|ULTIMATE.start_sll_append_~last~0#1.offset| Int) (v_prenex_30 Int) (v_ArrVal_2001 (Array Int Int)) (v_ArrVal_2000 (Array Int Int))) (let ((.cse164 (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_37| v_ArrVal_2000)) (.cse168 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_37| v_ArrVal_2001))) (let ((.cse162 (select .cse168 v_prenex_29)) (.cse160 (select .cse164 v_prenex_29)) (.cse161 (+ v_prenex_30 4)) (.cse169 (+ |ULTIMATE.start_sll_append_~last~0#1.offset| 4))) (let ((.cse167 (store .cse164 |ULTIMATE.start_sll_append_~last~0#1.base| (store (select .cse164 |ULTIMATE.start_sll_append_~last~0#1.base|) .cse169 0))) (.cse163 (store .cse164 v_prenex_29 (store .cse160 .cse161 0))) (.cse157 (store .cse168 v_prenex_29 (store .cse162 .cse161 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_37|)))) (let ((.cse158 (select (select .cse157 .cse10) .cse11)) (.cse159 (+ (select (select .cse163 .cse10) .cse11) 4)) (.cse165 (select (select (store .cse168 |ULTIMATE.start_sll_append_~last~0#1.base| (store (select .cse168 |ULTIMATE.start_sll_append_~last~0#1.base|) .cse169 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_37|)) .cse10) .cse11)) (.cse166 (+ (select (select .cse167 .cse10) .cse11) 4))) (or (= (select (select .cse157 .cse158) .cse159) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_37|) 0)) (not (= (select .cse160 .cse161) 0)) (not (= (select .cse162 .cse161) 0)) (= (select (select .cse163 .cse158) .cse159) (select (select .cse164 .cse165) .cse166)) (= (select (select .cse167 .cse165) .cse166) 0)))))))) (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_37| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_37|) 0)) (forall ((|ULTIMATE.start_sll_append_~last~0#1.base| Int) (|ULTIMATE.start_sll_append_~last~0#1.offset| Int) (v_ArrVal_2001 (Array Int Int)) (v_ArrVal_2000 (Array Int Int))) (let ((.cse177 (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_37| v_ArrVal_2000)) (.cse183 (+ |ULTIMATE.start_sll_append_~last~0#1.offset| 4))) (let ((.cse182 (store .cse177 |ULTIMATE.start_sll_append_~last~0#1.base| (store (select .cse177 |ULTIMATE.start_sll_append_~last~0#1.base|) .cse183 0))) (.cse181 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_37| v_ArrVal_2001))) (let ((.cse178 (select (select (store .cse181 |ULTIMATE.start_sll_append_~last~0#1.base| (store (select .cse181 |ULTIMATE.start_sll_append_~last~0#1.base|) .cse183 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_37|)) .cse10) .cse11)) (.cse179 (+ (select (select .cse182 .cse10) .cse11) 4))) (or (forall ((v_prenex_29 Int) (v_prenex_30 Int)) (let ((.cse173 (select .cse181 v_prenex_29)) (.cse171 (select .cse177 v_prenex_29)) (.cse172 (+ v_prenex_30 4))) (let ((.cse174 (store .cse177 v_prenex_29 (store .cse171 .cse172 0))) (.cse180 (store .cse181 v_prenex_29 (store .cse173 .cse172 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_37|)))) (let ((.cse175 (select (select .cse180 .cse10) .cse11)) (.cse176 (+ (select (select .cse174 .cse10) .cse11) 4))) (let ((.cse170 (select (select .cse180 .cse175) .cse176))) (or (= .cse170 0) (not (= (select .cse171 .cse172) 0)) (not (= (select .cse173 .cse172) 0)) (= (select (select .cse174 .cse175) .cse176) (select (select .cse177 .cse178) .cse179)) (not (= .cse170 v_prenex_29)))))))) (= (select (select .cse182 .cse178) .cse179) 0)))))))) (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_37| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_37|) 0)) (forall ((|ULTIMATE.start_sll_append_~last~0#1.base| Int) (|ULTIMATE.start_sll_append_~last~0#1.offset| Int) (v_ArrVal_2001 (Array Int Int)) (v_ArrVal_2000 (Array Int Int))) (let ((.cse192 (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_37| v_ArrVal_2000))) (let ((.cse190 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_37| v_ArrVal_2001)) (.cse193 (select .cse192 |ULTIMATE.start_sll_append_~last~0#1.base|)) (.cse185 (+ |ULTIMATE.start_sll_append_~last~0#1.offset| 4))) (let ((.cse186 (store .cse192 |ULTIMATE.start_sll_append_~last~0#1.base| (store .cse193 .cse185 0))) (.cse184 (select .cse190 |ULTIMATE.start_sll_append_~last~0#1.base|))) (let ((.cse187 (select (select (store .cse190 |ULTIMATE.start_sll_append_~last~0#1.base| (store .cse184 .cse185 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_37|)) .cse10) .cse11)) (.cse188 (+ (select (select .cse186 .cse10) .cse11) 4))) (or (not (= (select .cse184 .cse185) 0)) (= (select (select .cse186 .cse187) .cse188) 0) (forall ((v_prenex_29 Int) (v_prenex_30 Int)) (= (let ((.cse191 (+ v_prenex_30 4))) (let ((.cse189 (store .cse192 v_prenex_29 (store (select .cse192 v_prenex_29) .cse191 0)))) (select (select .cse189 (select (select (store .cse190 v_prenex_29 (store (select .cse190 v_prenex_29) .cse191 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_37|)) .cse10) .cse11)) (+ (select (select .cse189 .cse10) .cse11) 4)))) (select (select .cse192 .cse187) .cse188))) (not (= (select .cse193 .cse185) 0)))))))))) (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_37| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_37|) 0)) (forall ((v_prenex_29 Int) (v_prenex_30 Int) (v_ArrVal_2000 (Array Int Int))) (let ((.cse201 (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_37| v_ArrVal_2000))) (let ((.cse194 (select .cse201 v_prenex_29)) (.cse195 (+ v_prenex_30 4))) (or (not (= (select .cse194 .cse195) 0)) (forall ((|ULTIMATE.start_sll_append_~last~0#1.base| Int) (|ULTIMATE.start_sll_append_~last~0#1.offset| Int) (v_ArrVal_2001 (Array Int Int))) (let ((.cse199 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_37| v_ArrVal_2001))) (let ((.cse197 (select .cse199 v_prenex_29))) (let ((.cse196 (select (let ((.cse202 (store .cse199 v_prenex_29 (store .cse197 .cse195 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_37|)))) (select .cse202 (select (select .cse202 .cse10) .cse11))) (+ (select (select (store .cse201 v_prenex_29 (store .cse194 .cse195 0)) .cse10) .cse11) 4)))) (or (= .cse196 0) (not (= (select .cse197 .cse195) 0)) (not (= .cse196 v_prenex_29)) (= .cse196 (let ((.cse200 (+ |ULTIMATE.start_sll_append_~last~0#1.offset| 4))) (select (let ((.cse198 (store .cse199 |ULTIMATE.start_sll_append_~last~0#1.base| (store (select .cse199 |ULTIMATE.start_sll_append_~last~0#1.base|) .cse200 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_37|)))) (select .cse198 (select (select .cse198 .cse10) .cse11))) (+ (select (select (store .cse201 |ULTIMATE.start_sll_append_~last~0#1.base| (store (select .cse201 |ULTIMATE.start_sll_append_~last~0#1.base|) .cse200 0)) .cse10) .cse11) 4))))))))))))))) (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_37| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_37|) 0)) (forall ((v_prenex_29 Int) (|ULTIMATE.start_sll_append_~last~0#1.base| Int) (|ULTIMATE.start_sll_append_~last~0#1.offset| Int) (v_prenex_30 Int) (v_ArrVal_2001 (Array Int Int)) (v_ArrVal_2000 (Array Int Int))) (let ((.cse207 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_37| v_ArrVal_2001)) (.cse203 (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_37| v_ArrVal_2000))) (let ((.cse210 (select .cse203 v_prenex_29)) (.cse212 (select .cse207 v_prenex_29)) (.cse211 (+ v_prenex_30 4))) (let ((.cse204 (select (select (store .cse207 v_prenex_29 (store .cse212 .cse211 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_37|)) .cse10) .cse11)) (.cse205 (+ (select (select (store .cse203 v_prenex_29 (store .cse210 .cse211 0)) .cse10) .cse11) 4))) (let ((.cse209 (select (select .cse207 .cse204) .cse205))) (or (= (select (select .cse203 .cse204) .cse205) (let ((.cse208 (+ |ULTIMATE.start_sll_append_~last~0#1.offset| 4))) (let ((.cse206 (store .cse203 |ULTIMATE.start_sll_append_~last~0#1.base| (store (select .cse203 |ULTIMATE.start_sll_append_~last~0#1.base|) .cse208 0)))) (select (select .cse206 (select (select (store .cse207 |ULTIMATE.start_sll_append_~last~0#1.base| (store (select .cse207 |ULTIMATE.start_sll_append_~last~0#1.base|) .cse208 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_37|)) .cse10) .cse11)) (+ (select (select .cse206 .cse10) .cse11) 4))))) (= .cse209 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_37|) (= .cse209 0) (not (= (select .cse210 .cse211) 0)) (not (= (select .cse212 .cse211) 0)))))))))) (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_37| Int)) (or (forall ((v_prenex_29 Int) (v_prenex_30 Int) (v_ArrVal_2001 (Array Int Int)) (v_ArrVal_2000 (Array Int Int))) (let ((.cse219 (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_37| v_ArrVal_2000)) (.cse224 (+ v_prenex_30 4))) (let ((.cse213 (store .cse219 v_prenex_29 (store (select .cse219 v_prenex_29) .cse224 0))) (.cse220 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_37| v_ArrVal_2001))) (let ((.cse214 (select (select (store .cse220 v_prenex_29 (store (select .cse220 v_prenex_29) .cse224 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_37|)) .cse10) .cse11)) (.cse215 (+ (select (select .cse213 .cse10) .cse11) 4))) (or (= (select (select .cse213 .cse214) .cse215) 0) (forall ((|ULTIMATE.start_sll_append_~last~0#1.base| Int) (|ULTIMATE.start_sll_append_~last~0#1.offset| Int)) (let ((.cse223 (select .cse219 |ULTIMATE.start_sll_append_~last~0#1.base|)) (.cse216 (select .cse220 |ULTIMATE.start_sll_append_~last~0#1.base|)) (.cse217 (+ |ULTIMATE.start_sll_append_~last~0#1.offset| 4))) (let ((.cse221 (select (select (store .cse220 |ULTIMATE.start_sll_append_~last~0#1.base| (store .cse216 .cse217 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_37|)) .cse10) .cse11)) (.cse222 (+ (select (select (store .cse219 |ULTIMATE.start_sll_append_~last~0#1.base| (store .cse223 .cse217 0)) .cse10) .cse11) 4))) (let ((.cse218 (select (select .cse219 .cse221) .cse222))) (or (not (= (select .cse216 .cse217) 0)) (= .cse218 0) (= (select (select .cse219 .cse214) .cse215) .cse218) (= |v_ULTIMATE.start_sll_append_#t~ret7#1.base_37| (select (select .cse220 .cse221) .cse222)) (not (= (select .cse223 .cse217) 0)))))))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_37|) 0)))) (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_37| Int)) (or (forall ((v_prenex_29 Int) (v_prenex_30 Int) (v_ArrVal_2001 (Array Int Int)) (v_ArrVal_2000 (Array Int Int))) (let ((.cse227 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_37| v_ArrVal_2001)) (.cse229 (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_37| v_ArrVal_2000))) (let ((.cse232 (select .cse229 v_prenex_29)) (.cse234 (select .cse227 v_prenex_29)) (.cse233 (+ v_prenex_30 4))) (let ((.cse230 (select (select (store .cse227 v_prenex_29 (store .cse234 .cse233 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_37|)) .cse10) .cse11)) (.cse231 (+ (select (select (store .cse229 v_prenex_29 (store .cse232 .cse233 0)) .cse10) .cse11) 4))) (let ((.cse225 (select (select .cse229 .cse230) .cse231))) (or (forall ((|ULTIMATE.start_sll_append_~last~0#1.base| Int) (|ULTIMATE.start_sll_append_~last~0#1.offset| Int)) (= .cse225 (let ((.cse228 (+ |ULTIMATE.start_sll_append_~last~0#1.offset| 4))) (let ((.cse226 (store .cse229 |ULTIMATE.start_sll_append_~last~0#1.base| (store (select .cse229 |ULTIMATE.start_sll_append_~last~0#1.base|) .cse228 0)))) (select (select .cse226 (select (select (store .cse227 |ULTIMATE.start_sll_append_~last~0#1.base| (store (select .cse227 |ULTIMATE.start_sll_append_~last~0#1.base|) .cse228 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_37|)) .cse10) .cse11)) (+ (select (select .cse226 .cse10) .cse11) 4)))))) (= (select (select .cse227 .cse230) .cse231) 0) (not (= (select .cse232 .cse233) 0)) (not (= (select .cse234 .cse233) 0)) (= .cse225 0))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_37|) 0)))))) is different from true [2024-11-19 10:23:08,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [889113370] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 10:23:08,225 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 10:23:08,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 30] total 46 [2024-11-19 10:23:08,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273958446] [2024-11-19 10:23:08,225 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 10:23:08,225 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2024-11-19 10:23:08,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:23:08,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2024-11-19 10:23:08,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=1382, Unknown=43, NotChecked=1860, Total=3422 [2024-11-19 10:23:08,227 INFO L87 Difference]: Start difference. First operand 360 states and 394 transitions. Second operand has 46 states, 44 states have (on average 2.090909090909091) internal successors, (92), 39 states have internal predecessors, (92), 6 states have call successors, (6), 3 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 10:23:08,669 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0)) (.cse0 (= (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0))) (and .cse0 (exists ((|v_old(#valid)_AFTER_CALL_46| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_46| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (= |c_#valid| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_46| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_46| .cse1 (select |c_#valid| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_46| |c_ULTIMATE.start_sll_create_#t~ret4#1.base|) 0))) (not (= |c_ULTIMATE.start_sll_create_#t~ret4#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (not (= |c_ULTIMATE.start_sll_create_~head~0#1.base| 0)) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) .cse2 (<= |c_ULTIMATE.start_main_~data~0#1| 1) (or (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| |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| .cse3 (select |c_#memory_$Pointer$#2.offset| .cse3))) (= .cse3 |c_ULTIMATE.start_sll_create_#t~ret4#1.base|)))) .cse2) (or .cse0 (exists ((|v_#memory_$Pointer$#2.base_BEFORE_CALL_6| (Array Int (Array Int Int)))) (let ((.cse4 (@diff |v_#memory_$Pointer$#2.base_BEFORE_CALL_6| |c_#memory_$Pointer$#2.base|))) (and (= (store |v_#memory_$Pointer$#2.base_BEFORE_CALL_6| .cse4 (select |c_#memory_$Pointer$#2.base| .cse4)) |c_#memory_$Pointer$#2.base|) (= .cse4 |c_ULTIMATE.start_sll_create_#t~ret4#1.base|) (= (select (select |v_#memory_$Pointer$#2.base_BEFORE_CALL_6| |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 10:23:08,675 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0)) (.cse0 (= (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0))) (and .cse0 (exists ((|v_old(#valid)_AFTER_CALL_46| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_46| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (= |c_#valid| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_46| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_46| .cse1 (select |c_#valid| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_46| |c_ULTIMATE.start_sll_create_#t~ret4#1.base|) 0))) (not (= |c_ULTIMATE.start_sll_create_#t~ret4#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (not (= |c_ULTIMATE.start_sll_create_~head~0#1.base| 0)) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) .cse2 (<= |c_ULTIMATE.start_main_~data~0#1| 1) (or (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| |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| .cse3 (select |c_#memory_$Pointer$#2.offset| .cse3))) (= .cse3 |c_ULTIMATE.start_sll_create_#t~ret4#1.base|)))) .cse2) (or .cse0 (exists ((|v_#memory_$Pointer$#2.base_BEFORE_CALL_6| (Array Int (Array Int Int)))) (let ((.cse4 (@diff |v_#memory_$Pointer$#2.base_BEFORE_CALL_6| |c_#memory_$Pointer$#2.base|))) (and (= (store |v_#memory_$Pointer$#2.base_BEFORE_CALL_6| .cse4 (select |c_#memory_$Pointer$#2.base| .cse4)) |c_#memory_$Pointer$#2.base|) (= .cse4 |c_ULTIMATE.start_sll_create_#t~ret4#1.base|) (= (select (select |v_#memory_$Pointer$#2.base_BEFORE_CALL_6| |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 10:23:08,683 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 ((.cse6 (= (select (select |c_#memory_$Pointer$#2.base| .cse1) 4) 0)) (.cse2 (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0)) (.cse3 (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) 4) 0))) (and (or (exists ((|v_#memory_$Pointer$#2.offset_116| (Array Int (Array Int Int)))) (and (= |c_#memory_$Pointer$#2.offset| (store |v_#memory_$Pointer$#2.offset_116| |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select |v_#memory_$Pointer$#2.offset_116| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4 0))) (exists ((|v_#memory_$Pointer$#2.offset_BEFORE_CALL_4| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_$Pointer$#2.offset_BEFORE_CALL_4| |v_#memory_$Pointer$#2.offset_116|))) (and (= .cse0 |c_ULTIMATE.start_sll_create_~head~0#1.base|) (= (store |v_#memory_$Pointer$#2.offset_BEFORE_CALL_4| .cse0 (select |v_#memory_$Pointer$#2.offset_116| .cse0)) |v_#memory_$Pointer$#2.offset_116|) (= (select (select |v_#memory_$Pointer$#2.offset_BEFORE_CALL_4| .cse1) 4) 0)))))) (and .cse2 .cse3)) (exists ((|v_old(#valid)_AFTER_CALL_46| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_46| .cse1) 1) (= |c_#valid| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_46| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_46| .cse4 (select |c_#valid| .cse4)))) (= (select |v_old(#valid)_AFTER_CALL_46| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0))) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (or (exists ((|v_#memory_$Pointer$#2.base_120| (Array Int (Array Int Int)))) (and (exists ((|v_#memory_$Pointer$#2.base_BEFORE_CALL_6| (Array Int (Array Int Int)))) (let ((.cse5 (@diff |v_#memory_$Pointer$#2.base_BEFORE_CALL_6| |v_#memory_$Pointer$#2.base_120|))) (and (= (store |v_#memory_$Pointer$#2.base_BEFORE_CALL_6| .cse5 (select |v_#memory_$Pointer$#2.base_120| .cse5)) |v_#memory_$Pointer$#2.base_120|) (= |c_ULTIMATE.start_sll_create_~head~0#1.base| .cse5) (= (select (select |v_#memory_$Pointer$#2.base_BEFORE_CALL_6| .cse1) 4) 0)))) (= |c_#memory_$Pointer$#2.base| (store |v_#memory_$Pointer$#2.base_120| |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select |v_#memory_$Pointer$#2.base_120| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4 .cse1))))) (= .cse1 |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse6) .cse6 .cse2 (<= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select |c_#valid| .cse1) 1) (not (= .cse1 0)) .cse3 (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0)))) is different from false [2024-11-19 10:23:08,690 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 ((.cse6 (= (select (select |c_#memory_$Pointer$#2.base| .cse1) 4) 0)) (.cse2 (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0)) (.cse3 (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) 4) 0))) (and (or (exists ((|v_#memory_$Pointer$#2.offset_116| (Array Int (Array Int Int)))) (and (= |c_#memory_$Pointer$#2.offset| (store |v_#memory_$Pointer$#2.offset_116| |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select |v_#memory_$Pointer$#2.offset_116| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4 0))) (exists ((|v_#memory_$Pointer$#2.offset_BEFORE_CALL_4| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_$Pointer$#2.offset_BEFORE_CALL_4| |v_#memory_$Pointer$#2.offset_116|))) (and (= .cse0 |c_ULTIMATE.start_sll_create_~head~0#1.base|) (= (store |v_#memory_$Pointer$#2.offset_BEFORE_CALL_4| .cse0 (select |v_#memory_$Pointer$#2.offset_116| .cse0)) |v_#memory_$Pointer$#2.offset_116|) (= (select (select |v_#memory_$Pointer$#2.offset_BEFORE_CALL_4| .cse1) 4) 0)))))) (and .cse2 .cse3)) (exists ((|v_old(#valid)_AFTER_CALL_46| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_46| .cse1) 1) (= |c_#valid| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_46| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_46| .cse4 (select |c_#valid| .cse4)))) (= (select |v_old(#valid)_AFTER_CALL_46| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0))) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (or (exists ((|v_#memory_$Pointer$#2.base_120| (Array Int (Array Int Int)))) (and (exists ((|v_#memory_$Pointer$#2.base_BEFORE_CALL_6| (Array Int (Array Int Int)))) (let ((.cse5 (@diff |v_#memory_$Pointer$#2.base_BEFORE_CALL_6| |v_#memory_$Pointer$#2.base_120|))) (and (= (store |v_#memory_$Pointer$#2.base_BEFORE_CALL_6| .cse5 (select |v_#memory_$Pointer$#2.base_120| .cse5)) |v_#memory_$Pointer$#2.base_120|) (= |c_ULTIMATE.start_sll_create_~head~0#1.base| .cse5) (= (select (select |v_#memory_$Pointer$#2.base_BEFORE_CALL_6| .cse1) 4) 0)))) (= |c_#memory_$Pointer$#2.base| (store |v_#memory_$Pointer$#2.base_120| |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select |v_#memory_$Pointer$#2.base_120| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4 .cse1))))) (= .cse1 |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse6) .cse6 .cse2 (<= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select |c_#valid| .cse1) 1) (not (= .cse1 0)) .cse3 (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0)))) is different from true [2024-11-19 10:23:08,696 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 ((.cse2 (= (select (select |c_#memory_$Pointer$#2.base| .cse0) 4) 0))) (and (exists ((|v_old(#valid)_AFTER_CALL_46| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_46| .cse0) 1) (= |c_#valid| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_46| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_46| .cse1 (select |c_#valid| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_46| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0))) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) .cse2 (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0) (<= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select |c_#valid| .cse0) 1) (not (= .cse0 0)) (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0) (or (= .cse0 |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse2) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0)))) is different from false [2024-11-19 10:23:08,699 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 ((.cse2 (= (select (select |c_#memory_$Pointer$#2.base| .cse0) 4) 0))) (and (exists ((|v_old(#valid)_AFTER_CALL_46| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_46| .cse0) 1) (= |c_#valid| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_46| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_46| .cse1 (select |c_#valid| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_46| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0))) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) .cse2 (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0) (<= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select |c_#valid| .cse0) 1) (not (= .cse0 0)) (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0) (or (= .cse0 |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse2) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0)))) is different from true [2024-11-19 10:23:08,706 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 ((.cse1 (= (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) .cse1 (or (= |c_ULTIMATE.start_sll_create_#res#1.base| .cse0) .cse1) (= |c_ULTIMATE.start_sll_create_#res#1.offset| 0) (not (= .cse0 0)) (<= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_old(#valid)_AFTER_CALL_46| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_46| .cse0) 1) (= |c_#valid| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_46| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_46| .cse2 (select |c_#valid| .cse2)))) (= (select |v_old(#valid)_AFTER_CALL_46| |c_ULTIMATE.start_sll_create_#res#1.base|) 0))) (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0)))) is different from false [2024-11-19 10:23:08,710 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 ((.cse1 (= (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) .cse1 (or (= |c_ULTIMATE.start_sll_create_#res#1.base| .cse0) .cse1) (= |c_ULTIMATE.start_sll_create_#res#1.offset| 0) (not (= .cse0 0)) (<= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_old(#valid)_AFTER_CALL_46| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_46| .cse0) 1) (= |c_#valid| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_46| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_46| .cse2 (select |c_#valid| .cse2)))) (= (select |v_old(#valid)_AFTER_CALL_46| |c_ULTIMATE.start_sll_create_#res#1.base|) 0))) (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0)))) is different from true [2024-11-19 10:23:08,718 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| .cse1) 4)) (.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse3) 4))) (and (not (= .cse0 0)) (= |c_ULTIMATE.start_sll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) 4) 0) (= (select |c_#valid| .cse2) 1) (= (select (select |c_#memory_$Pointer$#2.offset| .cse3) 4) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0) (or (= .cse0 .cse1) (= (select (select |c_#memory_$Pointer$#2.base| .cse0) 4) 0)) (= (select |c_#valid| .cse3) 1) (exists ((|v_old(#valid)_AFTER_CALL_46| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_46| .cse1) 0) (= (select |v_old(#valid)_AFTER_CALL_46| .cse0) 1) (= |c_#valid| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_46| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_46| .cse4 (select |c_#valid| .cse4)))))) (= (select (select |c_#memory_$Pointer$#2.base| .cse2) 4) 0) (<= 5 |c_ULTIMATE.start_sll_append_~data#1|) (<= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_sll_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= (select |c_#valid| .cse1) 1) (= (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 10:23:08,722 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| .cse1) 4)) (.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse3) 4))) (and (not (= .cse0 0)) (= |c_ULTIMATE.start_sll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) 4) 0) (= (select |c_#valid| .cse2) 1) (= (select (select |c_#memory_$Pointer$#2.offset| .cse3) 4) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0) (or (= .cse0 .cse1) (= (select (select |c_#memory_$Pointer$#2.base| .cse0) 4) 0)) (= (select |c_#valid| .cse3) 1) (exists ((|v_old(#valid)_AFTER_CALL_46| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_46| .cse1) 0) (= (select |v_old(#valid)_AFTER_CALL_46| .cse0) 1) (= |c_#valid| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_46| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_46| .cse4 (select |c_#valid| .cse4)))))) (= (select (select |c_#memory_$Pointer$#2.base| .cse2) 4) 0) (<= 5 |c_ULTIMATE.start_sll_append_~data#1|) (<= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_sll_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= (select |c_#valid| .cse1) 1) (= (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 10:23:08,729 WARN L851 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimIndex_3 Int) (|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_46| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_7| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_3| Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_3|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_7|))) (and (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_46| |v_#valid_BEFORE_CALL_9|))) (store |v_old(#valid)_AFTER_CALL_46| .cse0 (select |v_#valid_BEFORE_CALL_9| .cse0))) |v_#valid_BEFORE_CALL_9|) (not (= v_arrayElimIndex_3 0)) (= (select |v_#valid_BEFORE_CALL_9| .cse1) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_3|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_7|) 0) (= (select |v_old(#valid)_AFTER_CALL_46| v_arrayElimIndex_3) 1) (= (select |v_old(#valid)_AFTER_CALL_46| .cse1) 0)))) (<= |c_node_create_#in~data#1| |c_node_create_~data#1|) (not (= |c_node_create_~temp~0#1.base| 0)) (= |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_#valid| |c_node_create_~temp~0#1.base|) 1) (= (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 10:23:08,733 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimIndex_3 Int) (|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_46| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_7| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_3| Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_3|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_7|))) (and (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_46| |v_#valid_BEFORE_CALL_9|))) (store |v_old(#valid)_AFTER_CALL_46| .cse0 (select |v_#valid_BEFORE_CALL_9| .cse0))) |v_#valid_BEFORE_CALL_9|) (not (= v_arrayElimIndex_3 0)) (= (select |v_#valid_BEFORE_CALL_9| .cse1) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_3|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_7|) 0) (= (select |v_old(#valid)_AFTER_CALL_46| v_arrayElimIndex_3) 1) (= (select |v_old(#valid)_AFTER_CALL_46| .cse1) 0)))) (<= |c_node_create_#in~data#1| |c_node_create_~data#1|) (not (= |c_node_create_~temp~0#1.base| 0)) (= |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_#valid| |c_node_create_~temp~0#1.base|) 1) (= (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 10:23:08,746 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 (= |c_node_create_#res#1.offset| 0) (exists ((v_arrayElimIndex_3 Int) (|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_46| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_7| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_3| Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_3|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_7|))) (and (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_46| |v_#valid_BEFORE_CALL_9|))) (store |v_old(#valid)_AFTER_CALL_46| .cse0 (select |v_#valid_BEFORE_CALL_9| .cse0))) |v_#valid_BEFORE_CALL_9|) (not (= v_arrayElimIndex_3 0)) (= (select |v_#valid_BEFORE_CALL_9| .cse1) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_3|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_7|) 0) (= (select |v_old(#valid)_AFTER_CALL_46| v_arrayElimIndex_3) 1) (= (select |v_old(#valid)_AFTER_CALL_46| .cse1) 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|) (not (= |c_node_create_#res#1.base| 0)) (= (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_node_create_#in~data#1| (select (select |c_#memory_int#2| |c_node_create_#res#1.base|) 0)) (= |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 10:23:08,753 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 (= |c_node_create_#res#1.offset| 0) (exists ((v_arrayElimIndex_3 Int) (|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_46| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_7| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_3| Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_3|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_7|))) (and (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_46| |v_#valid_BEFORE_CALL_9|))) (store |v_old(#valid)_AFTER_CALL_46| .cse0 (select |v_#valid_BEFORE_CALL_9| .cse0))) |v_#valid_BEFORE_CALL_9|) (not (= v_arrayElimIndex_3 0)) (= (select |v_#valid_BEFORE_CALL_9| .cse1) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_3|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_7|) 0) (= (select |v_old(#valid)_AFTER_CALL_46| v_arrayElimIndex_3) 1) (= (select |v_old(#valid)_AFTER_CALL_46| .cse1) 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|) (not (= |c_node_create_#res#1.base| 0)) (= (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_node_create_#in~data#1| (select (select |c_#memory_int#2| |c_node_create_#res#1.base|) 0)) (= |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 10:23:08,765 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~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 ((.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse3) 4)) (.cse6 (select (select |c_#memory_$Pointer$#2.base| .cse5) 4))) (and (exists ((v_arrayElimIndex_3 Int) (|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_46| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_7| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_3| Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_3|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_7|))) (and (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_46| |v_#valid_BEFORE_CALL_9|))) (store |v_old(#valid)_AFTER_CALL_46| .cse0 (select |v_#valid_BEFORE_CALL_9| .cse0))) |v_#valid_BEFORE_CALL_9|) (not (= v_arrayElimIndex_3 0)) (= (select |v_#valid_BEFORE_CALL_9| .cse1) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_3|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_7|) 0) (= (select |v_old(#valid)_AFTER_CALL_46| v_arrayElimIndex_3) 1) (= (select |v_old(#valid)_AFTER_CALL_46| .cse1) 0)))) (not (= .cse2 0)) (= |c_ULTIMATE.start_sll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0) (exists ((|v_old(#valid)_AFTER_CALL_47| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_48| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_48| .cse3) 0) (= (select |v_old(#valid)_AFTER_CALL_48| .cse2) 1) (= |v_old(#valid)_AFTER_CALL_47| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_48| |v_old(#valid)_AFTER_CALL_47|))) (store |v_old(#valid)_AFTER_CALL_48| .cse4 (select |v_old(#valid)_AFTER_CALL_47| .cse4)))) (= (select |v_old(#valid)_AFTER_CALL_47| |c_ULTIMATE.start_sll_append_#t~ret7#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_47| .cse3) 1))) (= |c_ULTIMATE.start_sll_append_#t~ret7#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse5) 4) 0) (or (= .cse2 .cse3) (= (select (select |c_#memory_$Pointer$#2.base| .cse2) 4) 0)) (= (select (select |c_#memory_$Pointer$#2.base| .cse6) 4) 0) (<= 5 (select (select |c_#memory_int#2| |c_ULTIMATE.start_sll_append_#t~ret7#1.base|) 0)) (<= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_sll_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (let ((.cse7 (or (= (select (select |c_#memory_$Pointer$#2.offset| .cse2) 4) 0) (= |c_ULTIMATE.start_sll_append_#t~ret7#1.base| .cse2)))) (or (and (= |c_ULTIMATE.start_sll_append_#t~ret7#1.base| .cse3) .cse7) (and (= (select (select |c_#memory_$Pointer$#2.offset| .cse3) 4) 0) .cse7))) (= (select (select |c_#memory_$Pointer$#2.offset| .cse6) 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 10:23:08,771 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse5 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~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 ((.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse3) 4)) (.cse6 (select (select |c_#memory_$Pointer$#2.base| .cse5) 4))) (and (exists ((v_arrayElimIndex_3 Int) (|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_46| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_7| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_3| Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_3|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_7|))) (and (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_46| |v_#valid_BEFORE_CALL_9|))) (store |v_old(#valid)_AFTER_CALL_46| .cse0 (select |v_#valid_BEFORE_CALL_9| .cse0))) |v_#valid_BEFORE_CALL_9|) (not (= v_arrayElimIndex_3 0)) (= (select |v_#valid_BEFORE_CALL_9| .cse1) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_3|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_7|) 0) (= (select |v_old(#valid)_AFTER_CALL_46| v_arrayElimIndex_3) 1) (= (select |v_old(#valid)_AFTER_CALL_46| .cse1) 0)))) (not (= .cse2 0)) (= |c_ULTIMATE.start_sll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0) (exists ((|v_old(#valid)_AFTER_CALL_47| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_48| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_48| .cse3) 0) (= (select |v_old(#valid)_AFTER_CALL_48| .cse2) 1) (= |v_old(#valid)_AFTER_CALL_47| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_48| |v_old(#valid)_AFTER_CALL_47|))) (store |v_old(#valid)_AFTER_CALL_48| .cse4 (select |v_old(#valid)_AFTER_CALL_47| .cse4)))) (= (select |v_old(#valid)_AFTER_CALL_47| |c_ULTIMATE.start_sll_append_#t~ret7#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_47| .cse3) 1))) (= |c_ULTIMATE.start_sll_append_#t~ret7#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse5) 4) 0) (or (= .cse2 .cse3) (= (select (select |c_#memory_$Pointer$#2.base| .cse2) 4) 0)) (= (select (select |c_#memory_$Pointer$#2.base| .cse6) 4) 0) (<= 5 (select (select |c_#memory_int#2| |c_ULTIMATE.start_sll_append_#t~ret7#1.base|) 0)) (<= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_sll_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (let ((.cse7 (or (= (select (select |c_#memory_$Pointer$#2.offset| .cse2) 4) 0) (= |c_ULTIMATE.start_sll_append_#t~ret7#1.base| .cse2)))) (or (and (= |c_ULTIMATE.start_sll_append_#t~ret7#1.base| .cse3) .cse7) (and (= (select (select |c_#memory_$Pointer$#2.offset| .cse3) 4) 0) .cse7))) (= (select (select |c_#memory_$Pointer$#2.offset| .cse6) 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 10:23:08,784 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (.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)) (.cse5 (select (select |c_#memory_$Pointer$#2.base| .cse3) 4))) (and (exists ((v_arrayElimIndex_3 Int) (|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_46| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_7| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_3| Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_3|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_7|))) (and (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_46| |v_#valid_BEFORE_CALL_9|))) (store |v_old(#valid)_AFTER_CALL_46| .cse0 (select |v_#valid_BEFORE_CALL_9| .cse0))) |v_#valid_BEFORE_CALL_9|) (not (= v_arrayElimIndex_3 0)) (= (select |v_#valid_BEFORE_CALL_9| .cse1) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_3|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_7|) 0) (= (select |v_old(#valid)_AFTER_CALL_46| v_arrayElimIndex_3) 1) (= (select |v_old(#valid)_AFTER_CALL_46| .cse1) 0)))) (not (= .cse2 0)) (= |c_ULTIMATE.start_sll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0) (<= 5 (select (select |c_#memory_int#2| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) 0)) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse3) 4) 0) (or (= .cse2 .cse4) (= (select (select |c_#memory_$Pointer$#2.base| .cse2) 4) 0)) (= (select (select |c_#memory_$Pointer$#2.base| .cse5) 4) 0) (<= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_sll_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (exists ((|v_old(#valid)_AFTER_CALL_47| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_48| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_48| .cse4) 0) (= (select |v_old(#valid)_AFTER_CALL_48| .cse2) 1) (= |v_old(#valid)_AFTER_CALL_47| (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_48| |v_old(#valid)_AFTER_CALL_47|))) (store |v_old(#valid)_AFTER_CALL_48| .cse6 (select |v_old(#valid)_AFTER_CALL_47| .cse6)))) (= (select |v_old(#valid)_AFTER_CALL_47| .cse4) 1) (= (select |v_old(#valid)_AFTER_CALL_47| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) 0))) (let ((.cse7 (or (= (select (select |c_#memory_$Pointer$#2.offset| .cse2) 4) 0) (= .cse2 |c_ULTIMATE.start_sll_append_~new_last~0#1.base|)))) (or (and (= (select (select |c_#memory_$Pointer$#2.offset| .cse4) 4) 0) .cse7) (and (= |c_ULTIMATE.start_sll_append_~new_last~0#1.base| .cse4) .cse7))) (= (select (select |c_#memory_$Pointer$#2.offset| .cse5) 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 10:23:08,790 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (.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)) (.cse5 (select (select |c_#memory_$Pointer$#2.base| .cse3) 4))) (and (exists ((v_arrayElimIndex_3 Int) (|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_46| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_7| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_3| Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_3|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_7|))) (and (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_46| |v_#valid_BEFORE_CALL_9|))) (store |v_old(#valid)_AFTER_CALL_46| .cse0 (select |v_#valid_BEFORE_CALL_9| .cse0))) |v_#valid_BEFORE_CALL_9|) (not (= v_arrayElimIndex_3 0)) (= (select |v_#valid_BEFORE_CALL_9| .cse1) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_3|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_7|) 0) (= (select |v_old(#valid)_AFTER_CALL_46| v_arrayElimIndex_3) 1) (= (select |v_old(#valid)_AFTER_CALL_46| .cse1) 0)))) (not (= .cse2 0)) (= |c_ULTIMATE.start_sll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0) (<= 5 (select (select |c_#memory_int#2| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) 0)) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse3) 4) 0) (or (= .cse2 .cse4) (= (select (select |c_#memory_$Pointer$#2.base| .cse2) 4) 0)) (= (select (select |c_#memory_$Pointer$#2.base| .cse5) 4) 0) (<= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_sll_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (exists ((|v_old(#valid)_AFTER_CALL_47| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_48| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_48| .cse4) 0) (= (select |v_old(#valid)_AFTER_CALL_48| .cse2) 1) (= |v_old(#valid)_AFTER_CALL_47| (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_48| |v_old(#valid)_AFTER_CALL_47|))) (store |v_old(#valid)_AFTER_CALL_48| .cse6 (select |v_old(#valid)_AFTER_CALL_47| .cse6)))) (= (select |v_old(#valid)_AFTER_CALL_47| .cse4) 1) (= (select |v_old(#valid)_AFTER_CALL_47| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) 0))) (let ((.cse7 (or (= (select (select |c_#memory_$Pointer$#2.offset| .cse2) 4) 0) (= .cse2 |c_ULTIMATE.start_sll_append_~new_last~0#1.base|)))) (or (and (= (select (select |c_#memory_$Pointer$#2.offset| .cse4) 4) 0) .cse7) (and (= |c_ULTIMATE.start_sll_append_~new_last~0#1.base| .cse4) .cse7))) (= (select (select |c_#memory_$Pointer$#2.offset| .cse5) 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 10:23:08,802 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| |c_ULTIMATE.start_sll_append_~last~0#1.base|) 4)) (.cse3 (select (select |c_#memory_$Pointer$#2.base| .cse4) 4))) (and (exists ((v_arrayElimIndex_3 Int) (|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_46| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_7| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_3| Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_3|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_7|))) (and (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_46| |v_#valid_BEFORE_CALL_9|))) (store |v_old(#valid)_AFTER_CALL_46| .cse0 (select |v_#valid_BEFORE_CALL_9| .cse0))) |v_#valid_BEFORE_CALL_9|) (not (= v_arrayElimIndex_3 0)) (= (select |v_#valid_BEFORE_CALL_9| .cse1) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_3|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_7|) 0) (= (select |v_old(#valid)_AFTER_CALL_46| v_arrayElimIndex_3) 1) (= (select |v_old(#valid)_AFTER_CALL_46| .cse1) 0)))) (= (select (select |c_#memory_$Pointer$#2.offset| .cse2) 4) 0) (not (= .cse3 0)) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base|) 4) 0) (<= 5 (select (select |c_#memory_int#2| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) 0)) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.offset| 0) (or (= .cse3 .cse4) (= (select (select |c_#memory_$Pointer$#2.base| .cse3) 4) 0)) (<= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.base| .cse2) 4) 0) (exists ((|v_old(#valid)_AFTER_CALL_47| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_48| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_48| .cse4) 0) (= (select |v_old(#valid)_AFTER_CALL_48| .cse3) 1) (= |v_old(#valid)_AFTER_CALL_47| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_48| |v_old(#valid)_AFTER_CALL_47|))) (store |v_old(#valid)_AFTER_CALL_48| .cse5 (select |v_old(#valid)_AFTER_CALL_47| .cse5)))) (= (select |v_old(#valid)_AFTER_CALL_47| .cse4) 1) (= (select |v_old(#valid)_AFTER_CALL_47| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) 0))) (let ((.cse6 (or (= (select (select |c_#memory_$Pointer$#2.offset| .cse3) 4) 0) (= .cse3 |c_ULTIMATE.start_sll_append_~new_last~0#1.base|)))) (or (and (= (select (select |c_#memory_$Pointer$#2.offset| .cse4) 4) 0) .cse6) (and (= |c_ULTIMATE.start_sll_append_~new_last~0#1.base| .cse4) .cse6))) (= (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 10:23:08,807 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| |c_ULTIMATE.start_sll_append_~last~0#1.base|) 4)) (.cse3 (select (select |c_#memory_$Pointer$#2.base| .cse4) 4))) (and (exists ((v_arrayElimIndex_3 Int) (|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_46| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_7| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_3| Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_3|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_7|))) (and (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_46| |v_#valid_BEFORE_CALL_9|))) (store |v_old(#valid)_AFTER_CALL_46| .cse0 (select |v_#valid_BEFORE_CALL_9| .cse0))) |v_#valid_BEFORE_CALL_9|) (not (= v_arrayElimIndex_3 0)) (= (select |v_#valid_BEFORE_CALL_9| .cse1) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_3|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_7|) 0) (= (select |v_old(#valid)_AFTER_CALL_46| v_arrayElimIndex_3) 1) (= (select |v_old(#valid)_AFTER_CALL_46| .cse1) 0)))) (= (select (select |c_#memory_$Pointer$#2.offset| .cse2) 4) 0) (not (= .cse3 0)) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base|) 4) 0) (<= 5 (select (select |c_#memory_int#2| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) 0)) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.offset| 0) (or (= .cse3 .cse4) (= (select (select |c_#memory_$Pointer$#2.base| .cse3) 4) 0)) (<= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.base| .cse2) 4) 0) (exists ((|v_old(#valid)_AFTER_CALL_47| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_48| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_48| .cse4) 0) (= (select |v_old(#valid)_AFTER_CALL_48| .cse3) 1) (= |v_old(#valid)_AFTER_CALL_47| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_48| |v_old(#valid)_AFTER_CALL_47|))) (store |v_old(#valid)_AFTER_CALL_48| .cse5 (select |v_old(#valid)_AFTER_CALL_47| .cse5)))) (= (select |v_old(#valid)_AFTER_CALL_47| .cse4) 1) (= (select |v_old(#valid)_AFTER_CALL_47| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) 0))) (let ((.cse6 (or (= (select (select |c_#memory_$Pointer$#2.offset| .cse3) 4) 0) (= .cse3 |c_ULTIMATE.start_sll_append_~new_last~0#1.base|)))) (or (and (= (select (select |c_#memory_$Pointer$#2.offset| .cse4) 4) 0) .cse6) (and (= |c_ULTIMATE.start_sll_append_~new_last~0#1.base| .cse4) .cse6))) (= (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 10:23:08,821 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse7 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse0 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_append_~last~0#1.base|))) (let ((.cse6 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base|)) (.cse1 (+ |c_ULTIMATE.start_sll_append_~last~0#1.offset| 4)) (.cse4 (select .cse0 4)) (.cse5 (select (select |c_#memory_$Pointer$#2.base| .cse7) 4))) (and (= (select .cse0 .cse1) |c_ULTIMATE.start_sll_append_#t~mem10#1.base|) (exists ((v_arrayElimIndex_3 Int) (|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_46| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_7| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_3| Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_3|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_7|))) (and (= (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_46| |v_#valid_BEFORE_CALL_9|))) (store |v_old(#valid)_AFTER_CALL_46| .cse2 (select |v_#valid_BEFORE_CALL_9| .cse2))) |v_#valid_BEFORE_CALL_9|) (not (= v_arrayElimIndex_3 0)) (= (select |v_#valid_BEFORE_CALL_9| .cse3) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_3|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_7|) 0) (= (select |v_old(#valid)_AFTER_CALL_46| v_arrayElimIndex_3) 1) (= (select |v_old(#valid)_AFTER_CALL_46| .cse3) 0)))) (= (select (select |c_#memory_$Pointer$#2.offset| .cse4) 4) 0) (not (= .cse5 0)) (= (select .cse6 4) 0) (<= 5 (select (select |c_#memory_int#2| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) 0)) (= (select .cse6 .cse1) |c_ULTIMATE.start_sll_append_#t~mem10#1.offset|) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.offset| 0) (or (= .cse5 .cse7) (= (select (select |c_#memory_$Pointer$#2.base| .cse5) 4) 0)) (= |c_ULTIMATE.start_sll_append_#t~mem10#1.offset| 0) (<= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.base| .cse4) 4) 0) (exists ((|v_old(#valid)_AFTER_CALL_47| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_48| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_48| .cse7) 0) (= (select |v_old(#valid)_AFTER_CALL_48| .cse5) 1) (= |v_old(#valid)_AFTER_CALL_47| (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_48| |v_old(#valid)_AFTER_CALL_47|))) (store |v_old(#valid)_AFTER_CALL_48| .cse8 (select |v_old(#valid)_AFTER_CALL_47| .cse8)))) (= (select |v_old(#valid)_AFTER_CALL_47| .cse7) 1) (= (select |v_old(#valid)_AFTER_CALL_47| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) 0))) (let ((.cse9 (or (= (select (select |c_#memory_$Pointer$#2.offset| .cse5) 4) 0) (= .cse5 |c_ULTIMATE.start_sll_append_~new_last~0#1.base|)))) (or (and (= (select (select |c_#memory_$Pointer$#2.offset| .cse7) 4) 0) .cse9) (and (= |c_ULTIMATE.start_sll_append_~new_last~0#1.base| .cse7) .cse9))) (= (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 10:23:08,827 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse7 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse0 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_append_~last~0#1.base|))) (let ((.cse6 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base|)) (.cse1 (+ |c_ULTIMATE.start_sll_append_~last~0#1.offset| 4)) (.cse4 (select .cse0 4)) (.cse5 (select (select |c_#memory_$Pointer$#2.base| .cse7) 4))) (and (= (select .cse0 .cse1) |c_ULTIMATE.start_sll_append_#t~mem10#1.base|) (exists ((v_arrayElimIndex_3 Int) (|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_46| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_7| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_3| Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_3|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_7|))) (and (= (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_46| |v_#valid_BEFORE_CALL_9|))) (store |v_old(#valid)_AFTER_CALL_46| .cse2 (select |v_#valid_BEFORE_CALL_9| .cse2))) |v_#valid_BEFORE_CALL_9|) (not (= v_arrayElimIndex_3 0)) (= (select |v_#valid_BEFORE_CALL_9| .cse3) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_3|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_7|) 0) (= (select |v_old(#valid)_AFTER_CALL_46| v_arrayElimIndex_3) 1) (= (select |v_old(#valid)_AFTER_CALL_46| .cse3) 0)))) (= (select (select |c_#memory_$Pointer$#2.offset| .cse4) 4) 0) (not (= .cse5 0)) (= (select .cse6 4) 0) (<= 5 (select (select |c_#memory_int#2| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) 0)) (= (select .cse6 .cse1) |c_ULTIMATE.start_sll_append_#t~mem10#1.offset|) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.offset| 0) (or (= .cse5 .cse7) (= (select (select |c_#memory_$Pointer$#2.base| .cse5) 4) 0)) (= |c_ULTIMATE.start_sll_append_#t~mem10#1.offset| 0) (<= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.base| .cse4) 4) 0) (exists ((|v_old(#valid)_AFTER_CALL_47| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_48| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_48| .cse7) 0) (= (select |v_old(#valid)_AFTER_CALL_48| .cse5) 1) (= |v_old(#valid)_AFTER_CALL_47| (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_48| |v_old(#valid)_AFTER_CALL_47|))) (store |v_old(#valid)_AFTER_CALL_48| .cse8 (select |v_old(#valid)_AFTER_CALL_47| .cse8)))) (= (select |v_old(#valid)_AFTER_CALL_47| .cse7) 1) (= (select |v_old(#valid)_AFTER_CALL_47| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) 0))) (let ((.cse9 (or (= (select (select |c_#memory_$Pointer$#2.offset| .cse5) 4) 0) (= .cse5 |c_ULTIMATE.start_sll_append_~new_last~0#1.base|)))) (or (and (= (select (select |c_#memory_$Pointer$#2.offset| .cse7) 4) 0) .cse9) (and (= |c_ULTIMATE.start_sll_append_~new_last~0#1.base| .cse7) .cse9))) (= (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 10:23:08,841 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 ((.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse3) 4))) (and (= (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_append_~last~0#1.base|) 4) 0) (exists ((v_arrayElimIndex_3 Int) (|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_46| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_7| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_3| Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_3|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_7|))) (and (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_46| |v_#valid_BEFORE_CALL_9|))) (store |v_old(#valid)_AFTER_CALL_46| .cse0 (select |v_#valid_BEFORE_CALL_9| .cse0))) |v_#valid_BEFORE_CALL_9|) (not (= v_arrayElimIndex_3 0)) (= (select |v_#valid_BEFORE_CALL_9| .cse1) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_3|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_7|) 0) (= (select |v_old(#valid)_AFTER_CALL_46| v_arrayElimIndex_3) 1) (= (select |v_old(#valid)_AFTER_CALL_46| .cse1) 0)))) (not (= .cse2 0)) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base|) 4) 0) (<= 5 (select (select |c_#memory_int#2| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) 0)) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.offset| 0) (or (= .cse2 .cse3) (= (select (select |c_#memory_$Pointer$#2.base| .cse2) 4) 0)) (<= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_47| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_48| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_48| .cse3) 0) (= (select |v_old(#valid)_AFTER_CALL_48| .cse2) 1) (= |v_old(#valid)_AFTER_CALL_47| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_48| |v_old(#valid)_AFTER_CALL_47|))) (store |v_old(#valid)_AFTER_CALL_48| .cse4 (select |v_old(#valid)_AFTER_CALL_47| .cse4)))) (= (select |v_old(#valid)_AFTER_CALL_47| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_47| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) 0))) (let ((.cse5 (or (= (select (select |c_#memory_$Pointer$#2.offset| .cse2) 4) 0) (= .cse2 |c_ULTIMATE.start_sll_append_~new_last~0#1.base|)))) (or (and (= (select (select |c_#memory_$Pointer$#2.offset| .cse3) 4) 0) .cse5) (and (= |c_ULTIMATE.start_sll_append_~new_last~0#1.base| .cse3) .cse5))) (= (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 10:23:08,846 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 ((.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse3) 4))) (and (= (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_append_~last~0#1.base|) 4) 0) (exists ((v_arrayElimIndex_3 Int) (|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_46| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_7| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_3| Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_3|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_7|))) (and (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_46| |v_#valid_BEFORE_CALL_9|))) (store |v_old(#valid)_AFTER_CALL_46| .cse0 (select |v_#valid_BEFORE_CALL_9| .cse0))) |v_#valid_BEFORE_CALL_9|) (not (= v_arrayElimIndex_3 0)) (= (select |v_#valid_BEFORE_CALL_9| .cse1) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_3|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_7|) 0) (= (select |v_old(#valid)_AFTER_CALL_46| v_arrayElimIndex_3) 1) (= (select |v_old(#valid)_AFTER_CALL_46| .cse1) 0)))) (not (= .cse2 0)) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base|) 4) 0) (<= 5 (select (select |c_#memory_int#2| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) 0)) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.offset| 0) (or (= .cse2 .cse3) (= (select (select |c_#memory_$Pointer$#2.base| .cse2) 4) 0)) (<= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_47| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_48| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_48| .cse3) 0) (= (select |v_old(#valid)_AFTER_CALL_48| .cse2) 1) (= |v_old(#valid)_AFTER_CALL_47| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_48| |v_old(#valid)_AFTER_CALL_47|))) (store |v_old(#valid)_AFTER_CALL_48| .cse4 (select |v_old(#valid)_AFTER_CALL_47| .cse4)))) (= (select |v_old(#valid)_AFTER_CALL_47| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_47| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) 0))) (let ((.cse5 (or (= (select (select |c_#memory_$Pointer$#2.offset| .cse2) 4) 0) (= .cse2 |c_ULTIMATE.start_sll_append_~new_last~0#1.base|)))) (or (and (= (select (select |c_#memory_$Pointer$#2.offset| .cse3) 4) 0) .cse5) (and (= |c_ULTIMATE.start_sll_append_~new_last~0#1.base| .cse3) .cse5))) (= (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 10:23:08,861 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 ((.cse0 (+ |c_ULTIMATE.start_sll_append_~last~0#1.offset| 4)) (.cse3 (select (select |c_#memory_$Pointer$#2.base| .cse4) 4))) (and (= (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_append_~last~0#1.base|) .cse0) |c_ULTIMATE.start_sll_append_#t~mem10#1.base|) (exists ((v_arrayElimIndex_3 Int) (|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_46| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_7| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_3| Int)) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_3|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_7|))) (and (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_46| |v_#valid_BEFORE_CALL_9|))) (store |v_old(#valid)_AFTER_CALL_46| .cse1 (select |v_#valid_BEFORE_CALL_9| .cse1))) |v_#valid_BEFORE_CALL_9|) (not (= v_arrayElimIndex_3 0)) (= (select |v_#valid_BEFORE_CALL_9| .cse2) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_3|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_7|) 0) (= (select |v_old(#valid)_AFTER_CALL_46| v_arrayElimIndex_3) 1) (= (select |v_old(#valid)_AFTER_CALL_46| .cse2) 0)))) (not (= .cse3 0)) (<= 5 (select (select |c_#memory_int#2| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) 0)) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base|) .cse0) |c_ULTIMATE.start_sll_append_#t~mem10#1.offset|) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.offset| 0) (= |c_ULTIMATE.start_sll_append_#t~mem10#1.base| 0) (or (= .cse3 .cse4) (= (select (select |c_#memory_$Pointer$#2.base| .cse3) 4) 0)) (= |c_ULTIMATE.start_sll_append_#t~mem10#1.offset| 0) (<= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_47| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_48| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_48| .cse4) 0) (= (select |v_old(#valid)_AFTER_CALL_48| .cse3) 1) (= |v_old(#valid)_AFTER_CALL_47| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_48| |v_old(#valid)_AFTER_CALL_47|))) (store |v_old(#valid)_AFTER_CALL_48| .cse5 (select |v_old(#valid)_AFTER_CALL_47| .cse5)))) (= (select |v_old(#valid)_AFTER_CALL_47| .cse4) 1) (= (select |v_old(#valid)_AFTER_CALL_47| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) 0))) (let ((.cse6 (or (= (select (select |c_#memory_$Pointer$#2.offset| .cse3) 4) 0) (= .cse3 |c_ULTIMATE.start_sll_append_~new_last~0#1.base|)))) (or (and (= (select (select |c_#memory_$Pointer$#2.offset| .cse4) 4) 0) .cse6) (and (= |c_ULTIMATE.start_sll_append_~new_last~0#1.base| .cse4) .cse6))) (= (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 10:23:08,867 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 ((.cse0 (+ |c_ULTIMATE.start_sll_append_~last~0#1.offset| 4)) (.cse3 (select (select |c_#memory_$Pointer$#2.base| .cse4) 4))) (and (= (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_append_~last~0#1.base|) .cse0) |c_ULTIMATE.start_sll_append_#t~mem10#1.base|) (exists ((v_arrayElimIndex_3 Int) (|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_46| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_7| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_3| Int)) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_3|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_7|))) (and (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_46| |v_#valid_BEFORE_CALL_9|))) (store |v_old(#valid)_AFTER_CALL_46| .cse1 (select |v_#valid_BEFORE_CALL_9| .cse1))) |v_#valid_BEFORE_CALL_9|) (not (= v_arrayElimIndex_3 0)) (= (select |v_#valid_BEFORE_CALL_9| .cse2) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_3|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_7|) 0) (= (select |v_old(#valid)_AFTER_CALL_46| v_arrayElimIndex_3) 1) (= (select |v_old(#valid)_AFTER_CALL_46| .cse2) 0)))) (not (= .cse3 0)) (<= 5 (select (select |c_#memory_int#2| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) 0)) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base|) .cse0) |c_ULTIMATE.start_sll_append_#t~mem10#1.offset|) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.offset| 0) (= |c_ULTIMATE.start_sll_append_#t~mem10#1.base| 0) (or (= .cse3 .cse4) (= (select (select |c_#memory_$Pointer$#2.base| .cse3) 4) 0)) (= |c_ULTIMATE.start_sll_append_#t~mem10#1.offset| 0) (<= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_47| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_48| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_48| .cse4) 0) (= (select |v_old(#valid)_AFTER_CALL_48| .cse3) 1) (= |v_old(#valid)_AFTER_CALL_47| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_48| |v_old(#valid)_AFTER_CALL_47|))) (store |v_old(#valid)_AFTER_CALL_48| .cse5 (select |v_old(#valid)_AFTER_CALL_47| .cse5)))) (= (select |v_old(#valid)_AFTER_CALL_47| .cse4) 1) (= (select |v_old(#valid)_AFTER_CALL_47| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) 0))) (let ((.cse6 (or (= (select (select |c_#memory_$Pointer$#2.offset| .cse3) 4) 0) (= .cse3 |c_ULTIMATE.start_sll_append_~new_last~0#1.base|)))) (or (and (= (select (select |c_#memory_$Pointer$#2.offset| .cse4) 4) 0) .cse6) (and (= |c_ULTIMATE.start_sll_append_~new_last~0#1.base| .cse4) .cse6))) (= (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 10:23:09,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:23:09,088 INFO L93 Difference]: Finished difference Result 706 states and 774 transitions. [2024-11-19 10:23:09,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-19 10:23:09,089 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 44 states have (on average 2.090909090909091) internal successors, (92), 39 states have internal predecessors, (92), 6 states have call successors, (6), 3 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 205 [2024-11-19 10:23:09,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:23:09,091 INFO L225 Difference]: With dead ends: 706 [2024-11-19 10:23:09,091 INFO L226 Difference]: Without dead ends: 366 [2024-11-19 10:23:09,092 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 415 GetRequests, 342 SyntacticMatches, 1 SemanticMatches, 72 ConstructedPredicates, 33 IntricatePredicates, 0 DeprecatedPredicates, 320 ImplicationChecksByTransitivity, 22.3s TimeCoverageRelationStatistics Valid=176, Invalid=1527, Unknown=69, NotChecked=3630, Total=5402 [2024-11-19 10:23:09,092 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 0 mSDsluCounter, 407 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 442 SdHoareTripleChecker+Invalid, 1934 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1697 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 10:23:09,092 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 442 Invalid, 1934 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 230 Invalid, 0 Unknown, 1697 Unchecked, 0.4s Time] [2024-11-19 10:23:09,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2024-11-19 10:23:09,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 366. [2024-11-19 10:23:09,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 366 states, 358 states have (on average 1.0977653631284916) internal successors, (393), 359 states have internal predecessors, (393), 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 10:23:09,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 401 transitions. [2024-11-19 10:23:09,107 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 401 transitions. Word has length 205 [2024-11-19 10:23:09,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:23:09,107 INFO L471 AbstractCegarLoop]: Abstraction has 366 states and 401 transitions. [2024-11-19 10:23:09,107 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 44 states have (on average 2.090909090909091) internal successors, (92), 39 states have internal predecessors, (92), 6 states have call successors, (6), 3 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 10:23:09,107 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 401 transitions. [2024-11-19 10:23:09,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2024-11-19 10:23:09,109 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:23:09,109 INFO L215 NwaCegarLoop]: trace histogram [32, 31, 31, 31, 31, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:23:09,129 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2024-11-19 10:23:09,309 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 10:23:09,310 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-19 10:23:09,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:23:09,310 INFO L85 PathProgramCache]: Analyzing trace with hash 1825966312, now seen corresponding path program 5 times [2024-11-19 10:23:09,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:23:09,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101622842] [2024-11-19 10:23:09,311 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-19 10:23:09,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:23:09,459 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 32 check-sat command(s) [2024-11-19 10:23:09,459 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 10:23:09,715 INFO L134 CoverageAnalysis]: Checked inductivity of 2444 backedges. 14 proven. 7 refuted. 0 times theorem prover too weak. 2423 trivial. 0 not checked. [2024-11-19 10:23:09,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:23:09,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101622842] [2024-11-19 10:23:09,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1101622842] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 10:23:09,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1898640435] [2024-11-19 10:23:09,716 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-19 10:23:09,716 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 10:23:09,716 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 10:23:09,717 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 10:23:09,718 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2024-11-19 10:23:10,246 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 32 check-sat command(s) [2024-11-19 10:23:10,246 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 10:23:10,251 INFO L255 TraceCheckSpWp]: Trace formula consists of 1152 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-19 10:23:10,255 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 10:23:10,346 INFO L134 CoverageAnalysis]: Checked inductivity of 2444 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 2403 trivial. 0 not checked. [2024-11-19 10:23:10,347 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 10:23:10,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1898640435] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:23:10,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 10:23:10,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 9 [2024-11-19 10:23:10,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886942044] [2024-11-19 10:23:10,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:23:10,348 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 10:23:10,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:23:10,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 10:23:10,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-19 10:23:10,348 INFO L87 Difference]: Start difference. First operand 366 states and 401 transitions. Second operand has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 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 10:23:10,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:23:10,397 INFO L93 Difference]: Finished difference Result 371 states and 405 transitions. [2024-11-19 10:23:10,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 10:23:10,398 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 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 216 [2024-11-19 10:23:10,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:23:10,398 INFO L225 Difference]: With dead ends: 371 [2024-11-19 10:23:10,398 INFO L226 Difference]: Without dead ends: 0 [2024-11-19 10:23:10,399 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 215 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-19 10:23:10,400 INFO L432 NwaCegarLoop]: 12 mSDtfsCounter, 0 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 10:23:10,401 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 50 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 10:23:10,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-19 10:23:10,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-19 10:23:10,401 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 10:23:10,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-19 10:23:10,402 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 216 [2024-11-19 10:23:10,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:23:10,402 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-19 10:23:10,402 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 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 10:23:10,402 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-19 10:23:10,402 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-19 10:23:10,405 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 8 remaining) [2024-11-19 10:23:10,406 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 8 remaining) [2024-11-19 10:23:10,406 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 8 remaining) [2024-11-19 10:23:10,406 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 8 remaining) [2024-11-19 10:23:10,406 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 8 remaining) [2024-11-19 10:23:10,406 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 8 remaining) [2024-11-19 10:23:10,406 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 8 remaining) [2024-11-19 10:23:10,407 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 8 remaining) [2024-11-19 10:23:10,426 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2024-11-19 10:23:10,607 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 10:23:10,610 INFO L407 BasicCegarLoop]: Path program histogram: [5, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:23:10,612 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-19 10:23:14,486 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-19 10:23:14,496 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 10:23:14,498 INFO L158 Benchmark]: Toolchain (without parser) took 78673.09ms. Allocated memory was 159.4MB in the beginning and 752.9MB in the end (delta: 593.5MB). Free memory was 87.0MB in the beginning and 434.5MB in the end (delta: -347.5MB). Peak memory consumption was 247.2MB. Max. memory is 16.1GB. [2024-11-19 10:23:14,499 INFO L158 Benchmark]: CDTParser took 1.06ms. Allocated memory is still 159.4MB. Free memory was 110.1MB in the beginning and 110.0MB in the end (delta: 114.2kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 10:23:14,499 INFO L158 Benchmark]: CACSL2BoogieTranslator took 512.38ms. Allocated memory was 159.4MB in the beginning and 207.6MB in the end (delta: 48.2MB). Free memory was 86.6MB in the beginning and 173.0MB in the end (delta: -86.3MB). Peak memory consumption was 23.2MB. Max. memory is 16.1GB. [2024-11-19 10:23:14,499 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.14ms. Allocated memory is still 207.6MB. Free memory was 173.0MB in the beginning and 170.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 10:23:14,499 INFO L158 Benchmark]: Boogie Preprocessor took 59.46ms. Allocated memory is still 207.6MB. Free memory was 170.9MB in the beginning and 167.7MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 10:23:14,499 INFO L158 Benchmark]: RCFGBuilder took 568.21ms. Allocated memory is still 207.6MB. Free memory was 167.7MB in the beginning and 147.8MB in the end (delta: 19.9MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-11-19 10:23:14,500 INFO L158 Benchmark]: TraceAbstraction took 77473.38ms. Allocated memory was 207.6MB in the beginning and 752.9MB in the end (delta: 545.3MB). Free memory was 146.7MB in the beginning and 434.5MB in the end (delta: -287.7MB). Peak memory consumption was 257.5MB. Max. memory is 16.1GB. [2024-11-19 10:23:14,500 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.06ms. Allocated memory is still 159.4MB. Free memory was 110.1MB in the beginning and 110.0MB in the end (delta: 114.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 512.38ms. Allocated memory was 159.4MB in the beginning and 207.6MB in the end (delta: 48.2MB). Free memory was 86.6MB in the beginning and 173.0MB in the end (delta: -86.3MB). Peak memory consumption was 23.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 52.14ms. Allocated memory is still 207.6MB. Free memory was 173.0MB in the beginning and 170.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 59.46ms. Allocated memory is still 207.6MB. Free memory was 170.9MB in the beginning and 167.7MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 568.21ms. Allocated memory is still 207.6MB. Free memory was 167.7MB in the beginning and 147.8MB in the end (delta: 19.9MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 77473.38ms. Allocated memory was 207.6MB in the beginning and 752.9MB in the end (delta: 545.3MB). Free memory was 146.7MB in the beginning and 434.5MB in the end (delta: -287.7MB). Peak memory consumption was 257.5MB. 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: 585]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 585]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 626]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 626]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 631]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 631]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 633]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 633]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 52 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 73.5s, OverallIterations: 23, TraceHistogramMax: 32, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 5.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 587 SdHoareTripleChecker+Valid, 2.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 585 mSDsluCounter, 5711 SdHoareTripleChecker+Invalid, 2.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 1748 IncrementalHoareTripleChecker+Unchecked, 4904 mSDsCounter, 30 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2959 IncrementalHoareTripleChecker+Invalid, 4737 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 30 mSolverCounterUnsat, 807 mSDtfsCounter, 2959 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3178 GetRequests, 2552 SyntacticMatches, 4 SemanticMatches, 622 ConstructedPredicates, 34 IntricatePredicates, 0 DeprecatedPredicates, 10624 ImplicationChecksByTransitivity, 36.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=366occurred in iteration=22, InterpolantAutomatonStates: 482, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 23 MinimizatonAttempts, 126 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.7s SsaConstructionTime, 2.5s SatisfiabilityAnalysisTime, 58.3s InterpolantComputationTime, 3453 NumberOfCodeBlocks, 3053 NumberOfCodeBlocksAsserted, 137 NumberOfCheckSat, 4187 ConstructedInterpolants, 67 QuantifiedInterpolants, 20129 SizeOfPredicates, 28 NumberOfNonLiveVariables, 9304 ConjunctsInSsa, 561 ConjunctsInUnsatCore, 50 InterpolantComputations, 11 PerfectInterpolantSequences, 15473/26599 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 8 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 10:23:14,573 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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 ../sv-benchmarks/c/list-simple/sll2n_append_unequal.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-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 ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 742ffe63db70127807dbc7584eb0c51633a9ed1be5f19fa1a247e43392d52dab --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 10:23:16,794 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 10:23:16,864 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Bitvector.epf [2024-11-19 10:23:16,870 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 10:23:16,871 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 10:23:16,898 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 10:23:16,901 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 10:23:16,901 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 10:23:16,902 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 10:23:16,902 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 10:23:16,903 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 10:23:16,903 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 10:23:16,904 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 10:23:16,905 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 10:23:16,906 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 10:23:16,907 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 10:23:16,907 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 10:23:16,907 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 10:23:16,908 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 10:23:16,908 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 10:23:16,911 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 10:23:16,912 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 10:23:16,912 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 10:23:16,912 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-19 10:23:16,913 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-19 10:23:16,913 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 10:23:16,913 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-19 10:23:16,913 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-19 10:23:16,913 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 10:23:16,914 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 10:23:16,914 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 10:23:16,914 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 10:23:16,914 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 10:23:16,915 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 10:23:16,920 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 10:23:16,921 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 10:23:16,921 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 10:23:16,921 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 10:23:16,921 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 10:23:16,921 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 10:23:16,922 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-19 10:23:16,925 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-19 10:23:16,925 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 10:23:16,925 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 10:23:16,925 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 10:23:16,925 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 10:23:16,925 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 ! overflow) ) 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 -> 742ffe63db70127807dbc7584eb0c51633a9ed1be5f19fa1a247e43392d52dab [2024-11-19 10:23:17,245 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 10:23:17,269 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 10:23:17,273 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 10:23:17,274 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 10:23:17,275 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 10:23:17,276 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/sll2n_append_unequal.i