./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/list-simple/sll2c_append_unequal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8393723b Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35bc4d53-0cdb-454d-b70e-af4362592e65/bin/utaipan-I9t0OCRTmS/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35bc4d53-0cdb-454d-b70e-af4362592e65/bin/utaipan-I9t0OCRTmS/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35bc4d53-0cdb-454d-b70e-af4362592e65/bin/utaipan-I9t0OCRTmS/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35bc4d53-0cdb-454d-b70e-af4362592e65/bin/utaipan-I9t0OCRTmS/config/TaipanReach.xml -i ../../sv-benchmarks/c/list-simple/sll2c_append_unequal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35bc4d53-0cdb-454d-b70e-af4362592e65/bin/utaipan-I9t0OCRTmS/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35bc4d53-0cdb-454d-b70e-af4362592e65/bin/utaipan-I9t0OCRTmS --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d83e632829c1e193271bd76b90e08187eb94c70000e5f11d7aea101b3ec9a9e6 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-8393723 [2022-11-19 07:20:59,904 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-19 07:20:59,906 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-19 07:20:59,931 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-19 07:20:59,932 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-19 07:20:59,933 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-19 07:20:59,935 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-19 07:20:59,936 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-19 07:20:59,938 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-19 07:20:59,939 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-19 07:20:59,940 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-19 07:20:59,941 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-19 07:20:59,941 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-19 07:20:59,942 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-19 07:20:59,944 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-19 07:20:59,945 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-19 07:20:59,945 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-19 07:20:59,946 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-19 07:20:59,948 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-19 07:20:59,950 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-19 07:20:59,952 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-19 07:20:59,953 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-19 07:20:59,954 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-19 07:20:59,955 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-19 07:20:59,959 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-19 07:20:59,960 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-19 07:20:59,960 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-19 07:20:59,961 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-19 07:20:59,962 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-19 07:20:59,963 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-19 07:20:59,963 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-19 07:20:59,964 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-19 07:20:59,965 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-19 07:20:59,966 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-19 07:20:59,967 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-19 07:20:59,967 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-19 07:20:59,968 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-19 07:20:59,968 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-19 07:20:59,969 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-19 07:20:59,970 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-19 07:20:59,970 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-19 07:20:59,971 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35bc4d53-0cdb-454d-b70e-af4362592e65/bin/utaipan-I9t0OCRTmS/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-11-19 07:20:59,996 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-19 07:20:59,996 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-19 07:20:59,997 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-19 07:20:59,997 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-19 07:20:59,998 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-19 07:20:59,998 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-19 07:20:59,998 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-19 07:20:59,999 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-19 07:20:59,999 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-19 07:20:59,999 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-19 07:21:00,000 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-19 07:21:00,000 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-19 07:21:00,000 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-19 07:21:00,000 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-19 07:21:00,001 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-19 07:21:00,001 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-19 07:21:00,001 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-19 07:21:00,001 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-19 07:21:00,002 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-19 07:21:00,002 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-19 07:21:00,002 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-19 07:21:00,003 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-19 07:21:00,003 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-19 07:21:00,003 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-19 07:21:00,003 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-19 07:21:00,004 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-19 07:21:00,004 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-19 07:21:00,004 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-19 07:21:00,004 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-19 07:21:00,005 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-19 07:21:00,005 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-19 07:21:00,005 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-19 07:21:00,005 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-19 07:21:00,006 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-19 07:21:00,006 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-19 07:21:00,006 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-19 07:21:00,006 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-19 07:21:00,007 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-19 07:21:00,007 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-19 07:21:00,007 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-19 07:21:00,007 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-19 07:21:00,007 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35bc4d53-0cdb-454d-b70e-af4362592e65/bin/utaipan-I9t0OCRTmS/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35bc4d53-0cdb-454d-b70e-af4362592e65/bin/utaipan-I9t0OCRTmS Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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 -> Taipan 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 -> d83e632829c1e193271bd76b90e08187eb94c70000e5f11d7aea101b3ec9a9e6 [2022-11-19 07:21:00,266 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-19 07:21:00,298 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-19 07:21:00,301 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-19 07:21:00,303 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-19 07:21:00,304 INFO L275 PluginConnector]: CDTParser initialized [2022-11-19 07:21:00,306 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35bc4d53-0cdb-454d-b70e-af4362592e65/bin/utaipan-I9t0OCRTmS/../../sv-benchmarks/c/list-simple/sll2c_append_unequal.i [2022-11-19 07:21:00,372 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35bc4d53-0cdb-454d-b70e-af4362592e65/bin/utaipan-I9t0OCRTmS/data/c69fbfec4/fb17c20afbd94c7ab7de4814022c3739/FLAG01e466597 [2022-11-19 07:21:00,987 INFO L306 CDTParser]: Found 1 translation units. [2022-11-19 07:21:00,987 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35bc4d53-0cdb-454d-b70e-af4362592e65/sv-benchmarks/c/list-simple/sll2c_append_unequal.i [2022-11-19 07:21:00,998 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35bc4d53-0cdb-454d-b70e-af4362592e65/bin/utaipan-I9t0OCRTmS/data/c69fbfec4/fb17c20afbd94c7ab7de4814022c3739/FLAG01e466597 [2022-11-19 07:21:01,287 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35bc4d53-0cdb-454d-b70e-af4362592e65/bin/utaipan-I9t0OCRTmS/data/c69fbfec4/fb17c20afbd94c7ab7de4814022c3739 [2022-11-19 07:21:01,290 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-19 07:21:01,293 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-19 07:21:01,298 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-19 07:21:01,298 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-19 07:21:01,302 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-19 07:21:01,302 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:21:01" (1/1) ... [2022-11-19 07:21:01,304 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77e6dbad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:21:01, skipping insertion in model container [2022-11-19 07:21:01,305 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:21:01" (1/1) ... [2022-11-19 07:21:01,312 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-19 07:21:01,347 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-19 07:21:01,659 WARN L234 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35bc4d53-0cdb-454d-b70e-af4362592e65/sv-benchmarks/c/list-simple/sll2c_append_unequal.i[24587,24600] [2022-11-19 07:21:01,669 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-19 07:21:01,676 INFO L203 MainTranslator]: Completed pre-run [2022-11-19 07:21:01,767 WARN L234 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35bc4d53-0cdb-454d-b70e-af4362592e65/sv-benchmarks/c/list-simple/sll2c_append_unequal.i[24587,24600] [2022-11-19 07:21:01,768 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-19 07:21:01,803 INFO L208 MainTranslator]: Completed translation [2022-11-19 07:21:01,803 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:21:01 WrapperNode [2022-11-19 07:21:01,804 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-19 07:21:01,805 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-19 07:21:01,805 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-19 07:21:01,805 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-19 07:21:01,814 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:21:01" (1/1) ... [2022-11-19 07:21:01,836 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:21:01" (1/1) ... [2022-11-19 07:21:01,865 INFO L138 Inliner]: procedures = 127, calls = 46, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 158 [2022-11-19 07:21:01,865 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-19 07:21:01,866 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-19 07:21:01,866 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-19 07:21:01,866 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-19 07:21:01,875 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:21:01" (1/1) ... [2022-11-19 07:21:01,876 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:21:01" (1/1) ... [2022-11-19 07:21:01,880 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:21:01" (1/1) ... [2022-11-19 07:21:01,880 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:21:01" (1/1) ... [2022-11-19 07:21:01,889 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:21:01" (1/1) ... [2022-11-19 07:21:01,893 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:21:01" (1/1) ... [2022-11-19 07:21:01,895 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:21:01" (1/1) ... [2022-11-19 07:21:01,896 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:21:01" (1/1) ... [2022-11-19 07:21:01,900 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-19 07:21:01,900 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-19 07:21:01,900 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-19 07:21:01,901 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-19 07:21:01,901 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:21:01" (1/1) ... [2022-11-19 07:21:01,919 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-19 07:21:01,932 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35bc4d53-0cdb-454d-b70e-af4362592e65/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 07:21:01,946 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35bc4d53-0cdb-454d-b70e-af4362592e65/bin/utaipan-I9t0OCRTmS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-19 07:21:01,958 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35bc4d53-0cdb-454d-b70e-af4362592e65/bin/utaipan-I9t0OCRTmS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-19 07:21:01,988 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-19 07:21:01,988 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-19 07:21:01,988 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2022-11-19 07:21:01,988 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2022-11-19 07:21:01,989 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-19 07:21:01,989 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-19 07:21:01,989 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-19 07:21:01,989 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-19 07:21:01,989 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-19 07:21:01,989 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-19 07:21:01,990 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-19 07:21:01,990 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-19 07:21:01,990 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-19 07:21:01,990 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-19 07:21:02,116 INFO L235 CfgBuilder]: Building ICFG [2022-11-19 07:21:02,118 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-19 07:21:02,423 INFO L276 CfgBuilder]: Performing block encoding [2022-11-19 07:21:02,480 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-19 07:21:02,481 INFO L300 CfgBuilder]: Removed 5 assume(true) statements. [2022-11-19 07:21:02,483 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:21:02 BoogieIcfgContainer [2022-11-19 07:21:02,483 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-19 07:21:02,486 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-19 07:21:02,487 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-19 07:21:02,490 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-19 07:21:02,491 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 07:21:01" (1/3) ... [2022-11-19 07:21:02,491 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56493f7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:21:02, skipping insertion in model container [2022-11-19 07:21:02,491 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:21:01" (2/3) ... [2022-11-19 07:21:02,492 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56493f7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:21:02, skipping insertion in model container [2022-11-19 07:21:02,492 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:21:02" (3/3) ... [2022-11-19 07:21:02,493 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2c_append_unequal.i [2022-11-19 07:21:02,514 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-19 07:21:02,514 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-19 07:21:02,565 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-19 07:21:02,572 INFO L357 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, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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;@2e4b46c1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-19 07:21:02,572 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-19 07:21:02,577 INFO L276 IsEmpty]: Start isEmpty. Operand has 32 states, 26 states have (on average 1.5769230769230769) internal successors, (41), 27 states have internal predecessors, (41), 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) [2022-11-19 07:21:02,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-19 07:21:02,586 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:21:02,587 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:21:02,587 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-19 07:21:02,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:21:02,594 INFO L85 PathProgramCache]: Analyzing trace with hash -1623736300, now seen corresponding path program 1 times [2022-11-19 07:21:02,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:21:02,605 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959736126] [2022-11-19 07:21:02,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:21:02,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:21:02,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:21:03,022 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-19 07:21:03,023 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:21:03,023 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959736126] [2022-11-19 07:21:03,024 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1959736126] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:21:03,024 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:21:03,024 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-19 07:21:03,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844152803] [2022-11-19 07:21:03,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:21:03,032 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 07:21:03,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:21:03,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 07:21:03,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 07:21:03,066 INFO L87 Difference]: Start difference. First operand has 32 states, 26 states have (on average 1.5769230769230769) internal successors, (41), 27 states have internal predecessors, (41), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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) [2022-11-19 07:21:03,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:21:03,118 INFO L93 Difference]: Finished difference Result 61 states and 90 transitions. [2022-11-19 07:21:03,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 07:21:03,121 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2022-11-19 07:21:03,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:21:03,129 INFO L225 Difference]: With dead ends: 61 [2022-11-19 07:21:03,130 INFO L226 Difference]: Without dead ends: 29 [2022-11-19 07:21:03,133 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 07:21:03,136 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 1 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-19 07:21:03,137 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 71 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-19 07:21:03,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-11-19 07:21:03,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2022-11-19 07:21:03,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 22 states have internal predecessors, (29), 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) [2022-11-19 07:21:03,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 35 transitions. [2022-11-19 07:21:03,179 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 35 transitions. Word has length 18 [2022-11-19 07:21:03,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:21:03,180 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 35 transitions. [2022-11-19 07:21:03,181 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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) [2022-11-19 07:21:03,181 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 35 transitions. [2022-11-19 07:21:03,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-19 07:21:03,182 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:21:03,183 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:21:03,183 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-19 07:21:03,183 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-19 07:21:03,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:21:03,184 INFO L85 PathProgramCache]: Analyzing trace with hash -1105478418, now seen corresponding path program 1 times [2022-11-19 07:21:03,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:21:03,185 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248731906] [2022-11-19 07:21:03,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:21:03,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:21:03,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:21:04,128 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-19 07:21:04,128 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:21:04,128 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248731906] [2022-11-19 07:21:04,129 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1248731906] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 07:21:04,129 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1636247932] [2022-11-19 07:21:04,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:21:04,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 07:21:04,130 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35bc4d53-0cdb-454d-b70e-af4362592e65/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 07:21:04,133 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35bc4d53-0cdb-454d-b70e-af4362592e65/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 07:21:04,154 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35bc4d53-0cdb-454d-b70e-af4362592e65/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-19 07:21:04,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:21:04,303 INFO L263 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 38 conjunts are in the unsatisfiable core [2022-11-19 07:21:04,310 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:21:04,509 INFO L350 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 8 treesize of output 4 [2022-11-19 07:21:04,583 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:21:04,587 INFO L350 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 15 treesize of output 17 [2022-11-19 07:21:04,641 INFO L350 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 [2022-11-19 07:21:04,666 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-19 07:21:04,666 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 07:21:04,750 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_12| Int) (v_ArrVal_184 (Array Int Int))) (or (not (= (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_12| v_ArrVal_184) |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|) 0)) (not (< |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_12| |c_#StackHeapBarrier|)))) is different from false [2022-11-19 07:21:04,752 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1636247932] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 07:21:04,752 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1942806352] [2022-11-19 07:21:04,772 INFO L159 IcfgInterpreter]: Started Sifa with 19 locations of interest [2022-11-19 07:21:04,772 INFO L166 IcfgInterpreter]: Building call graph [2022-11-19 07:21:04,776 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-19 07:21:04,782 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-19 07:21:04,782 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-19 07:21:04,856 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:21:04,876 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-19 07:21:04,877 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 37 [2022-11-19 07:21:04,894 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:21:04,896 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2022-11-19 07:21:04,935 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-19 07:21:04,940 INFO L350 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 [2022-11-19 07:21:04,950 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:21:04,952 INFO L350 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 22 treesize of output 7 [2022-11-19 07:21:04,958 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:21:04,959 INFO L350 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 22 treesize of output 7 [2022-11-19 07:21:04,974 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:21:04,975 INFO L350 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 16 treesize of output 17 [2022-11-19 07:21:05,005 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:21:05,006 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-19 07:21:05,017 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:21:05,018 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2022-11-19 07:21:05,082 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:21:05,083 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2022-11-19 07:21:05,093 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:21:05,094 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-19 07:21:05,583 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-19 07:21:05,593 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-19 07:21:05,604 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-19 07:21:05,616 INFO L350 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 9 treesize of output 3 [2022-11-19 07:21:05,627 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-19 07:21:05,642 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-19 07:21:05,644 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-19 07:21:05,646 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-19 07:21:05,648 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-19 07:21:05,651 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-19 07:21:05,970 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-19 07:21:05,980 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-19 07:21:05,990 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-19 07:21:06,002 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-19 07:21:06,012 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-19 07:21:06,026 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-19 07:21:06,028 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-19 07:21:06,030 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-19 07:21:06,034 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-19 07:21:06,036 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-19 07:21:06,088 INFO L350 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 19 treesize of output 11 [2022-11-19 07:21:06,112 INFO L350 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 19 treesize of output 11 [2022-11-19 07:21:06,125 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:21:06,127 INFO L350 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 [2022-11-19 07:21:06,360 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:21:06,361 INFO L350 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 140 treesize of output 124 [2022-11-19 07:21:06,378 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 07:21:06,379 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 136 treesize of output 124 [2022-11-19 07:21:06,389 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 07:21:06,391 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 128 treesize of output 116 [2022-11-19 07:21:06,656 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-19 07:21:06,666 INFO L350 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 [2022-11-19 07:21:06,688 INFO L350 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 [2022-11-19 07:21:06,819 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 07:21:06,826 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-19 07:21:06,826 INFO L350 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 [2022-11-19 07:21:06,849 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 07:21:06,854 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-19 07:21:06,855 INFO L350 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 [2022-11-19 07:21:07,026 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 07:21:07,032 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-19 07:21:07,033 INFO L350 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 [2022-11-19 07:21:07,056 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 07:21:07,062 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-19 07:21:07,062 INFO L350 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 [2022-11-19 07:21:07,318 INFO L350 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 192 treesize of output 174 [2022-11-19 07:21:07,347 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:21:07,352 INFO L350 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 192 treesize of output 174 [2022-11-19 07:21:07,376 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 07:21:07,398 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-11-19 07:21:07,399 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 211 treesize of output 186 [2022-11-19 07:21:07,418 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 07:21:07,435 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-11-19 07:21:07,438 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 203 treesize of output 178 [2022-11-19 07:21:07,852 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 21 for LOIs [2022-11-19 07:21:07,864 INFO L350 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 [2022-11-19 07:21:07,870 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-19 07:21:07,895 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:21:07,896 INFO L350 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 16 treesize of output 17 [2022-11-19 07:21:07,906 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:21:07,907 INFO L350 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 22 treesize of output 7 [2022-11-19 07:21:07,916 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:21:07,917 INFO L350 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 22 treesize of output 7 [2022-11-19 07:21:07,919 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-19 07:21:12,984 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '280#(and (<= 2 |ULTIMATE.start_sll_circular_create_#in~len#1|) (= |ULTIMATE.start_sll_circular_append_~head#1.base| |ULTIMATE.start_sll_circular_append_#in~head#1.base|) (<= |ULTIMATE.start_sll_circular_create_#in~data#1| 1) (= (select |#valid| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 1) (<= |ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (= |ULTIMATE.start_main_~ptr~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) |ULTIMATE.start_main_~ptr~0#1.offset|) (<= |ULTIMATE.start_sll_circular_append_#in~data#1| 5) (<= |ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (= |ULTIMATE.start_sll_circular_append_~data#1| (select (select |#memory_int| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) (+ |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| 4))) (<= |ULTIMATE.start_sll_circular_create_#in~len#1| 2) (<= |#NULL.offset| 0) (<= 0 |ULTIMATE.start_sll_circular_create_~last~0#1.offset|) (<= 0 |ULTIMATE.start_sll_circular_append_#in~head#1.offset|) (<= 1 |ULTIMATE.start_sll_circular_create_~data#1|) (<= 0 |ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (= |ULTIMATE.start_main_~count~0#1| 0) (<= 1 |ULTIMATE.start_sll_circular_create_#in~data#1|) (= |ULTIMATE.start_main_~uneq~0#1| |ULTIMATE.start_sll_circular_append_#in~data#1|) (= |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| 0) (<= |ULTIMATE.start_sll_circular_create_~len#1| 1) (= |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_append_~head#1.base|) |ULTIMATE.start_sll_circular_append_~head#1.offset|)) (= |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_#res#1.base|) (<= |ULTIMATE.start_sll_circular_create_~data#1| 1) (<= |ULTIMATE.start_sll_circular_append_#in~head#1.offset| 0) (<= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (<= 5 |ULTIMATE.start_sll_circular_append_~data#1|) (= |ULTIMATE.start_main_~len~0#1| 2) (<= |ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| 0)) (<= 0 |ULTIMATE.start_main_~#s~0#1.base|) (<= 0 |ULTIMATE.start_sll_circular_append_~head#1.offset|) (= |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_append_~head#1.base|) |ULTIMATE.start_sll_circular_append_~head#1.offset|)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|) |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) (= |ULTIMATE.start_sll_circular_append_#in~data#1| |ULTIMATE.start_sll_circular_append_~data#1|) (<= 0 |#NULL.offset|) (<= 0 |ULTIMATE.start_sll_circular_create_#res#1.offset|) (= |ULTIMATE.start_main_~last~2#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (= |ULTIMATE.start_sll_circular_append_#in~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (= 8 (select |#length| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (<= 0 |ULTIMATE.start_main_~#s~0#1.offset|) (< |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| |#StackHeapBarrier|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) |ULTIMATE.start_main_~last~2#1.offset|) (= |#NULL.base| 0))' at error location [2022-11-19 07:21:12,984 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-19 07:21:12,984 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-19 07:21:12,984 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 20 [2022-11-19 07:21:12,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251931057] [2022-11-19 07:21:12,985 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-19 07:21:12,986 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-11-19 07:21:12,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:21:12,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-19 07:21:12,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=1139, Unknown=1, NotChecked=68, Total=1332 [2022-11-19 07:21:12,989 INFO L87 Difference]: Start difference. First operand 27 states and 35 transitions. Second operand has 20 states, 15 states have (on average 1.8) internal successors, (27), 15 states have internal predecessors, (27), 4 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-19 07:21:13,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:21:13,284 INFO L93 Difference]: Finished difference Result 39 states and 51 transitions. [2022-11-19 07:21:13,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-19 07:21:13,286 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 15 states have (on average 1.8) internal successors, (27), 15 states have internal predecessors, (27), 4 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 25 [2022-11-19 07:21:13,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:21:13,300 INFO L225 Difference]: With dead ends: 39 [2022-11-19 07:21:13,300 INFO L226 Difference]: Without dead ends: 28 [2022-11-19 07:21:13,301 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 33 SyntacticMatches, 3 SemanticMatches, 40 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 477 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=157, Invalid=1486, Unknown=1, NotChecked=78, Total=1722 [2022-11-19 07:21:13,302 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 12 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 21 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 07:21:13,302 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 221 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 132 Invalid, 0 Unknown, 21 Unchecked, 0.1s Time] [2022-11-19 07:21:13,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-11-19 07:21:13,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2022-11-19 07:21:13,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 22 states have internal predecessors, (28), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-19 07:21:13,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 34 transitions. [2022-11-19 07:21:13,308 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 34 transitions. Word has length 25 [2022-11-19 07:21:13,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:21:13,308 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 34 transitions. [2022-11-19 07:21:13,309 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 15 states have (on average 1.8) internal successors, (27), 15 states have internal predecessors, (27), 4 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-19 07:21:13,309 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 34 transitions. [2022-11-19 07:21:13,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-19 07:21:13,316 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:21:13,317 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:21:13,336 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35bc4d53-0cdb-454d-b70e-af4362592e65/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-19 07:21:13,524 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35bc4d53-0cdb-454d-b70e-af4362592e65/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 07:21:13,525 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-19 07:21:13,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:21:13,526 INFO L85 PathProgramCache]: Analyzing trace with hash 871403401, now seen corresponding path program 1 times [2022-11-19 07:21:13,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:21:13,526 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370159691] [2022-11-19 07:21:13,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:21:13,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:21:13,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:21:14,816 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-19 07:21:14,817 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:21:14,817 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370159691] [2022-11-19 07:21:14,817 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [370159691] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 07:21:14,817 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1832780702] [2022-11-19 07:21:14,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:21:14,818 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 07:21:14,818 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35bc4d53-0cdb-454d-b70e-af4362592e65/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 07:21:14,822 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35bc4d53-0cdb-454d-b70e-af4362592e65/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 07:21:14,849 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35bc4d53-0cdb-454d-b70e-af4362592e65/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-19 07:21:15,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:21:15,028 INFO L263 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 135 conjunts are in the unsatisfiable core [2022-11-19 07:21:15,041 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:21:15,055 INFO L350 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 [2022-11-19 07:21:15,097 INFO L350 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 5 treesize of output 3 [2022-11-19 07:21:15,186 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-19 07:21:15,187 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2022-11-19 07:21:15,326 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-19 07:21:15,326 INFO L350 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 11 treesize of output 7 [2022-11-19 07:21:15,390 INFO L350 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 [2022-11-19 07:21:15,475 INFO L321 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2022-11-19 07:21:15,476 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 22 treesize of output 33 [2022-11-19 07:21:15,596 INFO L350 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 19 treesize of output 18 [2022-11-19 07:21:15,623 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-19 07:21:15,758 INFO L321 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-11-19 07:21:15,758 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 45 [2022-11-19 07:21:15,770 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2022-11-19 07:21:15,914 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-19 07:21:15,919 INFO L350 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 50 treesize of output 29 [2022-11-19 07:21:15,938 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-19 07:21:15,939 INFO L350 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 1 case distinctions, treesize of input 16 treesize of output 10 [2022-11-19 07:21:15,947 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-19 07:21:15,952 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-19 07:21:16,147 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:21:16,156 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-19 07:21:16,157 INFO L350 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 56 treesize of output 52 [2022-11-19 07:21:16,175 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-11-19 07:21:16,176 INFO L350 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 18 treesize of output 28 [2022-11-19 07:21:16,195 INFO L350 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 5 treesize of output 3 [2022-11-19 07:21:16,202 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:21:16,204 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:21:16,221 INFO L321 Elim1Store]: treesize reduction 24, result has 46.7 percent of original size [2022-11-19 07:21:16,222 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 33 [2022-11-19 07:21:16,236 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:21:16,237 INFO L350 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 14 treesize of output 16 [2022-11-19 07:21:16,637 INFO L321 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2022-11-19 07:21:16,638 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 105 treesize of output 77 [2022-11-19 07:21:16,668 INFO L321 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-11-19 07:21:16,668 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 141 treesize of output 104 [2022-11-19 07:21:16,679 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:21:16,681 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:21:16,682 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2022-11-19 07:21:16,707 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-11-19 07:21:16,707 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 44 [2022-11-19 07:21:16,715 INFO L350 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 30 treesize of output 32 [2022-11-19 07:21:16,925 INFO L350 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 10 [2022-11-19 07:21:17,201 INFO L321 Elim1Store]: treesize reduction 16, result has 56.8 percent of original size [2022-11-19 07:21:17,202 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 150 treesize of output 73 [2022-11-19 07:21:17,298 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-19 07:21:17,298 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 07:21:17,564 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_347 (Array Int Int)) (v_ArrVal_341 Int) (|ULTIMATE.start_sll_circular_append_~last~1#1.offset| Int) (v_ArrVal_340 (Array Int Int)) (v_ArrVal_342 (Array Int Int)) (v_ArrVal_343 (Array Int Int))) (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |ULTIMATE.start_sll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_340))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| v_ArrVal_343) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_347) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= (select (select .cse0 .cse1) .cse2) .cse1)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |ULTIMATE.start_sll_circular_append_~last~1#1.offset| v_ArrVal_341)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_342) .cse1) (+ .cse2 4))))))) is different from false [2022-11-19 07:21:17,897 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_347 (Array Int Int)) (v_ArrVal_341 Int) (|ULTIMATE.start_sll_circular_append_~last~1#1.offset| Int) (v_ArrVal_340 (Array Int Int)) (v_ArrVal_342 (Array Int Int)) (v_ArrVal_343 (Array Int Int))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse1 (store (store |c_#memory_$Pointer$.base| .cse3 (store (select |c_#memory_$Pointer$.base| .cse3) |ULTIMATE.start_sll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|)) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_340))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (select (select (store (store |c_#memory_$Pointer$.offset| .cse3 v_ArrVal_343) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_347) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= .cse0 (select (select .cse1 .cse0) .cse2))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int| .cse3 (store (select |c_#memory_int| .cse3) |ULTIMATE.start_sll_circular_append_~last~1#1.offset| v_ArrVal_341)) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_342) .cse0) (+ .cse2 4)))))))) is different from false [2022-11-19 07:21:18,015 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_16| Int) (v_ArrVal_359 (Array Int Int)) (v_ArrVal_358 (Array Int Int)) (v_ArrVal_347 (Array Int Int)) (v_ArrVal_341 Int) (|ULTIMATE.start_sll_circular_append_~last~1#1.offset| Int) (v_ArrVal_340 (Array Int Int)) (v_ArrVal_342 (Array Int Int)) (v_ArrVal_343 (Array Int Int)) (v_ArrVal_357 (Array Int Int))) (let ((.cse5 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_16| v_ArrVal_358))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse1 (store (store .cse5 .cse4 (store (select .cse5 .cse4) |ULTIMATE.start_sll_circular_append_~last~1#1.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_16|)) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_16| v_ArrVal_340))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (select (select (store (store (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_16| v_ArrVal_357) .cse4 v_ArrVal_343) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_16| v_ArrVal_347) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= .cse0 (select (select .cse1 .cse0) .cse2))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (let ((.cse3 (store |c_#memory_int| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_16| v_ArrVal_359))) (store .cse3 .cse4 (store (select .cse3 .cse4) |ULTIMATE.start_sll_circular_append_~last~1#1.offset| v_ArrVal_341))) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_16| v_ArrVal_342) .cse0) (+ .cse2 4))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_16|) 0)) (not (< |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_16| |c_#StackHeapBarrier|)))))))) is different from false [2022-11-19 07:21:18,018 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1832780702] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 07:21:18,018 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2070014288] [2022-11-19 07:21:18,021 INFO L159 IcfgInterpreter]: Started Sifa with 22 locations of interest [2022-11-19 07:21:18,022 INFO L166 IcfgInterpreter]: Building call graph [2022-11-19 07:21:18,022 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-19 07:21:18,022 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-19 07:21:18,023 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-19 07:21:18,042 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:21:18,054 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-19 07:21:18,054 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 17 treesize of output 26 [2022-11-19 07:21:18,065 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:21:18,080 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-19 07:21:18,080 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 37 [2022-11-19 07:21:18,107 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-19 07:21:18,110 INFO L350 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 [2022-11-19 07:21:18,117 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:21:18,118 INFO L350 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 22 treesize of output 7 [2022-11-19 07:21:18,124 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:21:18,125 INFO L350 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 22 treesize of output 7 [2022-11-19 07:21:18,133 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:21:18,134 INFO L350 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 16 treesize of output 17 [2022-11-19 07:21:18,155 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:21:18,156 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2022-11-19 07:21:18,166 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:21:18,167 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-19 07:21:18,204 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:21:18,205 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2022-11-19 07:21:18,216 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:21:18,217 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-19 07:21:18,288 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-19 07:21:18,297 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-19 07:21:18,307 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-19 07:21:18,315 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-19 07:21:18,327 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-19 07:21:18,383 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-19 07:21:18,394 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-19 07:21:18,403 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-19 07:21:18,416 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-19 07:21:18,427 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-19 07:21:18,535 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 07:21:18,537 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:21:18,538 INFO L350 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 221 treesize of output 205 [2022-11-19 07:21:18,556 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 07:21:18,557 INFO L350 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 219 treesize of output 207 [2022-11-19 07:21:18,576 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 07:21:18,577 INFO L350 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 227 treesize of output 110 [2022-11-19 07:21:18,690 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-19 07:21:18,700 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-19 07:21:18,710 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-19 07:21:18,719 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-19 07:21:18,728 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-19 07:21:18,771 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-19 07:21:18,780 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-19 07:21:18,788 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-19 07:21:18,802 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-19 07:21:18,816 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-19 07:21:18,859 INFO L350 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 19 treesize of output 11 [2022-11-19 07:21:18,868 INFO L350 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 19 treesize of output 11 [2022-11-19 07:21:18,880 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:21:18,881 INFO L350 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 [2022-11-19 07:21:18,968 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-19 07:21:18,978 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-19 07:21:18,987 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-19 07:21:19,000 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-19 07:21:19,014 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-19 07:21:19,059 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-19 07:21:19,068 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-19 07:21:19,080 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-19 07:21:19,089 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-19 07:21:19,099 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-19 07:21:19,178 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 07:21:19,190 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-19 07:21:19,191 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 21 [2022-11-19 07:21:19,205 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:21:19,206 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-11-19 07:21:19,234 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-19 07:21:19,234 INFO L350 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 34 treesize of output 25 [2022-11-19 07:21:19,314 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-19 07:21:19,334 INFO L350 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 9 treesize of output 3 [2022-11-19 07:21:19,347 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:21:19,349 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:21:19,355 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-19 07:21:19,355 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2022-11-19 07:21:19,367 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-19 07:21:19,382 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:21:19,384 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:21:19,389 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-19 07:21:19,390 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2022-11-19 07:21:19,457 INFO L350 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 9 treesize of output 3 [2022-11-19 07:21:19,473 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:21:19,475 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:21:19,480 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-19 07:21:19,481 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2022-11-19 07:21:19,499 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-19 07:21:19,511 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-19 07:21:19,523 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:21:19,525 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:21:19,530 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-19 07:21:19,531 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2022-11-19 07:21:19,719 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:21:19,814 INFO L321 Elim1Store]: treesize reduction 95, result has 36.2 percent of original size [2022-11-19 07:21:19,815 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 119 treesize of output 137 [2022-11-19 07:21:19,901 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:21:19,941 INFO L321 Elim1Store]: treesize reduction 24, result has 52.0 percent of original size [2022-11-19 07:21:19,942 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 53 treesize of output 49 [2022-11-19 07:21:19,961 INFO L350 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 5 treesize of output 3 [2022-11-19 07:21:19,997 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-19 07:21:19,997 INFO L350 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 16 treesize of output 20 [2022-11-19 07:21:20,014 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-19 07:21:20,026 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-19 07:21:20,064 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:21:20,123 INFO L321 Elim1Store]: treesize reduction 120, result has 19.5 percent of original size [2022-11-19 07:21:20,124 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 115 treesize of output 108 [2022-11-19 07:21:20,157 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:21:20,200 INFO L321 Elim1Store]: treesize reduction 24, result has 52.0 percent of original size [2022-11-19 07:21:20,200 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 49 treesize of output 45 [2022-11-19 07:21:20,220 INFO L350 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 5 treesize of output 3 [2022-11-19 07:21:20,244 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 07:21:20,257 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-19 07:21:20,257 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 32 [2022-11-19 07:21:20,380 INFO L321 Elim1Store]: treesize reduction 44, result has 34.3 percent of original size [2022-11-19 07:21:20,381 INFO L350 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 2 case distinctions, treesize of input 39 treesize of output 26 [2022-11-19 07:21:21,420 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 13 for LOIs [2022-11-19 07:21:21,427 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-19 07:21:21,432 INFO L350 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 [2022-11-19 07:21:21,453 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:21:21,454 INFO L350 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 16 treesize of output 17 [2022-11-19 07:21:21,461 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:21:21,461 INFO L350 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 22 treesize of output 7 [2022-11-19 07:21:21,468 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:21:21,469 INFO L350 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 22 treesize of output 7 [2022-11-19 07:21:21,471 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-19 07:21:29,076 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse10 (= |c_ULTIMATE.start_sll_circular_append_~head#1.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|)) (.cse9 (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse3 (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|)) (.cse24 (not .cse9)) (.cse6 (not .cse10))) (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse5 (or .cse24 .cse6)) (.cse1 (not .cse3))) (and (= |c_ULTIMATE.start_main_~uneq~0#1| |c_ULTIMATE.start_sll_circular_append_#in~data#1|) (< 0 |c_#StackHeapBarrier|) (<= |c_ULTIMATE.start_sll_circular_append_#in~head#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_append_#in~head#1.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.offset|) (<= 5 |c_ULTIMATE.start_sll_circular_append_~data#1|) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (<= |c_ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (= |c_ULTIMATE.start_main_~uneq~0#1| 5) (<= |c_ULTIMATE.start_sll_circular_create_~data#1| 1) (< |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_sll_circular_append_#in~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (<= |c_ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (< |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_sll_circular_append_#in~head#1.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) (<= 0 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) (<= |c_ULTIMATE.start_sll_circular_create_#in~data#1| 1) (not (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| 0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (<= 2 |c_ULTIMATE.start_sll_circular_create_#in~len#1|) (<= 1 |c_ULTIMATE.start_sll_circular_create_#in~data#1|) (= |c_ULTIMATE.start_sll_circular_create_#res#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (= |c_#NULL.offset| 0) (<= |c_ULTIMATE.start_sll_circular_append_#in~data#1| 5) (= |c_ULTIMATE.start_sll_circular_append_#in~data#1| |c_ULTIMATE.start_sll_circular_append_~data#1|) (<= 1 |c_ULTIMATE.start_sll_circular_create_~len#1|) (<= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (<= 1 |c_ULTIMATE.start_sll_circular_create_~data#1|) (= (+ |c_ULTIMATE.start_sll_circular_create_~len#1| 1) |c_ULTIMATE.start_sll_circular_create_#in~len#1|) (<= |c_ULTIMATE.start_sll_circular_create_#in~len#1| 2) (<= 0 |c_ULTIMATE.start_sll_circular_append_#in~head#1.offset|) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| .cse0) (= |c_ULTIMATE.start_main_~count~0#1| 0) (<= 0 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (not (= 2 |c_ULTIMATE.start_main_~#s~0#1.base|)) (= |c_#NULL.base| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_main_~data~0#1| |c_ULTIMATE.start_sll_circular_create_#in~data#1|) (= |c_ULTIMATE.start_main_~len~0#1| |c_ULTIMATE.start_sll_circular_create_#in~len#1|) (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) (<= 0 |c_ULTIMATE.start_sll_circular_append_~head#1.offset|) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (or (not (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)) .cse1) (<= |c_ULTIMATE.start_sll_circular_append_~data#1| 5) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse2) (= |c_ULTIMATE.start_main_~last~2#1.offset| .cse0) (= |c_ULTIMATE.start_main_~last~2#1.base| .cse2) (= |c_ULTIMATE.start_sll_circular_append_#in~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (or (and (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| 4) .cse3) (= (select (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 4) |c_ULTIMATE.start_sll_circular_append_~data#1|)) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) (let ((.cse4 (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|))) (.cse8 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|))) (or (let ((.cse7 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|))) (and .cse4 .cse5 (or .cse6 (and (or .cse1 (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (select .cse7 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|))) (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (select .cse7 |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|)))) (= .cse8 |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) (or (and .cse9 .cse10) (= (select .cse7 |c_ULTIMATE.start_sll_circular_append_~head#1.offset|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|)))) (and .cse4 .cse9 .cse10 (or (exists ((v_DerPreprocessor_5 (Array Int Int))) (and (= (select v_DerPreprocessor_5 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) (exists ((v_DerPreprocessor_4 (Array Int Int))) (let ((.cse11 (select (store (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| v_DerPreprocessor_4) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_DerPreprocessor_5) |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| v_DerPreprocessor_4) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_DerPreprocessor_5) |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|))) (and (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (select .cse11 |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|)) (= v_DerPreprocessor_4 .cse11)))))) (exists ((v_DerPreprocessor_5 (Array Int Int))) (and (= (select v_DerPreprocessor_5 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) (exists ((v_DerPreprocessor_4 (Array Int Int))) (let ((.cse12 (store (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| v_DerPreprocessor_4) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_DerPreprocessor_5) |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| v_DerPreprocessor_4) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_DerPreprocessor_5))) (let ((.cse13 (select .cse12 |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|))) (and (= (select (select .cse12 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (select .cse13 |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|)) (= v_DerPreprocessor_4 .cse13)))))))) (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| .cse8)))) (<= 0 |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= 0 |c_ULTIMATE.start_main_~#s~0#1.base|)) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| 0) (<= 0 |c_ULTIMATE.start_sll_circular_create_#res#1.offset|) (= |c_ULTIMATE.start_sll_circular_create_#in~data#1| |c_ULTIMATE.start_sll_circular_create_~data#1|) (not (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| 0)) (<= 5 |c_ULTIMATE.start_sll_circular_append_#in~data#1|) (<= 0 |c_ULTIMATE.start_sll_circular_append_#in~head#1.base|) (let ((.cse16 (not (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| 0))) (.cse15 (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|))) (.cse14 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)) (.cse19 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (or (and .cse9 (= .cse14 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|) .cse10 .cse15 (or (and .cse16 (exists ((v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_6 (Array Int Int))) (let ((.cse20 (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| v_DerPreprocessor_6) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_DerPreprocessor_7) |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| v_DerPreprocessor_6) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_DerPreprocessor_7))) (let ((.cse17 (select .cse20 |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|)) (.cse18 (select (select .cse20 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (and (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| (select .cse17 |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|)) (= .cse18 .cse19) (= .cse17 v_DerPreprocessor_6) (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| .cse18) (= .cse18 (select v_DerPreprocessor_7 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|))))))) (exists ((v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_6 (Array Int Int))) (let ((.cse23 (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| v_DerPreprocessor_6) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_DerPreprocessor_7) |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| v_DerPreprocessor_6) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_DerPreprocessor_7))) (let ((.cse21 (select .cse23 |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|)) (.cse22 (select (select .cse23 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (and (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| (select .cse21 |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|)) (= .cse22 .cse19) (not (= .cse22 0)) (= .cse21 v_DerPreprocessor_6) (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| .cse22) (= .cse22 (select v_DerPreprocessor_7 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)))))))) (and (or .cse16 (not (= .cse19 0))) (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| .cse19) .cse5 .cse15 (= .cse14 .cse19) (or (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| .cse19) (and .cse24 .cse1) .cse6)))) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 1) (= (select |c_#length| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 8) (not (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| 0)) (< |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| |c_#StackHeapBarrier|) (<= |c_ULTIMATE.start_sll_circular_create_~len#1| 1) (= |c_ULTIMATE.start_main_~len~0#1| 2))))) is different from true [2022-11-19 07:21:30,763 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse10 (= |c_ULTIMATE.start_sll_circular_append_~head#1.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|)) (.cse9 (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse3 (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|)) (.cse24 (not .cse9)) (.cse6 (not .cse10))) (let ((.cse1 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse5 (or .cse24 .cse6)) (.cse2 (not .cse3))) (and (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~last~2#1.base|) |c_ULTIMATE.start_main_~last~2#1.offset|) .cse0) (= |c_ULTIMATE.start_main_~uneq~0#1| |c_ULTIMATE.start_sll_circular_append_#in~data#1|) (< 0 |c_#StackHeapBarrier|) (<= |c_ULTIMATE.start_sll_circular_append_#in~head#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_append_#in~head#1.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.offset|) (<= 5 |c_ULTIMATE.start_sll_circular_append_~data#1|) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (<= |c_ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (= |c_ULTIMATE.start_main_~uneq~0#1| 5) (<= |c_ULTIMATE.start_sll_circular_create_~data#1| 1) (< |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_sll_circular_append_#in~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (<= |c_ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (< |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_sll_circular_append_#in~head#1.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) (<= 0 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) (<= |c_ULTIMATE.start_sll_circular_create_#in~data#1| 1) (not (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| 0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (<= 2 |c_ULTIMATE.start_sll_circular_create_#in~len#1|) (<= 1 |c_ULTIMATE.start_sll_circular_create_#in~data#1|) (= |c_ULTIMATE.start_sll_circular_create_#res#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (= |c_#NULL.offset| 0) (<= |c_ULTIMATE.start_sll_circular_append_#in~data#1| 5) (= |c_ULTIMATE.start_sll_circular_append_#in~data#1| |c_ULTIMATE.start_sll_circular_append_~data#1|) (<= 1 |c_ULTIMATE.start_sll_circular_create_~len#1|) (<= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (<= 1 |c_ULTIMATE.start_sll_circular_create_~data#1|) (= (+ |c_ULTIMATE.start_sll_circular_create_~len#1| 1) |c_ULTIMATE.start_sll_circular_create_#in~len#1|) (<= |c_ULTIMATE.start_sll_circular_create_#in~len#1| 2) (<= 0 |c_ULTIMATE.start_sll_circular_append_#in~head#1.offset|) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| .cse1) (= |c_ULTIMATE.start_main_~count~0#1| 0) (<= 0 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (not (= 2 |c_ULTIMATE.start_main_~#s~0#1.base|)) (= |c_#NULL.base| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_main_~data~0#1| |c_ULTIMATE.start_sll_circular_create_#in~data#1|) (= |c_ULTIMATE.start_main_~len~0#1| |c_ULTIMATE.start_sll_circular_create_#in~len#1|) (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) (<= 0 |c_ULTIMATE.start_sll_circular_append_~head#1.offset|) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~last~2#1.base|) |c_ULTIMATE.start_main_~last~2#1.offset|) .cse1) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (or (not (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)) .cse2) (<= |c_ULTIMATE.start_sll_circular_append_~data#1| 5) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse0) (= |c_ULTIMATE.start_main_~last~2#1.offset| .cse1) (= |c_ULTIMATE.start_main_~last~2#1.base| .cse0) (= |c_ULTIMATE.start_sll_circular_append_#in~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (or (and (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| 4) .cse3) (= (select (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 4) |c_ULTIMATE.start_sll_circular_append_~data#1|)) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) (let ((.cse4 (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|))) (.cse8 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|))) (or (let ((.cse7 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|))) (and .cse4 .cse5 (or .cse6 (and (or .cse2 (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (select .cse7 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|))) (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (select .cse7 |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|)))) (= .cse8 |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) (or (and .cse9 .cse10) (= (select .cse7 |c_ULTIMATE.start_sll_circular_append_~head#1.offset|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|)))) (and .cse4 .cse9 .cse10 (or (exists ((v_DerPreprocessor_5 (Array Int Int))) (and (= (select v_DerPreprocessor_5 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) (exists ((v_DerPreprocessor_4 (Array Int Int))) (let ((.cse11 (select (store (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| v_DerPreprocessor_4) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_DerPreprocessor_5) |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| v_DerPreprocessor_4) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_DerPreprocessor_5) |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|))) (and (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (select .cse11 |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|)) (= v_DerPreprocessor_4 .cse11)))))) (exists ((v_DerPreprocessor_5 (Array Int Int))) (and (= (select v_DerPreprocessor_5 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) (exists ((v_DerPreprocessor_4 (Array Int Int))) (let ((.cse12 (store (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| v_DerPreprocessor_4) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_DerPreprocessor_5) |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| v_DerPreprocessor_4) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_DerPreprocessor_5))) (let ((.cse13 (select .cse12 |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|))) (and (= (select (select .cse12 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (select .cse13 |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|)) (= v_DerPreprocessor_4 .cse13)))))))) (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| .cse8)))) (<= 0 |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= 0 |c_ULTIMATE.start_main_~#s~0#1.base|)) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| 0) (<= 0 |c_ULTIMATE.start_sll_circular_create_#res#1.offset|) (= |c_ULTIMATE.start_sll_circular_create_#in~data#1| |c_ULTIMATE.start_sll_circular_create_~data#1|) (not (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| 0)) (<= 5 |c_ULTIMATE.start_sll_circular_append_#in~data#1|) (<= 0 |c_ULTIMATE.start_sll_circular_append_#in~head#1.base|) (let ((.cse16 (not (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| 0))) (.cse15 (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|))) (.cse14 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)) (.cse19 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (or (and .cse9 (= .cse14 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|) .cse10 .cse15 (or (and .cse16 (exists ((v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_6 (Array Int Int))) (let ((.cse20 (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| v_DerPreprocessor_6) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_DerPreprocessor_7) |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| v_DerPreprocessor_6) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_DerPreprocessor_7))) (let ((.cse17 (select .cse20 |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|)) (.cse18 (select (select .cse20 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (and (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| (select .cse17 |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|)) (= .cse18 .cse19) (= .cse17 v_DerPreprocessor_6) (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| .cse18) (= .cse18 (select v_DerPreprocessor_7 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|))))))) (exists ((v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_6 (Array Int Int))) (let ((.cse23 (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| v_DerPreprocessor_6) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_DerPreprocessor_7) |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| v_DerPreprocessor_6) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_DerPreprocessor_7))) (let ((.cse21 (select .cse23 |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|)) (.cse22 (select (select .cse23 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (and (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| (select .cse21 |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|)) (= .cse22 .cse19) (not (= .cse22 0)) (= .cse21 v_DerPreprocessor_6) (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| .cse22) (= .cse22 (select v_DerPreprocessor_7 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)))))))) (and (or .cse16 (not (= .cse19 0))) (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| .cse19) .cse5 .cse15 (= .cse14 .cse19) (or (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| .cse19) (and .cse24 .cse2) .cse6)))) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 1) (= (select |c_#length| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 8) (not (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| 0)) (< |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| |c_#StackHeapBarrier|) (<= |c_ULTIMATE.start_sll_circular_create_~len#1| 1) (= |c_ULTIMATE.start_main_~len~0#1| 2))))) is different from true [2022-11-19 07:21:31,918 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '558#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (< |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |#StackHeapBarrier|) (= |ULTIMATE.start_sll_circular_append_~last~1#1.offset| |ULTIMATE.start_sll_circular_append_~head#1.offset|) (exists ((v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_6 (Array Int Int))) (and (= v_DerPreprocessor_6 (select (store (store (store (store |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_append_~last~1#1.base| v_DerPreprocessor_6) |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_DerPreprocessor_7) |ULTIMATE.start_sll_circular_append_~last~1#1.base| v_DerPreprocessor_6) |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_DerPreprocessor_7) |ULTIMATE.start_sll_circular_append_~last~1#1.base|)) (= |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| (select (select (store (store (store (store |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_append_~last~1#1.base| v_DerPreprocessor_6) |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_DerPreprocessor_7) |ULTIMATE.start_sll_circular_append_~last~1#1.base| v_DerPreprocessor_6) |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_DerPreprocessor_7) |ULTIMATE.start_sll_circular_append_~last~1#1.base|) |ULTIMATE.start_sll_circular_append_~last~1#1.offset|)) (= |ULTIMATE.start_sll_circular_append_~last~1#1.offset| (select (select (store (store (store (store |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_append_~last~1#1.base| v_DerPreprocessor_6) |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_DerPreprocessor_7) |ULTIMATE.start_sll_circular_append_~last~1#1.base| v_DerPreprocessor_6) |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_DerPreprocessor_7) |ULTIMATE.start_sll_circular_append_~head#1.base|) |ULTIMATE.start_sll_circular_append_~head#1.offset|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_append_~head#1.base|) |ULTIMATE.start_sll_circular_append_~head#1.offset|) (select (select (store (store (store (store |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_append_~last~1#1.base| v_DerPreprocessor_6) |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_DerPreprocessor_7) |ULTIMATE.start_sll_circular_append_~last~1#1.base| v_DerPreprocessor_6) |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_DerPreprocessor_7) |ULTIMATE.start_sll_circular_append_~head#1.base|) |ULTIMATE.start_sll_circular_append_~head#1.offset|)) (= (select v_DerPreprocessor_7 |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|) (select (select (store (store (store (store |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_append_~last~1#1.base| v_DerPreprocessor_6) |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_DerPreprocessor_7) |ULTIMATE.start_sll_circular_append_~last~1#1.base| v_DerPreprocessor_6) |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_DerPreprocessor_7) |ULTIMATE.start_sll_circular_append_~head#1.base|) |ULTIMATE.start_sll_circular_append_~head#1.offset|)))) (= |ULTIMATE.start_sll_circular_append_~head#1.base| |ULTIMATE.start_sll_circular_append_#in~head#1.base|) (= |ULTIMATE.start_sll_circular_append_~data#1| (select (select |#memory_int| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 4)) (= (select |#valid| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 1) (= |ULTIMATE.start_main_~ptr~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) |ULTIMATE.start_main_~ptr~0#1.offset|) (<= |ULTIMATE.start_sll_circular_append_#in~data#1| 5) (= |ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (<= |ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~last~2#1.base|) |ULTIMATE.start_main_~last~2#1.offset|)) (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) (< |ULTIMATE.start_sll_circular_create_~last~0#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| 0)) (= (+ |ULTIMATE.start_sll_circular_create_~len#1| 1) |ULTIMATE.start_sll_circular_create_#in~len#1|) (= |ULTIMATE.start_main_~count~0#1| 0) (<= 1 |ULTIMATE.start_sll_circular_create_#in~data#1|) (= |ULTIMATE.start_sll_circular_create_#in~data#1| |ULTIMATE.start_sll_circular_create_~data#1|) (= |ULTIMATE.start_main_~uneq~0#1| |ULTIMATE.start_sll_circular_append_#in~data#1|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~last~2#1.base|) |ULTIMATE.start_main_~last~2#1.offset|)) (not (= 2 |ULTIMATE.start_main_~#s~0#1.base|)) (= |ULTIMATE.start_sll_circular_append_#in~head#1.offset| |ULTIMATE.start_main_~#s~0#1.offset|) (= |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_sll_circular_create_#in~len#1|) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_#res#1.base|) (<= |ULTIMATE.start_sll_circular_create_~data#1| 1) (= |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_append_~last~1#1.base|) |ULTIMATE.start_sll_circular_append_~last~1#1.offset|)) (= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| |ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (<= 5 |ULTIMATE.start_sll_circular_append_~data#1|) (= |ULTIMATE.start_main_~len~0#1| 2) (not (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| 0)) (= |#NULL.offset| 0) (not (= |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| 0)) (<= 0 |ULTIMATE.start_sll_circular_append_~head#1.offset|) (= |ULTIMATE.start_sll_circular_append_#in~data#1| |ULTIMATE.start_sll_circular_append_~data#1|) (<= 0 |ULTIMATE.start_sll_circular_create_#res#1.offset|) (= |ULTIMATE.start_main_~last~2#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (= |ULTIMATE.start_sll_circular_append_#in~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| 0) (= |ULTIMATE.start_sll_circular_append_~last~1#1.base| |ULTIMATE.start_sll_circular_append_~head#1.base|) (= 8 (select |#length| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) (<= |ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (< |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| |#StackHeapBarrier|) (< 0 |#StackHeapBarrier|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) |ULTIMATE.start_main_~last~2#1.offset|) (= |#NULL.base| 0))' at error location [2022-11-19 07:21:31,919 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-19 07:21:31,919 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-19 07:21:31,919 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 21] total 37 [2022-11-19 07:21:31,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803167559] [2022-11-19 07:21:31,919 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-19 07:21:31,919 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-11-19 07:21:31,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:21:31,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-11-19 07:21:31,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=209, Invalid=3418, Unknown=53, NotChecked=610, Total=4290 [2022-11-19 07:21:31,923 INFO L87 Difference]: Start difference. First operand 27 states and 34 transitions. Second operand has 37 states, 29 states have (on average 1.4137931034482758) internal successors, (41), 29 states have internal predecessors, (41), 5 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-11-19 07:21:32,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:21:32,822 INFO L93 Difference]: Finished difference Result 54 states and 71 transitions. [2022-11-19 07:21:32,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-19 07:21:32,823 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 29 states have (on average 1.4137931034482758) internal successors, (41), 29 states have internal predecessors, (41), 5 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 28 [2022-11-19 07:21:32,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:21:32,824 INFO L225 Difference]: With dead ends: 54 [2022-11-19 07:21:32,824 INFO L226 Difference]: Without dead ends: 46 [2022-11-19 07:21:32,826 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 1119 ImplicationChecksByTransitivity, 12.8s TimeCoverageRelationStatistics Valid=268, Invalid=4251, Unknown=57, NotChecked=680, Total=5256 [2022-11-19 07:21:32,827 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 19 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 54 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-19 07:21:32,827 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 253 Invalid, 312 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 242 Invalid, 0 Unknown, 54 Unchecked, 0.3s Time] [2022-11-19 07:21:32,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-11-19 07:21:32,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 33. [2022-11-19 07:21:32,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 28 states have (on average 1.25) internal successors, (35), 28 states have internal predecessors, (35), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-19 07:21:32,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 41 transitions. [2022-11-19 07:21:32,842 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 41 transitions. Word has length 28 [2022-11-19 07:21:32,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:21:32,842 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 41 transitions. [2022-11-19 07:21:32,843 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 29 states have (on average 1.4137931034482758) internal successors, (41), 29 states have internal predecessors, (41), 5 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-11-19 07:21:32,843 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 41 transitions. [2022-11-19 07:21:32,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-19 07:21:32,843 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:21:32,844 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:21:32,861 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35bc4d53-0cdb-454d-b70e-af4362592e65/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-19 07:21:33,050 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35bc4d53-0cdb-454d-b70e-af4362592e65/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 07:21:33,050 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-19 07:21:33,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:21:33,051 INFO L85 PathProgramCache]: Analyzing trace with hash -53225596, now seen corresponding path program 1 times [2022-11-19 07:21:33,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:21:33,051 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142903310] [2022-11-19 07:21:33,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:21:33,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:21:33,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:21:34,089 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-19 07:21:34,090 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:21:34,090 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142903310] [2022-11-19 07:21:34,090 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [142903310] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 07:21:34,090 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1506029702] [2022-11-19 07:21:34,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:21:34,090 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 07:21:34,090 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35bc4d53-0cdb-454d-b70e-af4362592e65/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 07:21:34,092 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35bc4d53-0cdb-454d-b70e-af4362592e65/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 07:21:34,119 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35bc4d53-0cdb-454d-b70e-af4362592e65/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-19 07:21:34,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:21:34,352 INFO L263 TraceCheckSpWp]: Trace formula consists of 374 conjuncts, 128 conjunts are in the unsatisfiable core [2022-11-19 07:21:34,359 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:21:34,399 INFO L350 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 [2022-11-19 07:21:34,558 INFO L350 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 [2022-11-19 07:21:34,639 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-19 07:21:34,639 INFO L350 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 [2022-11-19 07:21:34,725 INFO L350 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 19 treesize of output 18 [2022-11-19 07:21:34,833 INFO L350 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 18 treesize of output 20 [2022-11-19 07:21:34,943 INFO L350 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 36 treesize of output 20 [2022-11-19 07:21:34,948 INFO L350 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 11 treesize of output 7 [2022-11-19 07:21:34,953 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-19 07:21:34,958 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-19 07:21:35,120 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:21:35,122 INFO L350 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 14 treesize of output 16 [2022-11-19 07:21:35,141 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:21:35,142 INFO L350 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 44 treesize of output 40 [2022-11-19 07:21:35,168 INFO L321 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2022-11-19 07:21:35,168 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2022-11-19 07:21:35,178 INFO L350 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 18 treesize of output 20 [2022-11-19 07:21:35,490 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-19 07:21:35,491 INFO L350 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 94 treesize of output 71 [2022-11-19 07:21:35,519 INFO L321 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-11-19 07:21:35,519 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 139 treesize of output 114 [2022-11-19 07:21:35,529 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 48 [2022-11-19 07:21:35,536 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:21:35,556 INFO L321 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2022-11-19 07:21:35,558 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 88 treesize of output 87 [2022-11-19 07:21:35,569 INFO L350 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 30 treesize of output 32 [2022-11-19 07:21:35,653 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-19 07:21:35,653 INFO L350 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 65 treesize of output 28 [2022-11-19 07:21:35,749 INFO L350 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 10 [2022-11-19 07:21:35,851 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-19 07:21:35,890 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-19 07:21:35,891 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 07:21:36,991 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_528 (Array Int Int)) (v_ArrVal_516 (Array Int Int)) (v_ArrVal_519 (Array Int Int)) (v_ArrVal_529 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_20| Int) (v_ArrVal_517 Int) (v_ArrVal_520 (Array Int Int)) (v_ArrVal_530 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse3 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_20| v_ArrVal_529))) (let ((.cse4 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_20| v_ArrVal_528)) (.cse1 (select (select .cse3 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (select (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (select (store (let ((.cse0 (store |c_#memory_int| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_20| v_ArrVal_530))) (store .cse0 .cse1 (store (select .cse0 .cse1) .cse2 v_ArrVal_517))) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_20| v_ArrVal_513) (select (select (store (store .cse3 .cse1 (store (select .cse3 .cse1) .cse2 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_20|)) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_20| v_ArrVal_519) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store (store .cse4 .cse1 v_ArrVal_516) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_20| v_ArrVal_520) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))))) (not (< |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_20| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_20|) 0)))) is different from false [2022-11-19 07:21:36,994 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1506029702] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 07:21:36,994 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [984602716] [2022-11-19 07:21:36,997 INFO L159 IcfgInterpreter]: Started Sifa with 22 locations of interest [2022-11-19 07:21:36,997 INFO L166 IcfgInterpreter]: Building call graph [2022-11-19 07:21:36,997 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-19 07:21:36,997 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-19 07:21:36,997 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-19 07:21:37,015 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:21:37,049 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-19 07:21:37,049 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 17 treesize of output 26 [2022-11-19 07:21:37,058 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:21:37,073 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-19 07:21:37,073 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 37 [2022-11-19 07:21:37,103 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-19 07:21:37,107 INFO L350 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 [2022-11-19 07:21:37,115 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:21:37,115 INFO L350 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 22 treesize of output 7 [2022-11-19 07:21:37,121 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:21:37,122 INFO L350 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 22 treesize of output 7 [2022-11-19 07:21:37,130 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:21:37,131 INFO L350 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 16 treesize of output 17 [2022-11-19 07:21:37,151 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:21:37,152 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-19 07:21:37,161 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:21:37,162 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2022-11-19 07:21:37,195 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:21:37,196 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-19 07:21:37,206 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:21:37,206 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2022-11-19 07:21:37,267 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-19 07:21:37,275 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-19 07:21:37,283 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-19 07:21:37,296 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-19 07:21:37,304 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-19 07:21:37,339 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-19 07:21:37,347 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-19 07:21:37,356 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-19 07:21:37,367 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-19 07:21:37,375 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-19 07:21:37,409 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:21:37,410 INFO L350 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 [2022-11-19 07:21:37,418 INFO L350 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 19 treesize of output 11 [2022-11-19 07:21:37,428 INFO L350 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 19 treesize of output 11 [2022-11-19 07:21:37,726 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-19 07:21:37,728 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-19 07:21:37,730 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-19 07:21:37,732 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-19 07:21:37,735 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-19 07:21:37,746 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-19 07:21:37,768 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-19 07:21:37,778 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-19 07:21:37,788 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-19 07:21:37,797 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-19 07:21:37,995 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-19 07:21:37,997 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-19 07:21:37,999 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-19 07:21:38,001 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-19 07:21:38,003 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-19 07:21:38,015 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-19 07:21:38,025 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-19 07:21:38,034 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-19 07:21:38,045 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-19 07:21:38,054 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-19 07:21:38,094 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:21:38,095 INFO L350 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 [2022-11-19 07:21:38,104 INFO L350 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 19 treesize of output 11 [2022-11-19 07:21:38,113 INFO L350 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 19 treesize of output 11 [2022-11-19 07:21:38,533 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-19 07:21:38,547 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-19 07:21:38,556 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-19 07:21:38,565 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-19 07:21:38,577 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-19 07:21:38,590 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-19 07:21:38,591 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-19 07:21:38,593 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-19 07:21:38,595 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-19 07:21:38,598 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-19 07:21:38,804 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-19 07:21:38,806 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-19 07:21:38,807 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-19 07:21:38,810 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-19 07:21:38,812 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-19 07:21:38,821 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-19 07:21:38,829 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-19 07:21:38,837 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-19 07:21:38,849 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-19 07:21:38,857 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-19 07:21:38,930 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-19 07:21:38,930 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2022-11-19 07:21:38,952 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2022-11-19 07:21:38,976 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-19 07:21:38,977 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2022-11-19 07:21:39,055 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-19 07:21:39,067 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:21:39,069 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:21:39,075 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-19 07:21:39,075 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2022-11-19 07:21:39,091 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-19 07:21:39,103 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-19 07:21:39,120 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:21:39,122 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:21:39,128 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-19 07:21:39,129 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2022-11-19 07:21:39,191 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-19 07:21:39,207 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-19 07:21:39,234 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:21:39,237 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:21:39,244 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-19 07:21:39,244 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2022-11-19 07:21:39,265 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:21:39,267 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:21:39,273 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-19 07:21:39,274 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2022-11-19 07:21:39,286 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-19 07:21:39,465 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:21:39,571 INFO L321 Elim1Store]: treesize reduction 95, result has 36.2 percent of original size [2022-11-19 07:21:39,572 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 119 treesize of output 137 [2022-11-19 07:21:39,602 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:21:39,670 INFO L321 Elim1Store]: treesize reduction 120, result has 19.5 percent of original size [2022-11-19 07:21:39,671 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 119 treesize of output 112 [2022-11-19 07:21:39,744 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:21:39,795 INFO L321 Elim1Store]: treesize reduction 24, result has 52.0 percent of original size [2022-11-19 07:21:39,795 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 57 treesize of output 53 [2022-11-19 07:21:39,816 INFO L350 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 5 treesize of output 3 [2022-11-19 07:21:39,854 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-19 07:21:39,883 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-19 07:21:39,884 INFO L350 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 16 treesize of output 20 [2022-11-19 07:21:39,933 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:21:39,979 INFO L321 Elim1Store]: treesize reduction 24, result has 52.0 percent of original size [2022-11-19 07:21:39,979 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 84 treesize of output 74 [2022-11-19 07:21:40,008 INFO L350 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 5 treesize of output 3 [2022-11-19 07:21:40,040 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-19 07:21:40,040 INFO L350 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 16 treesize of output 20 [2022-11-19 07:21:40,077 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:21:40,078 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 07:21:40,079 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 42 [2022-11-19 07:21:40,315 INFO L321 Elim1Store]: treesize reduction 44, result has 34.3 percent of original size [2022-11-19 07:21:40,316 INFO L350 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 2 case distinctions, treesize of input 39 treesize of output 26 [2022-11-19 07:21:42,821 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 13 for LOIs [2022-11-19 07:21:42,828 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-19 07:21:42,833 INFO L350 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 [2022-11-19 07:21:42,847 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:21:42,847 INFO L350 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 16 treesize of output 17 [2022-11-19 07:21:42,853 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:21:42,854 INFO L350 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 22 treesize of output 7 [2022-11-19 07:21:42,860 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:21:42,861 INFO L350 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 22 treesize of output 7 [2022-11-19 07:21:42,863 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-19 07:21:50,619 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '885#(and (<= 2 |ULTIMATE.start_sll_circular_create_#in~len#1|) (<= 5 |ULTIMATE.start_sll_circular_append_#in~data#1|) (<= |ULTIMATE.start_sll_circular_append_~data#1| 5) (not (= (select (select |#memory_int| |ULTIMATE.start_main_~ptr~0#1.base|) (+ |ULTIMATE.start_main_~ptr~0#1.offset| 4)) |ULTIMATE.start_main_~data~0#1|)) (<= |ULTIMATE.start_sll_circular_create_#in~data#1| 1) (<= 1 |ULTIMATE.start_sll_circular_create_~len#1|) (<= 0 |ULTIMATE.start_sll_circular_append_#in~head#1.base|) (= |ULTIMATE.start_main_~uneq~0#1| 5) (<= |ULTIMATE.start_sll_circular_append_#in~data#1| 5) (= |ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (<= |ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (<= |ULTIMATE.start_sll_circular_create_#in~len#1| 2) (<= 0 |ULTIMATE.start_sll_circular_append_#in~head#1.offset|) (<= 1 |ULTIMATE.start_sll_circular_create_~data#1|) (<= 0 |ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (= |ULTIMATE.start_main_~count~0#1| 0) (<= 0 |ULTIMATE.start_sll_circular_append_~head#1.base|) (<= 1 |ULTIMATE.start_sll_circular_create_#in~data#1|) (= |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| 0) (<= |ULTIMATE.start_sll_circular_create_~len#1| 1) (= |ULTIMATE.start_main_~data~0#1| 1) (<= |ULTIMATE.start_sll_circular_create_~data#1| 1) (<= |ULTIMATE.start_sll_circular_append_#in~head#1.offset| 0) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (<= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (<= 5 |ULTIMATE.start_sll_circular_append_~data#1|) (= |ULTIMATE.start_main_~len~0#1| 2) (= |#NULL.offset| 0) (<= 0 |ULTIMATE.start_main_~#s~0#1.base|) (<= 0 |ULTIMATE.start_sll_circular_append_~head#1.offset|) (<= 0 |ULTIMATE.start_sll_circular_create_#res#1.offset|) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| 0) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (= |#NULL.base| 0))' at error location [2022-11-19 07:21:50,619 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-19 07:21:50,619 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-19 07:21:50,619 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 24] total 38 [2022-11-19 07:21:50,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618372869] [2022-11-19 07:21:50,620 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-19 07:21:50,620 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-11-19 07:21:50,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:21:50,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-11-19 07:21:50,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=208, Invalid=3500, Unknown=78, NotChecked=120, Total=3906 [2022-11-19 07:21:50,622 INFO L87 Difference]: Start difference. First operand 33 states and 41 transitions. Second operand has 38 states, 29 states have (on average 1.5172413793103448) internal successors, (44), 29 states have internal predecessors, (44), 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) [2022-11-19 07:21:51,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:21:51,840 INFO L93 Difference]: Finished difference Result 59 states and 76 transitions. [2022-11-19 07:21:51,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-19 07:21:51,841 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 29 states have (on average 1.5172413793103448) internal successors, (44), 29 states have internal predecessors, (44), 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 30 [2022-11-19 07:21:51,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:21:51,842 INFO L225 Difference]: With dead ends: 59 [2022-11-19 07:21:51,842 INFO L226 Difference]: Without dead ends: 45 [2022-11-19 07:21:51,843 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1252 ImplicationChecksByTransitivity, 10.5s TimeCoverageRelationStatistics Valid=288, Invalid=4743, Unknown=85, NotChecked=140, Total=5256 [2022-11-19 07:21:51,844 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 21 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 471 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 532 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 471 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 51 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-19 07:21:51,845 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 360 Invalid, 532 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 471 Invalid, 0 Unknown, 51 Unchecked, 0.4s Time] [2022-11-19 07:21:51,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-11-19 07:21:51,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 41. [2022-11-19 07:21:51,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 34 states have (on average 1.2352941176470589) internal successors, (42), 34 states have internal predecessors, (42), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-11-19 07:21:51,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 52 transitions. [2022-11-19 07:21:51,855 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 52 transitions. Word has length 30 [2022-11-19 07:21:51,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:21:51,856 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 52 transitions. [2022-11-19 07:21:51,856 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 29 states have (on average 1.5172413793103448) internal successors, (44), 29 states have internal predecessors, (44), 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) [2022-11-19 07:21:51,856 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 52 transitions. [2022-11-19 07:21:51,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-19 07:21:51,857 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:21:51,857 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:21:51,866 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35bc4d53-0cdb-454d-b70e-af4362592e65/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-19 07:21:52,064 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35bc4d53-0cdb-454d-b70e-af4362592e65/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 07:21:52,064 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-19 07:21:52,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:21:52,065 INFO L85 PathProgramCache]: Analyzing trace with hash -325495100, now seen corresponding path program 1 times [2022-11-19 07:21:52,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:21:52,065 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552271263] [2022-11-19 07:21:52,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:21:52,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:21:52,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:21:53,719 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-19 07:21:53,720 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:21:53,720 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552271263] [2022-11-19 07:21:53,720 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [552271263] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 07:21:53,720 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1175686814] [2022-11-19 07:21:53,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:21:53,720 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 07:21:53,720 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35bc4d53-0cdb-454d-b70e-af4362592e65/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 07:21:53,721 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35bc4d53-0cdb-454d-b70e-af4362592e65/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 07:21:53,745 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35bc4d53-0cdb-454d-b70e-af4362592e65/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-19 07:21:53,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:21:53,926 INFO L263 TraceCheckSpWp]: Trace formula consists of 374 conjuncts, 107 conjunts are in the unsatisfiable core [2022-11-19 07:21:53,931 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:21:53,976 INFO L350 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 [2022-11-19 07:21:54,156 INFO L350 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 5 treesize of output 3 [2022-11-19 07:21:54,259 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-19 07:21:54,260 INFO L350 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 [2022-11-19 07:21:54,339 INFO L350 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 [2022-11-19 07:21:54,418 INFO L321 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-11-19 07:21:54,419 INFO L350 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 71 treesize of output 58 [2022-11-19 07:21:54,515 INFO L321 Elim1Store]: treesize reduction 3, result has 81.3 percent of original size [2022-11-19 07:21:54,515 INFO L350 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 62 treesize of output 34 [2022-11-19 07:21:54,521 INFO L350 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 13 treesize of output 9 [2022-11-19 07:21:54,526 INFO L350 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 11 treesize of output 7 [2022-11-19 07:21:54,649 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:21:54,670 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-19 07:21:54,670 INFO L350 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 70 treesize of output 62 [2022-11-19 07:21:54,676 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:21:54,677 INFO L350 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 61 treesize of output 59 [2022-11-19 07:21:54,699 INFO L321 Elim1Store]: treesize reduction 8, result has 75.8 percent of original size [2022-11-19 07:21:54,700 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 34 [2022-11-19 07:21:55,361 INFO L321 Elim1Store]: treesize reduction 104, result has 15.4 percent of original size [2022-11-19 07:21:55,361 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 5 case distinctions, treesize of input 144 treesize of output 67 [2022-11-19 07:21:55,396 INFO L321 Elim1Store]: treesize reduction 66, result has 19.5 percent of original size [2022-11-19 07:21:55,397 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 174 treesize of output 107 [2022-11-19 07:21:55,427 INFO L321 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2022-11-19 07:21:55,428 INFO L350 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 152 treesize of output 148 [2022-11-19 07:21:55,536 INFO L350 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 122 treesize of output 94 [2022-11-19 07:21:55,654 INFO L321 Elim1Store]: treesize reduction 28, result has 24.3 percent of original size [2022-11-19 07:21:55,655 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 109 treesize of output 44 [2022-11-19 07:21:55,661 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 07:21:55,661 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 07:21:55,686 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_680 (Array Int Int)) (v_ArrVal_684 (Array Int Int)) (v_ArrVal_686 (Array Int Int))) (not (let ((.cse1 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_684))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse0 (select (select .cse1 .cse0) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| v_ArrVal_686) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_680) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))))) is different from false [2022-11-19 07:21:56,059 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_680 (Array Int Int)) (v_ArrVal_684 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_14| Int) (v_ArrVal_686 (Array Int Int))) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| .cse4) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))) (let ((.cse3 (select |c_#memory_$Pointer$.base| .cse2))) (or (not (let ((.cse0 (store (store |c_#memory_$Pointer$.base| .cse2 (store .cse3 |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_14| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_684))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select .cse0 .cse1) (select (select (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_686) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_680) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1)))) (not (= .cse4 (select .cse3 |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_14|)))))))) is different from false [2022-11-19 07:21:56,305 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_24| Int) (v_ArrVal_692 (Array Int Int)) (v_ArrVal_691 (Array Int Int)) (v_ArrVal_680 (Array Int Int)) (v_ArrVal_684 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_14| Int) (v_ArrVal_686 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_24| v_ArrVal_691))) (let ((.cse1 (select (select .cse6 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (.cse4 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_24| v_ArrVal_692))) (let ((.cse5 (select (select .cse6 .cse1) (select (select .cse4 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))) (let ((.cse0 (select .cse6 .cse5))) (or (not (= (select .cse0 |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_14|) .cse1)) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_24|) 0)) (not (let ((.cse3 (store (store .cse6 .cse5 (store .cse0 |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_14| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_24|)) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_24| v_ArrVal_684))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse2 (select (select .cse3 .cse2) (select (select (store (store .cse4 .cse5 v_ArrVal_686) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_24| v_ArrVal_680) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) (not (< |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_24| |c_#StackHeapBarrier|)))))))) is different from false [2022-11-19 07:21:56,307 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1175686814] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 07:21:56,307 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [98509373] [2022-11-19 07:21:56,310 INFO L159 IcfgInterpreter]: Started Sifa with 22 locations of interest [2022-11-19 07:21:56,310 INFO L166 IcfgInterpreter]: Building call graph [2022-11-19 07:21:56,310 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-19 07:21:56,310 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-19 07:21:56,310 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-19 07:21:56,335 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:21:56,348 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-19 07:21:56,349 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 17 treesize of output 26 [2022-11-19 07:21:56,357 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:21:56,374 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-19 07:21:56,374 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 37 [2022-11-19 07:21:56,400 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-19 07:21:56,404 INFO L350 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 [2022-11-19 07:21:56,411 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:21:56,412 INFO L350 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 22 treesize of output 7 [2022-11-19 07:21:56,417 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:21:56,418 INFO L350 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 22 treesize of output 7 [2022-11-19 07:21:56,426 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:21:56,427 INFO L350 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 16 treesize of output 17 [2022-11-19 07:21:56,445 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:21:56,445 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-19 07:21:56,456 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:21:56,457 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2022-11-19 07:21:56,492 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:21:56,493 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2022-11-19 07:21:56,501 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:21:56,502 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-19 07:21:56,575 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-19 07:21:56,583 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-19 07:21:56,592 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-19 07:21:56,601 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-19 07:21:56,609 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-19 07:21:56,642 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-19 07:21:56,649 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-19 07:21:56,658 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-19 07:21:56,667 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-19 07:21:56,677 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-19 07:21:56,710 INFO L350 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 19 treesize of output 11 [2022-11-19 07:21:56,722 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:21:56,722 INFO L350 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 [2022-11-19 07:21:56,732 INFO L350 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 19 treesize of output 11 [2022-11-19 07:21:56,956 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-19 07:21:56,957 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-19 07:21:56,959 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-19 07:21:56,961 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-19 07:21:56,963 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-19 07:21:56,974 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-19 07:21:56,983 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-19 07:21:56,993 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-19 07:21:57,003 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-19 07:21:57,012 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-19 07:21:57,210 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-19 07:21:57,219 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-19 07:21:57,228 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-19 07:21:57,238 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-19 07:21:57,246 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-19 07:21:57,259 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-19 07:21:57,260 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-19 07:21:57,263 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-19 07:21:57,265 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-19 07:21:57,267 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-19 07:21:57,304 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:21:57,305 INFO L350 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 [2022-11-19 07:21:57,314 INFO L350 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 19 treesize of output 11 [2022-11-19 07:21:57,327 INFO L350 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 19 treesize of output 11 [2022-11-19 07:21:57,648 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-19 07:21:57,651 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-19 07:21:57,652 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-19 07:21:57,654 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-19 07:21:57,657 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-19 07:21:57,668 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-19 07:21:57,676 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-19 07:21:57,685 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-19 07:21:57,694 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-19 07:21:57,703 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-19 07:21:57,886 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-19 07:21:57,895 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-19 07:21:57,903 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-19 07:21:57,912 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-19 07:21:57,923 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-19 07:21:57,935 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-19 07:21:57,943 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-19 07:21:57,944 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-19 07:21:57,947 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-19 07:21:57,949 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-19 07:21:57,998 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2022-11-19 07:21:58,028 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-19 07:21:58,029 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2022-11-19 07:21:58,059 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-19 07:21:58,060 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2022-11-19 07:21:58,114 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-19 07:21:58,126 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:21:58,128 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:21:58,134 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-19 07:21:58,134 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2022-11-19 07:21:58,148 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-19 07:21:58,166 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:21:58,169 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:21:58,175 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-19 07:21:58,176 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2022-11-19 07:21:58,189 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-19 07:21:58,244 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-19 07:21:58,257 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:21:58,259 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:21:58,264 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-19 07:21:58,265 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2022-11-19 07:21:58,279 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-19 07:21:58,294 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:21:58,299 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:21:58,305 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-19 07:21:58,305 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2022-11-19 07:21:58,320 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-19 07:21:58,599 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 07:21:58,669 INFO L321 Elim1Store]: treesize reduction 117, result has 32.4 percent of original size [2022-11-19 07:21:58,670 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 88 treesize of output 120 [2022-11-19 07:21:58,743 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 07:21:58,755 INFO L321 Elim1Store]: treesize reduction 13, result has 38.1 percent of original size [2022-11-19 07:21:58,755 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 58 treesize of output 37 [2022-11-19 07:21:58,759 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-19 07:21:58,769 INFO L350 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 5 treesize of output 3 [2022-11-19 07:21:58,788 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 07:21:58,872 INFO L321 Elim1Store]: treesize reduction 117, result has 32.4 percent of original size [2022-11-19 07:21:58,872 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 88 treesize of output 120 [2022-11-19 07:21:58,937 INFO L321 Elim1Store]: treesize reduction 39, result has 48.7 percent of original size [2022-11-19 07:21:58,938 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 60 treesize of output 67 [2022-11-19 07:21:58,957 INFO L350 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 5 treesize of output 3 [2022-11-19 07:21:58,993 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-19 07:21:58,994 INFO L350 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 16 treesize of output 20 [2022-11-19 07:21:59,009 INFO L350 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 5 treesize of output 3 [2022-11-19 07:21:59,027 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 07:21:59,028 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:21:59,028 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 59 [2022-11-19 07:21:59,061 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-19 07:21:59,062 INFO L350 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 21 treesize of output 25 [2022-11-19 07:21:59,163 INFO L321 Elim1Store]: treesize reduction 21, result has 41.7 percent of original size [2022-11-19 07:21:59,163 INFO L350 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 1 case distinctions, treesize of input 31 treesize of output 15 [2022-11-19 07:21:59,884 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 21 for LOIs [2022-11-19 07:21:59,892 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-19 07:21:59,897 INFO L350 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 [2022-11-19 07:21:59,914 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:21:59,915 INFO L350 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 16 treesize of output 17 [2022-11-19 07:21:59,921 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:21:59,922 INFO L350 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 22 treesize of output 7 [2022-11-19 07:21:59,930 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:21:59,931 INFO L350 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 22 treesize of output 7 [2022-11-19 07:21:59,933 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-19 07:22:10,735 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1237#(and (or (and (= |ULTIMATE.start_sll_circular_append_~last~1#1.offset| |ULTIMATE.start_sll_circular_append_~head#1.offset|) (= |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)) (= |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_append_~last~1#1.base|) |ULTIMATE.start_sll_circular_append_~last~1#1.offset|)) (= |ULTIMATE.start_sll_circular_append_~last~1#1.base| |ULTIMATE.start_sll_circular_append_~head#1.base|)) (and (or (not (= |ULTIMATE.start_sll_circular_append_~last~1#1.base| |ULTIMATE.start_sll_circular_append_~head#1.base|)) (not (= |ULTIMATE.start_sll_circular_append_~last~1#1.offset| |ULTIMATE.start_sll_circular_append_~head#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_append_~head#1.base|) |ULTIMATE.start_sll_circular_append_~head#1.offset|)) (or (and (= |ULTIMATE.start_sll_circular_append_~last~1#1.base| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) (= |ULTIMATE.start_sll_circular_append_~last~1#1.offset| |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)) (= |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_append_~last~1#1.base|) |ULTIMATE.start_sll_circular_append_~last~1#1.offset|))))) (<= 2 |ULTIMATE.start_sll_circular_create_#in~len#1|) (<= 5 |ULTIMATE.start_sll_circular_append_#in~data#1|) (<= |ULTIMATE.start_sll_circular_append_~data#1| 5) (not (= (select (select |#memory_int| |ULTIMATE.start_main_~ptr~0#1.base|) (+ |ULTIMATE.start_main_~ptr~0#1.offset| 4)) |ULTIMATE.start_main_~data~0#1|)) (<= |ULTIMATE.start_sll_circular_create_#in~data#1| 1) (<= 1 |ULTIMATE.start_sll_circular_create_~len#1|) (= |ULTIMATE.start_main_~ptr~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (<= 0 |ULTIMATE.start_sll_circular_append_#in~head#1.base|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) |ULTIMATE.start_main_~ptr~0#1.offset|) (= |ULTIMATE.start_main_~uneq~0#1| 5) (<= |ULTIMATE.start_sll_circular_append_#in~data#1| 5) (= |ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (<= |ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~last~2#1.base|) |ULTIMATE.start_main_~last~2#1.offset|)) (<= |ULTIMATE.start_sll_circular_create_#in~len#1| 2) (<= 0 |ULTIMATE.start_sll_circular_append_#in~head#1.offset|) (<= 1 |ULTIMATE.start_sll_circular_create_~data#1|) (<= 0 |ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (= |ULTIMATE.start_main_~count~0#1| 0) (<= 0 |ULTIMATE.start_sll_circular_append_~head#1.base|) (<= 1 |ULTIMATE.start_sll_circular_create_#in~data#1|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~last~2#1.base|) |ULTIMATE.start_main_~last~2#1.offset|)) (= |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| 0) (<= |ULTIMATE.start_sll_circular_create_~len#1| 1) (= |ULTIMATE.start_main_~data~0#1| 1) (<= |ULTIMATE.start_sll_circular_create_~data#1| 1) (<= |ULTIMATE.start_sll_circular_append_#in~head#1.offset| 0) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (<= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (<= 5 |ULTIMATE.start_sll_circular_append_~data#1|) (= |ULTIMATE.start_main_~len~0#1| 2) (= |#NULL.offset| 0) (<= 0 |ULTIMATE.start_main_~#s~0#1.base|) (<= 0 |ULTIMATE.start_sll_circular_append_~head#1.offset|) (<= 0 |ULTIMATE.start_sll_circular_create_#res#1.offset|) (= |ULTIMATE.start_main_~last~2#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| 0) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) |ULTIMATE.start_main_~last~2#1.offset|) (or (and (or (not (= |ULTIMATE.start_sll_circular_append_~last~1#1.base| |ULTIMATE.start_sll_circular_append_~head#1.base|)) (not (= |ULTIMATE.start_sll_circular_append_~last~1#1.offset| |ULTIMATE.start_sll_circular_append_~head#1.offset|))) (or (and (= |ULTIMATE.start_sll_circular_append_~last~1#1.base| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) (= |ULTIMATE.start_sll_circular_append_~last~1#1.offset| |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)) (= |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_append_~last~1#1.base|) |ULTIMATE.start_sll_circular_append_~last~1#1.offset|))) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_append_~head#1.base|) |ULTIMATE.start_sll_circular_append_~head#1.offset|)) (or (exists ((v_DerPreprocessor_19 (Array Int Int))) (and (= (select v_DerPreprocessor_19 |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|) |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) (exists ((v_DerPreprocessor_18 (Array Int Int))) (and (= (select (select (store (store (store (store |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_append_~last~1#1.base| v_DerPreprocessor_18) |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_DerPreprocessor_19) |ULTIMATE.start_sll_circular_append_~last~1#1.base| v_DerPreprocessor_18) |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_DerPreprocessor_19) |ULTIMATE.start_sll_circular_append_~head#1.base|) |ULTIMATE.start_sll_circular_append_~head#1.offset|) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)) (= (select (select (store (store (store (store |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_append_~last~1#1.base| v_DerPreprocessor_18) |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_DerPreprocessor_19) |ULTIMATE.start_sll_circular_append_~last~1#1.base| v_DerPreprocessor_18) |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_DerPreprocessor_19) |ULTIMATE.start_sll_circular_append_~last~1#1.base|) |ULTIMATE.start_sll_circular_append_~last~1#1.offset|) |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) (= v_DerPreprocessor_18 (select (store (store (store (store |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_append_~last~1#1.base| v_DerPreprocessor_18) |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_DerPreprocessor_19) |ULTIMATE.start_sll_circular_append_~last~1#1.base| v_DerPreprocessor_18) |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_DerPreprocessor_19) |ULTIMATE.start_sll_circular_append_~last~1#1.base|)))))) (= |ULTIMATE.start_sll_circular_append_~head#1.base| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|))) (and (= |ULTIMATE.start_sll_circular_append_~last~1#1.offset| |ULTIMATE.start_sll_circular_append_~head#1.offset|) (= |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_append_~last~1#1.base|) |ULTIMATE.start_sll_circular_append_~last~1#1.offset|)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|) |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) (= |ULTIMATE.start_sll_circular_append_~last~1#1.base| |ULTIMATE.start_sll_circular_append_~head#1.base|))) (= |#NULL.base| 0))' at error location [2022-11-19 07:22:10,735 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-19 07:22:10,735 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-19 07:22:10,735 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 25] total 40 [2022-11-19 07:22:10,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498869157] [2022-11-19 07:22:10,735 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-19 07:22:10,736 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-11-19 07:22:10,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:22:10,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-11-19 07:22:10,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=211, Invalid=3792, Unknown=41, NotChecked=378, Total=4422 [2022-11-19 07:22:10,738 INFO L87 Difference]: Start difference. First operand 41 states and 52 transitions. Second operand has 40 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 31 states have internal predecessors, (41), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-19 07:22:11,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:22:11,661 INFO L93 Difference]: Finished difference Result 59 states and 76 transitions. [2022-11-19 07:22:11,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-19 07:22:11,662 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 31 states have internal predecessors, (41), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 30 [2022-11-19 07:22:11,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:22:11,663 INFO L225 Difference]: With dead ends: 59 [2022-11-19 07:22:11,663 INFO L226 Difference]: Without dead ends: 51 [2022-11-19 07:22:11,665 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 72 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1058 ImplicationChecksByTransitivity, 13.3s TimeCoverageRelationStatistics Valid=270, Invalid=4671, Unknown=41, NotChecked=420, Total=5402 [2022-11-19 07:22:11,666 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 23 mSDsluCounter, 359 mSDsCounter, 0 mSdLazyCounter, 499 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 587 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 499 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 75 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-19 07:22:11,666 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 378 Invalid, 587 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 499 Invalid, 0 Unknown, 75 Unchecked, 0.4s Time] [2022-11-19 07:22:11,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-11-19 07:22:11,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 41. [2022-11-19 07:22:11,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 34 states have (on average 1.2352941176470589) internal successors, (42), 34 states have internal predecessors, (42), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-11-19 07:22:11,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 52 transitions. [2022-11-19 07:22:11,677 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 52 transitions. Word has length 30 [2022-11-19 07:22:11,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:22:11,677 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 52 transitions. [2022-11-19 07:22:11,678 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 31 states have internal predecessors, (41), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-19 07:22:11,678 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 52 transitions. [2022-11-19 07:22:11,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-19 07:22:11,679 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:22:11,679 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:22:11,690 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35bc4d53-0cdb-454d-b70e-af4362592e65/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-19 07:22:11,885 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35bc4d53-0cdb-454d-b70e-af4362592e65/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 07:22:11,886 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-19 07:22:11,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:22:11,886 INFO L85 PathProgramCache]: Analyzing trace with hash 778550271, now seen corresponding path program 1 times [2022-11-19 07:22:11,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:22:11,886 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572900887] [2022-11-19 07:22:11,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:22:11,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:22:11,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:22:14,271 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-19 07:22:14,271 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:22:14,271 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572900887] [2022-11-19 07:22:14,271 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [572900887] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 07:22:14,271 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2133185750] [2022-11-19 07:22:14,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:22:14,272 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 07:22:14,272 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35bc4d53-0cdb-454d-b70e-af4362592e65/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 07:22:14,278 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35bc4d53-0cdb-454d-b70e-af4362592e65/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 07:22:14,287 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35bc4d53-0cdb-454d-b70e-af4362592e65/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-19 07:22:14,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:22:14,765 WARN L261 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 194 conjunts are in the unsatisfiable core [2022-11-19 07:22:14,774 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:22:14,831 INFO L350 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 [2022-11-19 07:22:15,121 INFO L350 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 5 treesize of output 3 [2022-11-19 07:22:15,211 INFO L350 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 [2022-11-19 07:22:15,318 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-19 07:22:15,319 INFO L350 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 [2022-11-19 07:22:15,430 INFO L350 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 [2022-11-19 07:22:15,448 INFO L350 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 19 treesize of output 18 [2022-11-19 07:22:15,463 INFO L350 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 [2022-11-19 07:22:15,587 INFO L321 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-11-19 07:22:15,587 INFO L350 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 83 treesize of output 58 [2022-11-19 07:22:15,593 INFO L350 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 26 treesize of output 28 [2022-11-19 07:22:15,604 INFO L350 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 26 treesize of output 28 [2022-11-19 07:22:15,747 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-19 07:22:15,748 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 79 treesize of output 38 [2022-11-19 07:22:15,755 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-19 07:22:15,761 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:22:15,762 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-19 07:22:15,766 INFO L350 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 11 treesize of output 7 [2022-11-19 07:22:16,018 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:22:16,029 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-19 07:22:16,030 INFO L350 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 89 treesize of output 75 [2022-11-19 07:22:16,042 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:22:16,043 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:22:16,056 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-11-19 07:22:16,056 INFO L350 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 1 case distinctions, treesize of input 25 treesize of output 38 [2022-11-19 07:22:16,085 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-11-19 07:22:16,086 INFO L350 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 18 treesize of output 28 [2022-11-19 07:22:16,095 INFO L350 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 5 treesize of output 3 [2022-11-19 07:22:16,129 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-11-19 07:22:16,129 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2022-11-19 07:22:17,405 INFO L321 Elim1Store]: treesize reduction 143, result has 15.4 percent of original size [2022-11-19 07:22:17,405 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 8 new quantified variables, introduced 9 case distinctions, treesize of input 305 treesize of output 154 [2022-11-19 07:22:17,456 INFO L321 Elim1Store]: treesize reduction 66, result has 19.5 percent of original size [2022-11-19 07:22:17,456 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 427 treesize of output 278 [2022-11-19 07:22:17,469 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:22:17,506 INFO L321 Elim1Store]: treesize reduction 123, result has 14.0 percent of original size [2022-11-19 07:22:17,506 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 8 case distinctions, treesize of input 815 treesize of output 482 [2022-11-19 07:22:17,522 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:22:17,598 INFO L321 Elim1Store]: treesize reduction 369, result has 5.1 percent of original size [2022-11-19 07:22:17,599 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 4 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 10 new quantified variables, introduced 17 case distinctions, treesize of input 671 treesize of output 680 [2022-11-19 07:22:17,622 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:22:17,624 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:22:17,625 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 65 [2022-11-19 07:22:17,647 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 173 [2022-11-19 07:22:17,663 INFO L350 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 32 treesize of output 31 [2022-11-19 07:22:17,680 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 173 [2022-11-19 07:22:17,773 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 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 316 treesize of output 129 [2022-11-19 07:22:18,331 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:22:18,410 INFO L321 Elim1Store]: treesize reduction 386, result has 3.3 percent of original size [2022-11-19 07:22:18,410 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 1 disjoint index pairs (out of 28 index pairs), introduced 14 new quantified variables, introduced 25 case distinctions, treesize of input 745 treesize of output 437 [2022-11-19 07:22:18,432 INFO L350 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 285 treesize of output 257 [2022-11-19 07:22:18,715 INFO L321 Elim1Store]: treesize reduction 36, result has 18.2 percent of original size [2022-11-19 07:22:18,715 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 124 treesize of output 53 [2022-11-19 07:22:18,795 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 07:22:18,795 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 07:22:31,704 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2133185750] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 07:22:31,704 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [891974287] [2022-11-19 07:22:31,707 INFO L159 IcfgInterpreter]: Started Sifa with 22 locations of interest [2022-11-19 07:22:31,707 INFO L166 IcfgInterpreter]: Building call graph [2022-11-19 07:22:31,708 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-19 07:22:31,708 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-19 07:22:31,708 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-19 07:22:31,726 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:22:31,742 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-19 07:22:31,742 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 17 treesize of output 26 [2022-11-19 07:22:31,752 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:22:31,767 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-19 07:22:31,768 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 37 [2022-11-19 07:22:31,788 INFO L350 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 [2022-11-19 07:22:31,795 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-19 07:22:31,802 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:22:31,802 INFO L350 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 22 treesize of output 7 [2022-11-19 07:22:31,808 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:22:31,808 INFO L350 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 22 treesize of output 7 [2022-11-19 07:22:31,816 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:22:31,817 INFO L350 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 16 treesize of output 17 [2022-11-19 07:22:31,835 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:22:31,835 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-19 07:22:31,844 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:22:31,844 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2022-11-19 07:22:31,880 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:22:31,880 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2022-11-19 07:22:31,889 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:22:31,890 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-19 07:22:32,080 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-19 07:22:32,089 INFO L350 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 9 treesize of output 3 [2022-11-19 07:22:32,099 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-19 07:22:32,124 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-19 07:22:32,137 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-19 07:22:32,148 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-19 07:22:32,150 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-19 07:22:32,151 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-19 07:22:32,154 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-19 07:22:32,155 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-19 07:22:32,304 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-19 07:22:32,313 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-19 07:22:32,324 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-19 07:22:32,333 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-19 07:22:32,343 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-19 07:22:32,354 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-19 07:22:32,356 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-19 07:22:32,357 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-19 07:22:32,360 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-19 07:22:32,361 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-19 07:22:32,440 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 07:22:32,441 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:22:32,442 INFO L350 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 221 treesize of output 205 [2022-11-19 07:22:32,454 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 07:22:32,454 INFO L350 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 219 treesize of output 207 [2022-11-19 07:22:32,467 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 07:22:32,468 INFO L350 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 227 treesize of output 110 [2022-11-19 07:22:32,624 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:22:32,625 INFO L350 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 140 treesize of output 124 [2022-11-19 07:22:32,635 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 07:22:32,636 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 136 treesize of output 124 [2022-11-19 07:22:32,645 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 07:22:32,646 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 132 treesize of output 120 [2022-11-19 07:22:32,803 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-19 07:22:32,818 INFO L350 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 [2022-11-19 07:22:32,833 INFO L350 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 [2022-11-19 07:22:32,924 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 07:22:32,929 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-19 07:22:32,930 INFO L350 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 [2022-11-19 07:22:32,944 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 07:22:32,949 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-19 07:22:32,950 INFO L350 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 [2022-11-19 07:22:33,053 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 07:22:33,058 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-19 07:22:33,059 INFO L350 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 [2022-11-19 07:22:33,070 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 07:22:33,075 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-19 07:22:33,076 INFO L350 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 [2022-11-19 07:22:33,186 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 07:22:33,265 INFO L321 Elim1Store]: treesize reduction 117, result has 32.4 percent of original size [2022-11-19 07:22:33,265 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 88 treesize of output 120 [2022-11-19 07:22:33,328 INFO L321 Elim1Store]: treesize reduction 39, result has 48.7 percent of original size [2022-11-19 07:22:33,328 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 60 treesize of output 67 [2022-11-19 07:22:33,341 INFO L350 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 5 treesize of output 3 [2022-11-19 07:22:33,363 INFO L350 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 5 treesize of output 3 [2022-11-19 07:22:33,384 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-19 07:22:33,385 INFO L350 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 11 treesize of output 7 [2022-11-19 07:22:33,404 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:22:33,405 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 07:22:33,406 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 65 [2022-11-19 07:22:33,433 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-19 07:22:33,434 INFO L350 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 21 treesize of output 25 [2022-11-19 07:22:33,448 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-19 07:22:33,456 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-19 07:22:33,563 INFO L321 Elim1Store]: treesize reduction 21, result has 41.7 percent of original size [2022-11-19 07:22:33,563 INFO L350 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 1 case distinctions, treesize of input 31 treesize of output 15 [2022-11-19 07:22:33,584 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 07:22:33,660 INFO L321 Elim1Store]: treesize reduction 117, result has 32.4 percent of original size [2022-11-19 07:22:33,661 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 88 treesize of output 120 [2022-11-19 07:22:33,732 INFO L321 Elim1Store]: treesize reduction 39, result has 48.7 percent of original size [2022-11-19 07:22:33,732 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 60 treesize of output 67 [2022-11-19 07:22:33,748 INFO L350 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 5 treesize of output 3 [2022-11-19 07:22:33,768 INFO L350 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 5 treesize of output 3 [2022-11-19 07:22:33,793 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-19 07:22:33,794 INFO L350 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 11 treesize of output 7 [2022-11-19 07:22:33,824 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 07:22:33,825 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:22:33,826 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 65 [2022-11-19 07:22:33,871 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-19 07:22:33,871 INFO L350 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 21 treesize of output 25 [2022-11-19 07:22:33,886 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-19 07:22:49,602 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 21 for LOIs [2022-11-19 07:22:49,611 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-19 07:22:49,616 INFO L350 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 [2022-11-19 07:22:49,629 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:22:49,630 INFO L350 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 22 treesize of output 7 [2022-11-19 07:22:49,640 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:22:49,640 INFO L350 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 16 treesize of output 17 [2022-11-19 07:22:49,652 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:22:49,653 INFO L350 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 22 treesize of output 7 [2022-11-19 07:22:49,657 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-19 07:22:55,744 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1610#(and (<= 2 |ULTIMATE.start_sll_circular_create_#in~len#1|) (<= 5 |ULTIMATE.start_sll_circular_append_#in~data#1|) (<= |ULTIMATE.start_sll_circular_append_~data#1| 5) (not (= (select (select |#memory_int| |ULTIMATE.start_main_~ptr~0#1.base|) (+ |ULTIMATE.start_main_~ptr~0#1.offset| 4)) |ULTIMATE.start_main_~data~0#1|)) (<= |ULTIMATE.start_sll_circular_create_#in~data#1| 1) (<= |ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (<= 0 |ULTIMATE.start_sll_circular_append_#in~head#1.base|) (= |ULTIMATE.start_main_~uneq~0#1| 5) (<= |ULTIMATE.start_sll_circular_append_#in~data#1| 5) (<= |ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (<= |ULTIMATE.start_sll_circular_create_#in~len#1| 2) (<= 0 |ULTIMATE.start_sll_circular_create_~last~0#1.offset|) (<= 0 |ULTIMATE.start_sll_circular_append_#in~head#1.offset|) (<= 1 |ULTIMATE.start_sll_circular_create_~data#1|) (<= 0 |ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (= |ULTIMATE.start_main_~count~0#1| 0) (<= 0 |ULTIMATE.start_sll_circular_append_~head#1.base|) (<= 1 |ULTIMATE.start_sll_circular_create_#in~data#1|) (= |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| 0) (<= |ULTIMATE.start_sll_circular_create_~len#1| 1) (= |ULTIMATE.start_main_~data~0#1| 1) (<= |ULTIMATE.start_sll_circular_create_~data#1| 1) (<= |ULTIMATE.start_sll_circular_append_#in~head#1.offset| 0) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (<= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (<= 5 |ULTIMATE.start_sll_circular_append_~data#1|) (= |ULTIMATE.start_main_~len~0#1| 2) (= |#NULL.offset| 0) (<= 0 |ULTIMATE.start_main_~#s~0#1.base|) (<= 0 |ULTIMATE.start_sll_circular_append_~head#1.offset|) (<= 0 |ULTIMATE.start_sll_circular_create_#res#1.offset|) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (= |#NULL.base| 0))' at error location [2022-11-19 07:22:55,744 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-19 07:22:55,744 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-19 07:22:55,744 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 26] total 47 [2022-11-19 07:22:55,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742023388] [2022-11-19 07:22:55,745 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-19 07:22:55,745 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-11-19 07:22:55,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:22:55,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-11-19 07:22:55,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=289, Invalid=5679, Unknown=38, NotChecked=0, Total=6006 [2022-11-19 07:22:55,749 INFO L87 Difference]: Start difference. First operand 41 states and 52 transitions. Second operand has 47 states, 38 states have (on average 1.236842105263158) internal successors, (47), 37 states have internal predecessors, (47), 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) [2022-11-19 07:22:57,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:22:57,394 INFO L93 Difference]: Finished difference Result 61 states and 78 transitions. [2022-11-19 07:22:57,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-19 07:22:57,395 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 38 states have (on average 1.236842105263158) internal successors, (47), 37 states have internal predecessors, (47), 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 32 [2022-11-19 07:22:57,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:22:57,396 INFO L225 Difference]: With dead ends: 61 [2022-11-19 07:22:57,396 INFO L226 Difference]: Without dead ends: 53 [2022-11-19 07:22:57,398 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1505 ImplicationChecksByTransitivity, 22.5s TimeCoverageRelationStatistics Valid=359, Invalid=6742, Unknown=39, NotChecked=0, Total=7140 [2022-11-19 07:22:57,398 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 17 mSDsluCounter, 371 mSDsCounter, 0 mSdLazyCounter, 622 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 693 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 622 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 60 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-19 07:22:57,399 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 388 Invalid, 693 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 622 Invalid, 0 Unknown, 60 Unchecked, 0.7s Time] [2022-11-19 07:22:57,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-11-19 07:22:57,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 47. [2022-11-19 07:22:57,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 40 states have (on average 1.225) internal successors, (49), 40 states have internal predecessors, (49), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-11-19 07:22:57,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 59 transitions. [2022-11-19 07:22:57,417 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 59 transitions. Word has length 32 [2022-11-19 07:22:57,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:22:57,417 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 59 transitions. [2022-11-19 07:22:57,417 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 38 states have (on average 1.236842105263158) internal successors, (47), 37 states have internal predecessors, (47), 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) [2022-11-19 07:22:57,426 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 59 transitions. [2022-11-19 07:22:57,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-19 07:22:57,433 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:22:57,433 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:22:57,446 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35bc4d53-0cdb-454d-b70e-af4362592e65/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-19 07:22:57,646 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35bc4d53-0cdb-454d-b70e-af4362592e65/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-11-19 07:22:57,647 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-19 07:22:57,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:22:57,647 INFO L85 PathProgramCache]: Analyzing trace with hash 506280767, now seen corresponding path program 2 times [2022-11-19 07:22:57,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:22:57,648 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520432001] [2022-11-19 07:22:57,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:22:57,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:22:57,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:22:59,280 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 07:22:59,280 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:22:59,280 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520432001] [2022-11-19 07:22:59,280 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520432001] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 07:22:59,280 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [355028273] [2022-11-19 07:22:59,280 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-19 07:22:59,280 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 07:22:59,281 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35bc4d53-0cdb-454d-b70e-af4362592e65/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 07:22:59,283 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35bc4d53-0cdb-454d-b70e-af4362592e65/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 07:22:59,309 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35bc4d53-0cdb-454d-b70e-af4362592e65/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-19 07:22:59,662 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-19 07:22:59,662 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-19 07:22:59,666 INFO L263 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 122 conjunts are in the unsatisfiable core [2022-11-19 07:22:59,674 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:22:59,714 INFO L350 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 [2022-11-19 07:22:59,914 WARN L837 $PredicateComparison]: unable to prove that (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) 1) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_135| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_135| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_135| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_135| |c_#valid|))) (store |v_#valid_BEFORE_CALL_135| .cse0 (select |c_#valid| .cse0)))))) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|)) is different from false [2022-11-19 07:22:59,917 WARN L859 $PredicateComparison]: unable to prove that (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) 1) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_135| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_135| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_135| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_135| |c_#valid|))) (store |v_#valid_BEFORE_CALL_135| .cse0 (select |c_#valid| .cse0)))))) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|)) is different from true [2022-11-19 07:22:59,956 INFO L350 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 [2022-11-19 07:22:59,965 INFO L350 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 [2022-11-19 07:22:59,972 WARN L837 $PredicateComparison]: unable to prove that (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_135| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_135| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1) (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_135| |c_#valid|))) (store |v_#valid_BEFORE_CALL_135| .cse0 (select |c_#valid| .cse0)))) (= (select |v_#valid_BEFORE_CALL_135| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) 0) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0)) is different from false [2022-11-19 07:22:59,975 WARN L859 $PredicateComparison]: unable to prove that (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_135| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_135| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1) (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_135| |c_#valid|))) (store |v_#valid_BEFORE_CALL_135| .cse0 (select |c_#valid| .cse0)))) (= (select |v_#valid_BEFORE_CALL_135| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) 0) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0)) is different from true [2022-11-19 07:23:00,020 INFO L321 Elim1Store]: treesize reduction 33, result has 25.0 percent of original size [2022-11-19 07:23:00,021 INFO L350 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 72 treesize of output 42 [2022-11-19 07:23:00,047 INFO L321 Elim1Store]: treesize reduction 45, result has 19.6 percent of original size [2022-11-19 07:23:00,047 INFO L350 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 39 treesize of output 30 [2022-11-19 07:23:00,059 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| .cse0) 0))) (and (= .cse0 (select (select |c_#memory_$Pointer$.base| .cse1) 0)) (= (select (select |c_#memory_$Pointer$.offset| .cse1) 0) 0) (= (select (select |c_#memory_$Pointer$.offset| .cse0) 0) 0) (= (select |c_#valid| .cse0) 1) (= |c_ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_135| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_135| .cse0) 0) (= |c_#valid| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_135| |c_#valid|))) (store |v_#valid_BEFORE_CALL_135| .cse2 (select |c_#valid| .cse2)))) (= (select |v_#valid_BEFORE_CALL_135| .cse1) 1))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) 0) 0) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_sll_circular_append_~head#1.base|)))) is different from false [2022-11-19 07:23:00,062 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| .cse0) 0))) (and (= .cse0 (select (select |c_#memory_$Pointer$.base| .cse1) 0)) (= (select (select |c_#memory_$Pointer$.offset| .cse1) 0) 0) (= (select (select |c_#memory_$Pointer$.offset| .cse0) 0) 0) (= (select |c_#valid| .cse0) 1) (= |c_ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_135| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_135| .cse0) 0) (= |c_#valid| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_135| |c_#valid|))) (store |v_#valid_BEFORE_CALL_135| .cse2 (select |c_#valid| .cse2)))) (= (select |v_#valid_BEFORE_CALL_135| .cse1) 1))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) 0) 0) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_sll_circular_append_~head#1.base|)))) is different from true [2022-11-19 07:23:00,087 INFO L321 Elim1Store]: treesize reduction 21, result has 16.0 percent of original size [2022-11-19 07:23:00,087 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 77 treesize of output 43 [2022-11-19 07:23:00,100 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:23:00,104 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-19 07:23:00,104 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 1 case distinctions, treesize of input 22 treesize of output 10 [2022-11-19 07:23:00,219 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:23:00,221 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:23:00,222 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:23:00,223 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:23:00,225 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:23:00,230 INFO L321 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-11-19 07:23:00,230 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 48 [2022-11-19 07:23:00,240 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:23:00,263 INFO L321 Elim1Store]: treesize reduction 52, result has 17.5 percent of original size [2022-11-19 07:23:00,263 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 83 treesize of output 77 [2022-11-19 07:23:00,295 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| .cse0) 0))) (and (= .cse0 (select (select |c_#memory_$Pointer$.base| .cse1) 0)) (= (select (select |c_#memory_$Pointer$.offset| .cse1) 0) 0) (= (select (select |c_#memory_$Pointer$.offset| .cse0) 0) 0) (= |c_ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (<= (+ 2 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.base|) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) 0) 0) (exists ((|v_old(#valid)_AFTER_CALL_68| (Array Int Int)) (|v_#valid_BEFORE_CALL_135| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_135| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_68| |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_68| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_135| .cse1) 1) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_135| |v_old(#valid)_AFTER_CALL_68|))) (store |v_#valid_BEFORE_CALL_135| .cse2 (select |v_old(#valid)_AFTER_CALL_68| .cse2))) |v_old(#valid)_AFTER_CALL_68|)))))) is different from false [2022-11-19 07:23:00,298 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| .cse0) 0))) (and (= .cse0 (select (select |c_#memory_$Pointer$.base| .cse1) 0)) (= (select (select |c_#memory_$Pointer$.offset| .cse1) 0) 0) (= (select (select |c_#memory_$Pointer$.offset| .cse0) 0) 0) (= |c_ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (<= (+ 2 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.base|) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) 0) 0) (exists ((|v_old(#valid)_AFTER_CALL_68| (Array Int Int)) (|v_#valid_BEFORE_CALL_135| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_135| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_68| |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_68| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_135| .cse1) 1) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_135| |v_old(#valid)_AFTER_CALL_68|))) (store |v_#valid_BEFORE_CALL_135| .cse2 (select |v_old(#valid)_AFTER_CALL_68| .cse2))) |v_old(#valid)_AFTER_CALL_68|)))))) is different from true [2022-11-19 07:23:00,337 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| .cse0) 0))) (and (= .cse0 (select (select |c_#memory_$Pointer$.base| .cse1) 0)) (= (select (select |c_#memory_$Pointer$.offset| .cse1) 0) 0) (= (select (select |c_#memory_$Pointer$.offset| .cse0) 0) 0) (= |c_ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) 0) 0) (exists ((|v_old(#valid)_AFTER_CALL_68| (Array Int Int)) (|v_#valid_BEFORE_CALL_135| (Array Int Int)) (|ULTIMATE.start_sll_circular_append_~new_last~0#1.base| Int)) (and (= (select |v_#valid_BEFORE_CALL_135| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_68| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_68| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0) (<= (+ 2 |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.base|) (= (select |v_#valid_BEFORE_CALL_135| .cse1) 1) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_135| |v_old(#valid)_AFTER_CALL_68|))) (store |v_#valid_BEFORE_CALL_135| .cse2 (select |v_old(#valid)_AFTER_CALL_68| .cse2))) |v_old(#valid)_AFTER_CALL_68|)))))) is different from false [2022-11-19 07:23:00,340 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| .cse0) 0))) (and (= .cse0 (select (select |c_#memory_$Pointer$.base| .cse1) 0)) (= (select (select |c_#memory_$Pointer$.offset| .cse1) 0) 0) (= (select (select |c_#memory_$Pointer$.offset| .cse0) 0) 0) (= |c_ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) 0) 0) (exists ((|v_old(#valid)_AFTER_CALL_68| (Array Int Int)) (|v_#valid_BEFORE_CALL_135| (Array Int Int)) (|ULTIMATE.start_sll_circular_append_~new_last~0#1.base| Int)) (and (= (select |v_#valid_BEFORE_CALL_135| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_68| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_68| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0) (<= (+ 2 |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.base|) (= (select |v_#valid_BEFORE_CALL_135| .cse1) 1) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_135| |v_old(#valid)_AFTER_CALL_68|))) (store |v_#valid_BEFORE_CALL_135| .cse2 (select |v_old(#valid)_AFTER_CALL_68| .cse2))) |v_old(#valid)_AFTER_CALL_68|)))))) is different from true [2022-11-19 07:23:00,384 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|))) (let ((.cse0 (select .cse3 0))) (let ((.cse2 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|)) (.cse1 (select (select |c_#memory_$Pointer$.base| .cse0) 0))) (and (= .cse0 (select (select |c_#memory_$Pointer$.base| .cse1) 0)) (= (select (select |c_#memory_$Pointer$.offset| .cse1) 0) 0) (= (select (select |c_#memory_$Pointer$.offset| .cse0) 0) 0) (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| (select .cse2 |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (= |c_ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (= (select .cse3 |c_ULTIMATE.start_sll_circular_append_~head#1.offset|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) (= (select .cse2 0) 0) (exists ((|v_old(#valid)_AFTER_CALL_68| (Array Int Int)) (|v_#valid_BEFORE_CALL_135| (Array Int Int)) (|ULTIMATE.start_sll_circular_append_~new_last~0#1.base| Int)) (and (= (select |v_#valid_BEFORE_CALL_135| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_68| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_68| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0) (<= (+ 2 |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.base|) (= (select |v_#valid_BEFORE_CALL_135| .cse1) 1) (= (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_135| |v_old(#valid)_AFTER_CALL_68|))) (store |v_#valid_BEFORE_CALL_135| .cse4 (select |v_old(#valid)_AFTER_CALL_68| .cse4))) |v_old(#valid)_AFTER_CALL_68|))))))) is different from false [2022-11-19 07:23:00,387 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|))) (let ((.cse0 (select .cse3 0))) (let ((.cse2 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|)) (.cse1 (select (select |c_#memory_$Pointer$.base| .cse0) 0))) (and (= .cse0 (select (select |c_#memory_$Pointer$.base| .cse1) 0)) (= (select (select |c_#memory_$Pointer$.offset| .cse1) 0) 0) (= (select (select |c_#memory_$Pointer$.offset| .cse0) 0) 0) (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| (select .cse2 |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (= |c_ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (= (select .cse3 |c_ULTIMATE.start_sll_circular_append_~head#1.offset|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) (= (select .cse2 0) 0) (exists ((|v_old(#valid)_AFTER_CALL_68| (Array Int Int)) (|v_#valid_BEFORE_CALL_135| (Array Int Int)) (|ULTIMATE.start_sll_circular_append_~new_last~0#1.base| Int)) (and (= (select |v_#valid_BEFORE_CALL_135| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_68| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_68| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0) (<= (+ 2 |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.base|) (= (select |v_#valid_BEFORE_CALL_135| .cse1) 1) (= (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_135| |v_old(#valid)_AFTER_CALL_68|))) (store |v_#valid_BEFORE_CALL_135| .cse4 (select |v_old(#valid)_AFTER_CALL_68| .cse4))) |v_old(#valid)_AFTER_CALL_68|))))))) is different from true [2022-11-19 07:23:00,487 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|))) (let ((.cse2 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|)) (.cse0 (select .cse6 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| .cse0) 0)) (.cse4 (select .cse6 |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (.cse5 (select .cse2 |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (and (= .cse0 (select (select |c_#memory_$Pointer$.base| .cse1) 0)) (= (select (select |c_#memory_$Pointer$.offset| .cse1) 0) 0) (= (select (select |c_#memory_$Pointer$.offset| .cse0) 0) 0) (= |c_ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (= (select .cse2 0) 0) (exists ((|v_old(#valid)_AFTER_CALL_68| (Array Int Int)) (|v_#valid_BEFORE_CALL_135| (Array Int Int)) (|ULTIMATE.start_sll_circular_append_~new_last~0#1.base| Int)) (and (= (select |v_#valid_BEFORE_CALL_135| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_68| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_68| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0) (<= (+ 2 |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.base|) (= (select |v_#valid_BEFORE_CALL_135| .cse1) 1) (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_135| |v_old(#valid)_AFTER_CALL_68|))) (store |v_#valid_BEFORE_CALL_135| .cse3 (select |v_old(#valid)_AFTER_CALL_68| .cse3))) |v_old(#valid)_AFTER_CALL_68|))) (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| (select (select |c_#memory_$Pointer$.offset| .cse4) .cse5)) (= (select (select |c_#memory_$Pointer$.base| .cse4) .cse5) |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|))))) is different from false [2022-11-19 07:23:00,490 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|))) (let ((.cse2 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|)) (.cse0 (select .cse6 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| .cse0) 0)) (.cse4 (select .cse6 |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (.cse5 (select .cse2 |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (and (= .cse0 (select (select |c_#memory_$Pointer$.base| .cse1) 0)) (= (select (select |c_#memory_$Pointer$.offset| .cse1) 0) 0) (= (select (select |c_#memory_$Pointer$.offset| .cse0) 0) 0) (= |c_ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (= (select .cse2 0) 0) (exists ((|v_old(#valid)_AFTER_CALL_68| (Array Int Int)) (|v_#valid_BEFORE_CALL_135| (Array Int Int)) (|ULTIMATE.start_sll_circular_append_~new_last~0#1.base| Int)) (and (= (select |v_#valid_BEFORE_CALL_135| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_68| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_68| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0) (<= (+ 2 |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.base|) (= (select |v_#valid_BEFORE_CALL_135| .cse1) 1) (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_135| |v_old(#valid)_AFTER_CALL_68|))) (store |v_#valid_BEFORE_CALL_135| .cse3 (select |v_old(#valid)_AFTER_CALL_68| .cse3))) |v_old(#valid)_AFTER_CALL_68|))) (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| (select (select |c_#memory_$Pointer$.offset| .cse4) .cse5)) (= (select (select |c_#memory_$Pointer$.base| .cse4) .cse5) |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|))))) is different from true [2022-11-19 07:23:00,573 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 07:23:00,598 INFO L321 Elim1Store]: treesize reduction 154, result has 4.3 percent of original size [2022-11-19 07:23:00,599 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 8 new quantified variables, introduced 14 case distinctions, treesize of input 96 treesize of output 51 [2022-11-19 07:23:00,611 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|))) (let ((.cse0 (select .cse2 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| .cse0) 0))) (and (= .cse0 (select (select |c_#memory_$Pointer$.base| .cse1) 0)) (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| (select .cse2 |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) 0)) 0)) (exists ((|v_old(#valid)_AFTER_CALL_68| (Array Int Int)) (|v_#valid_BEFORE_CALL_135| (Array Int Int)) (|ULTIMATE.start_sll_circular_append_~new_last~0#1.base| Int)) (and (= (select |v_#valid_BEFORE_CALL_135| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_68| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_68| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0) (<= (+ 2 |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.base|) (= (select |v_#valid_BEFORE_CALL_135| .cse1) 1) (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_135| |v_old(#valid)_AFTER_CALL_68|))) (store |v_#valid_BEFORE_CALL_135| .cse3 (select |v_old(#valid)_AFTER_CALL_68| .cse3))) |v_old(#valid)_AFTER_CALL_68|))))))) is different from false [2022-11-19 07:23:00,614 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|))) (let ((.cse0 (select .cse2 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| .cse0) 0))) (and (= .cse0 (select (select |c_#memory_$Pointer$.base| .cse1) 0)) (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| (select .cse2 |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) 0)) 0)) (exists ((|v_old(#valid)_AFTER_CALL_68| (Array Int Int)) (|v_#valid_BEFORE_CALL_135| (Array Int Int)) (|ULTIMATE.start_sll_circular_append_~new_last~0#1.base| Int)) (and (= (select |v_#valid_BEFORE_CALL_135| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_68| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_68| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0) (<= (+ 2 |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.base|) (= (select |v_#valid_BEFORE_CALL_135| .cse1) 1) (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_135| |v_old(#valid)_AFTER_CALL_68|))) (store |v_#valid_BEFORE_CALL_135| .cse3 (select |v_old(#valid)_AFTER_CALL_68| .cse3))) |v_old(#valid)_AFTER_CALL_68|))))))) is different from true [2022-11-19 07:23:00,638 INFO L321 Elim1Store]: treesize reduction 41, result has 16.3 percent of original size [2022-11-19 07:23:00,638 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 6 case distinctions, treesize of input 77 treesize of output 41 [2022-11-19 07:23:00,655 WARN L837 $PredicateComparison]: unable to prove that (exists ((|v_old(#valid)_AFTER_CALL_68| (Array Int Int)) (|v_#valid_BEFORE_CALL_135| (Array Int Int)) (|ULTIMATE.start_sll_circular_append_~new_last~0#1.base| Int)) (and (= (select |v_#valid_BEFORE_CALL_135| |c_ULTIMATE.start_sll_circular_append_#t~mem12#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_68| |c_ULTIMATE.start_sll_circular_append_#t~mem13#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_68| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_135| |c_ULTIMATE.start_sll_circular_append_#t~mem13#1.base|) 0) (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_135| |v_old(#valid)_AFTER_CALL_68|))) (store |v_#valid_BEFORE_CALL_135| .cse0 (select |v_old(#valid)_AFTER_CALL_68| .cse0))) |v_old(#valid)_AFTER_CALL_68|))) is different from false [2022-11-19 07:23:00,657 WARN L859 $PredicateComparison]: unable to prove that (exists ((|v_old(#valid)_AFTER_CALL_68| (Array Int Int)) (|v_#valid_BEFORE_CALL_135| (Array Int Int)) (|ULTIMATE.start_sll_circular_append_~new_last~0#1.base| Int)) (and (= (select |v_#valid_BEFORE_CALL_135| |c_ULTIMATE.start_sll_circular_append_#t~mem12#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_68| |c_ULTIMATE.start_sll_circular_append_#t~mem13#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_68| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_135| |c_ULTIMATE.start_sll_circular_append_#t~mem13#1.base|) 0) (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_135| |v_old(#valid)_AFTER_CALL_68|))) (store |v_#valid_BEFORE_CALL_135| .cse0 (select |v_old(#valid)_AFTER_CALL_68| .cse0))) |v_old(#valid)_AFTER_CALL_68|))) is different from true [2022-11-19 07:23:00,659 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2022-11-19 07:23:00,659 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 07:23:01,000 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [355028273] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 07:23:01,000 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [748612549] [2022-11-19 07:23:01,002 INFO L159 IcfgInterpreter]: Started Sifa with 22 locations of interest [2022-11-19 07:23:01,002 INFO L166 IcfgInterpreter]: Building call graph [2022-11-19 07:23:01,003 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-19 07:23:01,003 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-19 07:23:01,003 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-19 07:23:01,031 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:23:01,049 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-19 07:23:01,050 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 37 [2022-11-19 07:23:01,061 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:23:01,062 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2022-11-19 07:23:01,087 INFO L350 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 [2022-11-19 07:23:01,092 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-19 07:23:01,100 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:23:01,101 INFO L350 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 22 treesize of output 7 [2022-11-19 07:23:01,108 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:23:01,109 INFO L350 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 22 treesize of output 7 [2022-11-19 07:23:01,123 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:23:01,123 INFO L350 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 16 treesize of output 17 [2022-11-19 07:23:01,145 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:23:01,146 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2022-11-19 07:23:01,155 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:23:01,156 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-19 07:23:01,195 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:23:01,196 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2022-11-19 07:23:01,206 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:23:01,206 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-19 07:23:01,423 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-19 07:23:01,432 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-19 07:23:01,440 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-19 07:23:01,452 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-19 07:23:01,461 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-19 07:23:01,472 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-19 07:23:01,474 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-19 07:23:01,476 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-19 07:23:01,478 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-19 07:23:01,479 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-19 07:23:01,650 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-19 07:23:01,660 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-19 07:23:01,670 INFO L350 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 9 treesize of output 3 [2022-11-19 07:23:01,679 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-19 07:23:01,711 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-19 07:23:01,724 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-19 07:23:01,727 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-19 07:23:01,729 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-19 07:23:01,731 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-19 07:23:01,733 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-19 07:23:01,773 INFO L350 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 19 treesize of output 11 [2022-11-19 07:23:01,784 INFO L350 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 19 treesize of output 11 [2022-11-19 07:23:01,795 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:23:01,796 INFO L350 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 [2022-11-19 07:23:01,929 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:23:01,930 INFO L350 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 140 treesize of output 124 [2022-11-19 07:23:01,941 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 07:23:01,941 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 136 treesize of output 124 [2022-11-19 07:23:01,952 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 07:23:01,955 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 132 treesize of output 120 [2022-11-19 07:23:02,118 INFO L350 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 [2022-11-19 07:23:02,129 INFO L350 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 [2022-11-19 07:23:02,141 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-19 07:23:02,257 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 07:23:02,262 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-19 07:23:02,263 INFO L350 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 [2022-11-19 07:23:02,277 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 07:23:02,282 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-19 07:23:02,282 INFO L350 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 [2022-11-19 07:23:02,378 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 07:23:02,383 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-19 07:23:02,383 INFO L350 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 [2022-11-19 07:23:02,405 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 07:23:02,411 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-19 07:23:02,411 INFO L350 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 [2022-11-19 07:23:02,606 INFO L321 Elim1Store]: treesize reduction 21, result has 41.7 percent of original size [2022-11-19 07:23:02,607 INFO L350 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 1 case distinctions, treesize of input 31 treesize of output 15 [2022-11-19 07:23:02,616 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 07:23:02,692 INFO L321 Elim1Store]: treesize reduction 117, result has 32.4 percent of original size [2022-11-19 07:23:02,692 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 88 treesize of output 120 [2022-11-19 07:23:02,773 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 07:23:02,785 INFO L321 Elim1Store]: treesize reduction 13, result has 38.1 percent of original size [2022-11-19 07:23:02,786 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 58 treesize of output 37 [2022-11-19 07:23:02,798 INFO L350 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 5 treesize of output 3 [2022-11-19 07:23:02,818 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 07:23:02,908 INFO L321 Elim1Store]: treesize reduction 117, result has 32.4 percent of original size [2022-11-19 07:23:02,908 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 88 treesize of output 120 [2022-11-19 07:23:02,977 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 07:23:02,990 INFO L321 Elim1Store]: treesize reduction 13, result has 38.1 percent of original size [2022-11-19 07:23:02,990 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 58 treesize of output 37 [2022-11-19 07:23:03,003 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-19 07:23:03,015 INFO L350 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 5 treesize of output 3 [2022-11-19 07:23:03,582 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 21 for LOIs [2022-11-19 07:23:03,591 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-19 07:23:03,595 INFO L350 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 [2022-11-19 07:23:03,609 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:23:03,609 INFO L350 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 22 treesize of output 7 [2022-11-19 07:23:03,619 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:23:03,620 INFO L350 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 16 treesize of output 17 [2022-11-19 07:23:03,630 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:23:03,631 INFO L350 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 22 treesize of output 7 [2022-11-19 07:23:03,632 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-19 07:23:14,368 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1972#(and (<= 2 |ULTIMATE.start_sll_circular_create_#in~len#1|) (<= 5 |ULTIMATE.start_sll_circular_append_#in~data#1|) (or (and (= |ULTIMATE.start_sll_circular_append_~last~1#1.offset| |ULTIMATE.start_sll_circular_append_~head#1.offset|) (= |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)) (= |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_append_~last~1#1.base|) |ULTIMATE.start_sll_circular_append_~last~1#1.offset|)) (= |ULTIMATE.start_sll_circular_append_~last~1#1.base| |ULTIMATE.start_sll_circular_append_~head#1.base|)) (and (or (not (= |ULTIMATE.start_sll_circular_append_~last~1#1.base| |ULTIMATE.start_sll_circular_append_~head#1.base|)) (not (= |ULTIMATE.start_sll_circular_append_~last~1#1.offset| |ULTIMATE.start_sll_circular_append_~head#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_append_~head#1.base|) |ULTIMATE.start_sll_circular_append_~head#1.offset|)) (or (and (= |ULTIMATE.start_sll_circular_append_~last~1#1.base| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) (= |ULTIMATE.start_sll_circular_append_~last~1#1.offset| |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)) (= |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_append_~last~1#1.base|) |ULTIMATE.start_sll_circular_append_~last~1#1.offset|))) (or (and (exists ((v_DerPreprocessor_40 (Array Int Int)) (v_DerPreprocessor_39 (Array Int Int))) (and (= |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| (select v_DerPreprocessor_40 |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)) (= |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| (select (select (store (store (store (store |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_append_~last~1#1.base| v_DerPreprocessor_39) |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_DerPreprocessor_40) |ULTIMATE.start_sll_circular_append_~last~1#1.base| v_DerPreprocessor_39) |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_DerPreprocessor_40) |ULTIMATE.start_sll_circular_append_~last~1#1.base|) |ULTIMATE.start_sll_circular_append_~last~1#1.offset|)) (= (select (store (store (store (store |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_append_~last~1#1.base| v_DerPreprocessor_39) |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_DerPreprocessor_40) |ULTIMATE.start_sll_circular_append_~last~1#1.base| v_DerPreprocessor_39) |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_DerPreprocessor_40) |ULTIMATE.start_sll_circular_append_~last~1#1.base|) v_DerPreprocessor_39))) (= |ULTIMATE.start_sll_circular_append_~head#1.base| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) (exists ((v_DerPreprocessor_40 (Array Int Int))) (and (= |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| (select v_DerPreprocessor_40 |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)) (exists ((v_DerPreprocessor_39 (Array Int Int))) (and (= |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| (select (select (store (store (store (store |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_append_~last~1#1.base| v_DerPreprocessor_39) |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_DerPreprocessor_40) |ULTIMATE.start_sll_circular_append_~last~1#1.base| v_DerPreprocessor_39) |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_DerPreprocessor_40) |ULTIMATE.start_sll_circular_append_~last~1#1.base|) |ULTIMATE.start_sll_circular_append_~last~1#1.offset|)) (= (select (store (store (store (store |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_append_~last~1#1.base| v_DerPreprocessor_39) |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_DerPreprocessor_40) |ULTIMATE.start_sll_circular_append_~last~1#1.base| v_DerPreprocessor_39) |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_DerPreprocessor_40) |ULTIMATE.start_sll_circular_append_~last~1#1.base|) v_DerPreprocessor_39) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|) (select (select (store (store (store (store |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_append_~last~1#1.base| v_DerPreprocessor_39) |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_DerPreprocessor_40) |ULTIMATE.start_sll_circular_append_~last~1#1.base| v_DerPreprocessor_39) |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_DerPreprocessor_40) |ULTIMATE.start_sll_circular_append_~head#1.base|) |ULTIMATE.start_sll_circular_append_~head#1.offset|))))))))) (<= |ULTIMATE.start_sll_circular_append_~data#1| 5) (not (= (select (select |#memory_int| |ULTIMATE.start_main_~ptr~0#1.base|) (+ |ULTIMATE.start_main_~ptr~0#1.offset| 4)) |ULTIMATE.start_main_~data~0#1|)) (<= |ULTIMATE.start_sll_circular_create_#in~data#1| 1) (<= |ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (= |ULTIMATE.start_main_~ptr~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (<= 0 |ULTIMATE.start_sll_circular_append_#in~head#1.base|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) |ULTIMATE.start_main_~ptr~0#1.offset|) (= |ULTIMATE.start_main_~uneq~0#1| 5) (<= |ULTIMATE.start_sll_circular_append_#in~data#1| 5) (<= |ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~last~2#1.base|) |ULTIMATE.start_main_~last~2#1.offset|)) (<= |ULTIMATE.start_sll_circular_create_#in~len#1| 2) (<= 0 |ULTIMATE.start_sll_circular_create_~last~0#1.offset|) (<= 0 |ULTIMATE.start_sll_circular_append_#in~head#1.offset|) (<= 1 |ULTIMATE.start_sll_circular_create_~data#1|) (<= 0 |ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (= |ULTIMATE.start_main_~count~0#1| 0) (<= 0 |ULTIMATE.start_sll_circular_append_~head#1.base|) (<= 1 |ULTIMATE.start_sll_circular_create_#in~data#1|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~last~2#1.base|) |ULTIMATE.start_main_~last~2#1.offset|)) (= |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| 0) (<= |ULTIMATE.start_sll_circular_create_~len#1| 1) (or (and (or (not (= |ULTIMATE.start_sll_circular_append_~last~1#1.base| |ULTIMATE.start_sll_circular_append_~head#1.base|)) (not (= |ULTIMATE.start_sll_circular_append_~last~1#1.offset| |ULTIMATE.start_sll_circular_append_~head#1.offset|))) (or (and (= |ULTIMATE.start_sll_circular_append_~last~1#1.base| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) (= |ULTIMATE.start_sll_circular_append_~last~1#1.offset| |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)) (= |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_append_~last~1#1.base|) |ULTIMATE.start_sll_circular_append_~last~1#1.offset|))) (or (exists ((v_DerPreprocessor_42 (Array Int Int))) (and (exists ((v_DerPreprocessor_41 (Array Int Int))) (and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|) (select (select (store (store (store (store |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_append_~last~1#1.base| v_DerPreprocessor_41) |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_DerPreprocessor_42) |ULTIMATE.start_sll_circular_append_~last~1#1.base| v_DerPreprocessor_41) |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_DerPreprocessor_42) |ULTIMATE.start_sll_circular_append_~head#1.base|) |ULTIMATE.start_sll_circular_append_~head#1.offset|)) (= v_DerPreprocessor_41 (select (store (store (store (store |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_append_~last~1#1.base| v_DerPreprocessor_41) |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_DerPreprocessor_42) |ULTIMATE.start_sll_circular_append_~last~1#1.base| v_DerPreprocessor_41) |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_DerPreprocessor_42) |ULTIMATE.start_sll_circular_append_~last~1#1.base|)) (= (select (select (store (store (store (store |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_append_~last~1#1.base| v_DerPreprocessor_41) |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_DerPreprocessor_42) |ULTIMATE.start_sll_circular_append_~last~1#1.base| v_DerPreprocessor_41) |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_DerPreprocessor_42) |ULTIMATE.start_sll_circular_append_~last~1#1.base|) |ULTIMATE.start_sll_circular_append_~last~1#1.offset|) |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|))) (= (select v_DerPreprocessor_42 |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|) |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|))) (= |ULTIMATE.start_sll_circular_append_~head#1.base| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_append_~head#1.base|) |ULTIMATE.start_sll_circular_append_~head#1.offset|))) (and (= |ULTIMATE.start_sll_circular_append_~last~1#1.offset| |ULTIMATE.start_sll_circular_append_~head#1.offset|) (= |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_append_~last~1#1.base|) |ULTIMATE.start_sll_circular_append_~last~1#1.offset|)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|) |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) (= |ULTIMATE.start_sll_circular_append_~last~1#1.base| |ULTIMATE.start_sll_circular_append_~head#1.base|))) (= |ULTIMATE.start_main_~data~0#1| 1) (<= |ULTIMATE.start_sll_circular_create_~data#1| 1) (<= |ULTIMATE.start_sll_circular_append_#in~head#1.offset| 0) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (<= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (<= 5 |ULTIMATE.start_sll_circular_append_~data#1|) (= |ULTIMATE.start_main_~len~0#1| 2) (= |#NULL.offset| 0) (<= 0 |ULTIMATE.start_main_~#s~0#1.base|) (<= 0 |ULTIMATE.start_sll_circular_append_~head#1.offset|) (<= 0 |ULTIMATE.start_sll_circular_create_#res#1.offset|) (= |ULTIMATE.start_main_~last~2#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) |ULTIMATE.start_main_~last~2#1.offset|) (= |#NULL.base| 0))' at error location [2022-11-19 07:23:14,368 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-19 07:23:14,368 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-19 07:23:14,369 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 22] total 34 [2022-11-19 07:23:14,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300262703] [2022-11-19 07:23:14,371 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-19 07:23:14,371 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-11-19 07:23:14,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:23:14,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-11-19 07:23:14,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=2370, Unknown=44, NotChecked=954, Total=3540 [2022-11-19 07:23:14,374 INFO L87 Difference]: Start difference. First operand 47 states and 59 transitions. Second operand has 34 states, 26 states have (on average 1.5384615384615385) internal successors, (40), 26 states have internal predecessors, (40), 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) [2022-11-19 07:23:14,635 WARN L837 $PredicateComparison]: unable to prove that (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.offset|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) 1) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1) (not (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|)) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_135| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_135| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_135| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_135| |c_#valid|))) (store |v_#valid_BEFORE_CALL_135| .cse0 (select |c_#valid| .cse0)))))) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.offset|) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|)) is different from false [2022-11-19 07:23:14,638 WARN L859 $PredicateComparison]: unable to prove that (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.offset|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) 1) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1) (not (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|)) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_135| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_135| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_135| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_135| |c_#valid|))) (store |v_#valid_BEFORE_CALL_135| .cse0 (select |c_#valid| .cse0)))))) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.offset|) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|)) is different from true [2022-11-19 07:23:14,642 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (and (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|)) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_135| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_135| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1) (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_135| |c_#valid|))) (store |v_#valid_BEFORE_CALL_135| .cse0 (select |c_#valid| .cse0)))) (= (select |v_#valid_BEFORE_CALL_135| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| .cse1) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1) (= .cse1 0) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|))) is different from false [2022-11-19 07:23:14,645 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (and (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|)) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_135| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_135| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1) (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_135| |c_#valid|))) (store |v_#valid_BEFORE_CALL_135| .cse0 (select |c_#valid| .cse0)))) (= (select |v_#valid_BEFORE_CALL_135| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| .cse1) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1) (= .cse1 0) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|))) is different from true [2022-11-19 07:23:14,649 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) 0)) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| .cse2) .cse1)) (.cse4 (select (select |c_#memory_$Pointer$.base| .cse3) 0))) (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.offset|) (= (select (select |c_#memory_$Pointer$.base| .cse0) .cse1) .cse2) (= .cse3 (select (select |c_#memory_$Pointer$.base| .cse4) 0)) (= (select (select |c_#memory_$Pointer$.offset| .cse4) 0) 0) (= (select |c_#valid| .cse0) 1) (= (select (select |c_#memory_$Pointer$.offset| .cse3) 0) 0) (= (select |c_#valid| .cse3) 1) (= |c_ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (= (select (select |c_#memory_$Pointer$.offset| .cse2) .cse1) .cse1) (= (select (select |c_#memory_$Pointer$.offset| .cse0) .cse1) .cse1) (exists ((|v_#valid_BEFORE_CALL_135| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_135| .cse3) 0) (= |c_#valid| (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_135| |c_#valid|))) (store |v_#valid_BEFORE_CALL_135| .cse5 (select |c_#valid| .cse5)))) (= (select |v_#valid_BEFORE_CALL_135| .cse4) 1))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) 0) 0) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) (= (select |c_#valid| .cse2) 1) (= |c_ULTIMATE.start_sll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|)))) is different from false [2022-11-19 07:23:14,653 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) 0)) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| .cse2) .cse1)) (.cse4 (select (select |c_#memory_$Pointer$.base| .cse3) 0))) (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.offset|) (= (select (select |c_#memory_$Pointer$.base| .cse0) .cse1) .cse2) (= .cse3 (select (select |c_#memory_$Pointer$.base| .cse4) 0)) (= (select (select |c_#memory_$Pointer$.offset| .cse4) 0) 0) (= (select |c_#valid| .cse0) 1) (= (select (select |c_#memory_$Pointer$.offset| .cse3) 0) 0) (= (select |c_#valid| .cse3) 1) (= |c_ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (= (select (select |c_#memory_$Pointer$.offset| .cse2) .cse1) .cse1) (= (select (select |c_#memory_$Pointer$.offset| .cse0) .cse1) .cse1) (exists ((|v_#valid_BEFORE_CALL_135| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_135| .cse3) 0) (= |c_#valid| (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_135| |c_#valid|))) (store |v_#valid_BEFORE_CALL_135| .cse5 (select |c_#valid| .cse5)))) (= (select |v_#valid_BEFORE_CALL_135| .cse4) 1))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) 0) 0) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) (= (select |c_#valid| .cse2) 1) (= |c_ULTIMATE.start_sll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|)))) is different from true [2022-11-19 07:23:14,661 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|)) (.cse7 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|))) (let ((.cse0 (select .cse7 0)) (.cse2 (select .cse7 |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (.cse4 (select .cse5 |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| .cse2) .cse4)) (.cse1 (select (select |c_#memory_$Pointer$.base| .cse0) 0))) (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.offset|) (= .cse0 (select (select |c_#memory_$Pointer$.base| .cse1) 0)) (= (select (select |c_#memory_$Pointer$.offset| .cse1) 0) 0) (= (select (select |c_#memory_$Pointer$.offset| .cse0) 0) 0) (= |c_ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (= .cse2 (select (select |c_#memory_$Pointer$.base| .cse3) .cse4)) (<= (+ 2 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.base|) (= (select .cse5 0) 0) (= (select (select |c_#memory_$Pointer$.offset| .cse2) .cse4) .cse4) (= (select (select |c_#memory_$Pointer$.offset| .cse3) .cse4) .cse4) (exists ((|v_old(#valid)_AFTER_CALL_68| (Array Int Int)) (|v_#valid_BEFORE_CALL_135| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_135| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_68| |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_68| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_135| .cse1) 1) (= (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_135| |v_old(#valid)_AFTER_CALL_68|))) (store |v_#valid_BEFORE_CALL_135| .cse6 (select |v_old(#valid)_AFTER_CALL_68| .cse6))) |v_old(#valid)_AFTER_CALL_68|))))))) is different from false [2022-11-19 07:23:14,664 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|)) (.cse7 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|))) (let ((.cse0 (select .cse7 0)) (.cse2 (select .cse7 |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (.cse4 (select .cse5 |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| .cse2) .cse4)) (.cse1 (select (select |c_#memory_$Pointer$.base| .cse0) 0))) (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.offset|) (= .cse0 (select (select |c_#memory_$Pointer$.base| .cse1) 0)) (= (select (select |c_#memory_$Pointer$.offset| .cse1) 0) 0) (= (select (select |c_#memory_$Pointer$.offset| .cse0) 0) 0) (= |c_ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (= .cse2 (select (select |c_#memory_$Pointer$.base| .cse3) .cse4)) (<= (+ 2 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.base|) (= (select .cse5 0) 0) (= (select (select |c_#memory_$Pointer$.offset| .cse2) .cse4) .cse4) (= (select (select |c_#memory_$Pointer$.offset| .cse3) .cse4) .cse4) (exists ((|v_old(#valid)_AFTER_CALL_68| (Array Int Int)) (|v_#valid_BEFORE_CALL_135| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_135| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_68| |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_68| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_135| .cse1) 1) (= (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_135| |v_old(#valid)_AFTER_CALL_68|))) (store |v_#valid_BEFORE_CALL_135| .cse6 (select |v_old(#valid)_AFTER_CALL_68| .cse6))) |v_old(#valid)_AFTER_CALL_68|))))))) is different from true [2022-11-19 07:23:14,669 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|)) (.cse7 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|))) (let ((.cse0 (select .cse7 0)) (.cse2 (select .cse7 |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (.cse4 (select .cse5 |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| .cse2) .cse4)) (.cse1 (select (select |c_#memory_$Pointer$.base| .cse0) 0))) (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.offset|) (= .cse0 (select (select |c_#memory_$Pointer$.base| .cse1) 0)) (= (select (select |c_#memory_$Pointer$.offset| .cse1) 0) 0) (= (select (select |c_#memory_$Pointer$.offset| .cse0) 0) 0) (= |c_ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (= .cse2 (select (select |c_#memory_$Pointer$.base| .cse3) .cse4)) (= (select .cse5 0) 0) (= (select (select |c_#memory_$Pointer$.offset| .cse2) .cse4) .cse4) (= (select (select |c_#memory_$Pointer$.offset| .cse3) .cse4) .cse4) (exists ((|v_old(#valid)_AFTER_CALL_68| (Array Int Int)) (|v_#valid_BEFORE_CALL_135| (Array Int Int)) (|ULTIMATE.start_sll_circular_append_~new_last~0#1.base| Int)) (and (= (select |v_#valid_BEFORE_CALL_135| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_68| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_68| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0) (<= (+ 2 |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.base|) (= (select |v_#valid_BEFORE_CALL_135| .cse1) 1) (= (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_135| |v_old(#valid)_AFTER_CALL_68|))) (store |v_#valid_BEFORE_CALL_135| .cse6 (select |v_old(#valid)_AFTER_CALL_68| .cse6))) |v_old(#valid)_AFTER_CALL_68|))))))) is different from false [2022-11-19 07:23:14,672 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|)) (.cse7 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|))) (let ((.cse0 (select .cse7 0)) (.cse2 (select .cse7 |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (.cse4 (select .cse5 |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| .cse2) .cse4)) (.cse1 (select (select |c_#memory_$Pointer$.base| .cse0) 0))) (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.offset|) (= .cse0 (select (select |c_#memory_$Pointer$.base| .cse1) 0)) (= (select (select |c_#memory_$Pointer$.offset| .cse1) 0) 0) (= (select (select |c_#memory_$Pointer$.offset| .cse0) 0) 0) (= |c_ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (= .cse2 (select (select |c_#memory_$Pointer$.base| .cse3) .cse4)) (= (select .cse5 0) 0) (= (select (select |c_#memory_$Pointer$.offset| .cse2) .cse4) .cse4) (= (select (select |c_#memory_$Pointer$.offset| .cse3) .cse4) .cse4) (exists ((|v_old(#valid)_AFTER_CALL_68| (Array Int Int)) (|v_#valid_BEFORE_CALL_135| (Array Int Int)) (|ULTIMATE.start_sll_circular_append_~new_last~0#1.base| Int)) (and (= (select |v_#valid_BEFORE_CALL_135| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_68| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_68| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0) (<= (+ 2 |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.base|) (= (select |v_#valid_BEFORE_CALL_135| .cse1) 1) (= (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_135| |v_old(#valid)_AFTER_CALL_68|))) (store |v_#valid_BEFORE_CALL_135| .cse6 (select |v_old(#valid)_AFTER_CALL_68| .cse6))) |v_old(#valid)_AFTER_CALL_68|))))))) is different from true [2022-11-19 07:23:14,678 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|))) (let ((.cse5 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|)) (.cse0 (select .cse7 0))) (let ((.cse4 (select .cse7 |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (.cse1 (select (select |c_#memory_$Pointer$.base| .cse0) 0)) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|)) (.cse3 (select .cse5 |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.offset|) (= .cse0 (select (select |c_#memory_$Pointer$.base| .cse1) 0)) (= (select (select |c_#memory_$Pointer$.offset| .cse1) 0) 0) (= (select (select |c_#memory_$Pointer$.offset| .cse0) 0) 0) (= (select (select |c_#memory_$Pointer$.base| .cse2) .cse3) .cse4) (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| .cse3) (= |c_ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (= .cse4 |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) (= (select .cse5 0) 0) (exists ((|v_old(#valid)_AFTER_CALL_68| (Array Int Int)) (|v_#valid_BEFORE_CALL_135| (Array Int Int)) (|ULTIMATE.start_sll_circular_append_~new_last~0#1.base| Int)) (and (= (select |v_#valid_BEFORE_CALL_135| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_68| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_68| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0) (<= (+ 2 |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.base|) (= (select |v_#valid_BEFORE_CALL_135| .cse1) 1) (= (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_135| |v_old(#valid)_AFTER_CALL_68|))) (store |v_#valid_BEFORE_CALL_135| .cse6 (select |v_old(#valid)_AFTER_CALL_68| .cse6))) |v_old(#valid)_AFTER_CALL_68|))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|) .cse3) (= (select (select |c_#memory_$Pointer$.offset| .cse2) .cse3) .cse3))))) is different from false [2022-11-19 07:23:14,681 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|))) (let ((.cse5 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|)) (.cse0 (select .cse7 0))) (let ((.cse4 (select .cse7 |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (.cse1 (select (select |c_#memory_$Pointer$.base| .cse0) 0)) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|)) (.cse3 (select .cse5 |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.offset|) (= .cse0 (select (select |c_#memory_$Pointer$.base| .cse1) 0)) (= (select (select |c_#memory_$Pointer$.offset| .cse1) 0) 0) (= (select (select |c_#memory_$Pointer$.offset| .cse0) 0) 0) (= (select (select |c_#memory_$Pointer$.base| .cse2) .cse3) .cse4) (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| .cse3) (= |c_ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (= .cse4 |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) (= (select .cse5 0) 0) (exists ((|v_old(#valid)_AFTER_CALL_68| (Array Int Int)) (|v_#valid_BEFORE_CALL_135| (Array Int Int)) (|ULTIMATE.start_sll_circular_append_~new_last~0#1.base| Int)) (and (= (select |v_#valid_BEFORE_CALL_135| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_68| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_68| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0) (<= (+ 2 |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.base|) (= (select |v_#valid_BEFORE_CALL_135| .cse1) 1) (= (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_135| |v_old(#valid)_AFTER_CALL_68|))) (store |v_#valid_BEFORE_CALL_135| .cse6 (select |v_old(#valid)_AFTER_CALL_68| .cse6))) |v_old(#valid)_AFTER_CALL_68|))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|) .cse3) (= (select (select |c_#memory_$Pointer$.offset| .cse2) .cse3) .cse3))))) is different from true [2022-11-19 07:23:14,687 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse8 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|))) (let ((.cse0 (select .cse8 0)) (.cse6 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|))) (let ((.cse2 (select .cse6 |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (.cse5 (select .cse8 |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|)) (.cse4 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|)) (.cse1 (select (select |c_#memory_$Pointer$.base| .cse0) 0))) (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.offset|) (= .cse0 (select (select |c_#memory_$Pointer$.base| .cse1) 0)) (= (select (select |c_#memory_$Pointer$.offset| .cse1) 0) 0) (= (select (select |c_#memory_$Pointer$.offset| .cse0) 0) 0) (= |c_ULTIMATE.start_sll_circular_append_#t~mem13#1.offset| |c_ULTIMATE.start_sll_circular_append_#t~mem12#1.offset|) (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| .cse2) (= .cse2 (select (select |c_#memory_$Pointer$.offset| .cse3) .cse4)) (= |c_ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (= .cse5 |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) (= (select .cse6 0) 0) (= .cse5 (select (select |c_#memory_$Pointer$.base| .cse3) .cse4)) (exists ((|v_old(#valid)_AFTER_CALL_68| (Array Int Int)) (|v_#valid_BEFORE_CALL_135| (Array Int Int)) (|ULTIMATE.start_sll_circular_append_~new_last~0#1.base| Int)) (and (= (select |v_#valid_BEFORE_CALL_135| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_68| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_68| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0) (<= (+ 2 |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.base|) (= (select |v_#valid_BEFORE_CALL_135| .cse1) 1) (= (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_135| |v_old(#valid)_AFTER_CALL_68|))) (store |v_#valid_BEFORE_CALL_135| .cse7 (select |v_old(#valid)_AFTER_CALL_68| .cse7))) |v_old(#valid)_AFTER_CALL_68|))))))) is different from false [2022-11-19 07:23:14,690 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse8 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|))) (let ((.cse0 (select .cse8 0)) (.cse6 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|))) (let ((.cse2 (select .cse6 |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (.cse5 (select .cse8 |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|)) (.cse4 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|)) (.cse1 (select (select |c_#memory_$Pointer$.base| .cse0) 0))) (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.offset|) (= .cse0 (select (select |c_#memory_$Pointer$.base| .cse1) 0)) (= (select (select |c_#memory_$Pointer$.offset| .cse1) 0) 0) (= (select (select |c_#memory_$Pointer$.offset| .cse0) 0) 0) (= |c_ULTIMATE.start_sll_circular_append_#t~mem13#1.offset| |c_ULTIMATE.start_sll_circular_append_#t~mem12#1.offset|) (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| .cse2) (= .cse2 (select (select |c_#memory_$Pointer$.offset| .cse3) .cse4)) (= |c_ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (= .cse5 |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) (= (select .cse6 0) 0) (= .cse5 (select (select |c_#memory_$Pointer$.base| .cse3) .cse4)) (exists ((|v_old(#valid)_AFTER_CALL_68| (Array Int Int)) (|v_#valid_BEFORE_CALL_135| (Array Int Int)) (|ULTIMATE.start_sll_circular_append_~new_last~0#1.base| Int)) (and (= (select |v_#valid_BEFORE_CALL_135| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_68| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_68| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0) (<= (+ 2 |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.base|) (= (select |v_#valid_BEFORE_CALL_135| .cse1) 1) (= (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_135| |v_old(#valid)_AFTER_CALL_68|))) (store |v_#valid_BEFORE_CALL_135| .cse7 (select |v_old(#valid)_AFTER_CALL_68| .cse7))) |v_old(#valid)_AFTER_CALL_68|))))))) is different from true [2022-11-19 07:23:14,697 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|))) (let ((.cse2 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|)) (.cse0 (select .cse6 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| .cse0) 0)) (.cse3 (select .cse6 |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (.cse5 (select .cse2 |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.offset|) (= .cse0 (select (select |c_#memory_$Pointer$.base| .cse1) 0)) (= (select (select |c_#memory_$Pointer$.offset| .cse1) 0) 0) (= (select (select |c_#memory_$Pointer$.offset| .cse0) 0) 0) (= |c_ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (= (select .cse2 0) 0) (= .cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|)) (exists ((|v_old(#valid)_AFTER_CALL_68| (Array Int Int)) (|v_#valid_BEFORE_CALL_135| (Array Int Int)) (|ULTIMATE.start_sll_circular_append_~new_last~0#1.base| Int)) (and (= (select |v_#valid_BEFORE_CALL_135| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_68| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_68| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0) (<= (+ 2 |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.base|) (= (select |v_#valid_BEFORE_CALL_135| .cse1) 1) (= (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_135| |v_old(#valid)_AFTER_CALL_68|))) (store |v_#valid_BEFORE_CALL_135| .cse4 (select |v_old(#valid)_AFTER_CALL_68| .cse4))) |v_old(#valid)_AFTER_CALL_68|))) (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| (select (select |c_#memory_$Pointer$.offset| .cse3) .cse5)) (= (select (select |c_#memory_$Pointer$.base| .cse3) .cse5) |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|) .cse5))))) is different from false [2022-11-19 07:23:14,700 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|))) (let ((.cse2 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|)) (.cse0 (select .cse6 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| .cse0) 0)) (.cse3 (select .cse6 |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (.cse5 (select .cse2 |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.offset|) (= .cse0 (select (select |c_#memory_$Pointer$.base| .cse1) 0)) (= (select (select |c_#memory_$Pointer$.offset| .cse1) 0) 0) (= (select (select |c_#memory_$Pointer$.offset| .cse0) 0) 0) (= |c_ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (= (select .cse2 0) 0) (= .cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|)) (exists ((|v_old(#valid)_AFTER_CALL_68| (Array Int Int)) (|v_#valid_BEFORE_CALL_135| (Array Int Int)) (|ULTIMATE.start_sll_circular_append_~new_last~0#1.base| Int)) (and (= (select |v_#valid_BEFORE_CALL_135| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_68| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_68| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0) (<= (+ 2 |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.base|) (= (select |v_#valid_BEFORE_CALL_135| .cse1) 1) (= (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_135| |v_old(#valid)_AFTER_CALL_68|))) (store |v_#valid_BEFORE_CALL_135| .cse4 (select |v_old(#valid)_AFTER_CALL_68| .cse4))) |v_old(#valid)_AFTER_CALL_68|))) (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| (select (select |c_#memory_$Pointer$.offset| .cse3) .cse5)) (= (select (select |c_#memory_$Pointer$.base| .cse3) .cse5) |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|) .cse5))))) is different from true [2022-11-19 07:23:14,741 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|))) (let ((.cse2 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|)) (.cse0 (select .cse6 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| .cse0) 0)) (.cse4 (select .cse6 |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (.cse5 (select .cse2 |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (and (= |c_ULTIMATE.start_sll_circular_append_#t~mem13#1.base| |c_ULTIMATE.start_sll_circular_append_#t~mem12#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.offset|) (= .cse0 (select (select |c_#memory_$Pointer$.base| .cse1) 0)) (= (select (select |c_#memory_$Pointer$.offset| .cse1) 0) 0) (= (select (select |c_#memory_$Pointer$.offset| .cse0) 0) 0) (= |c_ULTIMATE.start_sll_circular_append_#t~mem13#1.offset| |c_ULTIMATE.start_sll_circular_append_#t~mem12#1.offset|) (= |c_ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (= (select .cse2 0) 0) (exists ((|v_old(#valid)_AFTER_CALL_68| (Array Int Int)) (|v_#valid_BEFORE_CALL_135| (Array Int Int)) (|ULTIMATE.start_sll_circular_append_~new_last~0#1.base| Int)) (and (= (select |v_#valid_BEFORE_CALL_135| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_68| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_68| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0) (<= (+ 2 |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.base|) (= (select |v_#valid_BEFORE_CALL_135| .cse1) 1) (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_135| |v_old(#valid)_AFTER_CALL_68|))) (store |v_#valid_BEFORE_CALL_135| .cse3 (select |v_old(#valid)_AFTER_CALL_68| .cse3))) |v_old(#valid)_AFTER_CALL_68|))) (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| (select (select |c_#memory_$Pointer$.offset| .cse4) .cse5)) (= (select (select |c_#memory_$Pointer$.base| .cse4) .cse5) |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|))))) is different from false [2022-11-19 07:23:14,744 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|))) (let ((.cse2 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|)) (.cse0 (select .cse6 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| .cse0) 0)) (.cse4 (select .cse6 |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (.cse5 (select .cse2 |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (and (= |c_ULTIMATE.start_sll_circular_append_#t~mem13#1.base| |c_ULTIMATE.start_sll_circular_append_#t~mem12#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.offset|) (= .cse0 (select (select |c_#memory_$Pointer$.base| .cse1) 0)) (= (select (select |c_#memory_$Pointer$.offset| .cse1) 0) 0) (= (select (select |c_#memory_$Pointer$.offset| .cse0) 0) 0) (= |c_ULTIMATE.start_sll_circular_append_#t~mem13#1.offset| |c_ULTIMATE.start_sll_circular_append_#t~mem12#1.offset|) (= |c_ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (= (select .cse2 0) 0) (exists ((|v_old(#valid)_AFTER_CALL_68| (Array Int Int)) (|v_#valid_BEFORE_CALL_135| (Array Int Int)) (|ULTIMATE.start_sll_circular_append_~new_last~0#1.base| Int)) (and (= (select |v_#valid_BEFORE_CALL_135| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_68| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_68| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0) (<= (+ 2 |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.base|) (= (select |v_#valid_BEFORE_CALL_135| .cse1) 1) (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_135| |v_old(#valid)_AFTER_CALL_68|))) (store |v_#valid_BEFORE_CALL_135| .cse3 (select |v_old(#valid)_AFTER_CALL_68| .cse3))) |v_old(#valid)_AFTER_CALL_68|))) (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| (select (select |c_#memory_$Pointer$.offset| .cse4) .cse5)) (= (select (select |c_#memory_$Pointer$.base| .cse4) .cse5) |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|))))) is different from true [2022-11-19 07:23:14,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:23:14,794 INFO L93 Difference]: Finished difference Result 67 states and 81 transitions. [2022-11-19 07:23:14,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-19 07:23:14,794 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 26 states have (on average 1.5384615384615385) internal successors, (40), 26 states have internal predecessors, (40), 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 32 [2022-11-19 07:23:14,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:23:14,795 INFO L225 Difference]: With dead ends: 67 [2022-11-19 07:23:14,795 INFO L226 Difference]: Without dead ends: 53 [2022-11-19 07:23:14,798 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 39 SyntacticMatches, 3 SemanticMatches, 71 ConstructedPredicates, 18 IntricatePredicates, 0 DeprecatedPredicates, 691 ImplicationChecksByTransitivity, 11.9s TimeCoverageRelationStatistics Valid=218, Invalid=2762, Unknown=62, NotChecked=2214, Total=5256 [2022-11-19 07:23:14,798 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 9 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 428 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 317 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 07:23:14,799 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 196 Invalid, 428 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 103 Invalid, 0 Unknown, 317 Unchecked, 0.1s Time] [2022-11-19 07:23:14,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-11-19 07:23:14,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2022-11-19 07:23:14,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 44 states have (on average 1.1818181818181819) internal successors, (52), 44 states have internal predecessors, (52), 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) [2022-11-19 07:23:14,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 62 transitions. [2022-11-19 07:23:14,813 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 62 transitions. Word has length 32 [2022-11-19 07:23:14,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:23:14,813 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 62 transitions. [2022-11-19 07:23:14,814 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 26 states have (on average 1.5384615384615385) internal successors, (40), 26 states have internal predecessors, (40), 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) [2022-11-19 07:23:14,814 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 62 transitions. [2022-11-19 07:23:14,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-11-19 07:23:14,815 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:23:14,815 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:23:14,823 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35bc4d53-0cdb-454d-b70e-af4362592e65/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-19 07:23:15,023 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35bc4d53-0cdb-454d-b70e-af4362592e65/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 07:23:15,023 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-19 07:23:15,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:23:15,024 INFO L85 PathProgramCache]: Analyzing trace with hash 909229690, now seen corresponding path program 2 times [2022-11-19 07:23:15,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:23:15,024 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130293901] [2022-11-19 07:23:15,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:23:15,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:23:15,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:23:17,534 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-19 07:23:17,535 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:23:17,535 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130293901] [2022-11-19 07:23:17,535 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1130293901] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 07:23:17,535 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1420084432] [2022-11-19 07:23:17,535 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-19 07:23:17,535 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 07:23:17,536 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35bc4d53-0cdb-454d-b70e-af4362592e65/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 07:23:17,536 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35bc4d53-0cdb-454d-b70e-af4362592e65/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 07:23:17,539 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35bc4d53-0cdb-454d-b70e-af4362592e65/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-19 07:23:17,912 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-19 07:23:17,912 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-19 07:23:17,917 INFO L263 TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 140 conjunts are in the unsatisfiable core [2022-11-19 07:23:17,928 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:23:17,943 INFO L350 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 [2022-11-19 07:23:17,999 INFO L350 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 5 treesize of output 3 [2022-11-19 07:23:18,114 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-19 07:23:18,114 INFO L350 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 [2022-11-19 07:23:18,293 INFO L350 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 11 treesize of output 7 [2022-11-19 07:23:18,372 INFO L350 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 [2022-11-19 07:23:18,473 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-11-19 07:23:18,473 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2022-11-19 07:23:18,576 INFO L350 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 19 treesize of output 18 [2022-11-19 07:23:18,591 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 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 [2022-11-19 07:23:18,727 INFO L321 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-11-19 07:23:18,727 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 51 [2022-11-19 07:23:18,733 INFO L350 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 28 [2022-11-19 07:23:18,876 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-19 07:23:18,877 INFO L350 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 62 treesize of output 33 [2022-11-19 07:23:18,884 INFO L350 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 [2022-11-19 07:23:18,890 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-19 07:23:19,056 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:23:19,057 INFO L350 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 14 treesize of output 16 [2022-11-19 07:23:19,078 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:23:19,091 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-19 07:23:19,091 INFO L350 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 58 [2022-11-19 07:23:19,120 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-11-19 07:23:19,120 INFO L350 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 18 treesize of output 28 [2022-11-19 07:23:19,126 INFO L350 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 5 treesize of output 3 [2022-11-19 07:23:19,143 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:23:19,144 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:23:19,160 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-11-19 07:23:19,160 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 33 [2022-11-19 07:23:19,757 INFO L321 Elim1Store]: treesize reduction 111, result has 14.0 percent of original size [2022-11-19 07:23:19,758 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 157 treesize of output 83 [2022-11-19 07:23:19,795 INFO L321 Elim1Store]: treesize reduction 66, result has 19.5 percent of original size [2022-11-19 07:23:19,795 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 190 treesize of output 115 [2022-11-19 07:23:19,808 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 45 [2022-11-19 07:23:19,816 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 44 [2022-11-19 07:23:19,823 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:23:19,823 INFO L350 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 28 [2022-11-19 07:23:19,960 INFO L321 Elim1Store]: treesize reduction 29, result has 12.1 percent of original size [2022-11-19 07:23:19,960 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 108 treesize of output 42 [2022-11-19 07:23:19,965 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-19 07:23:20,039 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-19 07:23:20,042 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-19 07:23:20,042 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 07:23:20,206 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1192 (Array Int Int)) (|ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| Int) (|ULTIMATE.start_sll_circular_append_~last~1#1.offset| Int) (v_ArrVal_1198 (Array Int Int)) (v_ArrVal_1195 (Array Int Int)) (v_ArrVal_1193 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| v_ArrVal_1198) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1192) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |ULTIMATE.start_sll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1193) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |ULTIMATE.start_sll_circular_append_~last~1#1.offset| |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1195) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)))) is different from false [2022-11-19 07:23:20,241 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1192 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_31| Int) (|ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| Int) (v_ArrVal_1198 (Array Int Int)) (v_ArrVal_1195 (Array Int Int)) (v_ArrVal_1193 (Array Int Int))) (= (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|))) (select (select (store (store |c_#memory_int| .cse0 v_ArrVal_1198) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1192) (select (select (store (store |c_#memory_$Pointer$.base| .cse0 (store (select |c_#memory_$Pointer$.base| .cse0) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_31| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1193) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 (store (select |c_#memory_$Pointer$.offset| .cse0) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_31| |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1195) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) |c_ULTIMATE.start_main_~data~0#1|)) is different from false [2022-11-19 07:23:20,307 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1192 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_31| Int) (|ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| Int) (v_ArrVal_1198 (Array Int Int)) (v_ArrVal_1195 (Array Int Int)) (v_ArrVal_1193 (Array Int Int))) (= (let ((.cse0 (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))) (select (select (store (store |c_#memory_int| .cse0 v_ArrVal_1198) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1192) (select (select (store (store |c_#memory_$Pointer$.base| .cse0 (store (select |c_#memory_$Pointer$.base| .cse0) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_31| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1193) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ 4 (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 (store (select |c_#memory_$Pointer$.offset| .cse0) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_31| |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1195) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) |c_ULTIMATE.start_main_~data~0#1|)) is different from false [2022-11-19 07:23:20,324 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1192 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_31| Int) (|ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| Int) (v_ArrVal_1198 (Array Int Int)) (v_ArrVal_1195 (Array Int Int)) (v_ArrVal_1193 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse0 (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))) (select (select (store (store |c_#memory_int| .cse0 v_ArrVal_1198) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_1192) (select (select (store (store |c_#memory_$Pointer$.base| .cse0 (store (select |c_#memory_$Pointer$.base| .cse0) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_31| |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|)) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_1193) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ 4 (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 (store (select |c_#memory_$Pointer$.offset| .cse0) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_31| |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_1195) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) is different from false [2022-11-19 07:23:20,429 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1192 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_36| Int) (|v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_31| Int) (|ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| Int) (v_ArrVal_1213 (Array Int Int)) (v_ArrVal_1212 (Array Int Int)) (v_ArrVal_1211 (Array Int Int)) (v_ArrVal_1198 (Array Int Int)) (v_ArrVal_1195 (Array Int Int)) (v_ArrVal_1193 (Array Int Int))) (or (not (< |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_36| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_36|) 0)) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse1 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_36| v_ArrVal_1213)) (.cse2 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_36| v_ArrVal_1211))) (let ((.cse0 (select (select .cse1 (select (select .cse1 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (select (select .cse2 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))) (select (select (store (store (store |c_#memory_int| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_36| v_ArrVal_1212) .cse0 v_ArrVal_1198) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_36| v_ArrVal_1192) (select (select (store (store .cse1 .cse0 (store (select .cse1 .cse0) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_31| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_36|)) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_36| v_ArrVal_1193) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store (store .cse2 .cse0 (store (select .cse2 .cse0) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_31| |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_36| v_ArrVal_1195) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))))))) is different from false [2022-11-19 07:23:20,432 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1420084432] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 07:23:20,432 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2023156655] [2022-11-19 07:23:20,434 INFO L159 IcfgInterpreter]: Started Sifa with 22 locations of interest [2022-11-19 07:23:20,434 INFO L166 IcfgInterpreter]: Building call graph [2022-11-19 07:23:20,435 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-19 07:23:20,435 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-19 07:23:20,435 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-19 07:23:20,456 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:23:20,471 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-19 07:23:20,471 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 37 [2022-11-19 07:23:20,480 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:23:20,480 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2022-11-19 07:23:20,501 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-19 07:23:20,504 INFO L350 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 [2022-11-19 07:23:20,514 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:23:20,514 INFO L350 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 16 treesize of output 17 [2022-11-19 07:23:20,520 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:23:20,520 INFO L350 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 22 treesize of output 7 [2022-11-19 07:23:20,526 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:23:20,526 INFO L350 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 22 treesize of output 7 [2022-11-19 07:23:20,561 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:23:20,562 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-19 07:23:20,577 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:23:20,578 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2022-11-19 07:23:20,616 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:23:20,617 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-19 07:23:20,626 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:23:20,626 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2022-11-19 07:23:20,679 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-19 07:23:20,687 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-19 07:23:20,695 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-19 07:23:20,705 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-19 07:23:20,717 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-19 07:23:20,748 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-19 07:23:20,757 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-19 07:23:20,767 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-19 07:23:20,776 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-19 07:23:20,786 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-19 07:23:20,819 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:23:20,820 INFO L350 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 [2022-11-19 07:23:20,830 INFO L350 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 19 treesize of output 11 [2022-11-19 07:23:20,841 INFO L350 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 19 treesize of output 11 [2022-11-19 07:23:20,918 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-19 07:23:20,927 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-19 07:23:20,937 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-19 07:23:20,947 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-19 07:23:20,958 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-19 07:23:20,989 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-19 07:23:20,998 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-19 07:23:21,006 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-19 07:23:21,015 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-19 07:23:21,024 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-19 07:23:21,087 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 07:23:21,088 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:23:21,089 INFO L350 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 221 treesize of output 205 [2022-11-19 07:23:21,104 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 07:23:21,105 INFO L350 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 219 treesize of output 207 [2022-11-19 07:23:21,117 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 07:23:21,118 INFO L350 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 235 treesize of output 114 [2022-11-19 07:23:21,204 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-19 07:23:21,213 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-19 07:23:21,222 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-19 07:23:21,233 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-19 07:23:21,245 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-19 07:23:21,287 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-19 07:23:21,298 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-19 07:23:21,312 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-19 07:23:21,322 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-19 07:23:21,333 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-19 07:23:21,414 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-19 07:23:21,415 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2022-11-19 07:23:21,432 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2022-11-19 07:23:21,463 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-19 07:23:21,464 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2022-11-19 07:23:21,541 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-19 07:23:21,553 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-19 07:23:21,566 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:23:21,568 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:23:21,574 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-19 07:23:21,574 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2022-11-19 07:23:21,592 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-19 07:23:21,606 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:23:21,608 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:23:21,613 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-19 07:23:21,614 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2022-11-19 07:23:21,673 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-19 07:23:21,719 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:23:21,721 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:23:21,726 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-19 07:23:21,726 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2022-11-19 07:23:21,742 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-19 07:23:21,751 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-19 07:23:21,766 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:23:21,768 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:23:21,773 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-19 07:23:21,774 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2022-11-19 07:23:22,109 INFO L321 Elim1Store]: treesize reduction 21, result has 41.7 percent of original size [2022-11-19 07:23:22,110 INFO L350 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 1 case distinctions, treesize of input 31 treesize of output 15 [2022-11-19 07:23:22,124 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 07:23:22,206 INFO L321 Elim1Store]: treesize reduction 117, result has 32.4 percent of original size [2022-11-19 07:23:22,207 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 88 treesize of output 120 [2022-11-19 07:23:22,280 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 07:23:22,293 INFO L321 Elim1Store]: treesize reduction 13, result has 38.1 percent of original size [2022-11-19 07:23:22,294 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 58 treesize of output 37 [2022-11-19 07:23:22,306 INFO L350 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 5 treesize of output 3 [2022-11-19 07:23:22,328 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 07:23:22,405 INFO L321 Elim1Store]: treesize reduction 117, result has 32.4 percent of original size [2022-11-19 07:23:22,406 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 88 treesize of output 120 [2022-11-19 07:23:22,497 INFO L321 Elim1Store]: treesize reduction 39, result has 48.7 percent of original size [2022-11-19 07:23:22,498 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 60 treesize of output 67 [2022-11-19 07:23:22,518 INFO L350 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 5 treesize of output 3 [2022-11-19 07:23:22,538 INFO L350 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 5 treesize of output 3 [2022-11-19 07:23:22,585 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-19 07:23:22,585 INFO L350 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 11 treesize of output 7 [2022-11-19 07:23:22,605 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 07:23:22,606 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:23:22,607 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 65 [2022-11-19 07:23:22,650 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-19 07:23:22,650 INFO L350 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 11 treesize of output 7 [2022-11-19 07:23:22,663 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-19 07:23:22,673 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-19 07:23:25,099 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 13 for LOIs [2022-11-19 07:23:25,105 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-19 07:23:25,109 INFO L350 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 [2022-11-19 07:23:25,118 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:23:25,119 INFO L350 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 22 treesize of output 7 [2022-11-19 07:23:25,127 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:23:25,128 INFO L350 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 16 treesize of output 17 [2022-11-19 07:23:25,134 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:23:25,134 INFO L350 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 22 treesize of output 7 [2022-11-19 07:23:25,136 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-19 07:23:33,283 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2382#(and (<= 2 |ULTIMATE.start_sll_circular_create_#in~len#1|) (<= 0 |ULTIMATE.start_main_~count~0#1|) (<= 0 |ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) (<= |ULTIMATE.start_main_~uneq~0#1| 5) (<= 5 |ULTIMATE.start_sll_circular_append_#in~data#1|) (<= |ULTIMATE.start_main_~data~0#1| 1) (<= 0 |#NULL.base|) (<= |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| 0) (<= 2 |ULTIMATE.start_main_~len~0#1|) (<= 5 |ULTIMATE.start_main_~uneq~0#1|) (<= |ULTIMATE.start_sll_circular_append_~data#1| 5) (not (= (select (select |#memory_int| |ULTIMATE.start_main_~ptr~0#1.base|) (+ |ULTIMATE.start_main_~ptr~0#1.offset| 4)) |ULTIMATE.start_main_~data~0#1|)) (<= |ULTIMATE.start_sll_circular_create_#in~data#1| 1) (<= 1 |ULTIMATE.start_sll_circular_create_~len#1|) (<= |ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (<= 0 |ULTIMATE.start_sll_circular_append_#in~head#1.base|) (<= |ULTIMATE.start_sll_circular_append_#in~data#1| 5) (<= |ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (<= |ULTIMATE.start_sll_circular_create_#in~len#1| 2) (<= |#NULL.offset| 0) (<= |ULTIMATE.start_main_~len~0#1| 2) (<= 0 |ULTIMATE.start_sll_circular_create_~last~0#1.offset|) (<= 0 |ULTIMATE.start_sll_circular_append_#in~head#1.offset|) (<= 1 |ULTIMATE.start_sll_circular_create_~data#1|) (<= 0 |ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (<= 0 |ULTIMATE.start_sll_circular_append_~head#1.base|) (<= |ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| 0) (<= 1 |ULTIMATE.start_sll_circular_create_#in~data#1|) (<= 0 |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|) (<= |ULTIMATE.start_sll_circular_create_~len#1| 1) (<= |ULTIMATE.start_sll_circular_create_~data#1| 1) (<= |#NULL.base| 0) (<= |ULTIMATE.start_sll_circular_append_#in~head#1.offset| 0) (<= |ULTIMATE.start_main_~count~0#1| 0) (<= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (<= 5 |ULTIMATE.start_sll_circular_append_~data#1|) (<= |ULTIMATE.start_main_~#s~0#1.offset| 0) (<= 0 |ULTIMATE.start_main_~#s~0#1.base|) (<= 0 |ULTIMATE.start_sll_circular_append_~head#1.offset|) (<= 0 |#NULL.offset|) (<= 0 |ULTIMATE.start_sll_circular_create_#res#1.offset|) (<= 1 |ULTIMATE.start_main_~data~0#1|) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (<= 0 |ULTIMATE.start_main_~#s~0#1.offset|))' at error location [2022-11-19 07:23:33,283 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-19 07:23:33,283 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-19 07:23:33,284 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 38 [2022-11-19 07:23:33,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932017757] [2022-11-19 07:23:33,285 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-19 07:23:33,285 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-11-19 07:23:33,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:23:33,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-11-19 07:23:33,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=196, Invalid=3354, Unknown=10, NotChecked=600, Total=4160 [2022-11-19 07:23:33,287 INFO L87 Difference]: Start difference. First operand 53 states and 62 transitions. Second operand has 39 states, 29 states have (on average 1.4827586206896552) internal successors, (43), 30 states have internal predecessors, (43), 6 states have call successors, (6), 2 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-19 07:23:34,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:23:34,458 INFO L93 Difference]: Finished difference Result 62 states and 73 transitions. [2022-11-19 07:23:34,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-19 07:23:34,459 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 29 states have (on average 1.4827586206896552) internal successors, (43), 30 states have internal predecessors, (43), 6 states have call successors, (6), 2 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 34 [2022-11-19 07:23:34,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:23:34,460 INFO L225 Difference]: With dead ends: 62 [2022-11-19 07:23:34,460 INFO L226 Difference]: Without dead ends: 60 [2022-11-19 07:23:34,461 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 39 SyntacticMatches, 6 SemanticMatches, 70 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 1128 ImplicationChecksByTransitivity, 10.9s TimeCoverageRelationStatistics Valid=256, Invalid=4176, Unknown=10, NotChecked=670, Total=5112 [2022-11-19 07:23:34,462 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 12 mSDsluCounter, 327 mSDsCounter, 0 mSdLazyCounter, 545 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 614 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 545 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 54 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-19 07:23:34,462 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 345 Invalid, 614 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 545 Invalid, 0 Unknown, 54 Unchecked, 0.5s Time] [2022-11-19 07:23:34,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-11-19 07:23:34,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 59. [2022-11-19 07:23:34,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 50 states have (on average 1.18) internal successors, (59), 50 states have internal predecessors, (59), 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) [2022-11-19 07:23:34,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 69 transitions. [2022-11-19 07:23:34,477 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 69 transitions. Word has length 34 [2022-11-19 07:23:34,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:23:34,478 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 69 transitions. [2022-11-19 07:23:34,478 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 29 states have (on average 1.4827586206896552) internal successors, (43), 30 states have internal predecessors, (43), 6 states have call successors, (6), 2 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-19 07:23:34,478 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 69 transitions. [2022-11-19 07:23:34,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-19 07:23:34,479 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:23:34,479 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:23:34,494 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35bc4d53-0cdb-454d-b70e-af4362592e65/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-19 07:23:34,686 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35bc4d53-0cdb-454d-b70e-af4362592e65/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 07:23:34,686 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-19 07:23:34,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:23:34,687 INFO L85 PathProgramCache]: Analyzing trace with hash -2024483017, now seen corresponding path program 2 times [2022-11-19 07:23:34,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:23:34,687 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913142632] [2022-11-19 07:23:34,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:23:34,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:23:34,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:23:34,794 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-11-19 07:23:34,795 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:23:34,795 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913142632] [2022-11-19 07:23:34,795 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [913142632] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 07:23:34,795 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1777464773] [2022-11-19 07:23:34,795 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-19 07:23:34,795 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 07:23:34,796 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35bc4d53-0cdb-454d-b70e-af4362592e65/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 07:23:34,797 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35bc4d53-0cdb-454d-b70e-af4362592e65/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 07:23:34,807 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35bc4d53-0cdb-454d-b70e-af4362592e65/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-19 07:23:35,050 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-19 07:23:35,051 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-19 07:23:35,053 INFO L263 TraceCheckSpWp]: Trace formula consists of 388 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-19 07:23:35,055 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:23:35,071 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-19 07:23:35,071 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 07:23:35,071 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1777464773] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:23:35,071 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-19 07:23:35,071 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2022-11-19 07:23:35,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790919026] [2022-11-19 07:23:35,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:23:35,074 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-19 07:23:35,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:23:35,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-19 07:23:35,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-19 07:23:35,075 INFO L87 Difference]: Start difference. First operand 59 states and 69 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-19 07:23:35,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:23:35,100 INFO L93 Difference]: Finished difference Result 70 states and 81 transitions. [2022-11-19 07:23:35,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-19 07:23:35,102 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 36 [2022-11-19 07:23:35,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:23:35,103 INFO L225 Difference]: With dead ends: 70 [2022-11-19 07:23:35,103 INFO L226 Difference]: Without dead ends: 38 [2022-11-19 07:23:35,103 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-19 07:23:35,104 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 21 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-19 07:23:35,104 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 37 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-19 07:23:35,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-11-19 07:23:35,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2022-11-19 07:23:35,112 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) [2022-11-19 07:23:35,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2022-11-19 07:23:35,113 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 36 [2022-11-19 07:23:35,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:23:35,114 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2022-11-19 07:23:35,114 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-19 07:23:35,114 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2022-11-19 07:23:35,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-11-19 07:23:35,115 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:23:35,115 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:23:35,122 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35bc4d53-0cdb-454d-b70e-af4362592e65/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-11-19 07:23:35,316 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35bc4d53-0cdb-454d-b70e-af4362592e65/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 07:23:35,316 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-19 07:23:35,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:23:35,316 INFO L85 PathProgramCache]: Analyzing trace with hash -1496251498, now seen corresponding path program 1 times [2022-11-19 07:23:35,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:23:35,317 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943889219] [2022-11-19 07:23:35,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:23:35,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:23:35,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:23:35,701 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-19 07:23:35,702 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:23:35,702 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943889219] [2022-11-19 07:23:35,702 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [943889219] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 07:23:35,702 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [632400351] [2022-11-19 07:23:35,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:23:35,702 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 07:23:35,702 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35bc4d53-0cdb-454d-b70e-af4362592e65/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 07:23:35,703 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35bc4d53-0cdb-454d-b70e-af4362592e65/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 07:23:35,724 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35bc4d53-0cdb-454d-b70e-af4362592e65/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-19 07:23:35,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:23:35,919 INFO L263 TraceCheckSpWp]: Trace formula consists of 414 conjuncts, 49 conjunts are in the unsatisfiable core [2022-11-19 07:23:35,922 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:23:36,670 INFO L321 Elim1Store]: treesize reduction 80, result has 79.6 percent of original size [2022-11-19 07:23:36,671 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 14 new quantified variables, introduced 28 case distinctions, treesize of input 279 treesize of output 461 [2022-11-19 07:23:37,025 INFO L321 Elim1Store]: treesize reduction 72, result has 78.6 percent of original size [2022-11-19 07:23:37,026 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 12 new quantified variables, introduced 28 case distinctions, treesize of input 491 treesize of output 555