./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/list-simple/sll2n_append_equal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f 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_equal.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f218eac2d2b52810cb44bb8b3f3f80463ec7e46c8818b20f079ed947cc8e9fd0 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-09 22:09:21,446 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 22:09:21,528 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 22:09:21,532 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 22:09:21,533 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 22:09:21,562 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 22:09:21,563 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 22:09:21,564 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 22:09:21,564 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 22:09:21,566 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 22:09:21,567 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 22:09:21,567 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 22:09:21,568 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 22:09:21,569 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 22:09:21,570 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 22:09:21,570 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 22:09:21,571 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 22:09:21,571 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 22:09:21,571 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 22:09:21,571 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 22:09:21,572 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 22:09:21,572 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 22:09:21,572 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 22:09:21,573 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 22:09:21,573 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 22:09:21,573 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 22:09:21,576 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 22:09:21,576 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 22:09:21,577 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-09 22:09:21,577 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 22:09:21,577 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 22:09:21,577 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 22:09:21,578 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 22:09:21,578 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 22:09:21,578 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 22:09:21,578 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 22:09:21,578 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 22:09:21,579 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 22:09:21,579 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 22:09:21,581 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 22:09:21,581 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 22:09:21,582 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 22:09:21,582 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f218eac2d2b52810cb44bb8b3f3f80463ec7e46c8818b20f079ed947cc8e9fd0 [2024-11-09 22:09:21,872 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 22:09:21,898 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 22:09:21,901 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 22:09:21,902 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 22:09:21,902 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 22:09:21,904 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/sll2n_append_equal.i [2024-11-09 22:09:23,366 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 22:09:23,634 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 22:09:23,635 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2n_append_equal.i [2024-11-09 22:09:23,655 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7d4a677da/37b669990d234bb6880ee25e9144d47c/FLAG3753c1e9c [2024-11-09 22:09:23,932 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7d4a677da/37b669990d234bb6880ee25e9144d47c [2024-11-09 22:09:23,934 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 22:09:23,936 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 22:09:23,938 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 22:09:23,939 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 22:09:23,945 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 22:09:23,946 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:09:23" (1/1) ... [2024-11-09 22:09:23,948 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7eea4244 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:09:23, skipping insertion in model container [2024-11-09 22:09:23,948 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:09:23" (1/1) ... [2024-11-09 22:09:23,997 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 22:09:24,324 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2n_append_equal.i[24197,24210] [2024-11-09 22:09:24,329 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 22:09:24,336 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 22:09:24,372 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2n_append_equal.i[24197,24210] [2024-11-09 22:09:24,373 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 22:09:24,402 INFO L204 MainTranslator]: Completed translation [2024-11-09 22:09:24,402 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:09:24 WrapperNode [2024-11-09 22:09:24,403 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 22:09:24,404 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 22:09:24,404 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 22:09:24,404 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 22:09:24,410 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:09:24" (1/1) ... [2024-11-09 22:09:24,423 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:09:24" (1/1) ... [2024-11-09 22:09:24,448 INFO L138 Inliner]: procedures = 127, calls = 33, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 117 [2024-11-09 22:09:24,449 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 22:09:24,449 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 22:09:24,449 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 22:09:24,449 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 22:09:24,460 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:09:24" (1/1) ... [2024-11-09 22:09:24,460 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:09:24" (1/1) ... [2024-11-09 22:09:24,464 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:09:24" (1/1) ... [2024-11-09 22:09:24,490 INFO L175 MemorySlicer]: Split 17 memory accesses to 3 slices as follows [2, 9, 6]. 53 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 0, 1]. The 5 writes are split as follows [0, 4, 1]. [2024-11-09 22:09:24,491 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:09:24" (1/1) ... [2024-11-09 22:09:24,491 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:09:24" (1/1) ... [2024-11-09 22:09:24,501 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:09:24" (1/1) ... [2024-11-09 22:09:24,501 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:09:24" (1/1) ... [2024-11-09 22:09:24,504 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:09:24" (1/1) ... [2024-11-09 22:09:24,505 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:09:24" (1/1) ... [2024-11-09 22:09:24,508 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 22:09:24,509 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-09 22:09:24,509 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-09 22:09:24,509 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-09 22:09:24,510 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:09:24" (1/1) ... [2024-11-09 22:09:24,517 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 22:09:24,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 22:09:24,538 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-09 22:09:24,541 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-09 22:09:24,588 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-09 22:09:24,588 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-09 22:09:24,588 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-09 22:09:24,588 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-09 22:09:24,588 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-09 22:09:24,588 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-09 22:09:24,589 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2024-11-09 22:09:24,589 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2024-11-09 22:09:24,589 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 22:09:24,589 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 22:09:24,589 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-09 22:09:24,589 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-09 22:09:24,590 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-09 22:09:24,590 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-09 22:09:24,590 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-09 22:09:24,590 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-09 22:09:24,590 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-09 22:09:24,591 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 22:09:24,591 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-09 22:09:24,591 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-09 22:09:24,591 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-09 22:09:24,591 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 22:09:24,591 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-09 22:09:24,592 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-09 22:09:24,592 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 22:09:24,592 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 22:09:24,707 INFO L256 CfgBuilder]: Building ICFG [2024-11-09 22:09:24,709 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 22:09:24,893 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L614: call ULTIMATE.dealloc(main_~#s~0#1.base, main_~#s~0#1.offset);havoc main_~#s~0#1.base, main_~#s~0#1.offset; [2024-11-09 22:09:24,913 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint myexit_returnLabel#1: assume true;havoc myexit_~s#1;havoc myexit_#in~s#1;assume { :end_inline_myexit } true; [2024-11-09 22:09:24,936 INFO L? ?]: Removed 43 outVars from TransFormulas that were not future-live. [2024-11-09 22:09:24,937 INFO L307 CfgBuilder]: Performing block encoding [2024-11-09 22:09:24,955 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 22:09:24,955 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 22:09:24,955 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 10:09:24 BoogieIcfgContainer [2024-11-09 22:09:24,955 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-09 22:09:24,957 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 22:09:24,957 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 22:09:24,959 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 22:09:24,959 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 10:09:23" (1/3) ... [2024-11-09 22:09:24,960 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32fc735a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 10:09:24, skipping insertion in model container [2024-11-09 22:09:24,960 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:09:24" (2/3) ... [2024-11-09 22:09:24,960 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32fc735a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 10:09:24, skipping insertion in model container [2024-11-09 22:09:24,960 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 10:09:24" (3/3) ... [2024-11-09 22:09:24,961 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2n_append_equal.i [2024-11-09 22:09:24,975 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 22:09:24,975 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 22:09:25,030 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 22:09:25,040 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;@e9be961, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 22:09:25,041 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 22:09:25,045 INFO L276 IsEmpty]: Start isEmpty. Operand has 35 states, 30 states have (on average 1.4333333333333333) internal successors, (43), 31 states have internal predecessors, (43), 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-09 22:09:25,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-09 22:09:25,054 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:09:25,054 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:09:25,054 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:09:25,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:09:25,059 INFO L85 PathProgramCache]: Analyzing trace with hash 156280014, now seen corresponding path program 1 times [2024-11-09 22:09:25,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:09:25,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183382121] [2024-11-09 22:09:25,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:09:25,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:09:25,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:09:25,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 22:09:25,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:09:25,350 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-09 22:09:25,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:09:25,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183382121] [2024-11-09 22:09:25,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183382121] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 22:09:25,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 22:09:25,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 22:09:25,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786371668] [2024-11-09 22:09:25,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 22:09:25,362 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 22:09:25,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:09:25,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 22:09:25,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 22:09:25,387 INFO L87 Difference]: Start difference. First operand has 35 states, 30 states have (on average 1.4333333333333333) internal successors, (43), 31 states have internal predecessors, (43), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 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-09 22:09:25,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:09:25,440 INFO L93 Difference]: Finished difference Result 63 states and 84 transitions. [2024-11-09 22:09:25,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 22:09:25,443 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 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 18 [2024-11-09 22:09:25,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:09:25,449 INFO L225 Difference]: With dead ends: 63 [2024-11-09 22:09:25,449 INFO L226 Difference]: Without dead ends: 27 [2024-11-09 22:09:25,467 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 22:09:25,474 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 0 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 22:09:25,479 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 68 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 22:09:25,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-11-09 22:09:25,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2024-11-09 22:09:25,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 23 states have internal predecessors, (28), 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-09 22:09:25,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 32 transitions. [2024-11-09 22:09:25,542 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 32 transitions. Word has length 18 [2024-11-09 22:09:25,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:09:25,543 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 32 transitions. [2024-11-09 22:09:25,544 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 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-09 22:09:25,544 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 32 transitions. [2024-11-09 22:09:25,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-09 22:09:25,546 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:09:25,546 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:09:25,547 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 22:09:25,547 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:09:25,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:09:25,549 INFO L85 PathProgramCache]: Analyzing trace with hash -244916478, now seen corresponding path program 1 times [2024-11-09 22:09:25,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:09:25,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033231749] [2024-11-09 22:09:25,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:09:25,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:09:25,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:09:25,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-09 22:09:25,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:09:25,793 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-09 22:09:25,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:09:25,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033231749] [2024-11-09 22:09:25,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033231749] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 22:09:25,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 22:09:25,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 22:09:25,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543662796] [2024-11-09 22:09:25,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 22:09:25,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 22:09:25,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:09:25,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 22:09:25,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 22:09:25,800 INFO L87 Difference]: Start difference. First operand 27 states and 32 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 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-09 22:09:25,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:09:25,851 INFO L93 Difference]: Finished difference Result 52 states and 62 transitions. [2024-11-09 22:09:25,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 22:09:25,853 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 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 20 [2024-11-09 22:09:25,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:09:25,854 INFO L225 Difference]: With dead ends: 52 [2024-11-09 22:09:25,854 INFO L226 Difference]: Without dead ends: 31 [2024-11-09 22:09:25,856 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 22:09:25,857 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 1 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 22:09:25,858 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 75 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 22:09:25,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-11-09 22:09:25,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2024-11-09 22:09:25,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 25 states have (on average 1.2) internal successors, (30), 25 states have internal predecessors, (30), 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-09 22:09:25,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 34 transitions. [2024-11-09 22:09:25,866 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 34 transitions. Word has length 20 [2024-11-09 22:09:25,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:09:25,866 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 34 transitions. [2024-11-09 22:09:25,867 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 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-09 22:09:25,867 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2024-11-09 22:09:25,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-09 22:09:25,868 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:09:25,868 INFO L215 NwaCegarLoop]: trace histogram [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-09 22:09:25,868 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 22:09:25,868 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:09:25,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:09:25,869 INFO L85 PathProgramCache]: Analyzing trace with hash -819250410, now seen corresponding path program 1 times [2024-11-09 22:09:25,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:09:25,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081264759] [2024-11-09 22:09:25,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:09:25,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:09:25,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:09:26,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-09 22:09:26,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:09:26,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-09 22:09:26,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:09:26,133 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-09 22:09:26,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:09:26,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081264759] [2024-11-09 22:09:26,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2081264759] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 22:09:26,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1983020378] [2024-11-09 22:09:26,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:09:26,135 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:09:26,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 22:09:26,138 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-09 22:09:26,139 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-09 22:09:26,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:09:26,288 INFO L255 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 22:09:26,295 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 22:09:26,350 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 22:09:26,350 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 22:09:26,406 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-09 22:09:26,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1983020378] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 22:09:26,410 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 22:09:26,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 6 [2024-11-09 22:09:26,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027824027] [2024-11-09 22:09:26,411 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 22:09:26,412 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 22:09:26,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:09:26,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 22:09:26,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-09 22:09:26,413 INFO L87 Difference]: Start difference. First operand 29 states and 34 transitions. Second operand has 6 states, 6 states have (on average 5.0) internal successors, (30), 5 states have internal predecessors, (30), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-09 22:09:26,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:09:26,469 INFO L93 Difference]: Finished difference Result 54 states and 64 transitions. [2024-11-09 22:09:26,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 22:09:26,470 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 5 states have internal predecessors, (30), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 29 [2024-11-09 22:09:26,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:09:26,471 INFO L225 Difference]: With dead ends: 54 [2024-11-09 22:09:26,471 INFO L226 Difference]: Without dead ends: 33 [2024-11-09 22:09:26,472 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 58 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-09 22:09:26,473 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 1 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 22:09:26,474 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 99 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 22:09:26,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-11-09 22:09:26,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2024-11-09 22:09:26,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 28 states have internal predecessors, (33), 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-09 22:09:26,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 39 transitions. [2024-11-09 22:09:26,479 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 39 transitions. Word has length 29 [2024-11-09 22:09:26,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:09:26,480 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 39 transitions. [2024-11-09 22:09:26,480 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 5 states have internal predecessors, (30), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-09 22:09:26,480 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2024-11-09 22:09:26,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-09 22:09:26,481 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:09:26,481 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:09:26,502 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-09 22:09:26,681 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:09:26,682 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:09:26,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:09:26,683 INFO L85 PathProgramCache]: Analyzing trace with hash -1471466110, now seen corresponding path program 2 times [2024-11-09 22:09:26,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:09:26,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103258587] [2024-11-09 22:09:26,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:09:26,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:09:26,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:09:27,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-09 22:09:27,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:09:27,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-09 22:09:27,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:09:27,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-09 22:09:27,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:09:27,456 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 13 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-09 22:09:27,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:09:27,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103258587] [2024-11-09 22:09:27,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2103258587] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 22:09:27,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [352571720] [2024-11-09 22:09:27,458 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 22:09:27,458 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:09:27,458 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 22:09:27,462 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-09 22:09:27,463 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-09 22:09:27,589 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-09 22:09:27,589 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 22:09:27,591 INFO L255 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-09 22:09:27,595 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 22:09:27,788 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-09 22:09:27,799 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2024-11-09 22:09:27,804 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-09 22:09:27,805 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 22:09:27,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [352571720] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 22:09:27,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 22:09:27,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [15] total 20 [2024-11-09 22:09:27,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247760644] [2024-11-09 22:09:27,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 22:09:27,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 22:09:27,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:09:27,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 22:09:27,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=338, Unknown=0, NotChecked=0, Total=380 [2024-11-09 22:09:27,809 INFO L87 Difference]: Start difference. First operand 33 states and 39 transitions. Second operand has 9 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 22:09:27,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:09:27,897 INFO L93 Difference]: Finished difference Result 47 states and 54 transitions. [2024-11-09 22:09:27,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 22:09:27,897 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 38 [2024-11-09 22:09:27,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:09:27,898 INFO L225 Difference]: With dead ends: 47 [2024-11-09 22:09:27,899 INFO L226 Difference]: Without dead ends: 43 [2024-11-09 22:09:27,900 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=46, Invalid=374, Unknown=0, NotChecked=0, Total=420 [2024-11-09 22:09:27,901 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 11 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 22:09:27,902 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 183 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 22:09:27,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-11-09 22:09:27,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 36. [2024-11-09 22:09:27,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 31 states have internal predecessors, (36), 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-09 22:09:27,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 42 transitions. [2024-11-09 22:09:27,908 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 42 transitions. Word has length 38 [2024-11-09 22:09:27,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:09:27,909 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 42 transitions. [2024-11-09 22:09:27,909 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 22:09:27,909 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 42 transitions. [2024-11-09 22:09:27,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-09 22:09:27,910 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:09:27,910 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:09:27,929 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-09 22:09:28,112 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2024-11-09 22:09:28,113 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:09:28,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:09:28,113 INFO L85 PathProgramCache]: Analyzing trace with hash -1471401723, now seen corresponding path program 1 times [2024-11-09 22:09:28,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:09:28,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879971459] [2024-11-09 22:09:28,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:09:28,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:09:28,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:09:28,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-09 22:09:28,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:09:28,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-09 22:09:28,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:09:28,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-09 22:09:28,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:09:28,571 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-09 22:09:28,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:09:28,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879971459] [2024-11-09 22:09:28,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879971459] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 22:09:28,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 22:09:28,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-09 22:09:28,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639665787] [2024-11-09 22:09:28,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 22:09:28,573 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-09 22:09:28,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:09:28,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-09 22:09:28,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2024-11-09 22:09:28,574 INFO L87 Difference]: Start difference. First operand 36 states and 42 transitions. Second operand has 11 states, 10 states have (on average 2.4) internal successors, (24), 9 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 22:09:28,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:09:28,721 INFO L93 Difference]: Finished difference Result 47 states and 54 transitions. [2024-11-09 22:09:28,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 22:09:28,722 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.4) internal successors, (24), 9 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 38 [2024-11-09 22:09:28,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:09:28,723 INFO L225 Difference]: With dead ends: 47 [2024-11-09 22:09:28,723 INFO L226 Difference]: Without dead ends: 44 [2024-11-09 22:09:28,723 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2024-11-09 22:09:28,726 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 12 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 22:09:28,727 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 173 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 22:09:28,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2024-11-09 22:09:28,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 37. [2024-11-09 22:09:28,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 32 states have (on average 1.15625) internal successors, (37), 32 states have internal predecessors, (37), 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-09 22:09:28,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 43 transitions. [2024-11-09 22:09:28,735 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 43 transitions. Word has length 38 [2024-11-09 22:09:28,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:09:28,736 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 43 transitions. [2024-11-09 22:09:28,736 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.4) internal successors, (24), 9 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 22:09:28,738 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 43 transitions. [2024-11-09 22:09:28,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-09 22:09:28,740 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:09:28,740 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:09:28,740 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 22:09:28,741 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:09:28,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:09:28,741 INFO L85 PathProgramCache]: Analyzing trace with hash -13365493, now seen corresponding path program 1 times [2024-11-09 22:09:28,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:09:28,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127532863] [2024-11-09 22:09:28,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:09:28,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:09:28,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:09:28,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-09 22:09:29,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:09:29,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-09 22:09:29,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:09:29,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-09 22:09:29,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:09:29,083 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-09 22:09:29,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:09:29,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127532863] [2024-11-09 22:09:29,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2127532863] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 22:09:29,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [301303493] [2024-11-09 22:09:29,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:09:29,084 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:09:29,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 22:09:29,086 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-09 22:09:29,087 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-09 22:09:29,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:09:29,234 INFO L255 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-09 22:09:29,237 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 22:09:29,331 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2024-11-09 22:09:29,345 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 15 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-09 22:09:29,345 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 22:09:29,388 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-09 22:09:29,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [301303493] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 22:09:29,389 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 22:09:29,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 9] total 13 [2024-11-09 22:09:29,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043290013] [2024-11-09 22:09:29,389 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 22:09:29,390 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-09 22:09:29,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:09:29,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-09 22:09:29,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2024-11-09 22:09:29,391 INFO L87 Difference]: Start difference. First operand 37 states and 43 transitions. Second operand has 13 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 11 states have internal predecessors, (37), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-09 22:09:33,412 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 22:09:37,433 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 22:09:41,448 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 22:09:45,474 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 22:09:45,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:09:45,625 INFO L93 Difference]: Finished difference Result 49 states and 55 transitions. [2024-11-09 22:09:45,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-09 22:09:45,626 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 11 states have internal predecessors, (37), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 41 [2024-11-09 22:09:45,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:09:45,627 INFO L225 Difference]: With dead ends: 49 [2024-11-09 22:09:45,627 INFO L226 Difference]: Without dead ends: 38 [2024-11-09 22:09:45,627 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 82 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2024-11-09 22:09:45,628 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 17 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 0 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.1s IncrementalHoareTripleChecker+Time [2024-11-09 22:09:45,628 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 251 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 147 Invalid, 4 Unknown, 0 Unchecked, 16.1s Time] [2024-11-09 22:09:45,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-11-09 22:09:45,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2024-11-09 22:09:45,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 32 states have (on average 1.125) internal successors, (36), 32 states have internal predecessors, (36), 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-09 22:09:45,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2024-11-09 22:09:45,636 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 41 [2024-11-09 22:09:45,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:09:45,637 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2024-11-09 22:09:45,637 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 11 states have internal predecessors, (37), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-09 22:09:45,637 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2024-11-09 22:09:45,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-09 22:09:45,638 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:09:45,638 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:09:45,657 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-09 22:09:45,838 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-09 22:09:45,839 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:09:45,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:09:45,839 INFO L85 PathProgramCache]: Analyzing trace with hash 857129698, now seen corresponding path program 1 times [2024-11-09 22:09:45,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:09:45,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546781013] [2024-11-09 22:09:45,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:09:45,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:09:45,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:09:45,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-09 22:09:45,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:09:45,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-09 22:09:46,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:09:46,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-09 22:09:46,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:09:46,060 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-09 22:09:46,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:09:46,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546781013] [2024-11-09 22:09:46,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [546781013] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 22:09:46,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [327285781] [2024-11-09 22:09:46,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:09:46,063 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:09:46,063 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 22:09:46,065 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-09 22:09:46,066 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-09 22:09:46,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:09:46,219 INFO L255 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-09 22:09:46,221 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 22:09:46,301 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2024-11-09 22:09:46,305 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 15 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 22:09:46,305 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 22:09:46,361 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-09 22:09:46,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [327285781] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 22:09:46,363 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 22:09:46,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 9] total 11 [2024-11-09 22:09:46,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104658456] [2024-11-09 22:09:46,364 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 22:09:46,364 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-09 22:09:46,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:09:46,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-09 22:09:46,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-11-09 22:09:46,365 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. Second operand has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 9 states have internal predecessors, (35), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-09 22:09:50,381 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 22:09:54,401 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 22:09:58,411 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 22:10:02,432 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 22:10:02,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:10:02,551 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2024-11-09 22:10:02,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-09 22:10:02,552 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 9 states have internal predecessors, (35), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 41 [2024-11-09 22:10:02,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:10:02,553 INFO L225 Difference]: With dead ends: 44 [2024-11-09 22:10:02,553 INFO L226 Difference]: Without dead ends: 40 [2024-11-09 22:10:02,553 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 84 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2024-11-09 22:10:02,554 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 13 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 0 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.1s IncrementalHoareTripleChecker+Time [2024-11-09 22:10:02,554 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 202 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 134 Invalid, 4 Unknown, 0 Unchecked, 16.1s Time] [2024-11-09 22:10:02,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-11-09 22:10:02,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2024-11-09 22:10:02,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 34 states have (on average 1.1176470588235294) internal successors, (38), 34 states have internal predecessors, (38), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 22:10:02,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2024-11-09 22:10:02,560 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 41 [2024-11-09 22:10:02,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:10:02,560 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2024-11-09 22:10:02,560 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 9 states have internal predecessors, (35), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-09 22:10:02,560 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2024-11-09 22:10:02,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-09 22:10:02,562 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:10:02,562 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:10:02,580 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-09 22:10:02,762 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-09 22:10:02,763 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:10:02,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:10:02,764 INFO L85 PathProgramCache]: Analyzing trace with hash 857194085, now seen corresponding path program 1 times [2024-11-09 22:10:02,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:10:02,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576894811] [2024-11-09 22:10:02,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:10:02,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:10:02,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:10:03,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-09 22:10:03,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:10:03,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-09 22:10:03,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:10:03,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-09 22:10:03,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:10:03,735 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 8 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-09 22:10:03,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:10:03,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576894811] [2024-11-09 22:10:03,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [576894811] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 22:10:03,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1631216745] [2024-11-09 22:10:03,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:10:03,737 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:10:03,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 22:10:03,739 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-09 22:10:03,740 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-09 22:10:03,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:10:03,929 INFO L255 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 69 conjuncts are in the unsatisfiable core [2024-11-09 22:10:03,933 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 22:10:04,027 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-09 22:10:04,047 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-09 22:10:04,111 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-09 22:10:04,280 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2024-11-09 22:10:04,284 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-09 22:10:04,378 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_4| Int)) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_4|) 0) 0)) (exists ((|v_node_create_~temp~0#1.base_37| Int)) (and (= |c_#memory_int#1| (store |c_old(#memory_int#1)| |v_node_create_~temp~0#1.base_37| (select |c_#memory_int#1| |v_node_create_~temp~0#1.base_37|))) (= (select |c_old(#valid)| |v_node_create_~temp~0#1.base_37|) 0)))) is different from true [2024-11-09 22:10:04,402 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 22:10:04,403 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2024-11-09 22:10:04,417 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-11-09 22:10:04,417 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-09 22:10:04,619 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 22:10:04,620 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 43 treesize of output 15 [2024-11-09 22:10:04,683 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-11-09 22:10:04,749 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 10 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 2 not checked. [2024-11-09 22:10:04,749 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 22:10:05,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1631216745] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 22:10:05,074 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 22:10:05,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 30 [2024-11-09 22:10:05,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91163653] [2024-11-09 22:10:05,074 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 22:10:05,075 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-11-09 22:10:05,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:10:05,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-11-09 22:10:05,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=881, Unknown=16, NotChecked=60, Total=1056 [2024-11-09 22:10:05,076 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. Second operand has 30 states, 28 states have (on average 2.0357142857142856) internal successors, (57), 26 states have internal predecessors, (57), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-09 22:10:05,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:10:05,712 INFO L93 Difference]: Finished difference Result 57 states and 63 transitions. [2024-11-09 22:10:05,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-09 22:10:05,713 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 28 states have (on average 2.0357142857142856) internal successors, (57), 26 states have internal predecessors, (57), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 41 [2024-11-09 22:10:05,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:10:05,714 INFO L225 Difference]: With dead ends: 57 [2024-11-09 22:10:05,714 INFO L226 Difference]: Without dead ends: 54 [2024-11-09 22:10:05,715 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 325 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=155, Invalid=1554, Unknown=17, NotChecked=80, Total=1806 [2024-11-09 22:10:05,715 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 34 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 373 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 427 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 373 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 53 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 22:10:05,715 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 256 Invalid, 427 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 373 Invalid, 0 Unknown, 53 Unchecked, 0.3s Time] [2024-11-09 22:10:05,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-11-09 22:10:05,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 47. [2024-11-09 22:10:05,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 41 states have (on average 1.1219512195121952) internal successors, (46), 41 states have internal predecessors, (46), 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-09 22:10:05,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 52 transitions. [2024-11-09 22:10:05,731 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 52 transitions. Word has length 41 [2024-11-09 22:10:05,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:10:05,732 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 52 transitions. [2024-11-09 22:10:05,732 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 28 states have (on average 2.0357142857142856) internal successors, (57), 26 states have internal predecessors, (57), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-09 22:10:05,732 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 52 transitions. [2024-11-09 22:10:05,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-09 22:10:05,733 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:10:05,733 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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-09 22:10:05,752 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-09 22:10:05,936 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:10:05,937 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:10:05,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:10:05,937 INFO L85 PathProgramCache]: Analyzing trace with hash 313775622, now seen corresponding path program 1 times [2024-11-09 22:10:05,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:10:05,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473773940] [2024-11-09 22:10:05,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:10:05,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:10:05,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:10:06,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-09 22:10:06,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:10:06,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-09 22:10:06,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:10:06,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-09 22:10:06,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:10:07,160 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 7 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-09 22:10:07,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:10:07,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473773940] [2024-11-09 22:10:07,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [473773940] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 22:10:07,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [944090743] [2024-11-09 22:10:07,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:10:07,161 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:10:07,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 22:10:07,163 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-09 22:10:07,164 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-09 22:10:07,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:10:07,343 INFO L255 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 110 conjuncts are in the unsatisfiable core [2024-11-09 22:10:07,347 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 22:10:07,486 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-09 22:10:07,497 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-09 22:10:07,585 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-09 22:10:07,592 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-09 22:10:07,763 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2024-11-09 22:10:07,768 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2024-11-09 22:10:07,771 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-09 22:10:07,882 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2024-11-09 22:10:07,896 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_node_create_~temp~0#1.base_46| Int)) (let ((.cse0 (select |c_#memory_int#1| |v_node_create_~temp~0#1.base_46|))) (and (= (select |c_old(#valid)| |v_node_create_~temp~0#1.base_46|) 0) (= |c_node_create_#in~data#1| (select .cse0 0)) (= |c_#memory_int#1| (store |c_old(#memory_int#1)| |v_node_create_~temp~0#1.base_46| .cse0)) (= |c_#memory_$Pointer$#1.offset| (store |c_old(#memory_$Pointer$#1.offset)| |v_node_create_~temp~0#1.base_46| (select |c_#memory_$Pointer$#1.offset| |v_node_create_~temp~0#1.base_46|)))))) (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_5| Int)) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_5|) 0) 0))) is different from true [2024-11-09 22:10:07,927 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 22:10:07,929 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2024-11-09 22:10:07,935 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 22:10:07,936 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2024-11-09 22:10:07,947 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-11-09 22:10:07,948 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-09 22:10:08,185 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2024-11-09 22:10:08,194 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2024-11-09 22:10:08,293 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2024-11-09 22:10:08,360 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2024-11-09 22:10:08,455 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 11 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 4 not checked. [2024-11-09 22:10:08,456 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 22:10:08,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 58 treesize of output 46 [2024-11-09 22:10:12,806 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 22:10:12,806 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 80 treesize of output 80 [2024-11-09 22:10:12,829 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1028 (Array Int Int)) (v_arrayElimArr_2 (Array Int Int)) (v_arrayElimCell_25 Int) (v_ArrVal_1020 (Array Int Int)) (|v_node_create_~temp~0#1.base_52| Int)) (let ((.cse0 (store |c_#memory_int#1| |v_node_create_~temp~0#1.base_52| v_arrayElimArr_2))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse0 v_arrayElimCell_25 v_ArrVal_1020) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (not (= |c_ULTIMATE.start_sll_append_~data#1| (select v_arrayElimArr_2 0))) (not (= (let ((.cse1 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |v_node_create_~temp~0#1.base_52| v_ArrVal_1028) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 4)) 4))) (store (select .cse0 v_arrayElimCell_25) .cse1 (select v_ArrVal_1020 .cse1))) v_ArrVal_1020)) (not (= (select |c_#valid| |v_node_create_~temp~0#1.base_52|) 0))))) is different from false [2024-11-09 22:10:12,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [944090743] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 22:10:12,831 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 22:10:12,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22] total 39 [2024-11-09 22:10:12,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526411117] [2024-11-09 22:10:12,832 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 22:10:12,832 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2024-11-09 22:10:12,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:10:12,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2024-11-09 22:10:12,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=1548, Unknown=34, NotChecked=162, Total=1892 [2024-11-09 22:10:12,834 INFO L87 Difference]: Start difference. First operand 47 states and 52 transitions. Second operand has 39 states, 37 states have (on average 1.7567567567567568) internal successors, (65), 33 states have internal predecessors, (65), 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-09 22:10:14,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:10:14,415 INFO L93 Difference]: Finished difference Result 64 states and 71 transitions. [2024-11-09 22:10:14,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-09 22:10:14,416 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 37 states have (on average 1.7567567567567568) internal successors, (65), 33 states have internal predecessors, (65), 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 43 [2024-11-09 22:10:14,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:10:14,417 INFO L225 Difference]: With dead ends: 64 [2024-11-09 22:10:14,417 INFO L226 Difference]: Without dead ends: 61 [2024-11-09 22:10:14,418 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 638 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=226, Invalid=2502, Unknown=36, NotChecked=206, Total=2970 [2024-11-09 22:10:14,419 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 36 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 480 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 539 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 480 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 57 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 22:10:14,419 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 289 Invalid, 539 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 480 Invalid, 0 Unknown, 57 Unchecked, 0.4s Time] [2024-11-09 22:10:14,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2024-11-09 22:10:14,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 49. [2024-11-09 22:10:14,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 43 states have (on average 1.1395348837209303) internal successors, (49), 43 states have internal predecessors, (49), 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-09 22:10:14,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 55 transitions. [2024-11-09 22:10:14,426 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 55 transitions. Word has length 43 [2024-11-09 22:10:14,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:10:14,426 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 55 transitions. [2024-11-09 22:10:14,427 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 37 states have (on average 1.7567567567567568) internal successors, (65), 33 states have internal predecessors, (65), 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-09 22:10:14,427 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 55 transitions. [2024-11-09 22:10:14,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-09 22:10:14,427 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:10:14,428 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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-09 22:10:14,446 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-09 22:10:14,628 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:10:14,628 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:10:14,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:10:14,629 INFO L85 PathProgramCache]: Analyzing trace with hash -1127414357, now seen corresponding path program 1 times [2024-11-09 22:10:14,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:10:14,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703116523] [2024-11-09 22:10:14,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:10:14,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:10:14,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:10:15,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-09 22:10:15,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:10:15,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-09 22:10:15,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:10:15,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-09 22:10:15,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:10:15,515 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 15 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-09 22:10:15,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:10:15,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703116523] [2024-11-09 22:10:15,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [703116523] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 22:10:15,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1406179049] [2024-11-09 22:10:15,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:10:15,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:10:15,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 22:10:15,518 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-09 22:10:15,523 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-09 22:10:15,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:10:15,697 INFO L255 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 51 conjuncts are in the unsatisfiable core [2024-11-09 22:10:15,699 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 22:10:15,715 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-09 22:10:15,808 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 19 treesize of output 1 [2024-11-09 22:10:15,917 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 18 treesize of output 4 [2024-11-09 22:10:15,921 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-09 22:10:15,963 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_node_create_~temp~0#1.base_55| Int)) (and (= 0 (select |c_old(#valid)| |v_node_create_~temp~0#1.base_55|)) (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| |v_node_create_~temp~0#1.base_55| (select |c_#memory_$Pointer$#1.base| |v_node_create_~temp~0#1.base_55|))))) is different from true [2024-11-09 22:10:15,979 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 22:10:15,980 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 27 treesize of output 22 [2024-11-09 22:10:15,989 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-11-09 22:10:15,989 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-09 22:10:16,119 INFO L349 Elim1Store]: treesize reduction 59, result has 37.2 percent of original size [2024-11-09 22:10:16,120 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 42 [2024-11-09 22:10:16,128 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 26 treesize of output 18 [2024-11-09 22:10:16,132 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 22 treesize of output 14 [2024-11-09 22:10:16,170 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2024-11-09 22:10:16,225 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 7 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 4 not checked. [2024-11-09 22:10:16,225 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 22:10:16,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1406179049] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 22:10:16,473 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 22:10:16,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 21] total 32 [2024-11-09 22:10:16,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331808390] [2024-11-09 22:10:16,473 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 22:10:16,474 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-11-09 22:10:16,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:10:16,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-11-09 22:10:16,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=1031, Unknown=2, NotChecked=64, Total=1190 [2024-11-09 22:10:16,475 INFO L87 Difference]: Start difference. First operand 49 states and 55 transitions. Second operand has 32 states, 30 states have (on average 2.033333333333333) internal successors, (61), 27 states have internal predecessors, (61), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2024-11-09 22:10:16,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:10:16,978 INFO L93 Difference]: Finished difference Result 68 states and 77 transitions. [2024-11-09 22:10:16,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-09 22:10:16,979 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 30 states have (on average 2.033333333333333) internal successors, (61), 27 states have internal predecessors, (61), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 44 [2024-11-09 22:10:16,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:10:16,981 INFO L225 Difference]: With dead ends: 68 [2024-11-09 22:10:16,981 INFO L226 Difference]: Without dead ends: 56 [2024-11-09 22:10:16,981 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 275 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=141, Invalid=1667, Unknown=2, NotChecked=82, Total=1892 [2024-11-09 22:10:16,982 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 26 mSDsluCounter, 335 mSDsCounter, 0 mSdLazyCounter, 411 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 459 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 411 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 48 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 22:10:16,982 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 358 Invalid, 459 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 411 Invalid, 0 Unknown, 48 Unchecked, 0.3s Time] [2024-11-09 22:10:16,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-11-09 22:10:16,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 52. [2024-11-09 22:10:16,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 46 states have (on average 1.1304347826086956) internal successors, (52), 46 states have internal predecessors, (52), 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-09 22:10:16,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 58 transitions. [2024-11-09 22:10:16,990 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 58 transitions. Word has length 44 [2024-11-09 22:10:16,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:10:16,991 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 58 transitions. [2024-11-09 22:10:16,991 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 30 states have (on average 2.033333333333333) internal successors, (61), 27 states have internal predecessors, (61), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2024-11-09 22:10:16,991 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 58 transitions. [2024-11-09 22:10:16,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-09 22:10:16,992 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:10:16,992 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:10:17,009 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-09 22:10:17,192 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:10:17,192 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:10:17,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:10:17,193 INFO L85 PathProgramCache]: Analyzing trace with hash 2074642791, now seen corresponding path program 2 times [2024-11-09 22:10:17,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:10:17,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682794886] [2024-11-09 22:10:17,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:10:17,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:10:17,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:10:18,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-09 22:10:18,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:10:18,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-09 22:10:18,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:10:19,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-09 22:10:19,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:10:19,355 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 4 proven. 22 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-09 22:10:19,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:10:19,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682794886] [2024-11-09 22:10:19,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1682794886] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 22:10:19,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1836888266] [2024-11-09 22:10:19,355 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 22:10:19,356 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:10:19,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 22:10:19,357 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-09 22:10:19,359 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-09 22:10:19,546 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 22:10:19,546 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 22:10:19,551 INFO L255 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 126 conjuncts are in the unsatisfiable core [2024-11-09 22:10:19,556 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 22:10:19,622 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-09 22:10:19,700 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-09 22:10:19,892 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-09 22:10:20,012 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-09 22:10:20,012 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-09 22:10:20,030 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 16 treesize of output 11 [2024-11-09 22:10:20,108 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 23 treesize of output 11 [2024-11-09 22:10:20,113 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-09 22:10:20,126 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 27 treesize of output 15 [2024-11-09 22:10:20,408 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-11-09 22:10:20,408 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 20 [2024-11-09 22:10:20,415 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2024-11-09 22:10:20,422 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-09 22:10:20,428 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-09 22:10:20,589 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_node_create_~temp~0#1.base_64| Int)) (and (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| |v_node_create_~temp~0#1.base_64| (select |c_#memory_$Pointer$#1.base| |v_node_create_~temp~0#1.base_64|))) (= (store |c_old(#memory_$Pointer$#1.offset)| |v_node_create_~temp~0#1.base_64| (select |c_#memory_$Pointer$#1.offset| |v_node_create_~temp~0#1.base_64|)) |c_#memory_$Pointer$#1.offset|) (= (select |c_old(#valid)| |v_node_create_~temp~0#1.base_64|) 0) (= |c_#memory_int#1| (store |c_old(#memory_int#1)| |v_node_create_~temp~0#1.base_64| (select |c_#memory_int#1| |v_node_create_~temp~0#1.base_64|))))) (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6| Int)) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (not (= (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0) 0))))) is different from true [2024-11-09 22:10:20,627 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 22:10:20,636 INFO L349 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2024-11-09 22:10:20,636 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 32 [2024-11-09 22:10:20,646 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 22:10:20,657 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2024-11-09 22:10:20,657 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2024-11-09 22:10:20,662 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2024-11-09 22:10:20,666 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2024-11-09 22:10:20,905 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-09 22:10:21,048 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-11-09 22:10:21,048 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2024-11-09 22:10:21,159 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2024-11-09 22:10:21,232 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 22:10:21,232 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 35 treesize of output 27 [2024-11-09 22:10:21,243 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-09 22:10:21,243 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-09 22:10:21,336 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 7 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2024-11-09 22:10:21,336 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 22:10:21,565 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1348 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int#1| (let ((.cse0 (+ |c_ULTIMATE.start_sll_append_~last~0#1.offset| 4))) (select (select |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_append_~last~0#1.base|) .cse0)) (+ 4 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base|) .cse0)))) v_ArrVal_1348) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) is different from false [2024-11-09 22:10:21,578 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1348 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int#1| (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (.cse1 (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 4))) (select (select |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| .cse0) .cse1)) (+ (select (select |c_#memory_$Pointer$#1.offset| .cse0) .cse1) 4))) v_ArrVal_1348) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) is different from false [2024-11-09 22:10:21,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1836888266] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 22:10:21,722 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 22:10:21,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 44 [2024-11-09 22:10:21,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728296444] [2024-11-09 22:10:21,722 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 22:10:21,723 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2024-11-09 22:10:21,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:10:21,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2024-11-09 22:10:21,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=2078, Unknown=21, NotChecked=282, Total=2550 [2024-11-09 22:10:21,724 INFO L87 Difference]: Start difference. First operand 52 states and 58 transitions. Second operand has 44 states, 42 states have (on average 1.7142857142857142) internal successors, (72), 37 states have internal predecessors, (72), 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-09 22:10:22,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:10:22,747 INFO L93 Difference]: Finished difference Result 99 states and 112 transitions. [2024-11-09 22:10:22,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-09 22:10:22,748 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 42 states have (on average 1.7142857142857142) internal successors, (72), 37 states have internal predecessors, (72), 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 45 [2024-11-09 22:10:22,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:10:22,749 INFO L225 Difference]: With dead ends: 99 [2024-11-09 22:10:22,749 INFO L226 Difference]: Without dead ends: 96 [2024-11-09 22:10:22,750 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 744 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=234, Invalid=2949, Unknown=21, NotChecked=336, Total=3540 [2024-11-09 22:10:22,750 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 35 mSDsluCounter, 438 mSDsCounter, 0 mSdLazyCounter, 767 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 462 SdHoareTripleChecker+Invalid, 863 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 767 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 81 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 22:10:22,751 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 462 Invalid, 863 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 767 Invalid, 0 Unknown, 81 Unchecked, 0.5s Time] [2024-11-09 22:10:22,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-11-09 22:10:22,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 70. [2024-11-09 22:10:22,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 61 states have (on average 1.1311475409836065) internal successors, (69), 61 states have internal predecessors, (69), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-09 22:10:22,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 79 transitions. [2024-11-09 22:10:22,773 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 79 transitions. Word has length 45 [2024-11-09 22:10:22,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:10:22,773 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 79 transitions. [2024-11-09 22:10:22,773 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 42 states have (on average 1.7142857142857142) internal successors, (72), 37 states have internal predecessors, (72), 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-09 22:10:22,774 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 79 transitions. [2024-11-09 22:10:22,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-09 22:10:22,774 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:10:22,774 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-09 22:10:22,793 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-11-09 22:10:22,978 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,SelfDestructingSolverStorable10 [2024-11-09 22:10:22,979 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:10:22,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:10:22,980 INFO L85 PathProgramCache]: Analyzing trace with hash 1919924717, now seen corresponding path program 1 times [2024-11-09 22:10:22,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:10:22,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598652953] [2024-11-09 22:10:22,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:10:22,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:10:23,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:10:24,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-09 22:10:24,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:10:24,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-09 22:10:24,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:10:25,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-09 22:10:25,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:10:25,407 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-09 22:10:25,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:10:25,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598652953] [2024-11-09 22:10:25,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1598652953] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 22:10:25,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [107136155] [2024-11-09 22:10:25,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:10:25,408 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:10:25,408 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 22:10:25,410 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-09 22:10:25,412 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-09 22:10:25,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:10:25,654 INFO L255 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 150 conjuncts are in the unsatisfiable core [2024-11-09 22:10:25,658 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 22:10:25,709 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-09 22:10:25,761 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-09 22:10:25,877 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 23 treesize of output 11 [2024-11-09 22:10:26,173 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-09 22:10:26,173 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 16 treesize of output 15 [2024-11-09 22:10:26,203 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-09 22:10:26,203 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-09 22:10:26,315 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 20 treesize of output 15 [2024-11-09 22:10:26,326 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-09 22:10:26,336 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-09 22:10:26,634 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 57 treesize of output 25 [2024-11-09 22:10:26,640 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-09 22:10:26,645 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-09 22:10:26,663 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-09 22:10:26,828 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2024-11-09 22:10:26,842 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_node_create_~temp~0#1.base_73| Int)) (let ((.cse0 (select |c_#memory_int#1| |v_node_create_~temp~0#1.base_73|))) (and (= |c_node_create_#in~data#1| (select .cse0 0)) (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| |v_node_create_~temp~0#1.base_73| (select |c_#memory_$Pointer$#1.base| |v_node_create_~temp~0#1.base_73|))) (= |c_#memory_int#1| (store |c_old(#memory_int#1)| |v_node_create_~temp~0#1.base_73| .cse0)) (= |c_#memory_$Pointer$#1.offset| (store |c_old(#memory_$Pointer$#1.offset)| |v_node_create_~temp~0#1.base_73| (select |c_#memory_$Pointer$#1.offset| |v_node_create_~temp~0#1.base_73|))) (= (select |c_old(#valid)| |v_node_create_~temp~0#1.base_73|) 0)))) (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_7| Int)) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_7|) 0) 0))) is different from true [2024-11-09 22:10:26,872 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 22:10:26,873 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 65 treesize of output 42 [2024-11-09 22:10:26,883 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 22:10:26,886 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 19 [2024-11-09 22:10:26,905 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2024-11-09 22:10:26,905 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2024-11-09 22:10:26,911 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 20 treesize of output 15 [2024-11-09 22:10:27,659 INFO L349 Elim1Store]: treesize reduction 36, result has 35.7 percent of original size [2024-11-09 22:10:27,659 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 2 case distinctions, treesize of input 78 treesize of output 46 [2024-11-09 22:10:27,670 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 27 treesize of output 15 [2024-11-09 22:10:27,679 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 29 [2024-11-09 22:10:27,855 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 82 treesize of output 50 [2024-11-09 22:10:27,980 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 43 treesize of output 23 [2024-11-09 22:10:27,986 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-09 22:10:28,246 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 3 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2024-11-09 22:10:28,246 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 22:10:28,447 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1525 (Array Int Int)) (|ULTIMATE.start_sll_append_~new_last~0#1.base| Int) (|ULTIMATE.start_sll_append_~new_last~0#1.offset| Int)) (let ((.cse0 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_append_~last~0#1.base| v_ArrVal_1525)) (.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse4 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1 (+ |c_ULTIMATE.start_sll_append_~last~0#1.offset| 4))) (or (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse3 (+ .cse4 4))) (select (select .cse0 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_append_~last~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_append_~last~0#1.base|) .cse1 |ULTIMATE.start_sll_append_~new_last~0#1.base|)) .cse2) .cse3)) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base| (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base|) .cse1 |ULTIMATE.start_sll_append_~new_last~0#1.offset|)) .cse2) .cse3)))) (not (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse0 .cse2) .cse4))) (not (= (store (select |c_#memory_int#1| |c_ULTIMATE.start_sll_append_~last~0#1.base|) .cse1 (select v_ArrVal_1525 .cse1)) v_ArrVal_1525))))) is different from false [2024-11-09 22:10:29,200 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 22:10:29,201 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 191 treesize of output 188 [2024-11-09 22:10:29,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [107136155] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 22:10:29,540 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 22:10:29,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 27] total 53 [2024-11-09 22:10:29,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226835340] [2024-11-09 22:10:29,541 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 22:10:29,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2024-11-09 22:10:29,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:10:29,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2024-11-09 22:10:29,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=201, Invalid=3345, Unknown=2, NotChecked=234, Total=3782 [2024-11-09 22:10:29,543 INFO L87 Difference]: Start difference. First operand 70 states and 79 transitions. Second operand has 53 states, 51 states have (on average 1.5098039215686274) internal successors, (77), 45 states have internal predecessors, (77), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-09 22:10:32,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:10:32,254 INFO L93 Difference]: Finished difference Result 90 states and 101 transitions. [2024-11-09 22:10:32,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-11-09 22:10:32,255 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 51 states have (on average 1.5098039215686274) internal successors, (77), 45 states have internal predecessors, (77), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 46 [2024-11-09 22:10:32,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:10:32,256 INFO L225 Difference]: With dead ends: 90 [2024-11-09 22:10:32,256 INFO L226 Difference]: Without dead ends: 87 [2024-11-09 22:10:32,257 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1398 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=402, Invalid=6246, Unknown=2, NotChecked=322, Total=6972 [2024-11-09 22:10:32,257 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 28 mSDsluCounter, 584 mSDsCounter, 0 mSdLazyCounter, 1084 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 608 SdHoareTripleChecker+Invalid, 1153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1084 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 64 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-09 22:10:32,258 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 608 Invalid, 1153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1084 Invalid, 0 Unknown, 64 Unchecked, 1.0s Time] [2024-11-09 22:10:32,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-11-09 22:10:32,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 80. [2024-11-09 22:10:32,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 71 states have (on average 1.1267605633802817) internal successors, (80), 71 states have internal predecessors, (80), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-09 22:10:32,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 90 transitions. [2024-11-09 22:10:32,273 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 90 transitions. Word has length 46 [2024-11-09 22:10:32,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:10:32,273 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 90 transitions. [2024-11-09 22:10:32,273 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 51 states have (on average 1.5098039215686274) internal successors, (77), 45 states have internal predecessors, (77), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-09 22:10:32,273 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 90 transitions. [2024-11-09 22:10:32,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-09 22:10:32,274 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:10:32,274 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:10:32,288 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-09 22:10:32,474 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:10:32,475 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:10:32,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:10:32,475 INFO L85 PathProgramCache]: Analyzing trace with hash 2050877576, now seen corresponding path program 3 times [2024-11-09 22:10:32,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:10:32,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259270956] [2024-11-09 22:10:32,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:10:32,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:10:32,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:10:33,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-09 22:10:33,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:10:33,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-09 22:10:33,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:10:33,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-09 22:10:33,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:10:33,908 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 12 proven. 18 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-09 22:10:33,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:10:33,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259270956] [2024-11-09 22:10:33,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [259270956] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 22:10:33,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [36801959] [2024-11-09 22:10:33,908 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-09 22:10:33,909 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:10:33,909 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 22:10:33,910 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-09 22:10:33,911 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-09 22:10:34,157 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-11-09 22:10:34,157 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 22:10:34,161 INFO L255 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 111 conjuncts are in the unsatisfiable core [2024-11-09 22:10:34,164 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 22:10:34,203 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-09 22:10:34,255 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-09 22:10:34,260 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-09 22:10:38,584 WARN L851 $PredicateComparison]: unable to prove that (and (exists ((|v_old(#valid)_AFTER_CALL_28| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_28| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_28| |c_ULTIMATE.start_sll_create_#t~ret4#1.base|) 0) (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_28| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_28| .cse0 (select |c_#valid| .cse0)))))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or (exists ((|v_old(#memory_$Pointer$#1.base)_AFTER_CALL_28| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_28| |c_#memory_$Pointer$#1.base|))) (and (= |c_#memory_$Pointer$#1.base| (store |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_28| .cse1 (select |c_#memory_$Pointer$#1.base| .cse1))) (= (select (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_28| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0) (= .cse1 |c_ULTIMATE.start_sll_create_#t~ret4#1.base|)))) (= (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0)) (or (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0) (exists ((|v_#memory_$Pointer$#1.offset_BEFORE_CALL_8| (Array Int (Array Int Int)))) (let ((.cse2 (@diff |v_#memory_$Pointer$#1.offset_BEFORE_CALL_8| |c_#memory_$Pointer$#1.offset|))) (and (= |c_ULTIMATE.start_sll_create_#t~ret4#1.base| .cse2) (= (select (select |v_#memory_$Pointer$#1.offset_BEFORE_CALL_8| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0) (= |c_#memory_$Pointer$#1.offset| (store |v_#memory_$Pointer$#1.offset_BEFORE_CALL_8| .cse2 (select |c_#memory_$Pointer$#1.offset| .cse2))))))) (= |c_ULTIMATE.start_sll_create_#t~ret4#1.offset| 0) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_#t~ret4#1.base|) 1)) is different from false [2024-11-09 22:10:38,589 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_old(#valid)_AFTER_CALL_28| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_28| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_28| |c_ULTIMATE.start_sll_create_#t~ret4#1.base|) 0) (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_28| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_28| .cse0 (select |c_#valid| .cse0)))))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or (exists ((|v_old(#memory_$Pointer$#1.base)_AFTER_CALL_28| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_28| |c_#memory_$Pointer$#1.base|))) (and (= |c_#memory_$Pointer$#1.base| (store |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_28| .cse1 (select |c_#memory_$Pointer$#1.base| .cse1))) (= (select (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_28| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0) (= .cse1 |c_ULTIMATE.start_sll_create_#t~ret4#1.base|)))) (= (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0)) (or (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0) (exists ((|v_#memory_$Pointer$#1.offset_BEFORE_CALL_8| (Array Int (Array Int Int)))) (let ((.cse2 (@diff |v_#memory_$Pointer$#1.offset_BEFORE_CALL_8| |c_#memory_$Pointer$#1.offset|))) (and (= |c_ULTIMATE.start_sll_create_#t~ret4#1.base| .cse2) (= (select (select |v_#memory_$Pointer$#1.offset_BEFORE_CALL_8| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0) (= |c_#memory_$Pointer$#1.offset| (store |v_#memory_$Pointer$#1.offset_BEFORE_CALL_8| .cse2 (select |c_#memory_$Pointer$#1.offset| .cse2))))))) (= |c_ULTIMATE.start_sll_create_#t~ret4#1.offset| 0) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_#t~ret4#1.base|) 1)) is different from true [2024-11-09 22:10:38,642 INFO L349 Elim1Store]: treesize reduction 25, result has 43.2 percent of original size [2024-11-09 22:10:38,643 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 23 [2024-11-09 22:10:38,670 INFO L349 Elim1Store]: treesize reduction 29, result has 27.5 percent of original size [2024-11-09 22:10:38,670 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2024-11-09 22:10:42,685 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4))) (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (exists ((|v_old(#valid)_AFTER_CALL_28| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_28| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_28| .cse0) 1) (= |c_#valid| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_28| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_28| .cse1 (select |c_#valid| .cse1)))))) (or (exists ((|v_#memory_$Pointer$#1.base_95| (Array Int (Array Int Int)))) (and (exists ((|v_old(#memory_$Pointer$#1.base)_AFTER_CALL_28| (Array Int (Array Int Int)))) (let ((.cse2 (@diff |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_28| |v_#memory_$Pointer$#1.base_95|))) (and (= .cse2 |c_ULTIMATE.start_sll_create_~head~0#1.base|) (= (select (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_28| .cse0) 4) 0) (= (store |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_28| .cse2 (select |v_#memory_$Pointer$#1.base_95| .cse2)) |v_#memory_$Pointer$#1.base_95|)))) (= (store |v_#memory_$Pointer$#1.base_95| |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select |v_#memory_$Pointer$#1.base_95| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4 .cse0)) |c_#memory_$Pointer$#1.base|))) (= (select (select |c_#memory_$Pointer$#1.base| .cse0) 4) 0) (= .cse0 |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (or (exists ((|v_#memory_$Pointer$#1.offset_92| (Array Int (Array Int Int)))) (and (= |c_#memory_$Pointer$#1.offset| (store |v_#memory_$Pointer$#1.offset_92| |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select |v_#memory_$Pointer$#1.offset_92| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4 0))) (exists ((|v_#memory_$Pointer$#1.offset_BEFORE_CALL_8| (Array Int (Array Int Int)))) (let ((.cse3 (@diff |v_#memory_$Pointer$#1.offset_BEFORE_CALL_8| |v_#memory_$Pointer$#1.offset_92|))) (and (= |v_#memory_$Pointer$#1.offset_92| (store |v_#memory_$Pointer$#1.offset_BEFORE_CALL_8| .cse3 (select |v_#memory_$Pointer$#1.offset_92| .cse3))) (= (select (select |v_#memory_$Pointer$#1.offset_BEFORE_CALL_8| .cse0) 4) 0) (= .cse3 |c_ULTIMATE.start_sll_create_~head~0#1.base|)))))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 4) 0))) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0))) is different from false [2024-11-09 22:10:42,690 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4))) (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (exists ((|v_old(#valid)_AFTER_CALL_28| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_28| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_28| .cse0) 1) (= |c_#valid| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_28| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_28| .cse1 (select |c_#valid| .cse1)))))) (or (exists ((|v_#memory_$Pointer$#1.base_95| (Array Int (Array Int Int)))) (and (exists ((|v_old(#memory_$Pointer$#1.base)_AFTER_CALL_28| (Array Int (Array Int Int)))) (let ((.cse2 (@diff |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_28| |v_#memory_$Pointer$#1.base_95|))) (and (= .cse2 |c_ULTIMATE.start_sll_create_~head~0#1.base|) (= (select (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_28| .cse0) 4) 0) (= (store |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_28| .cse2 (select |v_#memory_$Pointer$#1.base_95| .cse2)) |v_#memory_$Pointer$#1.base_95|)))) (= (store |v_#memory_$Pointer$#1.base_95| |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select |v_#memory_$Pointer$#1.base_95| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4 .cse0)) |c_#memory_$Pointer$#1.base|))) (= (select (select |c_#memory_$Pointer$#1.base| .cse0) 4) 0) (= .cse0 |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (or (exists ((|v_#memory_$Pointer$#1.offset_92| (Array Int (Array Int Int)))) (and (= |c_#memory_$Pointer$#1.offset| (store |v_#memory_$Pointer$#1.offset_92| |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select |v_#memory_$Pointer$#1.offset_92| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4 0))) (exists ((|v_#memory_$Pointer$#1.offset_BEFORE_CALL_8| (Array Int (Array Int Int)))) (let ((.cse3 (@diff |v_#memory_$Pointer$#1.offset_BEFORE_CALL_8| |v_#memory_$Pointer$#1.offset_92|))) (and (= |v_#memory_$Pointer$#1.offset_92| (store |v_#memory_$Pointer$#1.offset_BEFORE_CALL_8| .cse3 (select |v_#memory_$Pointer$#1.offset_92| .cse3))) (= (select (select |v_#memory_$Pointer$#1.offset_BEFORE_CALL_8| .cse0) 4) 0) (= .cse3 |c_ULTIMATE.start_sll_create_~head~0#1.base|)))))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 4) 0))) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0))) is different from true [2024-11-09 22:10:42,745 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (exists ((|v_old(#valid)_AFTER_CALL_28| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_28| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_28| .cse0) 1) (= |c_#valid| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_28| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_28| .cse1 (select |c_#valid| .cse1)))))) (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 4) 0) (or (= (select (select |c_#memory_$Pointer$#1.base| .cse0) 4) 0) (= .cse0 |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0))) is different from false [2024-11-09 22:10:42,747 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (exists ((|v_old(#valid)_AFTER_CALL_28| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_28| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_28| .cse0) 1) (= |c_#valid| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_28| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_28| .cse1 (select |c_#valid| .cse1)))))) (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 4) 0) (or (= (select (select |c_#memory_$Pointer$#1.base| .cse0) 4) 0) (= .cse0 |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0))) is different from true [2024-11-09 22:10:42,803 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_#res#1.base|) 4))) (and (= (select |c_#valid| |c_ULTIMATE.start_sll_create_#res#1.base|) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_create_#res#1.base|) 4) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 4) 0) (= |c_ULTIMATE.start_sll_create_#res#1.offset| 0) (or (= (select (select |c_#memory_$Pointer$#1.base| .cse0) 4) 0) (= .cse0 |c_ULTIMATE.start_sll_create_#res#1.base|)) (exists ((|v_old(#valid)_AFTER_CALL_28| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_28| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_28| |c_ULTIMATE.start_sll_create_#res#1.base|) 0) (= |c_#valid| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_28| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_28| .cse1 (select |c_#valid| .cse1)))))))) is different from false [2024-11-09 22:10:42,806 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_#res#1.base|) 4))) (and (= (select |c_#valid| |c_ULTIMATE.start_sll_create_#res#1.base|) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_create_#res#1.base|) 4) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 4) 0) (= |c_ULTIMATE.start_sll_create_#res#1.offset| 0) (or (= (select (select |c_#memory_$Pointer$#1.base| .cse0) 4) 0) (= .cse0 |c_ULTIMATE.start_sll_create_#res#1.base|)) (exists ((|v_old(#valid)_AFTER_CALL_28| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_28| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_28| |c_ULTIMATE.start_sll_create_#res#1.base|) 0) (= |c_#valid| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_28| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_28| .cse1 (select |c_#valid| .cse1)))))))) is different from true [2024-11-09 22:10:42,852 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| .cse1) 4))) (and (or (= (select (select |c_#memory_$Pointer$#1.base| .cse0) 4) 0) (= .cse0 .cse1)) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= (select |c_#valid| .cse1) 1) (= |c_ULTIMATE.start_sll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_28| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_28| .cse1) 0) (= (select |v_old(#valid)_AFTER_CALL_28| .cse0) 1) (= |c_#valid| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_28| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_28| .cse2 (select |c_#valid| .cse2)))))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) 4) 0) (= |c_ULTIMATE.start_sll_append_~head#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 4) 0)))) is different from false [2024-11-09 22:10:42,855 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| .cse1) 4))) (and (or (= (select (select |c_#memory_$Pointer$#1.base| .cse0) 4) 0) (= .cse0 .cse1)) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= (select |c_#valid| .cse1) 1) (= |c_ULTIMATE.start_sll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_28| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_28| .cse1) 0) (= (select |v_old(#valid)_AFTER_CALL_28| .cse0) 1) (= |c_#valid| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_28| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_28| .cse2 (select |c_#valid| .cse2)))))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) 4) 0) (= |c_ULTIMATE.start_sll_append_~head#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 4) 0)))) is different from true [2024-11-09 22:10:42,874 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-09 22:10:42,874 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 27 [2024-11-09 22:10:42,880 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 22:10:42,881 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2024-11-09 22:10:42,898 WARN L851 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimIndex_4 Int) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_8| Int) (|v_old(#valid)_AFTER_CALL_28| (Array Int Int)) (|v_#valid_BEFORE_CALL_17| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_8|) 0))) (and (= (select |v_#valid_BEFORE_CALL_17| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_28| .cse0) 0) (= |v_#valid_BEFORE_CALL_17| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_28| |v_#valid_BEFORE_CALL_17|))) (store |v_old(#valid)_AFTER_CALL_28| .cse1 (select |v_#valid_BEFORE_CALL_17| .cse1)))) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_8|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_28| v_arrayElimIndex_4) 1)))) (= |c_#valid| |c_old(#valid)|) (= |c_#memory_$Pointer$#1.offset| |c_old(#memory_$Pointer$#1.offset)|) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|)) is different from false [2024-11-09 22:10:42,901 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimIndex_4 Int) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_8| Int) (|v_old(#valid)_AFTER_CALL_28| (Array Int Int)) (|v_#valid_BEFORE_CALL_17| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_8|) 0))) (and (= (select |v_#valid_BEFORE_CALL_17| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_28| .cse0) 0) (= |v_#valid_BEFORE_CALL_17| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_28| |v_#valid_BEFORE_CALL_17|))) (store |v_old(#valid)_AFTER_CALL_28| .cse1 (select |v_#valid_BEFORE_CALL_17| .cse1)))) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_8|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_28| v_arrayElimIndex_4) 1)))) (= |c_#valid| |c_old(#valid)|) (= |c_#memory_$Pointer$#1.offset| |c_old(#memory_$Pointer$#1.offset)|) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|)) is different from true [2024-11-09 22:10:42,923 WARN L851 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimIndex_4 Int) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_8| Int) (|v_old(#valid)_AFTER_CALL_28| (Array Int Int)) (|v_#valid_BEFORE_CALL_17| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_8|) 0))) (and (= (select |v_#valid_BEFORE_CALL_17| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_28| .cse0) 0) (= |v_#valid_BEFORE_CALL_17| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_28| |v_#valid_BEFORE_CALL_17|))) (store |v_old(#valid)_AFTER_CALL_28| .cse1 (select |v_#valid_BEFORE_CALL_17| .cse1)))) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_8|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_28| v_arrayElimIndex_4) 1)))) (= |c_#memory_$Pointer$#1.offset| |c_old(#memory_$Pointer$#1.offset)|) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|)) is different from false [2024-11-09 22:10:42,927 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimIndex_4 Int) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_8| Int) (|v_old(#valid)_AFTER_CALL_28| (Array Int Int)) (|v_#valid_BEFORE_CALL_17| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_8|) 0))) (and (= (select |v_#valid_BEFORE_CALL_17| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_28| .cse0) 0) (= |v_#valid_BEFORE_CALL_17| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_28| |v_#valid_BEFORE_CALL_17|))) (store |v_old(#valid)_AFTER_CALL_28| .cse1 (select |v_#valid_BEFORE_CALL_17| .cse1)))) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_8|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_28| v_arrayElimIndex_4) 1)))) (= |c_#memory_$Pointer$#1.offset| |c_old(#memory_$Pointer$#1.offset)|) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|)) is different from true [2024-11-09 22:10:42,993 WARN L851 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimIndex_4 Int) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_8| Int) (|v_old(#valid)_AFTER_CALL_28| (Array Int Int)) (|v_#valid_BEFORE_CALL_17| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_8|) 0))) (and (= (select |v_#valid_BEFORE_CALL_17| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_28| .cse0) 0) (= |v_#valid_BEFORE_CALL_17| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_28| |v_#valid_BEFORE_CALL_17|))) (store |v_old(#valid)_AFTER_CALL_28| .cse1 (select |v_#valid_BEFORE_CALL_17| .cse1)))) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_8|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_28| v_arrayElimIndex_4) 1)))) (exists ((|v_node_create_~temp~0#1.base_82| Int)) (and (= |c_#memory_$Pointer$#1.offset| (store |c_old(#memory_$Pointer$#1.offset)| |v_node_create_~temp~0#1.base_82| (select |c_#memory_$Pointer$#1.offset| |v_node_create_~temp~0#1.base_82|))) (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| |v_node_create_~temp~0#1.base_82| (select |c_#memory_$Pointer$#1.base| |v_node_create_~temp~0#1.base_82|))) (= (select |c_old(#valid)| |v_node_create_~temp~0#1.base_82|) 0)))) is different from false [2024-11-09 22:10:42,997 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimIndex_4 Int) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_8| Int) (|v_old(#valid)_AFTER_CALL_28| (Array Int Int)) (|v_#valid_BEFORE_CALL_17| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_8|) 0))) (and (= (select |v_#valid_BEFORE_CALL_17| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_28| .cse0) 0) (= |v_#valid_BEFORE_CALL_17| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_28| |v_#valid_BEFORE_CALL_17|))) (store |v_old(#valid)_AFTER_CALL_28| .cse1 (select |v_#valid_BEFORE_CALL_17| .cse1)))) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_8|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_28| v_arrayElimIndex_4) 1)))) (exists ((|v_node_create_~temp~0#1.base_82| Int)) (and (= |c_#memory_$Pointer$#1.offset| (store |c_old(#memory_$Pointer$#1.offset)| |v_node_create_~temp~0#1.base_82| (select |c_#memory_$Pointer$#1.offset| |v_node_create_~temp~0#1.base_82|))) (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| |v_node_create_~temp~0#1.base_82| (select |c_#memory_$Pointer$#1.base| |v_node_create_~temp~0#1.base_82|))) (= (select |c_old(#valid)| |v_node_create_~temp~0#1.base_82|) 0)))) is different from true [2024-11-09 22:10:43,089 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 22:10:43,105 INFO L349 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2024-11-09 22:10:43,105 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 68 treesize of output 51 [2024-11-09 22:10:43,123 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 22:10:43,125 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 22:10:43,127 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 22:10:43,128 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 33 [2024-11-09 22:10:43,173 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| .cse1) 4))) (and (or (= (select (select |c_#memory_$Pointer$#1.base| .cse0) 4) 0) (= .cse0 .cse1)) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_sll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) 4) 0) (exists ((|v_node_create_~temp~0#1.base_82| Int) (|v_old(#valid)_AFTER_CALL_28| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_29| (Array Int Int))) (and (= (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_28| |v_old(#valid)_AFTER_CALL_29|))) (store |v_old(#valid)_AFTER_CALL_28| .cse2 (select |v_old(#valid)_AFTER_CALL_29| .cse2))) |v_old(#valid)_AFTER_CALL_29|) (= (select |v_old(#valid)_AFTER_CALL_29| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_29| |v_node_create_~temp~0#1.base_82|) 0) (= (select |v_old(#valid)_AFTER_CALL_28| .cse1) 0) (= (select |v_old(#valid)_AFTER_CALL_28| .cse0) 1))) (= |c_ULTIMATE.start_sll_append_~head#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_30| (Array Int Int)) (v_arrayElimIndex_4 Int) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_17| (Array Int Int))) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_8|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_30| .cse3) 0) (= (select |v_#valid_BEFORE_CALL_17| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_30| v_arrayElimIndex_4) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_8|) 0) 0) (= |v_#valid_BEFORE_CALL_17| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_30| |v_#valid_BEFORE_CALL_17|))) (store |v_old(#valid)_AFTER_CALL_30| .cse4 (select |v_#valid_BEFORE_CALL_17| .cse4))))))) (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 4) 0)))) is different from false [2024-11-09 22:10:43,179 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| .cse1) 4))) (and (or (= (select (select |c_#memory_$Pointer$#1.base| .cse0) 4) 0) (= .cse0 .cse1)) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_sll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) 4) 0) (exists ((|v_node_create_~temp~0#1.base_82| Int) (|v_old(#valid)_AFTER_CALL_28| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_29| (Array Int Int))) (and (= (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_28| |v_old(#valid)_AFTER_CALL_29|))) (store |v_old(#valid)_AFTER_CALL_28| .cse2 (select |v_old(#valid)_AFTER_CALL_29| .cse2))) |v_old(#valid)_AFTER_CALL_29|) (= (select |v_old(#valid)_AFTER_CALL_29| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_29| |v_node_create_~temp~0#1.base_82|) 0) (= (select |v_old(#valid)_AFTER_CALL_28| .cse1) 0) (= (select |v_old(#valid)_AFTER_CALL_28| .cse0) 1))) (= |c_ULTIMATE.start_sll_append_~head#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_30| (Array Int Int)) (v_arrayElimIndex_4 Int) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_17| (Array Int Int))) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_8|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_30| .cse3) 0) (= (select |v_#valid_BEFORE_CALL_17| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_30| v_arrayElimIndex_4) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_8|) 0) 0) (= |v_#valid_BEFORE_CALL_17| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_30| |v_#valid_BEFORE_CALL_17|))) (store |v_old(#valid)_AFTER_CALL_30| .cse4 (select |v_#valid_BEFORE_CALL_17| .cse4))))))) (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 4) 0)))) is different from true [2024-11-09 22:10:43,363 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| .cse1) 4))) (and (or (= (select (select |c_#memory_$Pointer$#1.base| .cse0) 4) 0) (= .cse0 .cse1)) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) 4) 0) (exists ((|v_node_create_~temp~0#1.base_82| Int) (|v_old(#valid)_AFTER_CALL_28| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_29| (Array Int Int))) (and (= (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_28| |v_old(#valid)_AFTER_CALL_29|))) (store |v_old(#valid)_AFTER_CALL_28| .cse2 (select |v_old(#valid)_AFTER_CALL_29| .cse2))) |v_old(#valid)_AFTER_CALL_29|) (= (select |v_old(#valid)_AFTER_CALL_29| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_29| |v_node_create_~temp~0#1.base_82|) 0) (= (select |v_old(#valid)_AFTER_CALL_28| .cse1) 0) (= (select |v_old(#valid)_AFTER_CALL_28| .cse0) 1))) (= .cse1 |c_ULTIMATE.start_sll_append_~last~0#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_30| (Array Int Int)) (v_arrayElimIndex_4 Int) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_17| (Array Int Int))) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_8|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_30| .cse3) 0) (= (select |v_#valid_BEFORE_CALL_17| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_30| v_arrayElimIndex_4) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_8|) 0) 0) (= |v_#valid_BEFORE_CALL_17| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_30| |v_#valid_BEFORE_CALL_17|))) (store |v_old(#valid)_AFTER_CALL_30| .cse4 (select |v_#valid_BEFORE_CALL_17| .cse4))))))) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 4) 0)))) is different from false [2024-11-09 22:10:43,368 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| .cse1) 4))) (and (or (= (select (select |c_#memory_$Pointer$#1.base| .cse0) 4) 0) (= .cse0 .cse1)) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) 4) 0) (exists ((|v_node_create_~temp~0#1.base_82| Int) (|v_old(#valid)_AFTER_CALL_28| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_29| (Array Int Int))) (and (= (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_28| |v_old(#valid)_AFTER_CALL_29|))) (store |v_old(#valid)_AFTER_CALL_28| .cse2 (select |v_old(#valid)_AFTER_CALL_29| .cse2))) |v_old(#valid)_AFTER_CALL_29|) (= (select |v_old(#valid)_AFTER_CALL_29| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_29| |v_node_create_~temp~0#1.base_82|) 0) (= (select |v_old(#valid)_AFTER_CALL_28| .cse1) 0) (= (select |v_old(#valid)_AFTER_CALL_28| .cse0) 1))) (= .cse1 |c_ULTIMATE.start_sll_append_~last~0#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_30| (Array Int Int)) (v_arrayElimIndex_4 Int) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_17| (Array Int Int))) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_8|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_30| .cse3) 0) (= (select |v_#valid_BEFORE_CALL_17| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_30| v_arrayElimIndex_4) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_8|) 0) 0) (= |v_#valid_BEFORE_CALL_17| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_30| |v_#valid_BEFORE_CALL_17|))) (store |v_old(#valid)_AFTER_CALL_30| .cse4 (select |v_#valid_BEFORE_CALL_17| .cse4))))))) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 4) 0)))) is different from true [2024-11-09 22:10:43,524 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| .cse1) 4))) (and (or (= (select (select |c_#memory_$Pointer$#1.base| .cse0) 4) 0) (= .cse0 .cse1)) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) 4) 0) (exists ((|v_node_create_~temp~0#1.base_82| Int) (|v_old(#valid)_AFTER_CALL_28| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_29| (Array Int Int))) (and (= (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_28| |v_old(#valid)_AFTER_CALL_29|))) (store |v_old(#valid)_AFTER_CALL_28| .cse2 (select |v_old(#valid)_AFTER_CALL_29| .cse2))) |v_old(#valid)_AFTER_CALL_29|) (= (select |v_old(#valid)_AFTER_CALL_29| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_29| |v_node_create_~temp~0#1.base_82|) 0) (= (select |v_old(#valid)_AFTER_CALL_28| .cse1) 0) (= (select |v_old(#valid)_AFTER_CALL_28| .cse0) 1))) (exists ((|v_old(#valid)_AFTER_CALL_30| (Array Int Int)) (v_arrayElimIndex_4 Int) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_17| (Array Int Int))) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_8|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_30| .cse3) 0) (= (select |v_#valid_BEFORE_CALL_17| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_30| v_arrayElimIndex_4) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_8|) 0) 0) (= |v_#valid_BEFORE_CALL_17| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_30| |v_#valid_BEFORE_CALL_17|))) (store |v_old(#valid)_AFTER_CALL_30| .cse4 (select |v_#valid_BEFORE_CALL_17| .cse4))))))) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 4) 0) (= .cse0 |c_ULTIMATE.start_sll_append_~last~0#1.base|)))) is different from false [2024-11-09 22:10:43,529 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| .cse1) 4))) (and (or (= (select (select |c_#memory_$Pointer$#1.base| .cse0) 4) 0) (= .cse0 .cse1)) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) 4) 0) (exists ((|v_node_create_~temp~0#1.base_82| Int) (|v_old(#valid)_AFTER_CALL_28| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_29| (Array Int Int))) (and (= (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_28| |v_old(#valid)_AFTER_CALL_29|))) (store |v_old(#valid)_AFTER_CALL_28| .cse2 (select |v_old(#valid)_AFTER_CALL_29| .cse2))) |v_old(#valid)_AFTER_CALL_29|) (= (select |v_old(#valid)_AFTER_CALL_29| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_29| |v_node_create_~temp~0#1.base_82|) 0) (= (select |v_old(#valid)_AFTER_CALL_28| .cse1) 0) (= (select |v_old(#valid)_AFTER_CALL_28| .cse0) 1))) (exists ((|v_old(#valid)_AFTER_CALL_30| (Array Int Int)) (v_arrayElimIndex_4 Int) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_17| (Array Int Int))) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_8|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_30| .cse3) 0) (= (select |v_#valid_BEFORE_CALL_17| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_30| v_arrayElimIndex_4) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_8|) 0) 0) (= |v_#valid_BEFORE_CALL_17| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_30| |v_#valid_BEFORE_CALL_17|))) (store |v_old(#valid)_AFTER_CALL_30| .cse4 (select |v_#valid_BEFORE_CALL_17| .cse4))))))) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 4) 0) (= .cse0 |c_ULTIMATE.start_sll_append_~last~0#1.base|)))) is different from true [2024-11-09 22:10:43,577 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-09 22:10:43,577 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 75 treesize of output 30 [2024-11-09 22:10:43,586 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 22:10:43,586 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2024-11-09 22:10:43,627 WARN L851 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_sll_append_#t~mem10#1.base| 0) (= |c_ULTIMATE.start_sll_append_#t~mem10#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_30| (Array Int Int)) (v_arrayElimIndex_4 Int) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_17| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_8|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_30| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_17| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_30| v_arrayElimIndex_4) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_8|) 0) 0) (= |v_#valid_BEFORE_CALL_17| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_30| |v_#valid_BEFORE_CALL_17|))) (store |v_old(#valid)_AFTER_CALL_30| .cse1 (select |v_#valid_BEFORE_CALL_17| .cse1))))))) (exists ((v_arrayElimIndex_6 Int) (|v_node_create_~temp~0#1.base_82| Int) (|v_old(#valid)_AFTER_CALL_28| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_29| (Array Int Int))) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (and (= (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_28| |v_old(#valid)_AFTER_CALL_29|))) (store |v_old(#valid)_AFTER_CALL_28| .cse2 (select |v_old(#valid)_AFTER_CALL_29| .cse2))) |v_old(#valid)_AFTER_CALL_29|) (= 1 (select |v_old(#valid)_AFTER_CALL_28| v_arrayElimIndex_6)) (= (select |v_old(#valid)_AFTER_CALL_29| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_29| |v_node_create_~temp~0#1.base_82|) 0) (= (select |v_old(#valid)_AFTER_CALL_28| .cse3) 0))))) is different from false [2024-11-09 22:10:43,631 WARN L873 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_sll_append_#t~mem10#1.base| 0) (= |c_ULTIMATE.start_sll_append_#t~mem10#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_30| (Array Int Int)) (v_arrayElimIndex_4 Int) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_17| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_8|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_30| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_17| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_30| v_arrayElimIndex_4) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_8|) 0) 0) (= |v_#valid_BEFORE_CALL_17| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_30| |v_#valid_BEFORE_CALL_17|))) (store |v_old(#valid)_AFTER_CALL_30| .cse1 (select |v_#valid_BEFORE_CALL_17| .cse1))))))) (exists ((v_arrayElimIndex_6 Int) (|v_node_create_~temp~0#1.base_82| Int) (|v_old(#valid)_AFTER_CALL_28| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_29| (Array Int Int))) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (and (= (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_28| |v_old(#valid)_AFTER_CALL_29|))) (store |v_old(#valid)_AFTER_CALL_28| .cse2 (select |v_old(#valid)_AFTER_CALL_29| .cse2))) |v_old(#valid)_AFTER_CALL_29|) (= 1 (select |v_old(#valid)_AFTER_CALL_28| v_arrayElimIndex_6)) (= (select |v_old(#valid)_AFTER_CALL_29| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_29| |v_node_create_~temp~0#1.base_82|) 0) (= (select |v_old(#valid)_AFTER_CALL_28| .cse3) 0))))) is different from true [2024-11-09 22:10:43,633 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 14 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 16 not checked. [2024-11-09 22:10:43,633 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 22:10:43,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [36801959] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 22:10:43,925 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 22:10:43,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 22] total 37 [2024-11-09 22:10:43,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491838540] [2024-11-09 22:10:43,925 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 22:10:43,925 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2024-11-09 22:10:43,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:10:43,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2024-11-09 22:10:43,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=788, Unknown=24, NotChecked=804, Total=1722 [2024-11-09 22:10:43,927 INFO L87 Difference]: Start difference. First operand 80 states and 90 transitions. Second operand has 37 states, 35 states have (on average 1.8) internal successors, (63), 30 states have internal predecessors, (63), 6 states have call successors, (6), 4 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-09 22:10:44,048 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0)) (.cse3 (= (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0))) (and (exists ((|v_old(#valid)_AFTER_CALL_28| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_28| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_28| |c_ULTIMATE.start_sll_create_#t~ret4#1.base|) 0) (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_28| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_28| .cse0 (select |c_#valid| .cse0)))))) .cse1 (not (= |c_ULTIMATE.start_sll_create_#t~ret4#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or (exists ((|v_old(#memory_$Pointer$#1.base)_AFTER_CALL_28| (Array Int (Array Int Int)))) (let ((.cse2 (@diff |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_28| |c_#memory_$Pointer$#1.base|))) (and (= |c_#memory_$Pointer$#1.base| (store |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_28| .cse2 (select |c_#memory_$Pointer$#1.base| .cse2))) (= (select (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_28| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0) (= .cse2 |c_ULTIMATE.start_sll_create_#t~ret4#1.base|)))) .cse3) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (or .cse1 (exists ((|v_#memory_$Pointer$#1.offset_BEFORE_CALL_8| (Array Int (Array Int Int)))) (let ((.cse4 (@diff |v_#memory_$Pointer$#1.offset_BEFORE_CALL_8| |c_#memory_$Pointer$#1.offset|))) (and (= |c_ULTIMATE.start_sll_create_#t~ret4#1.base| .cse4) (= (select (select |v_#memory_$Pointer$#1.offset_BEFORE_CALL_8| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0) (= |c_#memory_$Pointer$#1.offset| (store |v_#memory_$Pointer$#1.offset_BEFORE_CALL_8| .cse4 (select |c_#memory_$Pointer$#1.offset| .cse4))))))) (= |c_ULTIMATE.start_sll_create_#t~ret4#1.offset| 0) .cse3 (= |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-09 22:10:44,052 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0)) (.cse3 (= (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0))) (and (exists ((|v_old(#valid)_AFTER_CALL_28| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_28| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_28| |c_ULTIMATE.start_sll_create_#t~ret4#1.base|) 0) (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_28| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_28| .cse0 (select |c_#valid| .cse0)))))) .cse1 (not (= |c_ULTIMATE.start_sll_create_#t~ret4#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or (exists ((|v_old(#memory_$Pointer$#1.base)_AFTER_CALL_28| (Array Int (Array Int Int)))) (let ((.cse2 (@diff |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_28| |c_#memory_$Pointer$#1.base|))) (and (= |c_#memory_$Pointer$#1.base| (store |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_28| .cse2 (select |c_#memory_$Pointer$#1.base| .cse2))) (= (select (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_28| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0) (= .cse2 |c_ULTIMATE.start_sll_create_#t~ret4#1.base|)))) .cse3) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (or .cse1 (exists ((|v_#memory_$Pointer$#1.offset_BEFORE_CALL_8| (Array Int (Array Int Int)))) (let ((.cse4 (@diff |v_#memory_$Pointer$#1.offset_BEFORE_CALL_8| |c_#memory_$Pointer$#1.offset|))) (and (= |c_ULTIMATE.start_sll_create_#t~ret4#1.base| .cse4) (= (select (select |v_#memory_$Pointer$#1.offset_BEFORE_CALL_8| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0) (= |c_#memory_$Pointer$#1.offset| (store |v_#memory_$Pointer$#1.offset_BEFORE_CALL_8| .cse4 (select |c_#memory_$Pointer$#1.offset| .cse4))))))) (= |c_ULTIMATE.start_sll_create_#t~ret4#1.offset| 0) .cse3 (= |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-09 22:10:44,058 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4))) (let ((.cse2 (= (select (select |c_#memory_$Pointer$#1.base| .cse1) 4) 0)) (.cse0 (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0)) (.cse6 (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) 4) 0))) (and .cse0 (= (select |c_#valid| .cse1) 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) .cse2 (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (exists ((|v_old(#valid)_AFTER_CALL_28| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_28| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_28| .cse1) 1) (= |c_#valid| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_28| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_28| .cse3 (select |c_#valid| .cse3)))))) (or (exists ((|v_#memory_$Pointer$#1.base_95| (Array Int (Array Int Int)))) (and (exists ((|v_old(#memory_$Pointer$#1.base)_AFTER_CALL_28| (Array Int (Array Int Int)))) (let ((.cse4 (@diff |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_28| |v_#memory_$Pointer$#1.base_95|))) (and (= .cse4 |c_ULTIMATE.start_sll_create_~head~0#1.base|) (= (select (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_28| .cse1) 4) 0) (= (store |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_28| .cse4 (select |v_#memory_$Pointer$#1.base_95| .cse4)) |v_#memory_$Pointer$#1.base_95|)))) (= (store |v_#memory_$Pointer$#1.base_95| |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select |v_#memory_$Pointer$#1.base_95| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4 .cse1)) |c_#memory_$Pointer$#1.base|))) .cse2 (= .cse1 |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (or (exists ((|v_#memory_$Pointer$#1.offset_92| (Array Int (Array Int Int)))) (and (= |c_#memory_$Pointer$#1.offset| (store |v_#memory_$Pointer$#1.offset_92| |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select |v_#memory_$Pointer$#1.offset_92| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4 0))) (exists ((|v_#memory_$Pointer$#1.offset_BEFORE_CALL_8| (Array Int (Array Int Int)))) (let ((.cse5 (@diff |v_#memory_$Pointer$#1.offset_BEFORE_CALL_8| |v_#memory_$Pointer$#1.offset_92|))) (and (= |v_#memory_$Pointer$#1.offset_92| (store |v_#memory_$Pointer$#1.offset_BEFORE_CALL_8| .cse5 (select |v_#memory_$Pointer$#1.offset_92| .cse5))) (= (select (select |v_#memory_$Pointer$#1.offset_BEFORE_CALL_8| .cse1) 4) 0) (= .cse5 |c_ULTIMATE.start_sll_create_~head~0#1.base|)))))) (and .cse0 .cse6)) .cse6 (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0)))) is different from false [2024-11-09 22:10:44,062 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4))) (let ((.cse2 (= (select (select |c_#memory_$Pointer$#1.base| .cse1) 4) 0)) (.cse0 (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0)) (.cse6 (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) 4) 0))) (and .cse0 (= (select |c_#valid| .cse1) 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) .cse2 (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (exists ((|v_old(#valid)_AFTER_CALL_28| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_28| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_28| .cse1) 1) (= |c_#valid| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_28| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_28| .cse3 (select |c_#valid| .cse3)))))) (or (exists ((|v_#memory_$Pointer$#1.base_95| (Array Int (Array Int Int)))) (and (exists ((|v_old(#memory_$Pointer$#1.base)_AFTER_CALL_28| (Array Int (Array Int Int)))) (let ((.cse4 (@diff |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_28| |v_#memory_$Pointer$#1.base_95|))) (and (= .cse4 |c_ULTIMATE.start_sll_create_~head~0#1.base|) (= (select (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_28| .cse1) 4) 0) (= (store |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_28| .cse4 (select |v_#memory_$Pointer$#1.base_95| .cse4)) |v_#memory_$Pointer$#1.base_95|)))) (= (store |v_#memory_$Pointer$#1.base_95| |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select |v_#memory_$Pointer$#1.base_95| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4 .cse1)) |c_#memory_$Pointer$#1.base|))) .cse2 (= .cse1 |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (or (exists ((|v_#memory_$Pointer$#1.offset_92| (Array Int (Array Int Int)))) (and (= |c_#memory_$Pointer$#1.offset| (store |v_#memory_$Pointer$#1.offset_92| |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select |v_#memory_$Pointer$#1.offset_92| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4 0))) (exists ((|v_#memory_$Pointer$#1.offset_BEFORE_CALL_8| (Array Int (Array Int Int)))) (let ((.cse5 (@diff |v_#memory_$Pointer$#1.offset_BEFORE_CALL_8| |v_#memory_$Pointer$#1.offset_92|))) (and (= |v_#memory_$Pointer$#1.offset_92| (store |v_#memory_$Pointer$#1.offset_BEFORE_CALL_8| .cse5 (select |v_#memory_$Pointer$#1.offset_92| .cse5))) (= (select (select |v_#memory_$Pointer$#1.offset_BEFORE_CALL_8| .cse1) 4) 0) (= .cse5 |c_ULTIMATE.start_sll_create_~head~0#1.base|)))))) (and .cse0 .cse6)) .cse6 (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0)))) is different from true [2024-11-09 22:10:44,067 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4))) (let ((.cse1 (= (select (select |c_#memory_$Pointer$#1.base| .cse0) 4) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0) (= (select |c_#valid| .cse0) 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) .cse1 (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (exists ((|v_old(#valid)_AFTER_CALL_28| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_28| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_28| .cse0) 1) (= |c_#valid| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_28| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_28| .cse2 (select |c_#valid| .cse2)))))) (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 4) 0) (or .cse1 (= .cse0 |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0)))) is different from false [2024-11-09 22:10:44,069 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4))) (let ((.cse1 (= (select (select |c_#memory_$Pointer$#1.base| .cse0) 4) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0) (= (select |c_#valid| .cse0) 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) .cse1 (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (exists ((|v_old(#valid)_AFTER_CALL_28| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_28| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_28| .cse0) 1) (= |c_#valid| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_28| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_28| .cse2 (select |c_#valid| .cse2)))))) (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 4) 0) (or .cse1 (= .cse0 |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0)))) is different from true [2024-11-09 22:10:44,072 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_#res#1.base|) 4))) (let ((.cse1 (= (select (select |c_#memory_$Pointer$#1.base| .cse0) 4) 0))) (and (= (select |c_#valid| |c_ULTIMATE.start_sll_create_#res#1.base|) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_create_#res#1.base|) 4) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 4) 0) (= |c_ULTIMATE.start_sll_create_#res#1.offset| 0) (or .cse1 (= .cse0 |c_ULTIMATE.start_sll_create_#res#1.base|)) (exists ((|v_old(#valid)_AFTER_CALL_28| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_28| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_28| |c_ULTIMATE.start_sll_create_#res#1.base|) 0) (= |c_#valid| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_28| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_28| .cse2 (select |c_#valid| .cse2)))))) (= 1 (select |c_#valid| .cse0)) .cse1))) is different from false [2024-11-09 22:10:44,075 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_#res#1.base|) 4))) (let ((.cse1 (= (select (select |c_#memory_$Pointer$#1.base| .cse0) 4) 0))) (and (= (select |c_#valid| |c_ULTIMATE.start_sll_create_#res#1.base|) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_create_#res#1.base|) 4) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 4) 0) (= |c_ULTIMATE.start_sll_create_#res#1.offset| 0) (or .cse1 (= .cse0 |c_ULTIMATE.start_sll_create_#res#1.base|)) (exists ((|v_old(#valid)_AFTER_CALL_28| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_28| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_28| |c_ULTIMATE.start_sll_create_#res#1.base|) 0) (= |c_#valid| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_28| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_28| .cse2 (select |c_#valid| .cse2)))))) (= 1 (select |c_#valid| .cse0)) .cse1))) is different from true [2024-11-09 22:10:44,079 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0)) (.cse4 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|))) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| .cse4) 4)) (.cse0 (select (select |c_#memory_$Pointer$#1.base| .cse1) 4))) (and (or (= (select (select |c_#memory_$Pointer$#1.base| .cse0) 4) 0) (= .cse0 .cse1)) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0) (= (select |c_#valid| .cse1) 1) (= |c_ULTIMATE.start_sll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_28| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_28| .cse1) 0) (= (select |v_old(#valid)_AFTER_CALL_28| .cse0) 1) (= |c_#valid| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_28| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_28| .cse2 (select |c_#valid| .cse2)))))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) 4) 0) (= 1 (select |c_#valid| .cse3)) (= (select (select |c_#memory_$Pointer$#1.base| .cse3) 4) 0) (= |c_ULTIMATE.start_sll_append_~head#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse3) 4) 0) (= (select |c_#valid| .cse4) 1) (= |c_ULTIMATE.start_sll_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= (select (select |c_#memory_$Pointer$#1.offset| .cse4) 4) 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 4) 0)))) is different from false [2024-11-09 22:10:44,082 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0)) (.cse4 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|))) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| .cse4) 4)) (.cse0 (select (select |c_#memory_$Pointer$#1.base| .cse1) 4))) (and (or (= (select (select |c_#memory_$Pointer$#1.base| .cse0) 4) 0) (= .cse0 .cse1)) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0) (= (select |c_#valid| .cse1) 1) (= |c_ULTIMATE.start_sll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_28| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_28| .cse1) 0) (= (select |v_old(#valid)_AFTER_CALL_28| .cse0) 1) (= |c_#valid| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_28| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_28| .cse2 (select |c_#valid| .cse2)))))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) 4) 0) (= 1 (select |c_#valid| .cse3)) (= (select (select |c_#memory_$Pointer$#1.base| .cse3) 4) 0) (= |c_ULTIMATE.start_sll_append_~head#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse3) 4) 0) (= (select |c_#valid| .cse4) 1) (= |c_ULTIMATE.start_sll_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= (select (select |c_#memory_$Pointer$#1.offset| .cse4) 4) 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 4) 0)))) is different from true [2024-11-09 22:10:44,086 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_#memory_int#1| |c_old(#memory_int#1)|) (exists ((v_arrayElimIndex_4 Int) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_8| Int) (|v_old(#valid)_AFTER_CALL_28| (Array Int Int)) (|v_#valid_BEFORE_CALL_17| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_8|) 0))) (and (= (select |v_#valid_BEFORE_CALL_17| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_28| .cse0) 0) (= |v_#valid_BEFORE_CALL_17| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_28| |v_#valid_BEFORE_CALL_17|))) (store |v_old(#valid)_AFTER_CALL_28| .cse1 (select |v_#valid_BEFORE_CALL_17| .cse1)))) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_8|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_28| v_arrayElimIndex_4) 1)))) (= |c_#valid| |c_old(#valid)|) (= |c_#memory_$Pointer$#1.offset| |c_old(#memory_$Pointer$#1.offset)|) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|) (= |c_old(#length)| |c_#length|)) is different from false [2024-11-09 22:10:44,088 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_#memory_int#1| |c_old(#memory_int#1)|) (exists ((v_arrayElimIndex_4 Int) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_8| Int) (|v_old(#valid)_AFTER_CALL_28| (Array Int Int)) (|v_#valid_BEFORE_CALL_17| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_8|) 0))) (and (= (select |v_#valid_BEFORE_CALL_17| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_28| .cse0) 0) (= |v_#valid_BEFORE_CALL_17| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_28| |v_#valid_BEFORE_CALL_17|))) (store |v_old(#valid)_AFTER_CALL_28| .cse1 (select |v_#valid_BEFORE_CALL_17| .cse1)))) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_8|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_28| v_arrayElimIndex_4) 1)))) (= |c_#valid| |c_old(#valid)|) (= |c_#memory_$Pointer$#1.offset| |c_old(#memory_$Pointer$#1.offset)|) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|) (= |c_old(#length)| |c_#length|)) is different from true [2024-11-09 22:10:44,092 WARN L851 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimIndex_4 Int) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_8| Int) (|v_old(#valid)_AFTER_CALL_28| (Array Int Int)) (|v_#valid_BEFORE_CALL_17| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_8|) 0))) (and (= (select |v_#valid_BEFORE_CALL_17| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_28| .cse0) 0) (= |v_#valid_BEFORE_CALL_17| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_28| |v_#valid_BEFORE_CALL_17|))) (store |v_old(#valid)_AFTER_CALL_28| .cse1 (select |v_#valid_BEFORE_CALL_17| .cse1)))) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_8|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_28| v_arrayElimIndex_4) 1)))) (= |c_#memory_$Pointer$#1.offset| |c_old(#memory_$Pointer$#1.offset)|) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| 1)) (= |c_node_create_~temp~0#1.offset| 0) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|)) is different from false [2024-11-09 22:10:44,095 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimIndex_4 Int) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_8| Int) (|v_old(#valid)_AFTER_CALL_28| (Array Int Int)) (|v_#valid_BEFORE_CALL_17| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_8|) 0))) (and (= (select |v_#valid_BEFORE_CALL_17| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_28| .cse0) 0) (= |v_#valid_BEFORE_CALL_17| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_28| |v_#valid_BEFORE_CALL_17|))) (store |v_old(#valid)_AFTER_CALL_28| .cse1 (select |v_#valid_BEFORE_CALL_17| .cse1)))) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_8|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_28| v_arrayElimIndex_4) 1)))) (= |c_#memory_$Pointer$#1.offset| |c_old(#memory_$Pointer$#1.offset)|) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| 1)) (= |c_node_create_~temp~0#1.offset| 0) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|)) is different from true [2024-11-09 22:10:44,103 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (@diff |c_old(#memory_$Pointer$#1.base)| |c_#memory_$Pointer$#1.base|)) (.cse3 (@diff |c_old(#memory_$Pointer$#1.offset)| |c_#memory_$Pointer$#1.offset|))) (and (or (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|) (= .cse0 |c_node_create_#res#1.base|)) (exists ((v_arrayElimIndex_4 Int) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_8| Int) (|v_old(#valid)_AFTER_CALL_28| (Array Int Int)) (|v_#valid_BEFORE_CALL_17| (Array Int Int))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_8|) 0))) (and (= (select |v_#valid_BEFORE_CALL_17| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_28| .cse1) 0) (= |v_#valid_BEFORE_CALL_17| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_28| |v_#valid_BEFORE_CALL_17|))) (store |v_old(#valid)_AFTER_CALL_28| .cse2 (select |v_#valid_BEFORE_CALL_17| .cse2)))) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_8|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_28| v_arrayElimIndex_4) 1)))) (= |c_node_create_#res#1.offset| 0) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (= (select |c_#valid| |c_node_create_#res#1.base|) 1) (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| .cse0 (select |c_#memory_$Pointer$#1.base| .cse0))) (or (= |c_#memory_$Pointer$#1.offset| |c_old(#memory_$Pointer$#1.offset)|) (= |c_node_create_#res#1.base| .cse3)) (= |c_#valid| (let ((.cse4 (@diff |c_old(#valid)| |c_#valid|))) (store |c_old(#valid)| .cse4 (select |c_#valid| .cse4)))) (exists ((|v_node_create_~temp~0#1.base_82| Int)) (and (= |c_#memory_$Pointer$#1.offset| (store |c_old(#memory_$Pointer$#1.offset)| |v_node_create_~temp~0#1.base_82| (select |c_#memory_$Pointer$#1.offset| |v_node_create_~temp~0#1.base_82|))) (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| |v_node_create_~temp~0#1.base_82| (select |c_#memory_$Pointer$#1.base| |v_node_create_~temp~0#1.base_82|))) (= (select |c_old(#valid)| |v_node_create_~temp~0#1.base_82|) 0))) (= |c_#memory_$Pointer$#1.offset| (store |c_old(#memory_$Pointer$#1.offset)| .cse3 (select |c_#memory_$Pointer$#1.offset| .cse3))))) is different from false [2024-11-09 22:10:44,106 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (@diff |c_old(#memory_$Pointer$#1.base)| |c_#memory_$Pointer$#1.base|)) (.cse3 (@diff |c_old(#memory_$Pointer$#1.offset)| |c_#memory_$Pointer$#1.offset|))) (and (or (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|) (= .cse0 |c_node_create_#res#1.base|)) (exists ((v_arrayElimIndex_4 Int) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_8| Int) (|v_old(#valid)_AFTER_CALL_28| (Array Int Int)) (|v_#valid_BEFORE_CALL_17| (Array Int Int))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_8|) 0))) (and (= (select |v_#valid_BEFORE_CALL_17| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_28| .cse1) 0) (= |v_#valid_BEFORE_CALL_17| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_28| |v_#valid_BEFORE_CALL_17|))) (store |v_old(#valid)_AFTER_CALL_28| .cse2 (select |v_#valid_BEFORE_CALL_17| .cse2)))) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_8|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_28| v_arrayElimIndex_4) 1)))) (= |c_node_create_#res#1.offset| 0) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (= (select |c_#valid| |c_node_create_#res#1.base|) 1) (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| .cse0 (select |c_#memory_$Pointer$#1.base| .cse0))) (or (= |c_#memory_$Pointer$#1.offset| |c_old(#memory_$Pointer$#1.offset)|) (= |c_node_create_#res#1.base| .cse3)) (= |c_#valid| (let ((.cse4 (@diff |c_old(#valid)| |c_#valid|))) (store |c_old(#valid)| .cse4 (select |c_#valid| .cse4)))) (exists ((|v_node_create_~temp~0#1.base_82| Int)) (and (= |c_#memory_$Pointer$#1.offset| (store |c_old(#memory_$Pointer$#1.offset)| |v_node_create_~temp~0#1.base_82| (select |c_#memory_$Pointer$#1.offset| |v_node_create_~temp~0#1.base_82|))) (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| |v_node_create_~temp~0#1.base_82| (select |c_#memory_$Pointer$#1.base| |v_node_create_~temp~0#1.base_82|))) (= (select |c_old(#valid)| |v_node_create_~temp~0#1.base_82|) 0))) (= |c_#memory_$Pointer$#1.offset| (store |c_old(#memory_$Pointer$#1.offset)| .cse3 (select |c_#memory_$Pointer$#1.offset| .cse3))))) is different from true [2024-11-09 22:10:44,118 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0)) (.cse6 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|))) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| .cse6) 4)) (.cse0 (select (select |c_#memory_$Pointer$#1.base| .cse1) 4))) (and (or (= (select (select |c_#memory_$Pointer$#1.base| .cse0) 4) 0) (= .cse0 .cse1)) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0) (= |c_ULTIMATE.start_sll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) 4) 0) (exists ((|v_node_create_~temp~0#1.base_82| Int) (|v_old(#valid)_AFTER_CALL_28| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_29| (Array Int Int))) (and (= (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_28| |v_old(#valid)_AFTER_CALL_29|))) (store |v_old(#valid)_AFTER_CALL_28| .cse2 (select |v_old(#valid)_AFTER_CALL_29| .cse2))) |v_old(#valid)_AFTER_CALL_29|) (= (select |v_old(#valid)_AFTER_CALL_29| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_29| |v_node_create_~temp~0#1.base_82|) 0) (= (select |v_old(#valid)_AFTER_CALL_28| .cse1) 0) (= (select |v_old(#valid)_AFTER_CALL_28| .cse0) 1))) (= (select (select |c_#memory_$Pointer$#1.base| .cse3) 4) 0) (= |c_ULTIMATE.start_sll_append_~head#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse3) 4) 0) (exists ((|v_old(#valid)_AFTER_CALL_30| (Array Int Int)) (v_arrayElimIndex_4 Int) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_17| (Array Int Int))) (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_8|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_30| .cse4) 0) (= (select |v_#valid_BEFORE_CALL_17| .cse4) 1) (= (select |v_old(#valid)_AFTER_CALL_30| v_arrayElimIndex_4) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_8|) 0) 0) (= |v_#valid_BEFORE_CALL_17| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_30| |v_#valid_BEFORE_CALL_17|))) (store |v_old(#valid)_AFTER_CALL_30| .cse5 (select |v_#valid_BEFORE_CALL_17| .cse5))))))) (= |c_ULTIMATE.start_sll_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= (select (select |c_#memory_$Pointer$#1.offset| .cse6) 4) 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 4) 0)))) is different from false [2024-11-09 22:10:44,122 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0)) (.cse6 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|))) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| .cse6) 4)) (.cse0 (select (select |c_#memory_$Pointer$#1.base| .cse1) 4))) (and (or (= (select (select |c_#memory_$Pointer$#1.base| .cse0) 4) 0) (= .cse0 .cse1)) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0) (= |c_ULTIMATE.start_sll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) 4) 0) (exists ((|v_node_create_~temp~0#1.base_82| Int) (|v_old(#valid)_AFTER_CALL_28| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_29| (Array Int Int))) (and (= (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_28| |v_old(#valid)_AFTER_CALL_29|))) (store |v_old(#valid)_AFTER_CALL_28| .cse2 (select |v_old(#valid)_AFTER_CALL_29| .cse2))) |v_old(#valid)_AFTER_CALL_29|) (= (select |v_old(#valid)_AFTER_CALL_29| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_29| |v_node_create_~temp~0#1.base_82|) 0) (= (select |v_old(#valid)_AFTER_CALL_28| .cse1) 0) (= (select |v_old(#valid)_AFTER_CALL_28| .cse0) 1))) (= (select (select |c_#memory_$Pointer$#1.base| .cse3) 4) 0) (= |c_ULTIMATE.start_sll_append_~head#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse3) 4) 0) (exists ((|v_old(#valid)_AFTER_CALL_30| (Array Int Int)) (v_arrayElimIndex_4 Int) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_17| (Array Int Int))) (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_8|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_30| .cse4) 0) (= (select |v_#valid_BEFORE_CALL_17| .cse4) 1) (= (select |v_old(#valid)_AFTER_CALL_30| v_arrayElimIndex_4) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_8|) 0) 0) (= |v_#valid_BEFORE_CALL_17| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_30| |v_#valid_BEFORE_CALL_17|))) (store |v_old(#valid)_AFTER_CALL_30| .cse5 (select |v_#valid_BEFORE_CALL_17| .cse5))))))) (= |c_ULTIMATE.start_sll_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= (select (select |c_#memory_$Pointer$#1.offset| .cse6) 4) 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 4) 0)))) is different from true [2024-11-09 22:10:44,132 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_append_~last~0#1.base|) 4)) (.cse0 (select (select |c_#memory_$Pointer$#1.base| .cse1) 4))) (and (or (= (select (select |c_#memory_$Pointer$#1.base| .cse0) 4) 0) (= .cse0 .cse1)) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base|) 4) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse2) 4) 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) 4) 0) (exists ((|v_node_create_~temp~0#1.base_82| Int) (|v_old(#valid)_AFTER_CALL_28| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_29| (Array Int Int))) (and (= (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_28| |v_old(#valid)_AFTER_CALL_29|))) (store |v_old(#valid)_AFTER_CALL_28| .cse3 (select |v_old(#valid)_AFTER_CALL_29| .cse3))) |v_old(#valid)_AFTER_CALL_29|) (= (select |v_old(#valid)_AFTER_CALL_29| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_29| |v_node_create_~temp~0#1.base_82|) 0) (= (select |v_old(#valid)_AFTER_CALL_28| .cse1) 0) (= (select |v_old(#valid)_AFTER_CALL_28| .cse0) 1))) (= (select (select |c_#memory_$Pointer$#1.base| .cse2) 4) 0) (= .cse1 |c_ULTIMATE.start_sll_append_~last~0#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_30| (Array Int Int)) (v_arrayElimIndex_4 Int) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_17| (Array Int Int))) (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_8|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_30| .cse4) 0) (= (select |v_#valid_BEFORE_CALL_17| .cse4) 1) (= (select |v_old(#valid)_AFTER_CALL_30| v_arrayElimIndex_4) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_8|) 0) 0) (= |v_#valid_BEFORE_CALL_17| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_30| |v_#valid_BEFORE_CALL_17|))) (store |v_old(#valid)_AFTER_CALL_30| .cse5 (select |v_#valid_BEFORE_CALL_17| .cse5))))))) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 4) 0)))) is different from false [2024-11-09 22:10:44,135 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_append_~last~0#1.base|) 4)) (.cse0 (select (select |c_#memory_$Pointer$#1.base| .cse1) 4))) (and (or (= (select (select |c_#memory_$Pointer$#1.base| .cse0) 4) 0) (= .cse0 .cse1)) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base|) 4) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse2) 4) 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) 4) 0) (exists ((|v_node_create_~temp~0#1.base_82| Int) (|v_old(#valid)_AFTER_CALL_28| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_29| (Array Int Int))) (and (= (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_28| |v_old(#valid)_AFTER_CALL_29|))) (store |v_old(#valid)_AFTER_CALL_28| .cse3 (select |v_old(#valid)_AFTER_CALL_29| .cse3))) |v_old(#valid)_AFTER_CALL_29|) (= (select |v_old(#valid)_AFTER_CALL_29| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_29| |v_node_create_~temp~0#1.base_82|) 0) (= (select |v_old(#valid)_AFTER_CALL_28| .cse1) 0) (= (select |v_old(#valid)_AFTER_CALL_28| .cse0) 1))) (= (select (select |c_#memory_$Pointer$#1.base| .cse2) 4) 0) (= .cse1 |c_ULTIMATE.start_sll_append_~last~0#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_30| (Array Int Int)) (v_arrayElimIndex_4 Int) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_17| (Array Int Int))) (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_8|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_30| .cse4) 0) (= (select |v_#valid_BEFORE_CALL_17| .cse4) 1) (= (select |v_old(#valid)_AFTER_CALL_30| v_arrayElimIndex_4) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_8|) 0) 0) (= |v_#valid_BEFORE_CALL_17| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_30| |v_#valid_BEFORE_CALL_17|))) (store |v_old(#valid)_AFTER_CALL_30| .cse5 (select |v_#valid_BEFORE_CALL_17| .cse5))))))) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 4) 0)))) is different from true [2024-11-09 22:10:44,145 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_append_~last~0#1.base|) 4)) (.cse0 (select (select |c_#memory_$Pointer$#1.base| .cse1) 4))) (and (or (= (select (select |c_#memory_$Pointer$#1.base| .cse0) 4) 0) (= .cse0 .cse1)) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base|) 4) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse2) 4) 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) 4) 0) (exists ((|v_node_create_~temp~0#1.base_82| Int) (|v_old(#valid)_AFTER_CALL_28| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_29| (Array Int Int))) (and (= (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_28| |v_old(#valid)_AFTER_CALL_29|))) (store |v_old(#valid)_AFTER_CALL_28| .cse3 (select |v_old(#valid)_AFTER_CALL_29| .cse3))) |v_old(#valid)_AFTER_CALL_29|) (= (select |v_old(#valid)_AFTER_CALL_29| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_29| |v_node_create_~temp~0#1.base_82|) 0) (= (select |v_old(#valid)_AFTER_CALL_28| .cse1) 0) (= (select |v_old(#valid)_AFTER_CALL_28| .cse0) 1))) (= |c_ULTIMATE.start_sll_append_#t~mem10#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.base| .cse2) 4) 0) (= .cse1 |c_ULTIMATE.start_sll_append_~last~0#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_30| (Array Int Int)) (v_arrayElimIndex_4 Int) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_17| (Array Int Int))) (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_8|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_30| .cse4) 0) (= (select |v_#valid_BEFORE_CALL_17| .cse4) 1) (= (select |v_old(#valid)_AFTER_CALL_30| v_arrayElimIndex_4) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_8|) 0) 0) (= |v_#valid_BEFORE_CALL_17| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_30| |v_#valid_BEFORE_CALL_17|))) (store |v_old(#valid)_AFTER_CALL_30| .cse5 (select |v_#valid_BEFORE_CALL_17| .cse5))))))) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 4) 0)))) is different from false [2024-11-09 22:10:44,149 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_append_~last~0#1.base|) 4)) (.cse0 (select (select |c_#memory_$Pointer$#1.base| .cse1) 4))) (and (or (= (select (select |c_#memory_$Pointer$#1.base| .cse0) 4) 0) (= .cse0 .cse1)) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base|) 4) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse2) 4) 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) 4) 0) (exists ((|v_node_create_~temp~0#1.base_82| Int) (|v_old(#valid)_AFTER_CALL_28| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_29| (Array Int Int))) (and (= (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_28| |v_old(#valid)_AFTER_CALL_29|))) (store |v_old(#valid)_AFTER_CALL_28| .cse3 (select |v_old(#valid)_AFTER_CALL_29| .cse3))) |v_old(#valid)_AFTER_CALL_29|) (= (select |v_old(#valid)_AFTER_CALL_29| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_29| |v_node_create_~temp~0#1.base_82|) 0) (= (select |v_old(#valid)_AFTER_CALL_28| .cse1) 0) (= (select |v_old(#valid)_AFTER_CALL_28| .cse0) 1))) (= |c_ULTIMATE.start_sll_append_#t~mem10#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.base| .cse2) 4) 0) (= .cse1 |c_ULTIMATE.start_sll_append_~last~0#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_30| (Array Int Int)) (v_arrayElimIndex_4 Int) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_17| (Array Int Int))) (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_8|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_30| .cse4) 0) (= (select |v_#valid_BEFORE_CALL_17| .cse4) 1) (= (select |v_old(#valid)_AFTER_CALL_30| v_arrayElimIndex_4) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_8|) 0) 0) (= |v_#valid_BEFORE_CALL_17| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_30| |v_#valid_BEFORE_CALL_17|))) (store |v_old(#valid)_AFTER_CALL_30| .cse5 (select |v_#valid_BEFORE_CALL_17| .cse5))))))) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 4) 0)))) is different from true [2024-11-09 22:10:44,159 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| .cse1) 4))) (and (or (= (select (select |c_#memory_$Pointer$#1.base| .cse0) 4) 0) (= .cse0 .cse1)) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base|) 4) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) 4) 0) (exists ((|v_node_create_~temp~0#1.base_82| Int) (|v_old(#valid)_AFTER_CALL_28| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_29| (Array Int Int))) (and (= (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_28| |v_old(#valid)_AFTER_CALL_29|))) (store |v_old(#valid)_AFTER_CALL_28| .cse2 (select |v_old(#valid)_AFTER_CALL_29| .cse2))) |v_old(#valid)_AFTER_CALL_29|) (= (select |v_old(#valid)_AFTER_CALL_29| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_29| |v_node_create_~temp~0#1.base_82|) 0) (= (select |v_old(#valid)_AFTER_CALL_28| .cse1) 0) (= (select |v_old(#valid)_AFTER_CALL_28| .cse0) 1))) (exists ((|v_old(#valid)_AFTER_CALL_30| (Array Int Int)) (v_arrayElimIndex_4 Int) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_17| (Array Int Int))) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_8|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_30| .cse3) 0) (= (select |v_#valid_BEFORE_CALL_17| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_30| v_arrayElimIndex_4) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_8|) 0) 0) (= |v_#valid_BEFORE_CALL_17| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_30| |v_#valid_BEFORE_CALL_17|))) (store |v_old(#valid)_AFTER_CALL_30| .cse4 (select |v_#valid_BEFORE_CALL_17| .cse4))))))) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 4) 0) (= .cse0 |c_ULTIMATE.start_sll_append_~last~0#1.base|) (= (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_append_~last~0#1.base|) 4) 0)))) is different from false [2024-11-09 22:10:44,162 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| .cse1) 4))) (and (or (= (select (select |c_#memory_$Pointer$#1.base| .cse0) 4) 0) (= .cse0 .cse1)) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base|) 4) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) 4) 0) (exists ((|v_node_create_~temp~0#1.base_82| Int) (|v_old(#valid)_AFTER_CALL_28| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_29| (Array Int Int))) (and (= (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_28| |v_old(#valid)_AFTER_CALL_29|))) (store |v_old(#valid)_AFTER_CALL_28| .cse2 (select |v_old(#valid)_AFTER_CALL_29| .cse2))) |v_old(#valid)_AFTER_CALL_29|) (= (select |v_old(#valid)_AFTER_CALL_29| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_29| |v_node_create_~temp~0#1.base_82|) 0) (= (select |v_old(#valid)_AFTER_CALL_28| .cse1) 0) (= (select |v_old(#valid)_AFTER_CALL_28| .cse0) 1))) (exists ((|v_old(#valid)_AFTER_CALL_30| (Array Int Int)) (v_arrayElimIndex_4 Int) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_17| (Array Int Int))) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_8|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_30| .cse3) 0) (= (select |v_#valid_BEFORE_CALL_17| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_30| v_arrayElimIndex_4) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_8|) 0) 0) (= |v_#valid_BEFORE_CALL_17| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_30| |v_#valid_BEFORE_CALL_17|))) (store |v_old(#valid)_AFTER_CALL_30| .cse4 (select |v_#valid_BEFORE_CALL_17| .cse4))))))) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 4) 0) (= .cse0 |c_ULTIMATE.start_sll_append_~last~0#1.base|) (= (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_append_~last~0#1.base|) 4) 0)))) is different from true [2024-11-09 22:10:44,174 WARN L851 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_sll_append_#t~mem10#1.base| 0) (= |c_ULTIMATE.start_sll_append_#t~mem10#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_30| (Array Int Int)) (v_arrayElimIndex_4 Int) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_17| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_8|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_30| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_17| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_30| v_arrayElimIndex_4) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_8|) 0) 0) (= |v_#valid_BEFORE_CALL_17| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_30| |v_#valid_BEFORE_CALL_17|))) (store |v_old(#valid)_AFTER_CALL_30| .cse1 (select |v_#valid_BEFORE_CALL_17| .cse1))))))) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| 0) (exists ((v_arrayElimIndex_6 Int) (|v_node_create_~temp~0#1.base_82| Int) (|v_old(#valid)_AFTER_CALL_28| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_29| (Array Int Int))) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (and (= (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_28| |v_old(#valid)_AFTER_CALL_29|))) (store |v_old(#valid)_AFTER_CALL_28| .cse2 (select |v_old(#valid)_AFTER_CALL_29| .cse2))) |v_old(#valid)_AFTER_CALL_29|) (= 1 (select |v_old(#valid)_AFTER_CALL_28| v_arrayElimIndex_6)) (= (select |v_old(#valid)_AFTER_CALL_29| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_29| |v_node_create_~temp~0#1.base_82|) 0) (= (select |v_old(#valid)_AFTER_CALL_28| .cse3) 0))))) is different from false [2024-11-09 22:10:44,177 WARN L873 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_sll_append_#t~mem10#1.base| 0) (= |c_ULTIMATE.start_sll_append_#t~mem10#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_30| (Array Int Int)) (v_arrayElimIndex_4 Int) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_17| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_8|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_30| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_17| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_30| v_arrayElimIndex_4) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_8|) 0) 0) (= |v_#valid_BEFORE_CALL_17| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_30| |v_#valid_BEFORE_CALL_17|))) (store |v_old(#valid)_AFTER_CALL_30| .cse1 (select |v_#valid_BEFORE_CALL_17| .cse1))))))) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| 0) (exists ((v_arrayElimIndex_6 Int) (|v_node_create_~temp~0#1.base_82| Int) (|v_old(#valid)_AFTER_CALL_28| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_29| (Array Int Int))) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (and (= (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_28| |v_old(#valid)_AFTER_CALL_29|))) (store |v_old(#valid)_AFTER_CALL_28| .cse2 (select |v_old(#valid)_AFTER_CALL_29| .cse2))) |v_old(#valid)_AFTER_CALL_29|) (= 1 (select |v_old(#valid)_AFTER_CALL_28| v_arrayElimIndex_6)) (= (select |v_old(#valid)_AFTER_CALL_29| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_29| |v_node_create_~temp~0#1.base_82|) 0) (= (select |v_old(#valid)_AFTER_CALL_28| .cse3) 0))))) is different from true [2024-11-09 22:10:44,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:10:44,263 INFO L93 Difference]: Finished difference Result 96 states and 109 transitions. [2024-11-09 22:10:44,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-09 22:10:44,263 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 35 states have (on average 1.8) internal successors, (63), 30 states have internal predecessors, (63), 6 states have call successors, (6), 4 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 47 [2024-11-09 22:10:44,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:10:44,264 INFO L225 Difference]: With dead ends: 96 [2024-11-09 22:10:44,264 INFO L226 Difference]: Without dead ends: 73 [2024-11-09 22:10:44,265 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 25 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=132, Invalid=788, Unknown=50, NotChecked=2000, Total=2970 [2024-11-09 22:10:44,266 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 0 mSDsluCounter, 369 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 399 SdHoareTripleChecker+Invalid, 1324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1087 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 22:10:44,266 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 399 Invalid, 1324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 232 Invalid, 0 Unknown, 1087 Unchecked, 0.2s Time] [2024-11-09 22:10:44,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-11-09 22:10:44,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2024-11-09 22:10:44,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 64 states have (on average 1.109375) internal successors, (71), 64 states have internal predecessors, (71), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-09 22:10:44,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 81 transitions. [2024-11-09 22:10:44,279 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 81 transitions. Word has length 47 [2024-11-09 22:10:44,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:10:44,280 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 81 transitions. [2024-11-09 22:10:44,280 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 35 states have (on average 1.8) internal successors, (63), 30 states have internal predecessors, (63), 6 states have call successors, (6), 4 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-09 22:10:44,280 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 81 transitions. [2024-11-09 22:10:44,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-09 22:10:44,281 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:10:44,281 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-09 22:10:44,296 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-09 22:10:44,481 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,SelfDestructingSolverStorable12 [2024-11-09 22:10:44,482 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:10:44,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:10:44,482 INFO L85 PathProgramCache]: Analyzing trace with hash 476904739, now seen corresponding path program 1 times [2024-11-09 22:10:44,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:10:44,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752507363] [2024-11-09 22:10:44,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:10:44,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:10:44,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:10:45,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-09 22:10:45,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:10:45,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-09 22:10:45,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:10:45,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-09 22:10:45,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:10:45,924 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 12 proven. 17 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-09 22:10:45,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:10:45,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752507363] [2024-11-09 22:10:45,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1752507363] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 22:10:45,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1466098917] [2024-11-09 22:10:45,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:10:45,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:10:45,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 22:10:45,928 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-09 22:10:45,929 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-09 22:10:46,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:10:46,166 INFO L255 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 117 conjuncts are in the unsatisfiable core [2024-11-09 22:10:46,169 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 22:10:46,198 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-09 22:10:46,409 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-09 22:10:46,410 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-09 22:10:46,458 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 13 treesize of output 9 [2024-11-09 22:10:46,470 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 19 treesize of output 1 [2024-11-09 22:10:46,661 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 42 treesize of output 14 [2024-11-09 22:10:46,667 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 17 treesize of output 3 [2024-11-09 22:10:46,672 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-09 22:10:46,851 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 22:10:46,851 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 50 treesize of output 39 [2024-11-09 22:10:46,868 INFO L349 Elim1Store]: treesize reduction 8, result has 77.1 percent of original size [2024-11-09 22:10:46,869 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 36 [2024-11-09 22:10:46,879 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2024-11-09 22:10:47,422 INFO L349 Elim1Store]: treesize reduction 55, result has 23.6 percent of original size [2024-11-09 22:10:47,423 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 224 treesize of output 86 [2024-11-09 22:10:47,429 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 0 case distinctions, treesize of input 78 treesize of output 45 [2024-11-09 22:10:47,520 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 152 treesize of output 112 [2024-11-09 22:10:47,522 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 84 [2024-11-09 22:10:47,605 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2024-11-09 22:10:47,808 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-09 22:10:47,808 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 23 [2024-11-09 22:10:47,813 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 8 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 22:10:47,813 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 22:10:48,621 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1865 (Array Int Int)) (v_ArrVal_1864 (Array Int Int)) (|v_ULTIMATE.start_sll_append_#t~ret7#1.base_41| Int)) (let ((.cse5 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_41| v_ArrVal_1864)) (.cse8 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (.cse9 (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 4))) (let ((.cse7 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_41| v_ArrVal_1865)) (.cse6 (select (select .cse5 .cse8) .cse9))) (let ((.cse0 (select .cse7 .cse6)) (.cse1 (+ (select (select .cse7 .cse8) .cse9) 4))) (or (= |v_ULTIMATE.start_sll_append_#t~ret7#1.base_41| 0) (not (= (select .cse0 .cse1) 0)) (not (= (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse4 (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (select (let ((.cse2 (store .cse5 .cse6 (store (select .cse5 .cse6) .cse1 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_41|)))) (select .cse2 (select (select .cse2 .cse3) .cse4))) (+ (select (select (store .cse7 .cse6 (store .cse0 .cse1 0)) .cse3) .cse4) 4))) 0)) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_41|) 0))))))) is different from false [2024-11-09 22:10:48,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1466098917] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 22:10:48,623 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 22:10:48,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 29] total 49 [2024-11-09 22:10:48,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492656927] [2024-11-09 22:10:48,624 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 22:10:48,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2024-11-09 22:10:48,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:10:48,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2024-11-09 22:10:48,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=3248, Unknown=1, NotChecked=114, Total=3540 [2024-11-09 22:10:48,626 INFO L87 Difference]: Start difference. First operand 73 states and 81 transitions. Second operand has 49 states, 47 states have (on average 1.6170212765957446) internal successors, (76), 40 states have internal predecessors, (76), 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)