./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 38b53e6a 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_13b6cc96-6476-4ea8-bd16-bb8e5a4c06c8/bin/utaipan-ByfvJB40ur/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13b6cc96-6476-4ea8-bd16-bb8e5a4c06c8/bin/utaipan-ByfvJB40ur/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13b6cc96-6476-4ea8-bd16-bb8e5a4c06c8/bin/utaipan-ByfvJB40ur/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13b6cc96-6476-4ea8-bd16-bb8e5a4c06c8/bin/utaipan-ByfvJB40ur/config/TaipanReach.xml -i ../../sv-benchmarks/c/list-simple/sll2c_append_unequal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13b6cc96-6476-4ea8-bd16-bb8e5a4c06c8/bin/utaipan-ByfvJB40ur/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13b6cc96-6476-4ea8-bd16-bb8e5a4c06c8/bin/utaipan-ByfvJB40ur --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-38b53e6 [2022-11-26 00:24:36,054 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-26 00:24:36,056 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-26 00:24:36,089 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-26 00:24:36,090 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-26 00:24:36,091 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-26 00:24:36,092 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-26 00:24:36,094 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-26 00:24:36,095 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-26 00:24:36,096 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-26 00:24:36,097 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-26 00:24:36,100 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-26 00:24:36,101 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-26 00:24:36,102 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-26 00:24:36,103 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-26 00:24:36,104 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-26 00:24:36,105 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-26 00:24:36,106 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-26 00:24:36,108 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-26 00:24:36,110 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-26 00:24:36,111 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-26 00:24:36,114 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-26 00:24:36,116 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-26 00:24:36,117 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-26 00:24:36,120 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-26 00:24:36,121 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-26 00:24:36,121 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-26 00:24:36,122 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-26 00:24:36,123 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-26 00:24:36,124 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-26 00:24:36,124 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-26 00:24:36,125 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-26 00:24:36,126 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-26 00:24:36,127 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-26 00:24:36,129 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-26 00:24:36,129 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-26 00:24:36,130 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-26 00:24:36,130 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-26 00:24:36,131 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-26 00:24:36,132 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-26 00:24:36,133 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-26 00:24:36,134 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13b6cc96-6476-4ea8-bd16-bb8e5a4c06c8/bin/utaipan-ByfvJB40ur/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-11-26 00:24:36,163 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-26 00:24:36,163 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-26 00:24:36,164 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-26 00:24:36,164 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-26 00:24:36,165 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-26 00:24:36,165 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-26 00:24:36,165 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-26 00:24:36,165 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-26 00:24:36,166 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-26 00:24:36,166 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-26 00:24:36,166 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-26 00:24:36,166 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-26 00:24:36,178 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-26 00:24:36,178 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-26 00:24:36,178 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-26 00:24:36,179 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-26 00:24:36,179 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-26 00:24:36,179 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-26 00:24:36,180 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-26 00:24:36,180 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-26 00:24:36,180 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-26 00:24:36,180 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-26 00:24:36,180 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-26 00:24:36,181 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-26 00:24:36,181 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-26 00:24:36,181 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-26 00:24:36,182 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-26 00:24:36,182 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-26 00:24:36,183 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-26 00:24:36,183 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-26 00:24:36,183 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-26 00:24:36,183 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-26 00:24:36,184 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-26 00:24:36,184 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-26 00:24:36,184 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-26 00:24:36,184 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-26 00:24:36,185 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-26 00:24:36,185 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-26 00:24:36,186 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-26 00:24:36,186 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-26 00:24:36,186 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-26 00:24:36,186 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_13b6cc96-6476-4ea8-bd16-bb8e5a4c06c8/bin/utaipan-ByfvJB40ur/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_13b6cc96-6476-4ea8-bd16-bb8e5a4c06c8/bin/utaipan-ByfvJB40ur 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-26 00:24:36,462 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-26 00:24:36,495 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-26 00:24:36,502 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-26 00:24:36,503 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-26 00:24:36,504 INFO L275 PluginConnector]: CDTParser initialized [2022-11-26 00:24:36,505 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13b6cc96-6476-4ea8-bd16-bb8e5a4c06c8/bin/utaipan-ByfvJB40ur/../../sv-benchmarks/c/list-simple/sll2c_append_unequal.i [2022-11-26 00:24:39,500 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-26 00:24:39,782 INFO L351 CDTParser]: Found 1 translation units. [2022-11-26 00:24:39,783 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13b6cc96-6476-4ea8-bd16-bb8e5a4c06c8/sv-benchmarks/c/list-simple/sll2c_append_unequal.i [2022-11-26 00:24:39,794 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13b6cc96-6476-4ea8-bd16-bb8e5a4c06c8/bin/utaipan-ByfvJB40ur/data/b2e1dfd20/3edbb257f69f4766b43c0d6bb6450291/FLAG5f71a3099 [2022-11-26 00:24:39,813 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13b6cc96-6476-4ea8-bd16-bb8e5a4c06c8/bin/utaipan-ByfvJB40ur/data/b2e1dfd20/3edbb257f69f4766b43c0d6bb6450291 [2022-11-26 00:24:39,815 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-26 00:24:39,817 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-26 00:24:39,818 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-26 00:24:39,819 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-26 00:24:39,822 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-26 00:24:39,823 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 12:24:39" (1/1) ... [2022-11-26 00:24:39,824 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@32ca5872 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:24:39, skipping insertion in model container [2022-11-26 00:24:39,825 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 12:24:39" (1/1) ... [2022-11-26 00:24:39,832 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-26 00:24:39,867 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-26 00:24:40,145 WARN L237 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_13b6cc96-6476-4ea8-bd16-bb8e5a4c06c8/sv-benchmarks/c/list-simple/sll2c_append_unequal.i[24587,24600] [2022-11-26 00:24:40,150 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-26 00:24:40,162 INFO L203 MainTranslator]: Completed pre-run [2022-11-26 00:24:40,236 WARN L237 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_13b6cc96-6476-4ea8-bd16-bb8e5a4c06c8/sv-benchmarks/c/list-simple/sll2c_append_unequal.i[24587,24600] [2022-11-26 00:24:40,249 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-26 00:24:40,284 INFO L208 MainTranslator]: Completed translation [2022-11-26 00:24:40,285 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:24:40 WrapperNode [2022-11-26 00:24:40,285 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-26 00:24:40,287 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-26 00:24:40,287 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-26 00:24:40,287 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-26 00:24:40,294 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:24:40" (1/1) ... [2022-11-26 00:24:40,323 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:24:40" (1/1) ... [2022-11-26 00:24:40,370 INFO L138 Inliner]: procedures = 127, calls = 46, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 158 [2022-11-26 00:24:40,370 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-26 00:24:40,372 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-26 00:24:40,372 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-26 00:24:40,372 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-26 00:24:40,382 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:24:40" (1/1) ... [2022-11-26 00:24:40,382 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:24:40" (1/1) ... [2022-11-26 00:24:40,385 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:24:40" (1/1) ... [2022-11-26 00:24:40,386 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:24:40" (1/1) ... [2022-11-26 00:24:40,393 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:24:40" (1/1) ... [2022-11-26 00:24:40,398 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:24:40" (1/1) ... [2022-11-26 00:24:40,399 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:24:40" (1/1) ... [2022-11-26 00:24:40,401 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:24:40" (1/1) ... [2022-11-26 00:24:40,404 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-26 00:24:40,405 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-26 00:24:40,405 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-26 00:24:40,405 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-26 00:24:40,406 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:24:40" (1/1) ... [2022-11-26 00:24:40,417 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-26 00:24:40,428 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13b6cc96-6476-4ea8-bd16-bb8e5a4c06c8/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:24:40,446 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13b6cc96-6476-4ea8-bd16-bb8e5a4c06c8/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-26 00:24:40,472 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13b6cc96-6476-4ea8-bd16-bb8e5a4c06c8/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-26 00:24:40,498 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-26 00:24:40,498 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-26 00:24:40,498 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2022-11-26 00:24:40,499 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2022-11-26 00:24:40,499 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-26 00:24:40,499 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-26 00:24:40,499 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-26 00:24:40,499 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-26 00:24:40,500 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-26 00:24:40,500 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-26 00:24:40,500 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-26 00:24:40,500 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-26 00:24:40,501 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-26 00:24:40,501 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-26 00:24:40,627 INFO L235 CfgBuilder]: Building ICFG [2022-11-26 00:24:40,629 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-26 00:24:40,938 INFO L276 CfgBuilder]: Performing block encoding [2022-11-26 00:24:40,986 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-26 00:24:40,993 INFO L300 CfgBuilder]: Removed 5 assume(true) statements. [2022-11-26 00:24:40,995 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 12:24:40 BoogieIcfgContainer [2022-11-26 00:24:40,996 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-26 00:24:41,002 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-26 00:24:41,002 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-26 00:24:41,006 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-26 00:24:41,006 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 12:24:39" (1/3) ... [2022-11-26 00:24:41,009 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7eeedcb0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 12:24:41, skipping insertion in model container [2022-11-26 00:24:41,009 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:24:40" (2/3) ... [2022-11-26 00:24:41,010 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7eeedcb0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 12:24:41, skipping insertion in model container [2022-11-26 00:24:41,010 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 12:24:40" (3/3) ... [2022-11-26 00:24:41,014 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2c_append_unequal.i [2022-11-26 00:24:41,036 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-26 00:24:41,036 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-26 00:24:41,094 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-26 00:24:41,101 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;@16f408c3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-26 00:24:41,102 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-26 00:24:41,109 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-26 00:24:41,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-26 00:24:41,117 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:24:41,118 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:24:41,118 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-26 00:24:41,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:24:41,124 INFO L85 PathProgramCache]: Analyzing trace with hash -1623736300, now seen corresponding path program 1 times [2022-11-26 00:24:41,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:24:41,134 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899013050] [2022-11-26 00:24:41,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:24:41,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:24:41,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:24:41,662 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-26 00:24:41,663 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:24:41,663 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899013050] [2022-11-26 00:24:41,664 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [899013050] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:24:41,664 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:24:41,664 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-26 00:24:41,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492348555] [2022-11-26 00:24:41,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:24:41,673 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-26 00:24:41,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:24:41,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-26 00:24:41,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-26 00:24:41,733 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-26 00:24:41,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:24:41,799 INFO L93 Difference]: Finished difference Result 61 states and 90 transitions. [2022-11-26 00:24:41,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-26 00:24:41,802 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-26 00:24:41,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:24:41,810 INFO L225 Difference]: With dead ends: 61 [2022-11-26 00:24:41,810 INFO L226 Difference]: Without dead ends: 29 [2022-11-26 00:24:41,813 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-26 00:24:41,817 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-26 00:24:41,818 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-26 00:24:41,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-11-26 00:24:41,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2022-11-26 00:24:41,858 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-26 00:24:41,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 35 transitions. [2022-11-26 00:24:41,861 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 35 transitions. Word has length 18 [2022-11-26 00:24:41,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:24:41,862 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 35 transitions. [2022-11-26 00:24:41,862 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-26 00:24:41,863 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 35 transitions. [2022-11-26 00:24:41,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-26 00:24:41,865 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:24:41,865 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-26 00:24:41,865 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-26 00:24:41,866 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-26 00:24:41,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:24:41,867 INFO L85 PathProgramCache]: Analyzing trace with hash -1105478418, now seen corresponding path program 1 times [2022-11-26 00:24:41,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:24:41,867 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813098928] [2022-11-26 00:24:41,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:24:41,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:24:41,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:24:42,655 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-26 00:24:42,655 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:24:42,656 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813098928] [2022-11-26 00:24:42,656 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [813098928] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:24:42,656 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1342333087] [2022-11-26 00:24:42,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:24:42,657 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:24:42,657 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13b6cc96-6476-4ea8-bd16-bb8e5a4c06c8/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:24:42,663 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13b6cc96-6476-4ea8-bd16-bb8e5a4c06c8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:24:42,691 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13b6cc96-6476-4ea8-bd16-bb8e5a4c06c8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-26 00:24:42,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:24:42,923 INFO L263 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 38 conjunts are in the unsatisfiable core [2022-11-26 00:24:42,938 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:24:43,191 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-26 00:24:43,269 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:24:43,273 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-26 00:24:43,311 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-26 00:24:43,331 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-26 00:24:43,331 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:24:43,415 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-26 00:24:43,417 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1342333087] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:24:43,417 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [916976086] [2022-11-26 00:24:43,438 INFO L159 IcfgInterpreter]: Started Sifa with 19 locations of interest [2022-11-26 00:24:43,438 INFO L166 IcfgInterpreter]: Building call graph [2022-11-26 00:24:43,442 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-26 00:24:43,448 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-26 00:24:43,448 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-26 00:24:43,502 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:24:43,523 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-26 00:24:43,524 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-26 00:24:43,546 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:24:43,547 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-26 00:24:43,615 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-26 00:24:43,623 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-26 00:24:43,638 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:24:43,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 22 treesize of output 7 [2022-11-26 00:24:43,648 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:24:43,650 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-26 00:24:43,666 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:24:43,667 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-26 00:24:43,707 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:24:43,708 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-26 00:24:43,721 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:24:43,724 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-26 00:24:43,806 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:24:43,807 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-26 00:24:43,819 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:24:43,820 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-26 00:24:44,343 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-26 00:24:44,353 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-26 00:24:44,365 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-26 00:24:44,376 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-26 00:24:44,395 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-26 00:24:44,411 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-26 00:24:44,414 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-26 00:24:44,420 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-26 00:24:44,422 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-26 00:24:44,425 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-26 00:24:44,781 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-26 00:24:44,800 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-26 00:24:44,811 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-26 00:24:44,823 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-26 00:24:44,833 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-26 00:24:44,846 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-26 00:24:44,848 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-26 00:24:44,851 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-26 00:24:44,854 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-26 00:24:44,856 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-26 00:24:44,917 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-26 00:24:44,931 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-26 00:24:44,944 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:24:44,947 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-26 00:24:45,180 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:24:45,182 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-26 00:24:45,198 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:24:45,200 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-26 00:24:45,210 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:24:45,211 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-26 00:24:45,425 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-26 00:24:45,434 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-26 00:24:45,450 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-26 00:24:45,570 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:24:45,577 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-26 00:24:45,578 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-26 00:24:45,599 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:24:45,604 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-26 00:24:45,605 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-26 00:24:45,743 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:24:45,749 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-26 00:24:45,750 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-26 00:24:45,765 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:24:45,771 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-26 00:24:45,771 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-26 00:24:45,929 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-26 00:24:45,965 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:24:45,966 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-26 00:24:45,987 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:24:46,008 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-11-26 00:24:46,010 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-26 00:24:46,026 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:24:46,042 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-11-26 00:24:46,045 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-26 00:24:46,409 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 21 for LOIs [2022-11-26 00:24:46,422 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-26 00:24:46,428 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-26 00:24:46,453 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:24:46,455 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-26 00:24:46,464 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:24:46,465 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-26 00:24:46,474 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:24:46,475 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-26 00:24:46,477 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-26 00:24:51,483 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-26 00:24:51,484 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-26 00:24:51,484 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-26 00:24:51,484 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 20 [2022-11-26 00:24:51,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678677690] [2022-11-26 00:24:51,485 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-26 00:24:51,486 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-11-26 00:24:51,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:24:51,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-26 00:24:51,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=1139, Unknown=1, NotChecked=68, Total=1332 [2022-11-26 00:24:51,489 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-26 00:24:51,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:24:51,951 INFO L93 Difference]: Finished difference Result 40 states and 52 transitions. [2022-11-26 00:24:51,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-26 00:24:51,952 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-26 00:24:51,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:24:51,953 INFO L225 Difference]: With dead ends: 40 [2022-11-26 00:24:51,953 INFO L226 Difference]: Without dead ends: 29 [2022-11-26 00:24:51,954 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 33 SyntacticMatches, 3 SemanticMatches, 41 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 479 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=179, Invalid=1546, Unknown=1, NotChecked=80, Total=1806 [2022-11-26 00:24:51,955 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 58 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-26 00:24:51,956 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 212 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-26 00:24:51,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-11-26 00:24:51,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2022-11-26 00:24:51,961 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-26 00:24:51,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 34 transitions. [2022-11-26 00:24:51,962 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 34 transitions. Word has length 25 [2022-11-26 00:24:51,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:24:51,963 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 34 transitions. [2022-11-26 00:24:51,963 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-26 00:24:51,963 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 34 transitions. [2022-11-26 00:24:51,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-26 00:24:51,964 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:24:51,965 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-26 00:24:51,978 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13b6cc96-6476-4ea8-bd16-bb8e5a4c06c8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-26 00:24:52,175 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13b6cc96-6476-4ea8-bd16-bb8e5a4c06c8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:24:52,176 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-26 00:24:52,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:24:52,176 INFO L85 PathProgramCache]: Analyzing trace with hash 871403401, now seen corresponding path program 1 times [2022-11-26 00:24:52,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:24:52,177 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877101929] [2022-11-26 00:24:52,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:24:52,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:24:52,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:24:53,424 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-26 00:24:53,424 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:24:53,425 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877101929] [2022-11-26 00:24:53,425 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1877101929] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:24:53,425 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1598925714] [2022-11-26 00:24:53,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:24:53,425 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:24:53,425 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13b6cc96-6476-4ea8-bd16-bb8e5a4c06c8/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:24:53,426 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13b6cc96-6476-4ea8-bd16-bb8e5a4c06c8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:24:53,430 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13b6cc96-6476-4ea8-bd16-bb8e5a4c06c8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-26 00:24:53,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:24:53,594 INFO L263 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 135 conjunts are in the unsatisfiable core [2022-11-26 00:24:53,601 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:24:53,614 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-26 00:24:53,654 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-26 00:24:53,746 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-26 00:24:53,746 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-26 00:24:53,887 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-26 00:24:53,888 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-26 00:24:53,943 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-26 00:24:54,032 INFO L321 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2022-11-26 00:24:54,032 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-26 00:24:54,178 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-26 00:24:54,198 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-26 00:24:54,303 INFO L321 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-11-26 00:24:54,304 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-26 00:24:54,321 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-26 00:24:54,442 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-26 00:24:54,442 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-26 00:24:54,454 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-26 00:24:54,454 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-26 00:24:54,466 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-26 00:24:54,471 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-26 00:24:54,663 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:24:54,679 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-26 00:24:54,679 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-26 00:24:54,701 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-11-26 00:24:54,701 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-26 00:24:54,713 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-26 00:24:54,721 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:24:54,723 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:24:54,740 INFO L321 Elim1Store]: treesize reduction 24, result has 46.7 percent of original size [2022-11-26 00:24:54,740 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-26 00:24:54,755 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:24:54,756 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-26 00:24:55,131 INFO L321 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2022-11-26 00:24:55,132 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-26 00:24:55,162 INFO L321 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-11-26 00:24:55,162 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-26 00:24:55,173 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:24:55,174 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:24:55,175 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-26 00:24:55,199 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-11-26 00:24:55,200 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-26 00:24:55,207 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-26 00:24:55,496 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-26 00:24:55,762 INFO L321 Elim1Store]: treesize reduction 16, result has 56.8 percent of original size [2022-11-26 00:24:55,762 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-26 00:24:55,858 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-26 00:24:55,858 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:24:56,191 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-26 00:24:56,239 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 (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 ((.cse3 (store (store |c_#memory_$Pointer$.base| .cse0 (store (select |c_#memory_$Pointer$.base| .cse0) |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 .cse3 |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| .cse0 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 (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int| .cse0 (store (select |c_#memory_int| .cse0) |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))) (not (= .cse1 (select (select .cse3 .cse1) .cse2)))))))) is different from false [2022-11-26 00:24:56,260 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-26 00:24:56,379 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-26 00:24:56,382 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1598925714] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:24:56,382 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [771600440] [2022-11-26 00:24:56,385 INFO L159 IcfgInterpreter]: Started Sifa with 22 locations of interest [2022-11-26 00:24:56,385 INFO L166 IcfgInterpreter]: Building call graph [2022-11-26 00:24:56,385 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-26 00:24:56,386 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-26 00:24:56,386 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-26 00:24:56,406 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:24:56,418 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-26 00:24:56,418 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-26 00:24:56,434 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:24:56,449 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-26 00:24:56,450 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-26 00:24:56,482 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-26 00:24:56,486 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-26 00:24:56,495 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:24:56,496 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-26 00:24:56,502 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:24:56,503 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-26 00:24:56,512 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:24:56,513 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-26 00:24:56,534 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:24:56,535 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-26 00:24:56,544 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:24:56,545 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-26 00:24:56,582 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:24:56,583 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-26 00:24:56,593 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:24:56,594 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-26 00:24:56,664 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-26 00:24:56,672 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-26 00:24:56,682 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-26 00:24:56,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-26 00:24:56,719 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-26 00:24:56,759 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-26 00:24:56,770 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-26 00:24:56,777 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-26 00:24:56,788 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-26 00:24:56,798 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-26 00:24:56,874 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:24:56,875 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:24:56,877 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-26 00:24:56,889 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:24:56,891 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-26 00:24:56,905 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:24:56,907 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-26 00:24:56,996 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-26 00:24:57,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-26 00:24:57,016 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-26 00:24:57,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-26 00:24:57,033 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-26 00:24:57,069 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-26 00:24:57,078 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-26 00:24:57,087 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-26 00:24:57,097 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-26 00:24:57,111 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-26 00:24:57,147 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-26 00:24:57,156 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-26 00:24:57,172 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:24:57,173 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-26 00:24:57,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-26 00:24:57,254 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-26 00:24:57,263 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-26 00:24:57,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-26 00:24:57,290 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-26 00:24:57,342 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-26 00:24:57,353 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-26 00:24:57,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-26 00:24:57,376 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-26 00:24:57,386 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-26 00:24:57,465 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:24:57,478 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-26 00:24:57,479 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-26 00:24:57,494 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:24:57,495 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-26 00:24:57,522 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-26 00:24:57,523 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-26 00:24:57,599 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-26 00:24:57,620 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-26 00:24:57,639 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:24:57,641 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:24:57,647 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-26 00:24:57,647 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-26 00:24:57,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-26 00:24:57,676 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:24:57,678 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:24:57,684 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-26 00:24:57,685 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-26 00:24:57,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 9 treesize of output 3 [2022-11-26 00:24:57,772 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:24:57,773 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:24:57,779 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-26 00:24:57,780 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-26 00:24:57,799 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-26 00:24:57,810 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-26 00:24:57,826 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:24:57,828 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:24:57,834 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-26 00:24:57,834 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-26 00:24:58,038 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:24:58,136 INFO L321 Elim1Store]: treesize reduction 95, result has 36.2 percent of original size [2022-11-26 00:24:58,137 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-26 00:24:58,209 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:24:58,250 INFO L321 Elim1Store]: treesize reduction 24, result has 52.0 percent of original size [2022-11-26 00:24:58,250 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-26 00:24:58,269 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-26 00:24:58,305 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:24:58,305 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-26 00:24:58,325 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-26 00:24:58,337 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-26 00:24:58,384 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:24:58,447 INFO L321 Elim1Store]: treesize reduction 120, result has 19.5 percent of original size [2022-11-26 00:24:58,448 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-26 00:24:58,479 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:24:58,520 INFO L321 Elim1Store]: treesize reduction 24, result has 52.0 percent of original size [2022-11-26 00:24:58,521 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-26 00:24:58,539 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-26 00:24:58,564 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:24:58,577 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:24:58,577 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-26 00:24:58,694 INFO L321 Elim1Store]: treesize reduction 44, result has 34.3 percent of original size [2022-11-26 00:24:58,694 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-26 00:24:59,793 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 13 for LOIs [2022-11-26 00:24:59,799 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-26 00:24:59,804 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-26 00:24:59,817 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:24:59,818 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-26 00:24:59,825 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:24:59,825 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-26 00:24:59,831 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:24:59,832 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-26 00:24:59,834 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-26 00:25:07,568 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-26 00:25:11,178 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '561#(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-26 00:25:11,178 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-26 00:25:11,179 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-26 00:25:11,179 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 21] total 37 [2022-11-26 00:25:11,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670492566] [2022-11-26 00:25:11,179 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-26 00:25:11,180 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-11-26 00:25:11,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:25:11,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-11-26 00:25:11,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=213, Invalid=3447, Unknown=20, NotChecked=610, Total=4290 [2022-11-26 00:25:11,183 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-26 00:25:13,965 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-26 00:25:17,658 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-26 00:25:18,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:25:18,794 INFO L93 Difference]: Finished difference Result 78 states and 102 transitions. [2022-11-26 00:25:18,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-11-26 00:25:18,795 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-26 00:25:18,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:25:18,796 INFO L225 Difference]: With dead ends: 78 [2022-11-26 00:25:18,796 INFO L226 Difference]: Without dead ends: 70 [2022-11-26 00:25:18,801 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 1541 ImplicationChecksByTransitivity, 15.6s TimeCoverageRelationStatistics Valid=479, Invalid=6157, Unknown=26, NotChecked=820, Total=7482 [2022-11-26 00:25:18,802 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 274 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 719 mSolverCounterSat, 28 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 274 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 749 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 719 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2022-11-26 00:25:18,802 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [274 Valid, 278 Invalid, 749 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 719 Invalid, 2 Unknown, 0 Unchecked, 4.9s Time] [2022-11-26 00:25:18,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-11-26 00:25:18,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 33. [2022-11-26 00:25:18,838 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-26 00:25:18,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 41 transitions. [2022-11-26 00:25:18,843 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 41 transitions. Word has length 28 [2022-11-26 00:25:18,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:25:18,844 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 41 transitions. [2022-11-26 00:25:18,844 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-26 00:25:18,844 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 41 transitions. [2022-11-26 00:25:18,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-26 00:25:18,845 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:25:18,845 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-26 00:25:18,851 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13b6cc96-6476-4ea8-bd16-bb8e5a4c06c8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-26 00:25:19,047 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13b6cc96-6476-4ea8-bd16-bb8e5a4c06c8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:25:19,047 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-26 00:25:19,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:25:19,048 INFO L85 PathProgramCache]: Analyzing trace with hash -53225596, now seen corresponding path program 1 times [2022-11-26 00:25:19,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:25:19,048 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220236960] [2022-11-26 00:25:19,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:25:19,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:25:19,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:25:20,060 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-26 00:25:20,060 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:25:20,060 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220236960] [2022-11-26 00:25:20,060 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1220236960] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:25:20,060 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1281790858] [2022-11-26 00:25:20,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:25:20,060 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:25:20,061 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13b6cc96-6476-4ea8-bd16-bb8e5a4c06c8/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:25:20,064 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13b6cc96-6476-4ea8-bd16-bb8e5a4c06c8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:25:20,071 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13b6cc96-6476-4ea8-bd16-bb8e5a4c06c8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-26 00:25:20,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:25:20,310 INFO L263 TraceCheckSpWp]: Trace formula consists of 374 conjuncts, 128 conjunts are in the unsatisfiable core [2022-11-26 00:25:20,317 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:25:20,360 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-26 00:25:20,522 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-26 00:25:20,595 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-26 00:25:20,596 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-26 00:25:20,694 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-26 00:25:20,783 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-26 00:25:20,901 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-26 00:25:20,907 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-26 00:25:20,913 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-26 00:25:20,917 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-26 00:25:21,098 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:25:21,101 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-26 00:25:21,120 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:25:21,121 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-26 00:25:21,149 INFO L321 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2022-11-26 00:25:21,150 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-26 00:25:21,159 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-26 00:25:21,482 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-26 00:25:21,482 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-26 00:25:21,511 INFO L321 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-11-26 00:25:21,512 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-26 00:25:21,522 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-26 00:25:21,529 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:25:21,549 INFO L321 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2022-11-26 00:25:21,549 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-26 00:25:21,560 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-26 00:25:21,649 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-26 00:25:21,650 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-26 00:25:21,751 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-26 00:25:21,860 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-26 00:25:21,903 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-26 00:25:21,903 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:25:22,066 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_516 (Array Int Int)) (v_ArrVal_519 (Array Int Int)) (v_ArrVal_517 Int) (v_ArrVal_520 (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| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| v_ArrVal_517)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_513) (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|) |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_519) |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| v_ArrVal_516) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_520) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)))) is different from false [2022-11-26 00:25:24,110 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_516 (Array Int Int)) (v_ArrVal_519 (Array Int Int)) (v_ArrVal_517 Int) (v_ArrVal_520 (Array Int Int))) (= (let ((.cse0 (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 (let ((.cse1 (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 (store (store |c_#memory_int| .cse0 (store (select |c_#memory_int| .cse0) .cse1 v_ArrVal_517)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_513) (select (select (store (store |c_#memory_$Pointer$.base| .cse0 (store (select |c_#memory_$Pointer$.base| .cse0) .cse1 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_519) |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 v_ArrVal_516) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_520) |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-26 00:25:24,574 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-26 00:25:24,576 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1281790858] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:25:24,577 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1303630894] [2022-11-26 00:25:24,579 INFO L159 IcfgInterpreter]: Started Sifa with 22 locations of interest [2022-11-26 00:25:24,579 INFO L166 IcfgInterpreter]: Building call graph [2022-11-26 00:25:24,579 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-26 00:25:24,580 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-26 00:25:24,580 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-26 00:25:24,597 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:25:24,610 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-26 00:25:24,611 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-26 00:25:24,625 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:25:24,641 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-26 00:25:24,642 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-26 00:25:24,664 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-26 00:25:24,668 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-26 00:25:24,678 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:25:24,678 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-26 00:25:24,685 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:25:24,685 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-26 00:25:24,699 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:25:24,700 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-26 00:25:24,718 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:25:24,719 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-26 00:25:24,728 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:25:24,729 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-26 00:25:24,776 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:25:24,777 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-26 00:25:24,787 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:25:24,789 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-26 00:25:24,853 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-26 00:25:24,861 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-26 00:25:24,869 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-26 00:25:24,882 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-26 00:25:24,890 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-26 00:25:24,924 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-26 00:25:24,933 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-26 00:25:24,941 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-26 00:25:24,952 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-26 00:25:24,960 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-26 00:25:24,995 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:25:24,996 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-26 00:25:25,005 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-26 00:25:25,015 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-26 00:25:25,331 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-26 00:25:25,333 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-26 00:25:25,335 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-26 00:25:25,337 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-26 00:25:25,340 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-26 00:25:25,351 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-26 00:25:25,373 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-26 00:25:25,382 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-26 00:25:25,392 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-26 00:25:25,402 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-26 00:25:25,604 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-26 00:25:25,605 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-26 00:25:25,607 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-26 00:25:25,609 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-26 00:25:25,611 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-26 00:25:25,623 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-26 00:25:25,632 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-26 00:25:25,641 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-26 00:25:25,653 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-26 00:25:25,661 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-26 00:25:25,701 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:25:25,702 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-26 00:25:25,711 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-26 00:25:25,719 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-26 00:25:26,136 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-26 00:25:26,145 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-26 00:25:26,154 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-26 00:25:26,163 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-26 00:25:26,174 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-26 00:25:26,187 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-26 00:25:26,189 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-26 00:25:26,191 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-26 00:25:26,192 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-26 00:25:26,195 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-26 00:25:26,399 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-26 00:25:26,401 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-26 00:25:26,403 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-26 00:25:26,405 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-26 00:25:26,407 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-26 00:25:26,417 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-26 00:25:26,426 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-26 00:25:26,434 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-26 00:25:26,447 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-26 00:25:26,455 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-26 00:25:26,535 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-26 00:25:26,535 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-26 00:25:26,555 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-26 00:25:26,581 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-26 00:25:26,582 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-26 00:25:26,653 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-26 00:25:26,665 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:25:26,667 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:25:26,673 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-26 00:25:26,673 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-26 00:25:26,686 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-26 00:25:26,698 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-26 00:25:26,728 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:25:26,730 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:25:26,737 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-26 00:25:26,737 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-26 00:25:26,791 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-26 00:25:26,805 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-26 00:25:26,819 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:25:26,821 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:25:26,827 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-26 00:25:26,827 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-26 00:25:26,847 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:25:26,849 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:25:26,855 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-26 00:25:26,855 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-26 00:25:26,872 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-26 00:25:27,016 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:25:27,133 INFO L321 Elim1Store]: treesize reduction 95, result has 36.2 percent of original size [2022-11-26 00:25:27,133 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-26 00:25:27,173 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:25:27,233 INFO L321 Elim1Store]: treesize reduction 120, result has 19.5 percent of original size [2022-11-26 00:25:27,234 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-26 00:25:27,295 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:25:27,344 INFO L321 Elim1Store]: treesize reduction 24, result has 52.0 percent of original size [2022-11-26 00:25:27,344 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-26 00:25:27,373 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-26 00:25:27,413 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-26 00:25:27,442 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:25:27,443 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-26 00:25:27,480 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:25:27,530 INFO L321 Elim1Store]: treesize reduction 24, result has 52.0 percent of original size [2022-11-26 00:25:27,530 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-26 00:25:27,549 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-26 00:25:27,579 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:25:27,579 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-26 00:25:27,620 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:25:27,621 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:25:27,622 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-26 00:25:27,840 INFO L321 Elim1Store]: treesize reduction 44, result has 34.3 percent of original size [2022-11-26 00:25:27,844 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-26 00:25:29,874 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 13 for LOIs [2022-11-26 00:25:29,881 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-26 00:25:29,886 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-26 00:25:29,900 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:25:29,900 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-26 00:25:29,907 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:25:29,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-26 00:25:29,914 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:25:29,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 22 treesize of output 7 [2022-11-26 00:25:29,917 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-26 00:25:37,659 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '947#(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-26 00:25:37,659 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-26 00:25:37,659 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-26 00:25:37,659 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 24] total 38 [2022-11-26 00:25:37,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191578282] [2022-11-26 00:25:37,660 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-26 00:25:37,661 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-11-26 00:25:37,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:25:37,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-11-26 00:25:37,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=206, Invalid=3306, Unknown=40, NotChecked=354, Total=3906 [2022-11-26 00:25:37,663 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-26 00:25:41,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:25:41,474 INFO L93 Difference]: Finished difference Result 72 states and 93 transitions. [2022-11-26 00:25:41,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-11-26 00:25:41,475 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-26 00:25:41,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:25:41,479 INFO L225 Difference]: With dead ends: 72 [2022-11-26 00:25:41,479 INFO L226 Difference]: Without dead ends: 58 [2022-11-26 00:25:41,481 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1432 ImplicationChecksByTransitivity, 14.3s TimeCoverageRelationStatistics Valid=480, Invalid=5964, Unknown=48, NotChecked=480, Total=6972 [2022-11-26 00:25:41,483 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 257 mSDsluCounter, 373 mSDsCounter, 0 mSdLazyCounter, 785 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 397 SdHoareTripleChecker+Invalid, 818 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 785 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-26 00:25:41,487 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [257 Valid, 397 Invalid, 818 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 785 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-11-26 00:25:41,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-11-26 00:25:41,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 45. [2022-11-26 00:25:41,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 38 states have (on average 1.236842105263158) internal successors, (47), 38 states have internal predecessors, (47), 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-26 00:25:41,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 57 transitions. [2022-11-26 00:25:41,517 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 57 transitions. Word has length 30 [2022-11-26 00:25:41,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:25:41,517 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 57 transitions. [2022-11-26 00:25:41,517 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-26 00:25:41,518 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 57 transitions. [2022-11-26 00:25:41,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-26 00:25:41,519 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:25:41,519 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-26 00:25:41,529 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13b6cc96-6476-4ea8-bd16-bb8e5a4c06c8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-26 00:25:41,728 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13b6cc96-6476-4ea8-bd16-bb8e5a4c06c8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:25:41,728 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-26 00:25:41,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:25:41,728 INFO L85 PathProgramCache]: Analyzing trace with hash -325495100, now seen corresponding path program 1 times [2022-11-26 00:25:41,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:25:41,729 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799234223] [2022-11-26 00:25:41,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:25:41,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:25:41,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:25:43,282 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-26 00:25:43,282 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:25:43,282 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799234223] [2022-11-26 00:25:43,283 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [799234223] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:25:43,283 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1227554545] [2022-11-26 00:25:43,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:25:43,283 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:25:43,283 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13b6cc96-6476-4ea8-bd16-bb8e5a4c06c8/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:25:43,284 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13b6cc96-6476-4ea8-bd16-bb8e5a4c06c8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:25:43,288 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13b6cc96-6476-4ea8-bd16-bb8e5a4c06c8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-26 00:25:43,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:25:43,456 INFO L263 TraceCheckSpWp]: Trace formula consists of 374 conjuncts, 107 conjunts are in the unsatisfiable core [2022-11-26 00:25:43,461 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:25:43,515 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-26 00:25:43,713 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-26 00:25:43,832 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-26 00:25:43,833 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-26 00:25:43,915 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-26 00:25:43,998 INFO L321 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-11-26 00:25:43,998 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-26 00:25:44,101 INFO L321 Elim1Store]: treesize reduction 3, result has 81.3 percent of original size [2022-11-26 00:25:44,101 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-26 00:25:44,107 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-26 00:25:44,112 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-26 00:25:44,235 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:25:44,245 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-26 00:25:44,246 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-26 00:25:44,251 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:25:44,252 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-26 00:25:44,288 INFO L321 Elim1Store]: treesize reduction 8, result has 75.8 percent of original size [2022-11-26 00:25:44,288 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-26 00:25:44,956 INFO L321 Elim1Store]: treesize reduction 104, result has 15.4 percent of original size [2022-11-26 00:25:44,956 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-26 00:25:44,990 INFO L321 Elim1Store]: treesize reduction 66, result has 19.5 percent of original size [2022-11-26 00:25:44,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 6 new quantified variables, introduced 6 case distinctions, treesize of input 174 treesize of output 107 [2022-11-26 00:25:45,031 INFO L321 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2022-11-26 00:25:45,031 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-26 00:25:45,149 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-26 00:25:45,280 INFO L321 Elim1Store]: treesize reduction 28, result has 24.3 percent of original size [2022-11-26 00:25:45,283 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-26 00:25:45,292 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-26 00:25:45,292 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:25:45,307 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-26 00:25:45,704 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-26 00:25:45,717 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 ((.cse1 (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_#t~ret9#1.base|)) |c_ULTIMATE.start_sll_circular_append_#t~ret9#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| .cse2 v_ArrVal_686) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_680) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) (not (= .cse4 (select .cse3 |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_14|)))))))) is different from false [2022-11-26 00:25:45,803 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-26 00:25:45,805 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1227554545] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:25:45,805 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1266085384] [2022-11-26 00:25:45,807 INFO L159 IcfgInterpreter]: Started Sifa with 22 locations of interest [2022-11-26 00:25:45,808 INFO L166 IcfgInterpreter]: Building call graph [2022-11-26 00:25:45,808 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-26 00:25:45,808 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-26 00:25:45,808 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-26 00:25:45,828 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:25:45,840 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-26 00:25:45,840 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-26 00:25:45,850 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:25:45,868 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-26 00:25:45,869 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-26 00:25:45,893 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-26 00:25:45,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-26 00:25:45,904 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:25:45,905 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-26 00:25:45,911 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:25:45,911 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-26 00:25:45,920 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:25:45,921 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-26 00:25:45,938 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:25:45,938 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-26 00:25:45,949 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:25:45,950 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-26 00:25:45,982 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:25:45,983 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-26 00:25:45,991 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:25:45,992 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-26 00:25:46,053 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-26 00:25:46,061 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-26 00:25:46,070 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-26 00:25:46,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-26 00:25:46,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-26 00:25:46,120 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-26 00:25:46,128 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-26 00:25:46,136 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-26 00:25:46,145 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-26 00:25:46,155 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-26 00:25:46,184 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-26 00:25:46,195 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:25:46,196 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-26 00:25:46,205 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-26 00:25:46,408 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-26 00:25:46,410 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-26 00:25:46,412 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-26 00:25:46,413 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-26 00:25:46,416 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-26 00:25:46,426 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-26 00:25:46,434 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-26 00:25:46,444 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-26 00:25:46,455 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-26 00:25:46,463 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-26 00:25:46,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-26 00:25:46,681 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-26 00:25:46,692 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-26 00:25:46,703 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-26 00:25:46,712 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-26 00:25:46,725 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-26 00:25:46,727 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-26 00:25:46,729 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-26 00:25:46,731 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-26 00:25:46,732 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-26 00:25:46,774 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:25:46,775 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-26 00:25:46,794 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-26 00:25:46,808 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-26 00:25:47,146 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-26 00:25:47,148 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-26 00:25:47,149 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-26 00:25:47,151 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-26 00:25:47,154 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-26 00:25:47,165 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-26 00:25:47,173 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-26 00:25:47,181 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-26 00:25:47,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-26 00:25:47,198 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-26 00:25:47,359 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-26 00:25:47,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-26 00:25:47,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-26 00:25:47,384 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-26 00:25:47,395 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-26 00:25:47,414 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-26 00:25:47,416 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-26 00:25:47,417 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-26 00:25:47,419 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-26 00:25:47,421 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-26 00:25:47,476 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-26 00:25:47,504 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-26 00:25:47,505 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-26 00:25:47,539 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-26 00:25:47,539 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-26 00:25:47,607 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-26 00:25:47,620 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:25:47,622 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:25:47,628 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-26 00:25:47,628 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-26 00:25:47,641 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-26 00:25:47,660 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:25:47,662 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:25:47,667 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-26 00:25:47,668 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-26 00:25:47,680 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-26 00:25:47,729 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-26 00:25:47,741 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:25:47,743 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:25:47,749 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-26 00:25:47,749 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-26 00:25:47,762 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-26 00:25:47,776 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:25:47,781 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:25:47,787 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-26 00:25:47,788 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-26 00:25:47,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-26 00:25:48,050 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:25:48,123 INFO L321 Elim1Store]: treesize reduction 117, result has 32.4 percent of original size [2022-11-26 00:25:48,123 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-26 00:25:48,210 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:25:48,224 INFO L321 Elim1Store]: treesize reduction 13, result has 38.1 percent of original size [2022-11-26 00:25:48,224 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-26 00:25:48,229 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-26 00:25:48,238 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-26 00:25:48,258 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:25:48,346 INFO L321 Elim1Store]: treesize reduction 117, result has 32.4 percent of original size [2022-11-26 00:25:48,347 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-26 00:25:48,424 INFO L321 Elim1Store]: treesize reduction 39, result has 48.7 percent of original size [2022-11-26 00:25:48,425 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-26 00:25:48,443 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-26 00:25:48,489 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:25:48,490 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-26 00:25:48,505 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-26 00:25:48,523 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:25:48,524 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:25:48,525 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-26 00:25:48,557 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:25:48,557 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-26 00:25:48,658 INFO L321 Elim1Store]: treesize reduction 21, result has 41.7 percent of original size [2022-11-26 00:25:48,658 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-26 00:25:49,291 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 21 for LOIs [2022-11-26 00:25:49,298 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-26 00:25:49,304 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-26 00:25:49,321 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:25:49,321 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-26 00:25:49,327 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:25:49,328 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-26 00:25:49,337 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:25:49,337 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-26 00:25:49,339 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-26 00:26:00,407 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1344#(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|) (= |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|)) (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|))) (= (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|)))) (and (= |ULTIMATE.start_sll_circular_append_~last~1#1.offset| |ULTIMATE.start_sll_circular_append_~head#1.offset|) (exists ((v_DerPreprocessor_20 (Array Int Int)) (v_DerPreprocessor_21 (Array Int Int))) (and (= v_DerPreprocessor_20 (select (store (store (store (store |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_append_~last~1#1.base| v_DerPreprocessor_20) |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_DerPreprocessor_21) |ULTIMATE.start_sll_circular_append_~last~1#1.base| v_DerPreprocessor_20) |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_DerPreprocessor_21) |ULTIMATE.start_sll_circular_append_~last~1#1.base|)) (= (select v_DerPreprocessor_21 |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_20) |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_DerPreprocessor_21) |ULTIMATE.start_sll_circular_append_~last~1#1.base| v_DerPreprocessor_20) |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_DerPreprocessor_21) |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_20) |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_DerPreprocessor_21) |ULTIMATE.start_sll_circular_append_~last~1#1.base| v_DerPreprocessor_20) |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_DerPreprocessor_21) |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|))) (= |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|))) (<= 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-26 00:26:00,407 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-26 00:26:00,407 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-26 00:26:00,407 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 25] total 40 [2022-11-26 00:26:00,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691372377] [2022-11-26 00:26:00,408 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-26 00:26:00,408 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-11-26 00:26:00,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:26:00,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-11-26 00:26:00,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=3673, Unknown=39, NotChecked=500, Total=4422 [2022-11-26 00:26:00,411 INFO L87 Difference]: Start difference. First operand 45 states and 57 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-26 00:26:03,248 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-26 00:26:05,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:26:05,186 INFO L93 Difference]: Finished difference Result 74 states and 95 transitions. [2022-11-26 00:26:05,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-26 00:26:05,187 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-26 00:26:05,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:26:05,188 INFO L225 Difference]: With dead ends: 74 [2022-11-26 00:26:05,188 INFO L226 Difference]: Without dead ends: 66 [2022-11-26 00:26:05,190 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 82 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 1309 ImplicationChecksByTransitivity, 15.0s TimeCoverageRelationStatistics Valid=433, Invalid=5864, Unknown=39, NotChecked=636, Total=6972 [2022-11-26 00:26:05,191 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 254 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 670 mSolverCounterSat, 33 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 704 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 670 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-11-26 00:26:05,191 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [254 Valid, 318 Invalid, 704 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 670 Invalid, 1 Unknown, 0 Unchecked, 2.8s Time] [2022-11-26 00:26:05,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-11-26 00:26:05,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 51. [2022-11-26 00:26:05,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 44 states have (on average 1.2272727272727273) internal successors, (54), 44 states have internal predecessors, (54), 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-26 00:26:05,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 64 transitions. [2022-11-26 00:26:05,204 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 64 transitions. Word has length 30 [2022-11-26 00:26:05,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:26:05,204 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 64 transitions. [2022-11-26 00:26:05,205 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-26 00:26:05,205 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 64 transitions. [2022-11-26 00:26:05,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-26 00:26:05,206 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:26:05,206 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-26 00:26:05,215 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13b6cc96-6476-4ea8-bd16-bb8e5a4c06c8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-11-26 00:26:05,407 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13b6cc96-6476-4ea8-bd16-bb8e5a4c06c8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:26:05,408 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-26 00:26:05,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:26:05,408 INFO L85 PathProgramCache]: Analyzing trace with hash 778550271, now seen corresponding path program 1 times [2022-11-26 00:26:05,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:26:05,408 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731800081] [2022-11-26 00:26:05,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:26:05,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:26:05,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:26:07,794 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-26 00:26:07,794 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:26:07,794 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731800081] [2022-11-26 00:26:07,794 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [731800081] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:26:07,795 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1032918134] [2022-11-26 00:26:07,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:26:07,795 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:26:07,795 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13b6cc96-6476-4ea8-bd16-bb8e5a4c06c8/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:26:07,799 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13b6cc96-6476-4ea8-bd16-bb8e5a4c06c8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:26:07,823 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13b6cc96-6476-4ea8-bd16-bb8e5a4c06c8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-26 00:26:08,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:26:08,390 WARN L261 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 194 conjunts are in the unsatisfiable core [2022-11-26 00:26:08,398 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:26:08,457 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-26 00:26:08,725 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-26 00:26:08,801 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-26 00:26:08,900 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-26 00:26:08,901 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-26 00:26:09,011 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-26 00:26:09,028 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-26 00:26:09,047 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-26 00:26:09,184 INFO L321 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-11-26 00:26:09,185 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-26 00:26:09,192 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-26 00:26:09,206 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-26 00:26:09,371 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-26 00:26:09,371 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-26 00:26:09,379 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-26 00:26:09,386 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:26:09,386 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-26 00:26:09,392 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-26 00:26:09,666 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:26:09,683 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-26 00:26:09,683 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-26 00:26:09,698 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:26:09,700 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:26:09,714 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-11-26 00:26:09,715 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-26 00:26:09,746 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-11-26 00:26:09,746 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-26 00:26:09,757 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-26 00:26:09,783 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-11-26 00:26:09,784 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-26 00:26:11,105 INFO L321 Elim1Store]: treesize reduction 143, result has 15.4 percent of original size [2022-11-26 00:26:11,105 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-26 00:26:11,158 INFO L321 Elim1Store]: treesize reduction 66, result has 19.5 percent of original size [2022-11-26 00:26:11,158 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-26 00:26:11,174 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:26:11,220 INFO L321 Elim1Store]: treesize reduction 123, result has 14.0 percent of original size [2022-11-26 00:26:11,220 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-26 00:26:11,230 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:26:11,314 INFO L321 Elim1Store]: treesize reduction 369, result has 5.1 percent of original size [2022-11-26 00:26:11,315 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-26 00:26:11,333 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:26:11,335 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:26:11,336 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-26 00:26:11,358 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-26 00:26:11,376 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-26 00:26:11,395 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-26 00:26:11,496 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-26 00:26:12,106 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:26:12,185 INFO L321 Elim1Store]: treesize reduction 386, result has 3.3 percent of original size [2022-11-26 00:26:12,185 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-26 00:26:12,198 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-26 00:26:12,458 INFO L321 Elim1Store]: treesize reduction 36, result has 18.2 percent of original size [2022-11-26 00:26:12,458 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-26 00:26:12,539 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-26 00:26:12,539 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:26:12,994 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_867 (Array Int Int)) (v_ArrVal_861 (Array Int Int)) (v_ArrVal_863 (Array Int Int)) (v_ArrVal_862 (Array Int Int))) (let ((.cse2 (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_861)) (.cse3 (let ((.cse4 (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|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)))) (store .cse4 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| v_ArrVal_867) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| (select (select .cse4 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= |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_863) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_862) .cse0) (+ .cse1 4))) (not (= (select (select .cse2 (select (select .cse2 .cse0) .cse1)) (select (select .cse3 .cse0) .cse1)) .cse0)))))) is different from false [2022-11-26 00:26:24,292 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1032918134] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:26:24,292 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1893487813] [2022-11-26 00:26:24,294 INFO L159 IcfgInterpreter]: Started Sifa with 22 locations of interest [2022-11-26 00:26:24,294 INFO L166 IcfgInterpreter]: Building call graph [2022-11-26 00:26:24,295 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-26 00:26:24,295 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-26 00:26:24,295 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-26 00:26:24,308 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:26:24,320 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-26 00:26:24,321 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-26 00:26:24,334 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:26:24,348 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-26 00:26:24,349 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-26 00:26:24,369 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-26 00:26:24,374 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-26 00:26:24,382 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:26:24,383 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-26 00:26:24,389 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:26:24,390 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-26 00:26:24,400 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:26:24,400 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-26 00:26:24,418 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:26:24,419 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-26 00:26:24,427 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:26:24,428 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-26 00:26:24,465 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:26:24,465 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-26 00:26:24,474 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:26:24,475 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-26 00:26:24,661 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-26 00:26:24,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-26 00:26:24,682 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-26 00:26:24,692 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-26 00:26:24,711 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-26 00:26:24,722 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-26 00:26:24,724 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-26 00:26:24,725 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-26 00:26:24,728 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-26 00:26:24,729 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-26 00:26:24,887 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-26 00:26:24,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-26 00:26:24,906 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-26 00:26:24,914 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-26 00:26:24,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-26 00:26:24,935 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-26 00:26:24,936 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-26 00:26:24,938 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-26 00:26:24,940 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-26 00:26:24,941 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-26 00:26:24,991 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:26:24,992 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:26:24,993 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-26 00:26:25,005 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:26:25,006 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-26 00:26:25,029 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:26:25,030 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-26 00:26:25,177 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:26:25,177 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-26 00:26:25,187 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:26:25,188 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-26 00:26:25,198 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:26:25,199 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-26 00:26:25,368 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-26 00:26:25,378 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-26 00:26:25,392 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-26 00:26:25,485 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:26:25,490 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-26 00:26:25,490 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-26 00:26:25,504 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:26:25,509 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-26 00:26:25,509 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-26 00:26:25,601 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:26:25,606 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-26 00:26:25,606 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-26 00:26:25,618 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:26:25,623 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-26 00:26:25,623 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-26 00:26:25,744 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:26:25,825 INFO L321 Elim1Store]: treesize reduction 117, result has 32.4 percent of original size [2022-11-26 00:26:25,826 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-26 00:26:25,902 INFO L321 Elim1Store]: treesize reduction 39, result has 48.7 percent of original size [2022-11-26 00:26:25,903 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-26 00:26:25,917 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-26 00:26:25,935 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-26 00:26:25,959 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-26 00:26:25,960 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-26 00:26:25,979 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:26:25,980 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:26:25,980 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-26 00:26:26,008 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:26:26,009 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-26 00:26:26,023 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-26 00:26:26,031 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-26 00:26:26,137 INFO L321 Elim1Store]: treesize reduction 21, result has 41.7 percent of original size [2022-11-26 00:26:26,138 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-26 00:26:26,163 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:26:26,251 INFO L321 Elim1Store]: treesize reduction 117, result has 32.4 percent of original size [2022-11-26 00:26:26,251 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-26 00:26:26,328 INFO L321 Elim1Store]: treesize reduction 39, result has 48.7 percent of original size [2022-11-26 00:26:26,329 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-26 00:26:26,346 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-26 00:26:26,366 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-26 00:26:26,390 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-26 00:26:26,390 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-26 00:26:26,420 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:26:26,421 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:26:26,422 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-26 00:26:26,457 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:26:26,458 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-26 00:26:26,474 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-26 00:26:40,135 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 21 for LOIs [2022-11-26 00:26:40,143 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-26 00:26:40,148 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-26 00:26:40,161 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:26:40,162 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-26 00:26:40,172 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:26:40,172 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-26 00:26:40,179 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:26:40,180 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-26 00:26:40,183 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-26 00:26:45,928 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1771#(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-26 00:26:45,928 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-26 00:26:45,928 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-26 00:26:45,928 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 26] total 47 [2022-11-26 00:26:45,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163257464] [2022-11-26 00:26:45,929 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-26 00:26:45,929 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-11-26 00:26:45,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:26:45,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-11-26 00:26:45,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=285, Invalid=5563, Unknown=8, NotChecked=150, Total=6006 [2022-11-26 00:26:45,933 INFO L87 Difference]: Start difference. First operand 51 states and 64 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-26 00:26:51,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:26:51,278 INFO L93 Difference]: Finished difference Result 76 states and 97 transitions. [2022-11-26 00:26:51,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-26 00:26:51,279 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-26 00:26:51,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:26:51,280 INFO L225 Difference]: With dead ends: 76 [2022-11-26 00:26:51,280 INFO L226 Difference]: Without dead ends: 68 [2022-11-26 00:26:51,283 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1921 ImplicationChecksByTransitivity, 24.1s TimeCoverageRelationStatistics Valid=622, Invalid=8494, Unknown=8, NotChecked=188, Total=9312 [2022-11-26 00:26:51,283 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 203 mSDsluCounter, 511 mSDsCounter, 0 mSdLazyCounter, 1136 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 533 SdHoareTripleChecker+Invalid, 1168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 1136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-11-26 00:26:51,284 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [203 Valid, 533 Invalid, 1168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 1136 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-11-26 00:26:51,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-11-26 00:26:51,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 53. [2022-11-26 00:26:51,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 46 states have (on average 1.2173913043478262) internal successors, (56), 46 states have internal predecessors, (56), 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-26 00:26:51,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 66 transitions. [2022-11-26 00:26:51,301 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 66 transitions. Word has length 32 [2022-11-26 00:26:51,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:26:51,301 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 66 transitions. [2022-11-26 00:26:51,301 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-26 00:26:51,302 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 66 transitions. [2022-11-26 00:26:51,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-26 00:26:51,303 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:26:51,303 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-26 00:26:51,311 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13b6cc96-6476-4ea8-bd16-bb8e5a4c06c8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-26 00:26:51,503 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13b6cc96-6476-4ea8-bd16-bb8e5a4c06c8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:26:51,504 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-26 00:26:51,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:26:51,504 INFO L85 PathProgramCache]: Analyzing trace with hash 506280767, now seen corresponding path program 2 times [2022-11-26 00:26:51,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:26:51,504 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177194393] [2022-11-26 00:26:51,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:26:51,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:26:51,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:26:53,001 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-26 00:26:53,002 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:26:53,002 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177194393] [2022-11-26 00:26:53,002 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [177194393] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:26:53,002 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1421294051] [2022-11-26 00:26:53,002 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-26 00:26:53,002 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:26:53,002 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13b6cc96-6476-4ea8-bd16-bb8e5a4c06c8/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:26:53,007 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13b6cc96-6476-4ea8-bd16-bb8e5a4c06c8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:26:53,027 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13b6cc96-6476-4ea8-bd16-bb8e5a4c06c8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-26 00:26:53,315 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-26 00:26:53,315 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-26 00:26:53,321 INFO L263 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 122 conjunts are in the unsatisfiable core [2022-11-26 00:26:53,329 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:26:53,365 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-26 00:26:53,550 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-26 00:26:53,553 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-26 00:26:53,580 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-26 00:26:53,587 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-26 00:26:53,595 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-26 00:26:53,598 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-26 00:26:53,634 INFO L321 Elim1Store]: treesize reduction 33, result has 25.0 percent of original size [2022-11-26 00:26:53,635 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-26 00:26:53,665 INFO L321 Elim1Store]: treesize reduction 45, result has 19.6 percent of original size [2022-11-26 00:26:53,665 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-26 00:26:53,680 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-26 00:26:53,683 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-26 00:26:53,710 INFO L321 Elim1Store]: treesize reduction 21, result has 16.0 percent of original size [2022-11-26 00:26:53,711 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-26 00:26:53,720 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:26:53,724 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-26 00:26:53,724 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-26 00:26:53,826 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:26:53,828 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:26:53,829 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:26:53,830 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:26:53,832 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:26:53,836 INFO L321 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-11-26 00:26:53,836 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-26 00:26:53,846 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:26:53,866 INFO L321 Elim1Store]: treesize reduction 52, result has 17.5 percent of original size [2022-11-26 00:26:53,867 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-26 00:26:53,895 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-26 00:26:53,898 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-26 00:26:53,933 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-26 00:26:53,936 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-26 00:26:53,979 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-26 00:26:53,982 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-26 00:26:54,070 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-26 00:26:54,072 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-26 00:26:54,158 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:26:54,181 INFO L321 Elim1Store]: treesize reduction 154, result has 4.3 percent of original size [2022-11-26 00:26:54,181 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-26 00:26:54,191 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-26 00:26:54,194 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-26 00:26:54,217 INFO L321 Elim1Store]: treesize reduction 41, result has 16.3 percent of original size [2022-11-26 00:26:54,217 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-26 00:26:54,233 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-26 00:26:54,235 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-26 00:26:54,237 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-26 00:26:54,237 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:26:54,547 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1421294051] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:26:54,548 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1863225880] [2022-11-26 00:26:54,549 INFO L159 IcfgInterpreter]: Started Sifa with 22 locations of interest [2022-11-26 00:26:54,550 INFO L166 IcfgInterpreter]: Building call graph [2022-11-26 00:26:54,550 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-26 00:26:54,550 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-26 00:26:54,550 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-26 00:26:54,565 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:26:54,580 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-26 00:26:54,580 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-26 00:26:54,589 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:26:54,589 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-26 00:26:54,609 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-26 00:26:54,613 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-26 00:26:54,620 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:26:54,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 22 treesize of output 7 [2022-11-26 00:26:54,625 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:26:54,626 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-26 00:26:54,634 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:26:54,635 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-26 00:26:54,651 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:26:54,652 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-26 00:26:54,660 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:26:54,664 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-26 00:26:54,698 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:26:54,699 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-26 00:26:54,707 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:26:54,707 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-26 00:26:54,884 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-26 00:26:54,892 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-26 00:26:54,901 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-26 00:26:54,912 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-26 00:26:54,921 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-26 00:26:54,931 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-26 00:26:54,933 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-26 00:26:54,935 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-26 00:26:54,936 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-26 00:26:54,938 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-26 00:26:55,096 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-26 00:26:55,106 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-26 00:26:55,115 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-26 00:26:55,124 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-26 00:26:55,132 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-26 00:26:55,143 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-26 00:26:55,145 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-26 00:26:55,147 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-26 00:26:55,148 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-26 00:26:55,149 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-26 00:26:55,182 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-26 00:26:55,192 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-26 00:26:55,202 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:26:55,203 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-26 00:26:55,337 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:26:55,338 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-26 00:26:55,348 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:26:55,349 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-26 00:26:55,359 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:26:55,362 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-26 00:26:55,543 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-26 00:26:55,552 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-26 00:26:55,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 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-26 00:26:55,660 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:26:55,665 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-26 00:26:55,665 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-26 00:26:55,679 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:26:55,683 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-26 00:26:55,684 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-26 00:26:55,771 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:26:55,776 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-26 00:26:55,776 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-26 00:26:55,795 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:26:55,801 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-26 00:26:55,801 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-26 00:26:56,005 INFO L321 Elim1Store]: treesize reduction 21, result has 41.7 percent of original size [2022-11-26 00:26:56,005 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-26 00:26:56,014 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:26:56,090 INFO L321 Elim1Store]: treesize reduction 117, result has 32.4 percent of original size [2022-11-26 00:26:56,090 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-26 00:26:56,155 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:26:56,167 INFO L321 Elim1Store]: treesize reduction 13, result has 38.1 percent of original size [2022-11-26 00:26:56,168 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-26 00:26:56,179 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-26 00:26:56,198 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:26:56,273 INFO L321 Elim1Store]: treesize reduction 117, result has 32.4 percent of original size [2022-11-26 00:26:56,274 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-26 00:26:56,361 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:26:56,375 INFO L321 Elim1Store]: treesize reduction 13, result has 38.1 percent of original size [2022-11-26 00:26:56,375 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-26 00:26:56,385 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-26 00:26:56,397 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-26 00:26:57,004 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 21 for LOIs [2022-11-26 00:26:57,012 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-26 00:26:57,016 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-26 00:26:57,030 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:26:57,030 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-26 00:26:57,040 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:26:57,040 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-26 00:26:57,049 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:26:57,050 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-26 00:26:57,051 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-26 00:27:06,883 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2186#(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-26 00:27:06,883 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-26 00:27:06,884 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-26 00:27:06,884 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 22] total 34 [2022-11-26 00:27:06,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315586948] [2022-11-26 00:27:06,884 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-26 00:27:06,885 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-11-26 00:27:06,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:27:06,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-11-26 00:27:06,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=2360, Unknown=54, NotChecked=954, Total=3540 [2022-11-26 00:27:06,887 INFO L87 Difference]: Start difference. First operand 53 states and 66 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-26 00:27:07,112 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-26 00:27:07,115 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-26 00:27:07,119 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-26 00:27:07,122 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-26 00:27:07,127 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-26 00:27:07,130 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-26 00:27:07,152 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-26 00:27:07,155 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-26 00:27:07,159 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-26 00:27:07,162 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-26 00:27:07,182 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-26 00:27:07,185 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-26 00:27:07,195 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-26 00:27:07,199 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-26 00:27:07,203 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-26 00:27:07,207 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-26 00:27:07,213 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-26 00:27:07,216 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-26 00:27:07,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:27:07,312 INFO L93 Difference]: Finished difference Result 67 states and 84 transitions. [2022-11-26 00:27:07,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-26 00:27:07,313 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-26 00:27:07,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:27:07,314 INFO L225 Difference]: With dead ends: 67 [2022-11-26 00:27:07,314 INFO L226 Difference]: Without dead ends: 53 [2022-11-26 00:27:07,316 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 39 SyntacticMatches, 3 SemanticMatches, 69 ConstructedPredicates, 18 IntricatePredicates, 0 DeprecatedPredicates, 637 ImplicationChecksByTransitivity, 10.9s TimeCoverageRelationStatistics Valid=204, Invalid=2552, Unknown=72, NotChecked=2142, Total=4970 [2022-11-26 00:27:07,316 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 2 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 512 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 307 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-26 00:27:07,317 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 223 Invalid, 512 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 195 Invalid, 0 Unknown, 307 Unchecked, 0.2s Time] [2022-11-26 00:27:07,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-11-26 00:27:07,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2022-11-26 00:27:07,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 46 states have (on average 1.1956521739130435) internal successors, (55), 46 states have internal predecessors, (55), 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-26 00:27:07,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 65 transitions. [2022-11-26 00:27:07,338 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 65 transitions. Word has length 32 [2022-11-26 00:27:07,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:27:07,339 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 65 transitions. [2022-11-26 00:27:07,339 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-26 00:27:07,339 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 65 transitions. [2022-11-26 00:27:07,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-11-26 00:27:07,340 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:27:07,340 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-26 00:27:07,347 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13b6cc96-6476-4ea8-bd16-bb8e5a4c06c8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-11-26 00:27:07,546 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13b6cc96-6476-4ea8-bd16-bb8e5a4c06c8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:27:07,546 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-26 00:27:07,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:27:07,547 INFO L85 PathProgramCache]: Analyzing trace with hash 909229690, now seen corresponding path program 2 times [2022-11-26 00:27:07,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:27:07,547 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922871130] [2022-11-26 00:27:07,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:27:07,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:27:07,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:27:09,901 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-26 00:27:09,901 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:27:09,901 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922871130] [2022-11-26 00:27:09,901 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1922871130] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:27:09,901 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1733732008] [2022-11-26 00:27:09,902 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-26 00:27:09,902 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:27:09,902 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13b6cc96-6476-4ea8-bd16-bb8e5a4c06c8/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:27:09,903 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13b6cc96-6476-4ea8-bd16-bb8e5a4c06c8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:27:09,905 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13b6cc96-6476-4ea8-bd16-bb8e5a4c06c8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-26 00:27:10,266 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-26 00:27:10,267 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-26 00:27:10,271 INFO L263 TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 140 conjunts are in the unsatisfiable core [2022-11-26 00:27:10,277 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:27:10,296 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-26 00:27:10,350 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-26 00:27:10,459 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-26 00:27:10,459 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-26 00:27:10,614 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-26 00:27:10,679 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-26 00:27:10,776 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-11-26 00:27:10,776 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-26 00:27:10,883 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-26 00:27:10,899 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-26 00:27:11,036 INFO L321 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-11-26 00:27:11,037 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-26 00:27:11,042 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-26 00:27:11,173 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-26 00:27:11,173 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-26 00:27:11,180 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-26 00:27:11,186 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-26 00:27:11,315 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:27:11,316 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-26 00:27:11,331 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:27:11,341 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-26 00:27:11,341 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-26 00:27:11,362 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-11-26 00:27:11,362 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-26 00:27:11,369 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-26 00:27:11,381 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:27:11,382 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:27:11,394 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-11-26 00:27:11,394 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-26 00:27:11,975 INFO L321 Elim1Store]: treesize reduction 111, result has 14.0 percent of original size [2022-11-26 00:27:11,975 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-26 00:27:12,010 INFO L321 Elim1Store]: treesize reduction 66, result has 19.5 percent of original size [2022-11-26 00:27:12,010 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-26 00:27:12,022 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-26 00:27:12,030 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-26 00:27:12,036 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:27:12,037 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-26 00:27:12,172 INFO L321 Elim1Store]: treesize reduction 29, result has 12.1 percent of original size [2022-11-26 00:27:12,172 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-26 00:27:12,177 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-26 00:27:12,253 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-26 00:27:12,256 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-26 00:27:12,256 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:27:12,424 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-26 00:27:12,450 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-26 00:27:12,469 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-26 00:27:12,817 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-26 00:27:12,820 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1733732008] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:27:12,820 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [714104206] [2022-11-26 00:27:12,824 INFO L159 IcfgInterpreter]: Started Sifa with 22 locations of interest [2022-11-26 00:27:12,824 INFO L166 IcfgInterpreter]: Building call graph [2022-11-26 00:27:12,824 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-26 00:27:12,825 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-26 00:27:12,825 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-26 00:27:12,838 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:27:12,853 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-26 00:27:12,853 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-26 00:27:12,862 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:27:12,863 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-26 00:27:12,890 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-26 00:27:12,894 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-26 00:27:12,904 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:27:12,904 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-26 00:27:12,914 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:27:12,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 22 treesize of output 7 [2022-11-26 00:27:12,920 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:27:12,921 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-26 00:27:12,940 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:27:12,940 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-26 00:27:12,953 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:27:12,954 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-26 00:27:12,985 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:27:12,986 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-26 00:27:12,995 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:27:12,995 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-26 00:27:13,050 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-26 00:27:13,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-26 00:27:13,079 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-26 00:27:13,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-26 00:27:13,100 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-26 00:27:13,129 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-26 00:27:13,138 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-26 00:27:13,147 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-26 00:27:13,155 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-26 00:27:13,163 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-26 00:27:13,198 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:27:13,199 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-26 00:27:13,209 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-26 00:27:13,219 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-26 00:27:13,276 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-26 00:27:13,285 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-26 00:27:13,295 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-26 00:27:13,304 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-26 00:27:13,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-26 00:27:13,348 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-26 00:27:13,357 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-26 00:27:13,366 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-26 00:27:13,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-26 00:27:13,384 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-26 00:27:13,439 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:27:13,441 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:27:13,441 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-26 00:27:13,453 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:27:13,455 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-26 00:27:13,467 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:27:13,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 235 treesize of output 114 [2022-11-26 00:27:13,551 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-26 00:27:13,560 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-26 00:27:13,569 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-26 00:27:13,580 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-26 00:27:13,592 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-26 00:27:13,629 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-26 00:27:13,639 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-26 00:27:13,651 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-26 00:27:13,660 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-26 00:27:13,669 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-26 00:27:13,753 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-26 00:27:13,754 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-26 00:27:13,769 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-26 00:27:13,803 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-26 00:27:13,804 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-26 00:27:13,876 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-26 00:27:13,892 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-26 00:27:13,906 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:27:13,908 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:27:13,914 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-26 00:27:13,915 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-26 00:27:13,933 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-26 00:27:13,947 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:27:13,950 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:27:13,956 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-26 00:27:13,957 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-26 00:27:14,017 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-26 00:27:14,033 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:27:14,039 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:27:14,045 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-26 00:27:14,046 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-26 00:27:14,062 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-26 00:27:14,074 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-26 00:27:14,089 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:27:14,092 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:27:14,098 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-26 00:27:14,099 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-26 00:27:14,409 INFO L321 Elim1Store]: treesize reduction 21, result has 41.7 percent of original size [2022-11-26 00:27:14,409 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-26 00:27:14,422 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:27:14,500 INFO L321 Elim1Store]: treesize reduction 117, result has 32.4 percent of original size [2022-11-26 00:27:14,501 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-26 00:27:14,568 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:27:14,580 INFO L321 Elim1Store]: treesize reduction 13, result has 38.1 percent of original size [2022-11-26 00:27:14,581 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-26 00:27:14,592 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-26 00:27:14,614 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:27:14,692 INFO L321 Elim1Store]: treesize reduction 117, result has 32.4 percent of original size [2022-11-26 00:27:14,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-26 00:27:14,763 INFO L321 Elim1Store]: treesize reduction 39, result has 48.7 percent of original size [2022-11-26 00:27:14,763 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-26 00:27:14,780 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-26 00:27:14,796 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-26 00:27:14,822 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-26 00:27:14,822 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-26 00:27:14,840 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:27:14,842 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:27:14,842 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-26 00:27:14,881 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-26 00:27:14,881 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-26 00:27:14,893 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-26 00:27:14,904 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-26 00:27:16,626 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 13 for LOIs [2022-11-26 00:27:16,632 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-26 00:27:16,636 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-26 00:27:16,647 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:27:16,647 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-26 00:27:16,656 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:27:16,656 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-26 00:27:16,663 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:27:16,663 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-26 00:27:16,665 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-26 00:27:23,344 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2594#(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-26 00:27:23,344 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-26 00:27:23,344 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-26 00:27:23,344 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 38 [2022-11-26 00:27:23,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790129387] [2022-11-26 00:27:23,345 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-26 00:27:23,345 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-11-26 00:27:23,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:27:23,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-11-26 00:27:23,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=198, Invalid=3441, Unknown=37, NotChecked=484, Total=4160 [2022-11-26 00:27:23,347 INFO L87 Difference]: Start difference. First operand 53 states and 65 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-26 00:27:25,923 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-26 00:27:28,193 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-26 00:27:32,574 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-26 00:27:34,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:27:34,256 INFO L93 Difference]: Finished difference Result 97 states and 123 transitions. [2022-11-26 00:27:34,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-11-26 00:27:34,256 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-26 00:27:34,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:27:34,257 INFO L225 Difference]: With dead ends: 97 [2022-11-26 00:27:34,257 INFO L226 Difference]: Without dead ends: 95 [2022-11-26 00:27:34,258 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 43 SyntacticMatches, 2 SemanticMatches, 85 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 1553 ImplicationChecksByTransitivity, 12.6s TimeCoverageRelationStatistics Valid=499, Invalid=6286, Unknown=37, NotChecked=660, Total=7482 [2022-11-26 00:27:34,259 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 386 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 900 mSolverCounterSat, 46 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 386 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 949 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 900 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.2s IncrementalHoareTripleChecker+Time [2022-11-26 00:27:34,259 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [386 Valid, 341 Invalid, 949 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 900 Invalid, 3 Unknown, 0 Unchecked, 7.2s Time] [2022-11-26 00:27:34,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2022-11-26 00:27:34,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 63. [2022-11-26 00:27:34,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 54 states have (on average 1.2222222222222223) internal successors, (66), 54 states have internal predecessors, (66), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-11-26 00:27:34,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 80 transitions. [2022-11-26 00:27:34,297 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 80 transitions. Word has length 34 [2022-11-26 00:27:34,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:27:34,297 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 80 transitions. [2022-11-26 00:27:34,297 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-26 00:27:34,297 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 80 transitions. [2022-11-26 00:27:34,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-11-26 00:27:34,298 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:27:34,299 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-26 00:27:34,307 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13b6cc96-6476-4ea8-bd16-bb8e5a4c06c8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-26 00:27:34,503 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13b6cc96-6476-4ea8-bd16-bb8e5a4c06c8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:27:34,503 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-26 00:27:34,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:27:34,504 INFO L85 PathProgramCache]: Analyzing trace with hash -1496251498, now seen corresponding path program 1 times [2022-11-26 00:27:34,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:27:34,504 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572993374] [2022-11-26 00:27:34,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:27:34,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:27:34,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:27:34,902 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-26 00:27:34,903 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:27:34,903 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572993374] [2022-11-26 00:27:34,903 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [572993374] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:27:34,903 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1819746397] [2022-11-26 00:27:34,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:27:34,903 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:27:34,903 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13b6cc96-6476-4ea8-bd16-bb8e5a4c06c8/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:27:34,905 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13b6cc96-6476-4ea8-bd16-bb8e5a4c06c8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:27:34,935 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13b6cc96-6476-4ea8-bd16-bb8e5a4c06c8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-26 00:27:35,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:27:35,120 INFO L263 TraceCheckSpWp]: Trace formula consists of 414 conjuncts, 49 conjunts are in the unsatisfiable core [2022-11-26 00:27:35,122 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:27:35,869 INFO L321 Elim1Store]: treesize reduction 80, result has 79.6 percent of original size [2022-11-26 00:27:35,870 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-26 00:27:36,231 INFO L321 Elim1Store]: treesize reduction 72, result has 78.6 percent of original size [2022-11-26 00:27:36,232 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