./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/list-simple/sll2n_append_equal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5e519f3a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cd72669-52b2-4744-a5dd-aea796699620/bin/utaipan-7li7fVZpFI/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cd72669-52b2-4744-a5dd-aea796699620/bin/utaipan-7li7fVZpFI/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cd72669-52b2-4744-a5dd-aea796699620/bin/utaipan-7li7fVZpFI/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cd72669-52b2-4744-a5dd-aea796699620/bin/utaipan-7li7fVZpFI/config/TaipanReach.xml -i ../../sv-benchmarks/c/list-simple/sll2n_append_equal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cd72669-52b2-4744-a5dd-aea796699620/bin/utaipan-7li7fVZpFI/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cd72669-52b2-4744-a5dd-aea796699620/bin/utaipan-7li7fVZpFI --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 f218eac2d2b52810cb44bb8b3f3f80463ec7e46c8818b20f079ed947cc8e9fd0 --- 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-5e519f3 [2022-11-03 02:41:25,956 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-03 02:41:25,959 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-03 02:41:25,994 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-03 02:41:25,995 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-03 02:41:25,996 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-03 02:41:25,998 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-03 02:41:26,000 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-03 02:41:26,002 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-03 02:41:26,004 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-03 02:41:26,005 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-03 02:41:26,006 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-03 02:41:26,007 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-03 02:41:26,008 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-03 02:41:26,010 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-03 02:41:26,012 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-03 02:41:26,019 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-03 02:41:26,020 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-03 02:41:26,022 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-03 02:41:26,025 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-03 02:41:26,027 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-03 02:41:26,033 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-03 02:41:26,035 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-03 02:41:26,036 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-03 02:41:26,041 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-03 02:41:26,042 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-03 02:41:26,042 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-03 02:41:26,044 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-03 02:41:26,055 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-03 02:41:26,057 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-03 02:41:26,057 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-03 02:41:26,058 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-03 02:41:26,059 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-03 02:41:26,060 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-03 02:41:26,062 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-03 02:41:26,062 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-03 02:41:26,063 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-03 02:41:26,063 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-03 02:41:26,064 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-03 02:41:26,065 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-03 02:41:26,066 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-03 02:41:26,070 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cd72669-52b2-4744-a5dd-aea796699620/bin/utaipan-7li7fVZpFI/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-11-03 02:41:26,128 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-03 02:41:26,128 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-03 02:41:26,129 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-03 02:41:26,129 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-03 02:41:26,130 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-03 02:41:26,130 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-03 02:41:26,130 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-03 02:41:26,130 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-03 02:41:26,130 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-03 02:41:26,131 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-03 02:41:26,131 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-03 02:41:26,131 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-03 02:41:26,131 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-03 02:41:26,132 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-03 02:41:26,132 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-03 02:41:26,132 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-03 02:41:26,132 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-03 02:41:26,132 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-03 02:41:26,133 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-03 02:41:26,134 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-03 02:41:26,134 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-03 02:41:26,134 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-03 02:41:26,134 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-03 02:41:26,134 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-03 02:41:26,135 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-03 02:41:26,135 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-03 02:41:26,135 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-03 02:41:26,135 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-03 02:41:26,136 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-03 02:41:26,136 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-03 02:41:26,136 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-03 02:41:26,142 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-03 02:41:26,142 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 02:41:26,142 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-03 02:41:26,143 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-03 02:41:26,143 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-03 02:41:26,144 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-03 02:41:26,144 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-03 02:41:26,145 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-03 02:41:26,145 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-03 02:41:26,145 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-03 02:41:26,145 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_7cd72669-52b2-4744-a5dd-aea796699620/bin/utaipan-7li7fVZpFI/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_7cd72669-52b2-4744-a5dd-aea796699620/bin/utaipan-7li7fVZpFI 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 -> f218eac2d2b52810cb44bb8b3f3f80463ec7e46c8818b20f079ed947cc8e9fd0 [2022-11-03 02:41:26,586 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-03 02:41:26,657 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-03 02:41:26,660 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-03 02:41:26,662 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-03 02:41:26,663 INFO L275 PluginConnector]: CDTParser initialized [2022-11-03 02:41:26,664 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cd72669-52b2-4744-a5dd-aea796699620/bin/utaipan-7li7fVZpFI/../../sv-benchmarks/c/list-simple/sll2n_append_equal.i [2022-11-03 02:41:26,782 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cd72669-52b2-4744-a5dd-aea796699620/bin/utaipan-7li7fVZpFI/data/1e523f523/73ca81aa125849a69c19e8ab9a8d293f/FLAG16a7f98cf [2022-11-03 02:41:27,579 INFO L306 CDTParser]: Found 1 translation units. [2022-11-03 02:41:27,580 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cd72669-52b2-4744-a5dd-aea796699620/sv-benchmarks/c/list-simple/sll2n_append_equal.i [2022-11-03 02:41:27,594 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cd72669-52b2-4744-a5dd-aea796699620/bin/utaipan-7li7fVZpFI/data/1e523f523/73ca81aa125849a69c19e8ab9a8d293f/FLAG16a7f98cf [2022-11-03 02:41:27,610 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cd72669-52b2-4744-a5dd-aea796699620/bin/utaipan-7li7fVZpFI/data/1e523f523/73ca81aa125849a69c19e8ab9a8d293f [2022-11-03 02:41:27,613 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-03 02:41:27,615 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-03 02:41:27,617 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-03 02:41:27,617 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-03 02:41:27,622 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-03 02:41:27,623 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 02:41:27" (1/1) ... [2022-11-03 02:41:27,624 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@52f23ec8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:41:27, skipping insertion in model container [2022-11-03 02:41:27,624 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 02:41:27" (1/1) ... [2022-11-03 02:41:27,634 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-03 02:41:27,672 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-03 02:41:28,061 WARN L230 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_7cd72669-52b2-4744-a5dd-aea796699620/sv-benchmarks/c/list-simple/sll2n_append_equal.i[24197,24210] [2022-11-03 02:41:28,065 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 02:41:28,075 INFO L203 MainTranslator]: Completed pre-run [2022-11-03 02:41:28,125 WARN L230 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_7cd72669-52b2-4744-a5dd-aea796699620/sv-benchmarks/c/list-simple/sll2n_append_equal.i[24197,24210] [2022-11-03 02:41:28,126 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 02:41:28,171 INFO L208 MainTranslator]: Completed translation [2022-11-03 02:41:28,175 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:41:28 WrapperNode [2022-11-03 02:41:28,175 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-03 02:41:28,177 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-03 02:41:28,177 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-03 02:41:28,177 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-03 02:41:28,189 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:41:28" (1/1) ... [2022-11-03 02:41:28,210 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:41:28" (1/1) ... [2022-11-03 02:41:28,242 INFO L138 Inliner]: procedures = 127, calls = 33, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 118 [2022-11-03 02:41:28,243 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-03 02:41:28,244 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-03 02:41:28,244 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-03 02:41:28,245 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-03 02:41:28,256 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:41:28" (1/1) ... [2022-11-03 02:41:28,257 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:41:28" (1/1) ... [2022-11-03 02:41:28,261 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:41:28" (1/1) ... [2022-11-03 02:41:28,262 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:41:28" (1/1) ... [2022-11-03 02:41:28,270 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:41:28" (1/1) ... [2022-11-03 02:41:28,275 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:41:28" (1/1) ... [2022-11-03 02:41:28,277 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:41:28" (1/1) ... [2022-11-03 02:41:28,279 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:41:28" (1/1) ... [2022-11-03 02:41:28,282 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-03 02:41:28,283 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-03 02:41:28,283 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-03 02:41:28,284 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-03 02:41:28,285 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:41:28" (1/1) ... [2022-11-03 02:41:28,294 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 02:41:28,310 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cd72669-52b2-4744-a5dd-aea796699620/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:41:28,324 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cd72669-52b2-4744-a5dd-aea796699620/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-03 02:41:28,350 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cd72669-52b2-4744-a5dd-aea796699620/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-03 02:41:28,393 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-03 02:41:28,393 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-03 02:41:28,394 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2022-11-03 02:41:28,394 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2022-11-03 02:41:28,394 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-03 02:41:28,394 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-03 02:41:28,395 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-03 02:41:28,395 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-03 02:41:28,396 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-03 02:41:28,397 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-03 02:41:28,397 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-03 02:41:28,397 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-03 02:41:28,397 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-03 02:41:28,398 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-03 02:41:28,635 INFO L235 CfgBuilder]: Building ICFG [2022-11-03 02:41:28,638 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-03 02:41:28,990 INFO L276 CfgBuilder]: Performing block encoding [2022-11-03 02:41:29,034 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-03 02:41:29,035 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2022-11-03 02:41:29,038 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 02:41:29 BoogieIcfgContainer [2022-11-03 02:41:29,038 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-03 02:41:29,042 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-03 02:41:29,042 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-03 02:41:29,047 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-03 02:41:29,047 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.11 02:41:27" (1/3) ... [2022-11-03 02:41:29,048 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ac859ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 02:41:29, skipping insertion in model container [2022-11-03 02:41:29,048 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:41:28" (2/3) ... [2022-11-03 02:41:29,049 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ac859ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 02:41:29, skipping insertion in model container [2022-11-03 02:41:29,049 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 02:41:29" (3/3) ... [2022-11-03 02:41:29,051 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2n_append_equal.i [2022-11-03 02:41:29,077 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-03 02:41:29,077 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-03 02:41:29,190 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-03 02:41:29,199 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;@6121d6c2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-03 02:41:29,199 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-03 02:41:29,205 INFO L276 IsEmpty]: Start isEmpty. Operand has 23 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 19 states have internal predecessors, (28), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-03 02:41:29,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-03 02:41:29,215 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:41:29,216 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:41:29,217 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:41:29,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:41:29,224 INFO L85 PathProgramCache]: Analyzing trace with hash -1022250339, now seen corresponding path program 1 times [2022-11-03 02:41:29,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:41:29,237 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705915002] [2022-11-03 02:41:29,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:41:29,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:41:29,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:41:29,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:41:29,802 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:41:29,803 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705915002] [2022-11-03 02:41:29,803 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [705915002] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:41:29,804 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:41:29,805 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 02:41:29,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666197461] [2022-11-03 02:41:29,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:41:29,815 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 02:41:29,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:41:29,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 02:41:29,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 02:41:29,868 INFO L87 Difference]: Start difference. First operand has 23 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 19 states have internal predecessors, (28), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-03 02:41:29,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:41:29,942 INFO L93 Difference]: Finished difference Result 45 states and 63 transitions. [2022-11-03 02:41:29,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 02:41:29,945 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-11-03 02:41:29,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:41:29,954 INFO L225 Difference]: With dead ends: 45 [2022-11-03 02:41:29,954 INFO L226 Difference]: Without dead ends: 22 [2022-11-03 02:41:29,958 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-03 02:41:29,962 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 1 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-03 02:41:29,964 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 45 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-03 02:41:29,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-11-03 02:41:30,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 20. [2022-11-03 02:41:30,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 16 states have (on average 1.3125) internal successors, (21), 16 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-03 02:41:30,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 25 transitions. [2022-11-03 02:41:30,021 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 25 transitions. Word has length 12 [2022-11-03 02:41:30,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:41:30,022 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 25 transitions. [2022-11-03 02:41:30,023 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-03 02:41:30,023 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 25 transitions. [2022-11-03 02:41:30,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-03 02:41:30,026 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:41:30,027 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:41:30,028 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-03 02:41:30,028 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:41:30,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:41:30,029 INFO L85 PathProgramCache]: Analyzing trace with hash -806168688, now seen corresponding path program 1 times [2022-11-03 02:41:30,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:41:30,030 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135813183] [2022-11-03 02:41:30,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:41:30,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:41:30,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:41:30,405 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-03 02:41:30,406 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:41:30,407 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135813183] [2022-11-03 02:41:30,407 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [135813183] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:41:30,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [293292169] [2022-11-03 02:41:30,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:41:30,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:41:30,409 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cd72669-52b2-4744-a5dd-aea796699620/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:41:30,412 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cd72669-52b2-4744-a5dd-aea796699620/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:41:30,432 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cd72669-52b2-4744-a5dd-aea796699620/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-03 02:41:30,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:41:30,589 INFO L263 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-03 02:41:30,596 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:41:30,691 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:41:30,691 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:41:30,760 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-03 02:41:30,760 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [293292169] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:41:30,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1341635503] [2022-11-03 02:41:30,828 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2022-11-03 02:41:30,829 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 02:41:30,840 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 02:41:30,848 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 02:41:30,850 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 02:41:30,997 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:41:31,032 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-03 02:41:31,034 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:41:31,077 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:41:31,104 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-03 02:41:31,105 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:41:31,256 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:41:31,272 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:41:31,312 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:41:31,315 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:41:31,330 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:41:31,333 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 20 treesize of output 9 [2022-11-03 02:41:31,348 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:41:31,350 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 20 treesize of output 9 [2022-11-03 02:41:31,429 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:41:31,432 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:41:31,453 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:41:31,454 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:41:31,614 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:41:31,616 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:41:31,639 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:41:31,641 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:41:31,798 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:41:31,799 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2022-11-03 02:41:31,827 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:41:31,829 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2022-11-03 02:41:31,848 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:41:31,852 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2022-11-03 02:41:31,985 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:41:32,000 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:41:32,014 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:41:32,037 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:41:32,055 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:41:32,173 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:41:32,189 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:41:32,202 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:41:32,215 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:41:32,236 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:41:32,394 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:41:32,396 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 222 treesize of output 202 [2022-11-03 02:41:32,424 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:41:32,426 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 216 treesize of output 204 [2022-11-03 02:41:32,449 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:41:32,451 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 220 treesize of output 208 [2022-11-03 02:41:32,598 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:41:32,611 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:41:32,632 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:41:32,647 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:41:32,661 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:41:32,732 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:41:32,746 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:41:32,767 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:41:32,782 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:41:32,796 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:41:32,922 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:41:32,935 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 222 treesize of output 202 [2022-11-03 02:41:32,959 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:41:32,962 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 216 treesize of output 204 [2022-11-03 02:41:32,982 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:41:32,988 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 220 treesize of output 208 [2022-11-03 02:41:33,314 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:41:33,336 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:41:33,485 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:41:33,511 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:41:33,617 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 19 treesize of output 11 [2022-11-03 02:41:33,632 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 19 treesize of output 11 [2022-11-03 02:41:33,645 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:41:33,980 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 11 for LOIs [2022-11-03 02:41:33,991 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:41:33,998 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:41:34,031 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:41:34,033 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:41:34,042 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:41:34,043 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 20 treesize of output 9 [2022-11-03 02:41:34,053 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:41:34,054 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 20 treesize of output 9 [2022-11-03 02:41:34,057 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 02:41:37,009 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '229#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_append_~head#1.base|) |ULTIMATE.start_sll_append_~head#1.offset|) |ULTIMATE.start_sll_append_~new_last~0#1.offset|) (<= 0 |ULTIMATE.start_sll_append_~head#1.offset|) (<= 1 |ULTIMATE.start_sll_create_#in~data#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_append_~data#1| 1) (<= |ULTIMATE.start_sll_create_#in~data#1| 1) (or (not (= |ULTIMATE.start_main_~ptr~0#1.base| 0)) (not (= |ULTIMATE.start_main_~ptr~0#1.offset| 0))) (<= 0 |ULTIMATE.start_sll_append_~head#1.base|) (<= |ULTIMATE.start_sll_create_~head~0#1.offset| 0) (<= 0 |ULTIMATE.start_sll_append_#in~head#1.offset|) (= |ULTIMATE.start_main_~temp~2#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~ptr~0#1.base|) (+ |ULTIMATE.start_main_~ptr~0#1.offset| 4))) (<= |ULTIMATE.start_sll_create_~len#1| 0) (<= |ULTIMATE.start_sll_create_#res#1.offset| 0) (= |ULTIMATE.start_main_~count~0#1| 0) (<= 1 |ULTIMATE.start_sll_create_~data#1|) (<= |ULTIMATE.start_sll_append_#in~data#1| 1) (<= 0 |ULTIMATE.start_sll_append_#in~head#1.base|) (<= |ULTIMATE.start_sll_append_#in~head#1.offset| 0) (not (= |ULTIMATE.start_main_~data~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~ptr~0#1.base|) |ULTIMATE.start_main_~ptr~0#1.offset|))) (= |ULTIMATE.start_main_~data~0#1| 1) (<= 1 |ULTIMATE.start_sll_append_~data#1|) (<= |ULTIMATE.start_sll_create_~data#1| 1) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_append_~head#1.base|) |ULTIMATE.start_sll_append_~head#1.offset|) |ULTIMATE.start_sll_append_~new_last~0#1.base|) (<= |ULTIMATE.start_sll_create_#in~len#1| 2) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (<= 0 |ULTIMATE.start_sll_create_~len#1|) (= |ULTIMATE.start_main_~len~0#1| 2) (= |#NULL.offset| 0) (<= 0 |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_sll_append_~new_last~0#1.offset| 0) (<= |ULTIMATE.start_sll_append_~head#1.offset| 0) (<= 0 |ULTIMATE.start_sll_create_#res#1.offset|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~ptr~0#1.base|) (+ |ULTIMATE.start_main_~ptr~0#1.offset| 4)) |ULTIMATE.start_main_~temp~2#1.offset|) (<= 0 |#StackHeapBarrier|) (<= 2 |ULTIMATE.start_sll_create_#in~len#1|) (<= 0 |ULTIMATE.start_sll_create_~head~0#1.offset|) (<= 1 |ULTIMATE.start_sll_append_#in~data#1|) (= |#NULL.base| 0))' at error location [2022-11-03 02:41:37,010 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-03 02:41:37,010 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 02:41:37,010 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2022-11-03 02:41:37,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081931470] [2022-11-03 02:41:37,011 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 02:41:37,012 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-03 02:41:37,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:41:37,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-03 02:41:37,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2022-11-03 02:41:37,017 INFO L87 Difference]: Start difference. First operand 20 states and 25 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-11-03 02:41:37,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:41:37,088 INFO L93 Difference]: Finished difference Result 38 states and 48 transitions. [2022-11-03 02:41:37,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-03 02:41:37,089 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 18 [2022-11-03 02:41:37,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:41:37,091 INFO L225 Difference]: With dead ends: 38 [2022-11-03 02:41:37,092 INFO L226 Difference]: Without dead ends: 23 [2022-11-03 02:41:37,093 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 38 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2022-11-03 02:41:37,094 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 2 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 02:41:37,094 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 70 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 02:41:37,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-11-03 02:41:37,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-11-03 02:41:37,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 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-03 02:41:37,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 29 transitions. [2022-11-03 02:41:37,107 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 29 transitions. Word has length 18 [2022-11-03 02:41:37,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:41:37,108 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 29 transitions. [2022-11-03 02:41:37,108 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-11-03 02:41:37,108 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 29 transitions. [2022-11-03 02:41:37,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-03 02:41:37,110 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:41:37,110 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:41:37,161 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cd72669-52b2-4744-a5dd-aea796699620/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-03 02:41:37,326 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cd72669-52b2-4744-a5dd-aea796699620/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2022-11-03 02:41:37,327 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:41:37,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:41:37,328 INFO L85 PathProgramCache]: Analyzing trace with hash -2030880189, now seen corresponding path program 2 times [2022-11-03 02:41:37,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:41:37,328 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237638726] [2022-11-03 02:41:37,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:41:37,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:41:37,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:41:37,929 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-03 02:41:37,929 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:41:37,930 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237638726] [2022-11-03 02:41:37,930 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1237638726] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:41:37,930 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [850378252] [2022-11-03 02:41:37,930 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 02:41:37,930 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:41:37,930 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cd72669-52b2-4744-a5dd-aea796699620/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:41:37,936 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cd72669-52b2-4744-a5dd-aea796699620/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:41:37,972 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cd72669-52b2-4744-a5dd-aea796699620/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-03 02:41:38,094 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-11-03 02:41:38,095 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 02:41:38,122 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 56 conjunts are in the unsatisfiable core [2022-11-03 02:41:38,126 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:41:38,374 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:41:38,584 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:41:38,593 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:41:38,595 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:41:38,610 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:41:38,666 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 28 treesize of output 16 [2022-11-03 02:41:38,671 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:41:38,719 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:41:38,754 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-03 02:41:38,754 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 02:41:38,755 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [850378252] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:41:38,755 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-03 02:41:38,755 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [13] total 22 [2022-11-03 02:41:38,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505609677] [2022-11-03 02:41:38,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:41:38,756 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-03 02:41:38,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:41:38,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-03 02:41:38,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=411, Unknown=0, NotChecked=0, Total=462 [2022-11-03 02:41:38,758 INFO L87 Difference]: Start difference. First operand 23 states and 29 transitions. Second operand has 11 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 10 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-03 02:41:39,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:41:39,296 INFO L93 Difference]: Finished difference Result 36 states and 43 transitions. [2022-11-03 02:41:39,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-03 02:41:39,298 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 10 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 24 [2022-11-03 02:41:39,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:41:39,299 INFO L225 Difference]: With dead ends: 36 [2022-11-03 02:41:39,299 INFO L226 Difference]: Without dead ends: 34 [2022-11-03 02:41:39,300 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=97, Invalid=659, Unknown=0, NotChecked=0, Total=756 [2022-11-03 02:41:39,301 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 54 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 02:41:39,301 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 57 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 02:41:39,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-11-03 02:41:39,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 26. [2022-11-03 02:41:39,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 21 states have internal predecessors, (27), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-03 02:41:39,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2022-11-03 02:41:39,327 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 33 transitions. Word has length 24 [2022-11-03 02:41:39,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:41:39,328 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 33 transitions. [2022-11-03 02:41:39,328 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 10 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-03 02:41:39,328 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 33 transitions. [2022-11-03 02:41:39,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-03 02:41:39,329 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:41:39,330 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:41:39,373 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cd72669-52b2-4744-a5dd-aea796699620/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-03 02:41:39,544 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cd72669-52b2-4744-a5dd-aea796699620/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:41:39,545 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:41:39,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:41:39,546 INFO L85 PathProgramCache]: Analyzing trace with hash -2030824203, now seen corresponding path program 1 times [2022-11-03 02:41:39,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:41:39,546 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073197745] [2022-11-03 02:41:39,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:41:39,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:41:39,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:41:39,887 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-03 02:41:39,888 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:41:39,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073197745] [2022-11-03 02:41:39,889 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2073197745] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:41:39,890 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:41:39,890 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-03 02:41:39,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528797993] [2022-11-03 02:41:39,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:41:39,891 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-03 02:41:39,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:41:39,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-03 02:41:39,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-11-03 02:41:39,892 INFO L87 Difference]: Start difference. First operand 26 states and 33 transitions. Second operand has 9 states, 7 states have (on average 2.0) internal successors, (14), 8 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-03 02:41:40,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:41:40,035 INFO L93 Difference]: Finished difference Result 34 states and 41 transitions. [2022-11-03 02:41:40,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-03 02:41:40,036 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 2.0) internal successors, (14), 8 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 24 [2022-11-03 02:41:40,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:41:40,041 INFO L225 Difference]: With dead ends: 34 [2022-11-03 02:41:40,041 INFO L226 Difference]: Without dead ends: 31 [2022-11-03 02:41:40,042 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2022-11-03 02:41:40,046 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 33 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 02:41:40,048 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 75 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 02:41:40,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-11-03 02:41:40,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 26. [2022-11-03 02:41:40,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 21 states have internal predecessors, (26), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-03 02:41:40,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 32 transitions. [2022-11-03 02:41:40,068 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 32 transitions. Word has length 24 [2022-11-03 02:41:40,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:41:40,068 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 32 transitions. [2022-11-03 02:41:40,069 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 2.0) internal successors, (14), 8 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-03 02:41:40,069 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 32 transitions. [2022-11-03 02:41:40,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-03 02:41:40,071 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:41:40,071 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:41:40,072 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-03 02:41:40,072 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:41:40,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:41:40,073 INFO L85 PathProgramCache]: Analyzing trace with hash -1760674786, now seen corresponding path program 1 times [2022-11-03 02:41:40,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:41:40,073 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939951376] [2022-11-03 02:41:40,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:41:40,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:41:40,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:41:40,655 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-03 02:41:40,656 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:41:40,656 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939951376] [2022-11-03 02:41:40,656 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1939951376] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:41:40,656 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2072498748] [2022-11-03 02:41:40,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:41:40,657 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:41:40,657 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cd72669-52b2-4744-a5dd-aea796699620/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:41:40,661 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cd72669-52b2-4744-a5dd-aea796699620/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:41:40,693 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cd72669-52b2-4744-a5dd-aea796699620/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-03 02:41:40,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:41:40,840 INFO L263 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 32 conjunts are in the unsatisfiable core [2022-11-03 02:41:40,843 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:41:40,998 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:41:41,041 WARN L855 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (exists ((v_ArrVal_384 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_384))))) is different from true [2022-11-03 02:41:41,064 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:41:41,065 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:41:41,107 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:41:41,139 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 1 not checked. [2022-11-03 02:41:41,139 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:41:41,214 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_node_create_~temp~0#1.base_17| Int) (v_ArrVal_387 (Array Int Int))) (or (not (= (select (select (store |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_17| v_ArrVal_387) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0)) (not (< |v_node_create_~temp~0#1.base_17| |c_#StackHeapBarrier|)))) is different from false [2022-11-03 02:41:41,217 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2072498748] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:41:41,217 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [793482364] [2022-11-03 02:41:41,228 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2022-11-03 02:41:41,229 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 02:41:41,229 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 02:41:41,229 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 02:41:41,230 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 02:41:41,251 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:41:41,267 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-03 02:41:41,268 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:41:41,281 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:41:41,301 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-03 02:41:41,302 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:41:41,346 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:41:41,354 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:41:41,369 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:41:41,370 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:41:41,378 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:41:41,379 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 20 treesize of output 9 [2022-11-03 02:41:41,386 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:41:41,388 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 20 treesize of output 9 [2022-11-03 02:41:41,416 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:41:41,417 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:41:41,431 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:41:41,432 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:41:41,483 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:41:41,485 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:41:41,503 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:41:41,505 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:41:41,555 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 13 [2022-11-03 02:41:41,571 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 13 [2022-11-03 02:41:41,586 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:41:41,588 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2022-11-03 02:41:41,669 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:41:41,679 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:41:41,691 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:41:41,705 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:41:41,718 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:41:41,774 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:41:41,785 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:41:41,801 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:41:41,816 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:41:41,830 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:41:41,940 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:41:41,941 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:41:41,943 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 226 treesize of output 206 [2022-11-03 02:41:41,962 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:41:41,963 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 220 treesize of output 206 [2022-11-03 02:41:41,991 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:41:41,992 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 222 treesize of output 208 [2022-11-03 02:41:42,108 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:41:42,122 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:41:42,134 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:41:42,146 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:41:42,161 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:41:42,208 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:41:42,219 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:41:42,244 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:41:42,256 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:41:42,270 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:41:42,380 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:41:42,381 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:41:42,382 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 226 treesize of output 206 [2022-11-03 02:41:42,400 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:41:42,401 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 220 treesize of output 206 [2022-11-03 02:41:42,417 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:41:42,419 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 222 treesize of output 208 [2022-11-03 02:41:42,640 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:41:42,670 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:41:42,803 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:41:42,818 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:41:42,894 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:41:42,908 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 19 treesize of output 11 [2022-11-03 02:41:42,931 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 19 treesize of output 11 [2022-11-03 02:41:43,395 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 11 for LOIs [2022-11-03 02:41:43,406 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:41:43,412 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:41:43,426 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:41:43,427 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 20 treesize of output 9 [2022-11-03 02:41:43,441 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:41:43,442 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:41:43,450 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:41:43,452 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 20 treesize of output 9 [2022-11-03 02:41:43,454 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 02:41:47,271 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '743#(and (<= 0 |ULTIMATE.start_main_~count~0#1|) (<= 0 |ULTIMATE.start_sll_append_~head#1.offset|) (<= 1 |ULTIMATE.start_sll_create_#in~data#1|) (<= |ULTIMATE.start_sll_append_~data#1| 1) (<= |ULTIMATE.start_sll_create_#in~data#1| 1) (or (not (= |ULTIMATE.start_main_~ptr~0#1.base| 0)) (not (= |ULTIMATE.start_main_~ptr~0#1.offset| 0))) (<= 0 |ULTIMATE.start_sll_append_~head#1.base|) (<= |ULTIMATE.start_sll_create_~head~0#1.offset| 0) (<= 0 |ULTIMATE.start_sll_append_#in~head#1.offset|) (= |ULTIMATE.start_main_~temp~2#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~ptr~0#1.base|) (+ |ULTIMATE.start_main_~ptr~0#1.offset| 4))) (<= |ULTIMATE.start_sll_create_~len#1| 0) (<= |ULTIMATE.start_sll_create_#res#1.offset| 0) (<= |#NULL.offset| 0) (<= 1 |ULTIMATE.start_sll_create_~data#1|) (<= |ULTIMATE.start_sll_append_#in~data#1| 1) (<= 0 |ULTIMATE.start_sll_append_#in~head#1.base|) (<= |ULTIMATE.start_sll_append_#in~head#1.offset| 0) (not (= |ULTIMATE.start_main_~data~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~ptr~0#1.base|) |ULTIMATE.start_main_~ptr~0#1.offset|))) (= |ULTIMATE.start_main_~data~0#1| 1) (<= 1 |ULTIMATE.start_sll_append_~data#1|) (<= |ULTIMATE.start_sll_create_~data#1| 1) (<= |ULTIMATE.start_sll_create_#in~len#1| 2) (<= 0 |ULTIMATE.start_sll_create_~len#1|) (= |ULTIMATE.start_main_~len~0#1| 2) (<= |ULTIMATE.start_main_~#s~0#1.offset| 0) (<= 0 |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_sll_append_~new_last~0#1.offset| 0) (<= |ULTIMATE.start_sll_append_~head#1.offset| 0) (<= 0 |ULTIMATE.start_sll_create_#res#1.offset|) (<= 0 |#NULL.offset|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~ptr~0#1.base|) (+ |ULTIMATE.start_main_~ptr~0#1.offset| 4)) |ULTIMATE.start_main_~temp~2#1.offset|) (<= 0 |#StackHeapBarrier|) (<= 2 |ULTIMATE.start_sll_create_#in~len#1|) (<= 0 |ULTIMATE.start_main_~#s~0#1.offset|) (<= 0 |ULTIMATE.start_sll_create_~head~0#1.offset|) (<= 1 |ULTIMATE.start_sll_append_#in~data#1|) (= |#NULL.base| 0))' at error location [2022-11-03 02:41:47,271 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-03 02:41:47,272 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-03 02:41:47,272 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 20 [2022-11-03 02:41:47,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411105260] [2022-11-03 02:41:47,272 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-03 02:41:47,273 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-11-03 02:41:47,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:41:47,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-03 02:41:47,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=958, Unknown=2, NotChecked=126, Total=1190 [2022-11-03 02:41:47,275 INFO L87 Difference]: Start difference. First operand 26 states and 32 transitions. Second operand has 20 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 states have internal predecessors, (26), 4 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-03 02:41:47,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:41:47,679 INFO L93 Difference]: Finished difference Result 31 states and 38 transitions. [2022-11-03 02:41:47,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-03 02:41:47,680 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 states have internal predecessors, (26), 4 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 26 [2022-11-03 02:41:47,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:41:47,682 INFO L225 Difference]: With dead ends: 31 [2022-11-03 02:41:47,682 INFO L226 Difference]: Without dead ends: 23 [2022-11-03 02:41:47,683 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 328 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=140, Invalid=1272, Unknown=2, NotChecked=146, Total=1560 [2022-11-03 02:41:47,683 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 11 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 23 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 02:41:47,684 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 120 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 152 Invalid, 0 Unknown, 23 Unchecked, 0.2s Time] [2022-11-03 02:41:47,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-11-03 02:41:47,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-11-03 02:41:47,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 18 states have internal predecessors, (22), 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-03 02:41:47,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 28 transitions. [2022-11-03 02:41:47,691 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 28 transitions. Word has length 26 [2022-11-03 02:41:47,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:41:47,692 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 28 transitions. [2022-11-03 02:41:47,692 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 states have internal predecessors, (26), 4 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-03 02:41:47,692 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 28 transitions. [2022-11-03 02:41:47,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-03 02:41:47,693 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:41:47,693 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:41:47,732 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cd72669-52b2-4744-a5dd-aea796699620/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-11-03 02:41:47,904 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cd72669-52b2-4744-a5dd-aea796699620/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:41:47,905 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:41:47,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:41:47,905 INFO L85 PathProgramCache]: Analyzing trace with hash -1230039643, now seen corresponding path program 1 times [2022-11-03 02:41:47,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:41:47,906 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303940703] [2022-11-03 02:41:47,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:41:47,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:41:47,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:41:49,778 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-03 02:41:49,779 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:41:49,779 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303940703] [2022-11-03 02:41:49,779 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [303940703] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:41:49,779 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [860069545] [2022-11-03 02:41:49,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:41:49,780 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:41:49,780 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cd72669-52b2-4744-a5dd-aea796699620/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:41:49,783 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cd72669-52b2-4744-a5dd-aea796699620/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:41:49,804 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cd72669-52b2-4744-a5dd-aea796699620/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-03 02:41:50,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:41:50,112 INFO L263 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 110 conjunts are in the unsatisfiable core [2022-11-03 02:41:50,119 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:41:50,139 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:41:50,215 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:41:50,335 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-03 02:41:50,335 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:41:50,478 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:41:50,553 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:41:50,656 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-03 02:41:50,656 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-03 02:41:50,777 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:41:50,779 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 21 treesize of output 20 [2022-11-03 02:41:51,000 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 37 treesize of output 21 [2022-11-03 02:41:51,007 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:41:51,015 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 02:41:51,022 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:41:51,192 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:41:51,193 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2022-11-03 02:41:51,209 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:41:51,210 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 18 treesize of output 20 [2022-11-03 02:41:51,228 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:41:51,237 INFO L356 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-11-03 02:41:51,238 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 case distinctions, treesize of input 20 treesize of output 18 [2022-11-03 02:41:51,246 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:41:51,247 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 16 [2022-11-03 02:41:51,681 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:41:51,686 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:41:51,686 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 35 [2022-11-03 02:41:51,721 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:41:51,722 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 25 treesize of output 24 [2022-11-03 02:41:51,740 INFO L356 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2022-11-03 02:41:51,740 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 28 treesize of output 23 [2022-11-03 02:41:51,831 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 35 treesize of output 19 [2022-11-03 02:41:51,836 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:41:51,902 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:41:51,947 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-03 02:41:51,947 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:41:55,314 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [860069545] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:41:55,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [642225399] [2022-11-03 02:41:55,317 INFO L159 IcfgInterpreter]: Started Sifa with 18 locations of interest [2022-11-03 02:41:55,317 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 02:41:55,318 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 02:41:55,318 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 02:41:55,318 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 02:41:55,341 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:41:55,369 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-03 02:41:55,369 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:41:55,399 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:41:55,401 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:41:55,441 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:41:55,447 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:41:55,457 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:41:55,459 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 20 treesize of output 9 [2022-11-03 02:41:55,469 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:41:55,470 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:41:55,478 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:41:55,481 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 20 treesize of output 9 [2022-11-03 02:41:55,509 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:41:55,512 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:41:55,525 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:41:55,526 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:41:55,607 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:41:55,608 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:41:55,621 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:41:55,622 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:41:55,696 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:41:55,697 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:41:55,698 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 207 treesize of output 187 [2022-11-03 02:41:55,712 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:41:55,713 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 201 treesize of output 187 [2022-11-03 02:41:55,729 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:41:55,730 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 203 treesize of output 98 [2022-11-03 02:41:55,801 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:41:55,816 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:41:55,828 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:41:55,839 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:41:55,855 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:41:55,906 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:41:55,916 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:41:55,927 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:41:55,938 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:41:55,956 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:41:56,014 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:41:56,026 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:41:56,044 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2022-11-03 02:41:56,162 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 76 treesize of output 58 [2022-11-03 02:41:56,174 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 45 [2022-11-03 02:41:56,355 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 51 [2022-11-03 02:41:56,366 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 70 treesize of output 52 [2022-11-03 02:41:56,432 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:41:56,443 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:41:56,463 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2022-11-03 02:41:56,646 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:41:56,659 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:41:56,750 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:41:56,772 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:41:56,884 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2022-11-03 02:41:56,937 INFO L356 Elim1Store]: treesize reduction 43, result has 14.0 percent of original size [2022-11-03 02:41:56,937 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 36 [2022-11-03 02:41:56,977 INFO L356 Elim1Store]: treesize reduction 43, result has 14.0 percent of original size [2022-11-03 02:41:56,978 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 32 [2022-11-03 02:41:57,128 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 20 for LOIs [2022-11-03 02:41:57,151 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:41:57,166 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:41:57,185 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:41:57,187 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 20 treesize of output 9 [2022-11-03 02:41:57,206 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:41:57,207 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:41:57,221 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:41:57,222 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 20 treesize of output 9 [2022-11-03 02:41:57,230 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 02:42:01,094 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '993#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_append_~head#1.base|) |ULTIMATE.start_sll_append_~head#1.offset|) |ULTIMATE.start_sll_append_~last~0#1.offset|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_append_~head#1.base|) |ULTIMATE.start_sll_append_~head#1.offset|) |ULTIMATE.start_sll_append_~last~0#1.base|) (<= 0 |ULTIMATE.start_sll_append_~head#1.offset|) (<= 1 |ULTIMATE.start_sll_create_#in~data#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_append_~data#1| 1) (<= |ULTIMATE.start_sll_create_#in~data#1| 1) (or (not (= |ULTIMATE.start_main_~ptr~0#1.base| 0)) (not (= |ULTIMATE.start_main_~ptr~0#1.offset| 0))) (<= 0 |ULTIMATE.start_sll_append_~head#1.base|) (<= |ULTIMATE.start_sll_create_~head~0#1.offset| 0) (<= 0 |ULTIMATE.start_sll_append_#in~head#1.offset|) (= |ULTIMATE.start_main_~temp~2#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~ptr~0#1.base|) (+ |ULTIMATE.start_main_~ptr~0#1.offset| 4))) (<= |ULTIMATE.start_sll_create_~len#1| 0) (<= |ULTIMATE.start_sll_create_#res#1.offset| 0) (= |ULTIMATE.start_main_~count~0#1| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_append_~last~0#1.base|) (+ |ULTIMATE.start_sll_append_~last~0#1.offset| 4)) |ULTIMATE.start_sll_append_~new_last~0#1.offset|) (<= 1 |ULTIMATE.start_sll_create_~data#1|) (<= |ULTIMATE.start_sll_append_#in~data#1| 1) (<= 0 |ULTIMATE.start_sll_append_#in~head#1.base|) (= |ULTIMATE.start_sll_append_~new_last~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_append_~last~0#1.base|) (+ |ULTIMATE.start_sll_append_~last~0#1.offset| 4))) (<= |ULTIMATE.start_sll_append_#in~head#1.offset| 0) (not (= |ULTIMATE.start_main_~data~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~ptr~0#1.base|) |ULTIMATE.start_main_~ptr~0#1.offset|))) (= |ULTIMATE.start_main_~data~0#1| 1) (<= 1 |ULTIMATE.start_sll_append_~data#1|) (<= |ULTIMATE.start_sll_create_~data#1| 1) (<= |ULTIMATE.start_sll_create_#in~len#1| 2) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (= |#NULL.offset| 0) (<= 0 |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_sll_append_~new_last~0#1.offset| 0) (<= |ULTIMATE.start_sll_append_~head#1.offset| 0) (<= 0 |ULTIMATE.start_sll_create_#res#1.offset|) (or (not (= |ULTIMATE.start_sll_append_~last~0#1.base| 0)) (not (= |ULTIMATE.start_sll_append_~last~0#1.offset| 0))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~ptr~0#1.base|) (+ |ULTIMATE.start_main_~ptr~0#1.offset| 4)) |ULTIMATE.start_main_~temp~2#1.offset|) (<= 0 |#StackHeapBarrier|) (<= 2 |ULTIMATE.start_sll_create_#in~len#1|) (<= 0 |ULTIMATE.start_sll_create_~head~0#1.offset|) (<= 1 |ULTIMATE.start_sll_append_#in~data#1|) (= |#NULL.base| 0))' at error location [2022-11-03 02:42:01,094 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-03 02:42:01,094 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-03 02:42:01,094 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 21] total 35 [2022-11-03 02:42:01,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863352309] [2022-11-03 02:42:01,094 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-03 02:42:01,095 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-11-03 02:42:01,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:42:01,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-11-03 02:42:01,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=3109, Unknown=2, NotChecked=0, Total=3306 [2022-11-03 02:42:01,097 INFO L87 Difference]: Start difference. First operand 23 states and 28 transitions. Second operand has 35 states, 28 states have (on average 1.3571428571428572) internal successors, (38), 29 states have internal predecessors, (38), 4 states have call successors, (4), 3 states have call predecessors, (4), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-03 02:42:02,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:42:02,649 INFO L93 Difference]: Finished difference Result 37 states and 45 transitions. [2022-11-03 02:42:02,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-03 02:42:02,650 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 28 states have (on average 1.3571428571428572) internal successors, (38), 29 states have internal predecessors, (38), 4 states have call successors, (4), 3 states have call predecessors, (4), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 27 [2022-11-03 02:42:02,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:42:02,651 INFO L225 Difference]: With dead ends: 37 [2022-11-03 02:42:02,651 INFO L226 Difference]: Without dead ends: 34 [2022-11-03 02:42:02,653 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 21 SyntacticMatches, 3 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1196 ImplicationChecksByTransitivity, 9.5s TimeCoverageRelationStatistics Valid=330, Invalid=4359, Unknown=3, NotChecked=0, Total=4692 [2022-11-03 02:42:02,654 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 50 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 443 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 488 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 443 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 24 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-03 02:42:02,655 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 117 Invalid, 488 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 443 Invalid, 0 Unknown, 24 Unchecked, 0.5s Time] [2022-11-03 02:42:02,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-11-03 02:42:02,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 29. [2022-11-03 02:42:02,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 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-03 02:42:02,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2022-11-03 02:42:02,663 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 35 transitions. Word has length 27 [2022-11-03 02:42:02,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:42:02,664 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 35 transitions. [2022-11-03 02:42:02,665 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 28 states have (on average 1.3571428571428572) internal successors, (38), 29 states have internal predecessors, (38), 4 states have call successors, (4), 3 states have call predecessors, (4), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-03 02:42:02,665 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2022-11-03 02:42:02,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-03 02:42:02,666 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:42:02,666 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:42:02,713 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cd72669-52b2-4744-a5dd-aea796699620/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-03 02:42:02,884 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cd72669-52b2-4744-a5dd-aea796699620/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:42:02,885 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:42:02,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:42:02,885 INFO L85 PathProgramCache]: Analyzing trace with hash -952056064, now seen corresponding path program 1 times [2022-11-03 02:42:02,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:42:02,885 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853979717] [2022-11-03 02:42:02,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:42:02,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:42:02,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:42:04,398 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-03 02:42:04,398 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:42:04,398 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853979717] [2022-11-03 02:42:04,399 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [853979717] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:42:04,399 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1974550531] [2022-11-03 02:42:04,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:42:04,399 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:42:04,399 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cd72669-52b2-4744-a5dd-aea796699620/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:42:04,400 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cd72669-52b2-4744-a5dd-aea796699620/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:42:04,402 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cd72669-52b2-4744-a5dd-aea796699620/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-03 02:42:04,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:42:04,752 INFO L263 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 66 conjunts are in the unsatisfiable core [2022-11-03 02:42:04,756 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:42:04,975 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:42:05,130 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 13 treesize of output 9 [2022-11-03 02:42:05,274 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:42:05,275 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 28 treesize of output 31 [2022-11-03 02:42:05,282 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2022-11-03 02:42:05,288 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:42:05,474 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:42:05,489 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-03 02:42:05,490 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 34 treesize of output 40 [2022-11-03 02:42:05,504 INFO L356 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-11-03 02:42:05,505 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2022-11-03 02:42:05,510 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:42:05,511 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 27 [2022-11-03 02:42:05,585 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 18 [2022-11-03 02:42:05,673 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:42:05,673 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 28 treesize of output 25 [2022-11-03 02:42:05,716 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-03 02:42:05,717 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:42:05,908 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_649 (Array Int Int)) (v_ArrVal_648 (Array Int Int)) (|v_node_create_~temp~0#1.base_23| Int)) (or (not (= (select |c_#valid| |v_node_create_~temp~0#1.base_23|) 0)) (not (< |v_node_create_~temp~0#1.base_23| |c_#StackHeapBarrier|)) (not (= (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_23| v_ArrVal_649))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|))) (+ (select (select (store |c_#memory_$Pointer$.offset| |v_node_create_~temp~0#1.base_23| v_ArrVal_648) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 4)) 0)))) is different from false [2022-11-03 02:42:05,910 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1974550531] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:42:05,910 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [190146691] [2022-11-03 02:42:05,914 INFO L159 IcfgInterpreter]: Started Sifa with 18 locations of interest [2022-11-03 02:42:05,914 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 02:42:05,914 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 02:42:05,914 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 02:42:05,915 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 02:42:05,933 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:42:05,950 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-03 02:42:05,951 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:42:05,963 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:42:05,984 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-03 02:42:05,984 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:42:06,043 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:42:06,048 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:42:06,060 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:42:06,061 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:42:06,069 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:42:06,070 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 20 treesize of output 9 [2022-11-03 02:42:06,078 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:42:06,079 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 20 treesize of output 9 [2022-11-03 02:42:06,104 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:42:06,106 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:42:06,122 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:42:06,123 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:42:06,168 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:42:06,169 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:42:06,184 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:42:06,186 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:42:06,222 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:42:06,222 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2022-11-03 02:42:06,231 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:42:06,232 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2022-11-03 02:42:06,242 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:42:06,243 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2022-11-03 02:42:06,308 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:42:06,320 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:42:06,331 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:42:06,343 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:42:06,355 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:42:06,398 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:42:06,410 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:42:06,421 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:42:06,435 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:42:06,447 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:42:06,554 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:42:06,555 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:42:06,559 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 226 treesize of output 206 [2022-11-03 02:42:06,582 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:42:06,585 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 220 treesize of output 206 [2022-11-03 02:42:06,603 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:42:06,605 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 222 treesize of output 208 [2022-11-03 02:42:06,716 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:42:06,726 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:42:06,737 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:42:06,748 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:42:06,763 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:42:06,808 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:42:06,819 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:42:06,830 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:42:06,843 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:42:06,855 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:42:06,967 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:42:06,969 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:42:06,970 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 226 treesize of output 206 [2022-11-03 02:42:06,984 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:42:06,985 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 220 treesize of output 206 [2022-11-03 02:42:06,999 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:42:07,000 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 222 treesize of output 208 [2022-11-03 02:42:07,210 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:42:07,224 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:42:07,309 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:42:07,321 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:42:07,655 INFO L356 Elim1Store]: treesize reduction 25, result has 40.5 percent of original size [2022-11-03 02:42:07,656 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 192 treesize of output 182 [2022-11-03 02:42:07,683 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:42:07,740 INFO L356 Elim1Store]: treesize reduction 78, result has 16.1 percent of original size [2022-11-03 02:42:07,740 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 3 new quantified variables, introduced 5 case distinctions, treesize of input 211 treesize of output 199 [2022-11-03 02:42:07,771 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:42:07,816 INFO L356 Elim1Store]: treesize reduction 70, result has 24.7 percent of original size [2022-11-03 02:42:07,816 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 3 new quantified variables, introduced 5 case distinctions, treesize of input 207 treesize of output 203 [2022-11-03 02:42:08,419 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 11 for LOIs [2022-11-03 02:42:08,426 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:42:08,432 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:42:08,445 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:42:08,446 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 20 treesize of output 9 [2022-11-03 02:42:08,455 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:42:08,456 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 20 treesize of output 9 [2022-11-03 02:42:08,469 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:42:08,471 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:42:08,474 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 02:42:16,556 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1281#(and (<= 0 |ULTIMATE.start_main_~count~0#1|) (<= 0 |ULTIMATE.start_sll_append_~head#1.offset|) (<= 1 |ULTIMATE.start_sll_create_#in~data#1|) (<= |ULTIMATE.start_sll_append_~data#1| 1) (<= |ULTIMATE.start_sll_create_#in~data#1| 1) (or (not (= |ULTIMATE.start_main_~ptr~0#1.base| 0)) (not (= |ULTIMATE.start_main_~ptr~0#1.offset| 0))) (<= 0 |ULTIMATE.start_sll_append_~head#1.base|) (<= |ULTIMATE.start_sll_create_~head~0#1.offset| 0) (<= 0 |ULTIMATE.start_sll_append_#in~head#1.offset|) (= |ULTIMATE.start_main_~temp~2#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~ptr~0#1.base|) (+ |ULTIMATE.start_main_~ptr~0#1.offset| 4))) (<= |ULTIMATE.start_sll_create_~len#1| 0) (<= |ULTIMATE.start_sll_create_#res#1.offset| 0) (<= 1 |ULTIMATE.start_sll_create_~data#1|) (<= |ULTIMATE.start_sll_append_#in~data#1| 1) (<= 0 |ULTIMATE.start_sll_append_#in~head#1.base|) (<= |ULTIMATE.start_sll_append_#in~head#1.offset| 0) (not (= |ULTIMATE.start_main_~data~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~ptr~0#1.base|) |ULTIMATE.start_main_~ptr~0#1.offset|))) (= |ULTIMATE.start_main_~data~0#1| 1) (<= 1 |ULTIMATE.start_sll_append_~data#1|) (<= |ULTIMATE.start_sll_create_~data#1| 1) (<= |ULTIMATE.start_sll_create_#in~len#1| 2) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (<= 0 |ULTIMATE.start_sll_create_~len#1|) (= |ULTIMATE.start_main_~len~0#1| 2) (= |#NULL.offset| 0) (<= 0 |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_sll_append_~new_last~0#1.offset| 0) (<= |ULTIMATE.start_sll_append_~head#1.offset| 0) (<= 0 |ULTIMATE.start_sll_create_#res#1.offset|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~ptr~0#1.base|) (+ |ULTIMATE.start_main_~ptr~0#1.offset| 4)) |ULTIMATE.start_main_~temp~2#1.offset|) (<= 0 |#StackHeapBarrier|) (<= 2 |ULTIMATE.start_sll_create_#in~len#1|) (<= 0 |ULTIMATE.start_sll_create_~head~0#1.offset|) (<= 1 |ULTIMATE.start_sll_append_#in~data#1|) (= |#NULL.base| 0))' at error location [2022-11-03 02:42:16,557 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-03 02:42:16,557 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-03 02:42:16,557 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18] total 34 [2022-11-03 02:42:16,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043045585] [2022-11-03 02:42:16,557 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-03 02:42:16,557 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-11-03 02:42:16,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:42:16,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-11-03 02:42:16,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=2494, Unknown=4, NotChecked=100, Total=2756 [2022-11-03 02:42:16,559 INFO L87 Difference]: Start difference. First operand 29 states and 35 transitions. Second operand has 34 states, 27 states have (on average 1.5925925925925926) internal successors, (43), 29 states have internal predecessors, (43), 5 states have call successors, (5), 2 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-11-03 02:42:17,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:42:17,740 INFO L93 Difference]: Finished difference Result 35 states and 43 transitions. [2022-11-03 02:42:17,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-03 02:42:17,742 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 27 states have (on average 1.5925925925925926) internal successors, (43), 29 states have internal predecessors, (43), 5 states have call successors, (5), 2 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 29 [2022-11-03 02:42:17,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:42:17,744 INFO L225 Difference]: With dead ends: 35 [2022-11-03 02:42:17,744 INFO L226 Difference]: Without dead ends: 26 [2022-11-03 02:42:17,746 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 653 ImplicationChecksByTransitivity, 10.0s TimeCoverageRelationStatistics Valid=239, Invalid=3666, Unknown=5, NotChecked=122, Total=4032 [2022-11-03 02:42:17,750 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 5 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 316 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 359 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 316 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 36 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-03 02:42:17,751 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 250 Invalid, 359 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 316 Invalid, 0 Unknown, 36 Unchecked, 0.3s Time] [2022-11-03 02:42:17,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-11-03 02:42:17,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2022-11-03 02:42:17,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 20 states have (on average 1.2) internal successors, (24), 20 states have internal predecessors, (24), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-03 02:42:17,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 30 transitions. [2022-11-03 02:42:17,768 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 30 transitions. Word has length 29 [2022-11-03 02:42:17,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:42:17,771 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 30 transitions. [2022-11-03 02:42:17,771 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 27 states have (on average 1.5925925925925926) internal successors, (43), 29 states have internal predecessors, (43), 5 states have call successors, (5), 2 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-11-03 02:42:17,771 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 30 transitions. [2022-11-03 02:42:17,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-03 02:42:17,773 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:42:17,773 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:42:17,819 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cd72669-52b2-4744-a5dd-aea796699620/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-03 02:42:17,996 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cd72669-52b2-4744-a5dd-aea796699620/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2022-11-03 02:42:17,997 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:42:17,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:42:17,997 INFO L85 PathProgramCache]: Analyzing trace with hash -1398610240, now seen corresponding path program 1 times [2022-11-03 02:42:17,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:42:17,998 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789431448] [2022-11-03 02:42:17,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:42:17,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:42:18,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:42:20,576 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 02:42:20,576 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:42:20,576 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789431448] [2022-11-03 02:42:20,576 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [789431448] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:42:20,576 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [450472472] [2022-11-03 02:42:20,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:42:20,577 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:42:20,577 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cd72669-52b2-4744-a5dd-aea796699620/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:42:20,578 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cd72669-52b2-4744-a5dd-aea796699620/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:42:20,596 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cd72669-52b2-4744-a5dd-aea796699620/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-03 02:42:20,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:42:20,896 INFO L263 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 121 conjunts are in the unsatisfiable core [2022-11-03 02:42:20,902 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:42:20,916 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:42:20,979 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:42:21,166 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-03 02:42:21,167 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:42:21,343 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:42:21,416 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:42:21,515 INFO L356 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-11-03 02:42:21,516 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:42:21,648 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:42:21,649 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-03 02:42:21,661 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 13 treesize of output 9 [2022-11-03 02:42:21,924 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:42:21,924 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 33 [2022-11-03 02:42:21,935 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:42:21,941 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:42:21,946 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:42:22,137 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:42:22,152 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-03 02:42:22,153 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 76 treesize of output 64 [2022-11-03 02:42:22,164 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:42:22,165 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-03 02:42:22,179 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:42:22,194 INFO L356 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-11-03 02:42:22,195 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:42:22,203 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:42:22,204 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:42:22,664 INFO L356 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-11-03 02:42:22,665 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 108 treesize of output 89 [2022-11-03 02:42:22,682 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-03 02:42:22,682 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 48 treesize of output 49 [2022-11-03 02:42:22,689 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:42:22,690 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 32 treesize of output 34 [2022-11-03 02:42:22,787 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:42:22,787 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 26 [2022-11-03 02:42:22,792 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:42:22,857 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:42:22,909 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 02:42:22,910 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:42:22,926 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_777 (Array Int Int)) (v_ArrVal_776 (Array Int Int)) (v_ArrVal_775 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_append_~last~0#1.base| v_ArrVal_775) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~last~0#1.base| v_ArrVal_776) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base| v_ArrVal_777) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) is different from false [2022-11-03 02:42:22,945 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_777 (Array Int Int)) (v_ArrVal_776 (Array Int Int)) (v_ArrVal_775 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~last~0#1.base|) (+ |c_ULTIMATE.start_sll_append_~last~0#1.offset| 4)))) (select (select (store |c_#memory_int| .cse0 v_ArrVal_775) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_776) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_777) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) is different from false [2022-11-03 02:42:22,962 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_777 (Array Int Int)) (v_ArrVal_776 (Array Int Int)) (v_ArrVal_775 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse0 (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 4)))) (select (select (store |c_#memory_int| .cse0 v_ArrVal_775) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_776) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_777) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) is different from false [2022-11-03 02:42:23,275 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [450472472] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:42:23,275 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2100109945] [2022-11-03 02:42:23,278 INFO L159 IcfgInterpreter]: Started Sifa with 18 locations of interest [2022-11-03 02:42:23,278 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 02:42:23,278 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 02:42:23,279 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 02:42:23,279 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 02:42:23,300 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:42:23,316 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-03 02:42:23,316 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:42:23,327 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:42:23,347 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-03 02:42:23,347 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:42:23,387 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:42:23,392 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:42:23,401 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:42:23,402 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 20 treesize of output 9 [2022-11-03 02:42:23,409 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:42:23,410 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 20 treesize of output 9 [2022-11-03 02:42:23,422 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:42:23,423 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:42:23,448 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:42:23,449 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:42:23,462 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:42:23,463 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:42:23,510 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:42:23,511 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:42:23,523 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:42:23,524 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:42:23,563 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:42:23,564 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2022-11-03 02:42:23,574 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:42:23,575 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2022-11-03 02:42:23,587 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:42:23,588 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2022-11-03 02:42:23,642 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:42:23,652 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:42:23,662 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:42:23,674 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:42:23,686 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:42:23,739 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:42:23,749 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:42:23,761 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:42:23,770 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:42:23,785 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:42:23,885 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:42:23,887 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 222 treesize of output 202 [2022-11-03 02:42:23,902 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:42:23,903 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 216 treesize of output 204 [2022-11-03 02:42:23,918 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:42:23,919 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 220 treesize of output 208 [2022-11-03 02:42:24,013 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:42:24,023 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:42:24,033 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:42:24,047 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:42:24,057 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:42:24,101 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:42:24,112 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:42:24,124 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:42:24,137 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:42:24,159 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:42:24,280 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:42:24,281 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 222 treesize of output 202 [2022-11-03 02:42:24,294 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:42:24,296 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 216 treesize of output 204 [2022-11-03 02:42:24,308 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:42:24,309 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 220 treesize of output 208 [2022-11-03 02:42:24,533 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:42:24,547 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:42:24,646 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:42:24,667 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:42:24,816 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 23 treesize of output 13 [2022-11-03 02:42:24,827 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 23 treesize of output 13 [2022-11-03 02:42:24,838 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2022-11-03 02:42:25,089 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 11 for LOIs [2022-11-03 02:42:25,096 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:42:25,101 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:42:25,113 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:42:25,115 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 20 treesize of output 9 [2022-11-03 02:42:25,121 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:42:25,122 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 20 treesize of output 9 [2022-11-03 02:42:25,144 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:42:25,146 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:42:25,148 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 02:42:29,727 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1570#(and (<= 0 |ULTIMATE.start_sll_append_~head#1.offset|) (<= 1 |ULTIMATE.start_sll_create_#in~data#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_append_~data#1| 1) (<= |ULTIMATE.start_sll_create_#in~data#1| 1) (or (not (= |ULTIMATE.start_main_~ptr~0#1.base| 0)) (not (= |ULTIMATE.start_main_~ptr~0#1.offset| 0))) (<= 0 |ULTIMATE.start_sll_append_~head#1.base|) (<= |ULTIMATE.start_sll_create_~head~0#1.offset| 0) (<= 0 |ULTIMATE.start_sll_append_#in~head#1.offset|) (= |ULTIMATE.start_main_~temp~2#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~ptr~0#1.base|) (+ |ULTIMATE.start_main_~ptr~0#1.offset| 4))) (<= |ULTIMATE.start_sll_create_~len#1| 0) (<= |ULTIMATE.start_sll_create_#res#1.offset| 0) (= |ULTIMATE.start_main_~count~0#1| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_append_~last~0#1.base|) (+ |ULTIMATE.start_sll_append_~last~0#1.offset| 4)) |ULTIMATE.start_sll_append_~new_last~0#1.offset|) (<= 1 |ULTIMATE.start_sll_create_~data#1|) (<= |ULTIMATE.start_sll_append_#in~data#1| 1) (<= 0 |ULTIMATE.start_sll_append_#in~head#1.base|) (= |ULTIMATE.start_sll_append_~new_last~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_append_~last~0#1.base|) (+ |ULTIMATE.start_sll_append_~last~0#1.offset| 4))) (<= |ULTIMATE.start_sll_append_#in~head#1.offset| 0) (not (= |ULTIMATE.start_main_~data~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~ptr~0#1.base|) |ULTIMATE.start_main_~ptr~0#1.offset|))) (= |ULTIMATE.start_main_~data~0#1| 1) (<= 1 |ULTIMATE.start_sll_append_~data#1|) (<= |ULTIMATE.start_sll_create_~data#1| 1) (<= |ULTIMATE.start_sll_create_#in~len#1| 2) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (<= 0 |ULTIMATE.start_sll_create_~len#1|) (= |ULTIMATE.start_main_~len~0#1| 2) (= |#NULL.offset| 0) (<= 0 |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_sll_append_~new_last~0#1.offset| 0) (<= |ULTIMATE.start_sll_append_~head#1.offset| 0) (<= 0 |ULTIMATE.start_sll_create_#res#1.offset|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~ptr~0#1.base|) (+ |ULTIMATE.start_main_~ptr~0#1.offset| 4)) |ULTIMATE.start_main_~temp~2#1.offset|) (<= 0 |#StackHeapBarrier|) (<= 2 |ULTIMATE.start_sll_create_#in~len#1|) (<= 0 |ULTIMATE.start_sll_create_~head~0#1.offset|) (<= 1 |ULTIMATE.start_sll_append_#in~data#1|) (= |#NULL.base| 0))' at error location [2022-11-03 02:42:29,727 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-03 02:42:29,727 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-03 02:42:29,727 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 21] total 41 [2022-11-03 02:42:29,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475622751] [2022-11-03 02:42:29,728 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-03 02:42:29,728 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-11-03 02:42:29,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:42:29,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-11-03 02:42:29,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=189, Invalid=3125, Unknown=4, NotChecked=342, Total=3660 [2022-11-03 02:42:29,731 INFO L87 Difference]: Start difference. First operand 25 states and 30 transitions. Second operand has 41 states, 33 states have (on average 1.3333333333333333) internal successors, (44), 33 states have internal predecessors, (44), 6 states have call successors, (6), 3 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-03 02:42:32,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:42:32,027 INFO L93 Difference]: Finished difference Result 42 states and 50 transitions. [2022-11-03 02:42:32,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-03 02:42:32,028 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 33 states have (on average 1.3333333333333333) internal successors, (44), 33 states have internal predecessors, (44), 6 states have call successors, (6), 3 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 29 [2022-11-03 02:42:32,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:42:32,029 INFO L225 Difference]: With dead ends: 42 [2022-11-03 02:42:32,029 INFO L226 Difference]: Without dead ends: 40 [2022-11-03 02:42:32,031 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 74 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1264 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=344, Invalid=4919, Unknown=5, NotChecked=432, Total=5700 [2022-11-03 02:42:32,032 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 90 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 447 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 490 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 447 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 9 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-03 02:42:32,032 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 130 Invalid, 490 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 447 Invalid, 0 Unknown, 9 Unchecked, 0.5s Time] [2022-11-03 02:42:32,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-11-03 02:42:32,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 31. [2022-11-03 02:42:32,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 26 states have internal predecessors, (32), 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-03 02:42:32,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 38 transitions. [2022-11-03 02:42:32,045 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 38 transitions. Word has length 29 [2022-11-03 02:42:32,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:42:32,045 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 38 transitions. [2022-11-03 02:42:32,046 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 33 states have (on average 1.3333333333333333) internal successors, (44), 33 states have internal predecessors, (44), 6 states have call successors, (6), 3 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-03 02:42:32,046 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 38 transitions. [2022-11-03 02:42:32,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-03 02:42:32,047 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:42:32,047 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:42:32,078 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cd72669-52b2-4744-a5dd-aea796699620/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-11-03 02:42:32,248 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cd72669-52b2-4744-a5dd-aea796699620/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2022-11-03 02:42:32,249 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:42:32,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:42:32,249 INFO L85 PathProgramCache]: Analyzing trace with hash -1398554254, now seen corresponding path program 1 times [2022-11-03 02:42:32,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:42:32,250 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659905905] [2022-11-03 02:42:32,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:42:32,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:42:32,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:42:33,132 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-03 02:42:33,132 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:42:33,132 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659905905] [2022-11-03 02:42:33,133 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1659905905] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:42:33,133 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [903143809] [2022-11-03 02:42:33,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:42:33,133 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:42:33,133 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cd72669-52b2-4744-a5dd-aea796699620/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:42:33,134 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cd72669-52b2-4744-a5dd-aea796699620/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:42:33,156 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cd72669-52b2-4744-a5dd-aea796699620/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-03 02:42:33,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:42:33,343 INFO L263 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 28 conjunts are in the unsatisfiable core [2022-11-03 02:42:33,350 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:42:33,523 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:42:33,599 WARN L855 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_900 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_900))))) is different from true [2022-11-03 02:42:33,608 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:42:33,608 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:42:33,726 INFO L356 Elim1Store]: treesize reduction 31, result has 38.0 percent of original size [2022-11-03 02:42:33,726 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 35 [2022-11-03 02:42:33,741 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:42:33,743 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 1 not checked. [2022-11-03 02:42:33,743 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:42:33,905 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_node_create_~temp~0#1.base_29| Int) (v_ArrVal_905 (Array Int Int))) (or (not (= (select (select (store |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_29| v_ArrVal_905) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (< |v_node_create_~temp~0#1.base_29| |c_#StackHeapBarrier|)))) is different from false [2022-11-03 02:42:33,907 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [903143809] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:42:33,907 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1658570598] [2022-11-03 02:42:33,909 INFO L159 IcfgInterpreter]: Started Sifa with 18 locations of interest [2022-11-03 02:42:33,909 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 02:42:33,910 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 02:42:33,910 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 02:42:33,910 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 02:42:33,928 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:42:33,949 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-03 02:42:33,949 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:42:33,962 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:42:33,963 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:42:33,996 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:42:34,001 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:42:34,012 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:42:34,013 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 20 treesize of output 9 [2022-11-03 02:42:34,020 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:42:34,021 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 20 treesize of output 9 [2022-11-03 02:42:34,031 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:42:34,032 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:42:34,056 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:42:34,059 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:42:34,071 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:42:34,072 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:42:34,111 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:42:34,112 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:42:34,122 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:42:34,123 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:42:34,152 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:42:34,153 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2022-11-03 02:42:34,161 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:42:34,162 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2022-11-03 02:42:34,178 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:42:34,181 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2022-11-03 02:42:34,221 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:42:34,230 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:42:34,242 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:42:34,256 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:42:34,267 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:42:34,305 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:42:34,315 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:42:34,325 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:42:34,336 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:42:34,371 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:42:34,457 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:42:34,458 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 222 treesize of output 202 [2022-11-03 02:42:34,471 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:42:34,472 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 216 treesize of output 204 [2022-11-03 02:42:34,486 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:42:34,487 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 220 treesize of output 208 [2022-11-03 02:42:34,565 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:42:34,575 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:42:34,586 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:42:34,596 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:42:34,607 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:42:34,659 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:42:34,673 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:42:34,684 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:42:34,694 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:42:34,703 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:42:34,787 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:42:34,795 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 222 treesize of output 202 [2022-11-03 02:42:34,814 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:42:34,815 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 216 treesize of output 204 [2022-11-03 02:42:34,829 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:42:34,832 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 220 treesize of output 208 [2022-11-03 02:42:35,007 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:42:35,027 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:42:35,129 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:42:35,152 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:42:35,425 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 23 treesize of output 13 [2022-11-03 02:42:35,433 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2022-11-03 02:42:35,443 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 23 treesize of output 13 [2022-11-03 02:42:35,639 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 11 for LOIs [2022-11-03 02:42:35,645 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:42:35,651 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:42:35,668 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:42:35,669 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:42:35,683 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:42:35,684 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 20 treesize of output 9 [2022-11-03 02:42:35,691 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:42:35,692 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 20 treesize of output 9 [2022-11-03 02:42:35,694 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 02:42:39,667 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1871#(and (<= 0 |ULTIMATE.start_sll_append_~head#1.offset|) (<= 1 |ULTIMATE.start_sll_create_#in~data#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_append_~data#1| 1) (<= |ULTIMATE.start_sll_create_#in~data#1| 1) (<= 0 |ULTIMATE.start_sll_append_~head#1.base|) (<= |ULTIMATE.start_sll_create_~head~0#1.offset| 0) (<= 0 |ULTIMATE.start_sll_append_#in~head#1.offset|) (<= |ULTIMATE.start_sll_create_~len#1| 0) (<= |ULTIMATE.start_sll_create_#res#1.offset| 0) (= |ULTIMATE.start_main_~ptr~0#1.offset| 0) (= |ULTIMATE.start_main_~count~0#1| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_append_~last~0#1.base|) (+ |ULTIMATE.start_sll_append_~last~0#1.offset| 4)) |ULTIMATE.start_sll_append_~new_last~0#1.offset|) (= |ULTIMATE.start_main_~ptr~0#1.base| 0) (<= 1 |ULTIMATE.start_sll_create_~data#1|) (<= |ULTIMATE.start_sll_append_#in~data#1| 1) (<= 0 |ULTIMATE.start_sll_append_#in~head#1.base|) (= |ULTIMATE.start_sll_append_~new_last~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_append_~last~0#1.base|) (+ |ULTIMATE.start_sll_append_~last~0#1.offset| 4))) (<= |ULTIMATE.start_sll_append_#in~head#1.offset| 0) (= |ULTIMATE.start_main_~data~0#1| 1) (<= 1 |ULTIMATE.start_sll_append_~data#1|) (<= |ULTIMATE.start_sll_create_~data#1| 1) (<= |ULTIMATE.start_sll_create_#in~len#1| 2) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (<= 0 |ULTIMATE.start_sll_create_~len#1|) (= |ULTIMATE.start_main_~len~0#1| 2) (= |#NULL.offset| 0) (<= 0 |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_sll_append_~new_last~0#1.offset| 0) (<= |ULTIMATE.start_sll_append_~head#1.offset| 0) (<= 0 |ULTIMATE.start_sll_create_#res#1.offset|) (<= 0 |#StackHeapBarrier|) (<= 2 |ULTIMATE.start_sll_create_#in~len#1|) (<= 0 |ULTIMATE.start_sll_create_~head~0#1.offset|) (<= 1 |ULTIMATE.start_sll_append_#in~data#1|) (= |#NULL.base| 0))' at error location [2022-11-03 02:42:39,667 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-03 02:42:39,667 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-03 02:42:39,667 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 15] total 28 [2022-11-03 02:42:39,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986907176] [2022-11-03 02:42:39,668 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-03 02:42:39,668 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-11-03 02:42:39,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:42:39,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-11-03 02:42:39,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=1664, Unknown=2, NotChecked=166, Total=1980 [2022-11-03 02:42:39,670 INFO L87 Difference]: Start difference. First operand 31 states and 38 transitions. Second operand has 28 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 23 states have internal predecessors, (34), 3 states have call successors, (3), 3 states have call predecessors, (3), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2022-11-03 02:42:40,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:42:40,252 INFO L93 Difference]: Finished difference Result 38 states and 45 transitions. [2022-11-03 02:42:40,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-03 02:42:40,253 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 23 states have internal predecessors, (34), 3 states have call successors, (3), 3 states have call predecessors, (3), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Word has length 29 [2022-11-03 02:42:40,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:42:40,254 INFO L225 Difference]: With dead ends: 38 [2022-11-03 02:42:40,254 INFO L226 Difference]: Without dead ends: 35 [2022-11-03 02:42:40,255 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 44 SyntacticMatches, 2 SemanticMatches, 54 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 740 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=239, Invalid=2629, Unknown=2, NotChecked=210, Total=3080 [2022-11-03 02:42:40,255 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 41 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 276 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 25 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 02:42:40,256 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 191 Invalid, 319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 276 Invalid, 0 Unknown, 25 Unchecked, 0.2s Time] [2022-11-03 02:42:40,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-11-03 02:42:40,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 32. [2022-11-03 02:42:40,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 27 states have internal predecessors, (32), 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-03 02:42:40,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 38 transitions. [2022-11-03 02:42:40,267 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 38 transitions. Word has length 29 [2022-11-03 02:42:40,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:42:40,267 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 38 transitions. [2022-11-03 02:42:40,267 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 23 states have internal predecessors, (34), 3 states have call successors, (3), 3 states have call predecessors, (3), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2022-11-03 02:42:40,268 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2022-11-03 02:42:40,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-03 02:42:40,268 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:42:40,269 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:42:40,306 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cd72669-52b2-4744-a5dd-aea796699620/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-03 02:42:40,483 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cd72669-52b2-4744-a5dd-aea796699620/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-11-03 02:42:40,483 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:42:40,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:42:40,484 INFO L85 PathProgramCache]: Analyzing trace with hash 260357467, now seen corresponding path program 1 times [2022-11-03 02:42:40,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:42:40,484 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069794162] [2022-11-03 02:42:40,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:42:40,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:42:40,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:42:43,523 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:42:43,523 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:42:43,523 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069794162] [2022-11-03 02:42:43,523 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2069794162] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:42:43,523 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [923381554] [2022-11-03 02:42:43,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:42:43,523 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:42:43,524 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cd72669-52b2-4744-a5dd-aea796699620/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:42:43,524 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cd72669-52b2-4744-a5dd-aea796699620/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:42:43,526 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cd72669-52b2-4744-a5dd-aea796699620/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-03 02:42:43,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:42:43,794 INFO L263 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 151 conjunts are in the unsatisfiable core [2022-11-03 02:42:43,799 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:42:43,885 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:42:43,949 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:42:44,117 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:42:44,118 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-03 02:42:44,220 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:42:44,223 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:42:44,393 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-03 02:42:44,394 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 20 [2022-11-03 02:42:44,398 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:42:44,422 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-03 02:42:44,422 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-03 02:42:44,529 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 13 treesize of output 9 [2022-11-03 02:42:44,539 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 13 treesize of output 9 [2022-11-03 02:42:44,553 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2022-11-03 02:42:44,839 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:42:44,840 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 96 treesize of output 43 [2022-11-03 02:42:44,850 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:42:44,850 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 02:42:44,857 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 02:42:44,863 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:42:45,097 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:42:45,108 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-03 02:42:45,109 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 104 treesize of output 80 [2022-11-03 02:42:45,126 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:42:45,126 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 22 treesize of output 24 [2022-11-03 02:42:45,142 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:42:45,143 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:42:45,147 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-03 02:42:45,148 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 30 [2022-11-03 02:42:45,174 INFO L356 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-11-03 02:42:45,174 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 2 case distinctions, treesize of input 28 treesize of output 30 [2022-11-03 02:42:45,946 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:42:45,947 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:42:45,994 INFO L356 Elim1Store]: treesize reduction 131, result has 19.6 percent of original size [2022-11-03 02:42:45,994 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 9 case distinctions, treesize of input 262 treesize of output 136 [2022-11-03 02:42:46,045 INFO L356 Elim1Store]: treesize reduction 128, result has 14.7 percent of original size [2022-11-03 02:42:46,046 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 6 new quantified variables, introduced 6 case distinctions, treesize of input 151 treesize of output 109 [2022-11-03 02:42:46,053 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 43 treesize of output 34 [2022-11-03 02:42:46,349 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:42:46,350 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:42:46,353 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:42:46,353 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 110 treesize of output 54 [2022-11-03 02:42:46,374 INFO L356 Elim1Store]: treesize reduction 18, result has 14.3 percent of original size [2022-11-03 02:42:46,374 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 18 [2022-11-03 02:42:46,521 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:42:46,590 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:42:46,590 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:42:48,739 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1040 Int) (v_ArrVal_1037 Int) (v_ArrVal_1039 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse0 (+ |c_ULTIMATE.start_sll_append_~last~0#1.offset| 4))) (let ((.cse4 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base|) .cse0 v_ArrVal_1040))) (.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~last~0#1.base|) .cse0 v_ArrVal_1039)))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (+ (select (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_append_~last~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_append_~last~0#1.base|) .cse0 v_ArrVal_1037)) (select (select .cse1 .cse2) .cse3)) (select (select .cse4 .cse2) .cse3))))))) is different from false [2022-11-03 02:42:50,392 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [923381554] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:42:50,392 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [680640838] [2022-11-03 02:42:50,394 INFO L159 IcfgInterpreter]: Started Sifa with 18 locations of interest [2022-11-03 02:42:50,394 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 02:42:50,394 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 02:42:50,395 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 02:42:50,395 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 02:42:50,419 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:42:50,432 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-03 02:42:50,433 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:42:50,443 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:42:50,463 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-03 02:42:50,463 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:42:50,495 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:42:50,499 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:42:50,507 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:42:50,507 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 20 treesize of output 9 [2022-11-03 02:42:50,517 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:42:50,518 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:42:50,524 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:42:50,525 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 20 treesize of output 9 [2022-11-03 02:42:50,548 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:42:50,549 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:42:50,562 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:42:50,564 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:42:50,602 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:42:50,603 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:42:50,616 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:42:50,617 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:42:50,678 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:42:50,679 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:42:50,680 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 207 treesize of output 187 [2022-11-03 02:42:50,696 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:42:50,698 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 201 treesize of output 187 [2022-11-03 02:42:50,712 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:42:50,713 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 203 treesize of output 98 [2022-11-03 02:42:50,766 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:42:50,778 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:42:50,787 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:42:50,801 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:42:50,810 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:42:50,857 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:42:50,867 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:42:50,879 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:42:50,898 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:42:50,908 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:42:50,959 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2022-11-03 02:42:50,970 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:42:50,980 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:42:51,084 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 51 [2022-11-03 02:42:51,093 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 70 treesize of output 52 [2022-11-03 02:42:51,187 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 51 [2022-11-03 02:42:51,196 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 70 treesize of output 52 [2022-11-03 02:42:51,244 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2022-11-03 02:42:51,253 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:42:51,262 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:42:51,404 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:42:51,425 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:42:51,506 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:42:51,521 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:42:51,651 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 23 treesize of output 13 [2022-11-03 02:42:51,662 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 23 treesize of output 13 [2022-11-03 02:42:51,673 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2022-11-03 02:42:51,866 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 20 for LOIs [2022-11-03 02:42:51,873 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:42:51,880 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:42:51,892 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:42:51,893 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 20 treesize of output 9 [2022-11-03 02:42:51,903 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:42:51,904 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:42:51,911 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:42:51,912 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 20 treesize of output 9 [2022-11-03 02:42:51,916 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 02:42:55,374 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2197#(and (<= 0 |ULTIMATE.start_main_~count~0#1|) (<= 0 |ULTIMATE.start_sll_append_~head#1.offset|) (<= 1 |ULTIMATE.start_sll_create_#in~data#1|) (<= |ULTIMATE.start_sll_append_~data#1| 1) (<= |ULTIMATE.start_sll_create_#in~data#1| 1) (or (not (= |ULTIMATE.start_main_~ptr~0#1.base| 0)) (not (= |ULTIMATE.start_main_~ptr~0#1.offset| 0))) (<= 0 |ULTIMATE.start_sll_append_~head#1.base|) (<= |ULTIMATE.start_sll_create_~head~0#1.offset| 0) (<= 0 |ULTIMATE.start_sll_append_#in~head#1.offset|) (= |ULTIMATE.start_main_~temp~2#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~ptr~0#1.base|) (+ |ULTIMATE.start_main_~ptr~0#1.offset| 4))) (<= |ULTIMATE.start_sll_create_~len#1| 0) (<= |ULTIMATE.start_sll_create_#res#1.offset| 0) (<= 1 |ULTIMATE.start_sll_create_~data#1|) (<= |ULTIMATE.start_sll_append_#in~data#1| 1) (<= 0 |ULTIMATE.start_sll_append_#in~head#1.base|) (<= |ULTIMATE.start_sll_append_#in~head#1.offset| 0) (not (= |ULTIMATE.start_main_~data~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~ptr~0#1.base|) |ULTIMATE.start_main_~ptr~0#1.offset|))) (= |ULTIMATE.start_main_~data~0#1| 1) (<= 1 |ULTIMATE.start_sll_append_~data#1|) (<= |ULTIMATE.start_sll_create_~data#1| 1) (<= |ULTIMATE.start_sll_create_#in~len#1| 2) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (= |#NULL.offset| 0) (<= 0 |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_sll_append_~new_last~0#1.offset| 0) (<= |ULTIMATE.start_sll_append_~head#1.offset| 0) (<= 0 |ULTIMATE.start_sll_create_#res#1.offset|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~ptr~0#1.base|) (+ |ULTIMATE.start_main_~ptr~0#1.offset| 4)) |ULTIMATE.start_main_~temp~2#1.offset|) (<= 0 |#StackHeapBarrier|) (<= 2 |ULTIMATE.start_sll_create_#in~len#1|) (<= 0 |ULTIMATE.start_sll_create_~head~0#1.offset|) (<= 1 |ULTIMATE.start_sll_append_#in~data#1|) (= |#NULL.base| 0))' at error location [2022-11-03 02:42:55,374 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-03 02:42:55,374 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-03 02:42:55,375 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 26] total 48 [2022-11-03 02:42:55,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188972669] [2022-11-03 02:42:55,375 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-03 02:42:55,376 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2022-11-03 02:42:55,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:42:55,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2022-11-03 02:42:55,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=233, Invalid=4735, Unknown=6, NotChecked=138, Total=5112 [2022-11-03 02:42:55,378 INFO L87 Difference]: Start difference. First operand 32 states and 38 transitions. Second operand has 48 states, 40 states have (on average 1.225) internal successors, (49), 39 states have internal predecessors, (49), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-03 02:42:57,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:42:57,886 INFO L93 Difference]: Finished difference Result 55 states and 68 transitions. [2022-11-03 02:42:57,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-03 02:42:57,887 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 40 states have (on average 1.225) internal successors, (49), 39 states have internal predecessors, (49), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 31 [2022-11-03 02:42:57,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:42:57,888 INFO L225 Difference]: With dead ends: 55 [2022-11-03 02:42:57,888 INFO L226 Difference]: Without dead ends: 52 [2022-11-03 02:42:57,891 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1415 ImplicationChecksByTransitivity, 11.4s TimeCoverageRelationStatistics Valid=369, Invalid=6600, Unknown=7, NotChecked=164, Total=7140 [2022-11-03 02:42:57,892 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 24 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 724 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 790 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 724 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 36 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-03 02:42:57,893 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 187 Invalid, 790 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 724 Invalid, 0 Unknown, 36 Unchecked, 0.7s Time] [2022-11-03 02:42:57,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-11-03 02:42:57,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 46. [2022-11-03 02:42:57,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 39 states have (on average 1.1794871794871795) internal successors, (46), 39 states have internal predecessors, (46), 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-03 02:42:57,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 56 transitions. [2022-11-03 02:42:57,912 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 56 transitions. Word has length 31 [2022-11-03 02:42:57,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:42:57,912 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 56 transitions. [2022-11-03 02:42:57,912 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 40 states have (on average 1.225) internal successors, (49), 39 states have internal predecessors, (49), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-03 02:42:57,912 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 56 transitions. [2022-11-03 02:42:57,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-03 02:42:57,913 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:42:57,913 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:42:57,956 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cd72669-52b2-4744-a5dd-aea796699620/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-03 02:42:58,128 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cd72669-52b2-4744-a5dd-aea796699620/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-03 02:42:58,129 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:42:58,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:42:58,129 INFO L85 PathProgramCache]: Analyzing trace with hash -186196709, now seen corresponding path program 2 times [2022-11-03 02:42:58,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:42:58,130 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5716366] [2022-11-03 02:42:58,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:42:58,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:42:58,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:42:59,763 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 8 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 02:42:59,763 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:42:59,763 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5716366] [2022-11-03 02:42:59,763 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5716366] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:42:59,763 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1511585200] [2022-11-03 02:42:59,763 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 02:42:59,764 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:42:59,764 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cd72669-52b2-4744-a5dd-aea796699620/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:42:59,765 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cd72669-52b2-4744-a5dd-aea796699620/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:42:59,776 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cd72669-52b2-4744-a5dd-aea796699620/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-03 02:43:00,018 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-03 02:43:00,019 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 02:43:00,023 INFO L263 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 137 conjunts are in the unsatisfiable core [2022-11-03 02:43:00,031 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:43:00,092 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:43:00,224 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:43:00,398 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:43:00,504 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-03 02:43:00,505 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 22 [2022-11-03 02:43:00,512 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 7 treesize of output 3 [2022-11-03 02:43:00,544 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-03 02:43:00,545 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-03 02:43:00,643 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 22 [2022-11-03 02:43:00,660 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 13 treesize of output 9 [2022-11-03 02:43:00,671 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:43:00,672 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-03 02:43:00,921 INFO L356 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-03 02:43:00,921 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 3 case distinctions, treesize of input 90 treesize of output 56 [2022-11-03 02:43:00,930 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:43:00,931 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2022-11-03 02:43:00,940 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:43:00,946 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 02:43:01,189 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:43:01,209 INFO L356 Elim1Store]: treesize reduction 52, result has 17.5 percent of original size [2022-11-03 02:43:01,210 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 98 treesize of output 88 [2022-11-03 02:43:01,225 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:43:01,225 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-03 02:43:01,246 INFO L356 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-11-03 02:43:01,246 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2022-11-03 02:43:01,252 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:43:01,253 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:43:01,254 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2022-11-03 02:43:02,030 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:43:02,133 INFO L356 Elim1Store]: treesize reduction 302, result has 15.4 percent of original size [2022-11-03 02:43:02,133 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 12 new quantified variables, introduced 20 case distinctions, treesize of input 315 treesize of output 145 [2022-11-03 02:43:02,143 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:43:02,169 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:43:02,182 INFO L356 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2022-11-03 02:43:02,182 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 104 treesize of output 86 [2022-11-03 02:43:02,325 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:43:02,337 INFO L356 Elim1Store]: treesize reduction 22, result has 29.0 percent of original size [2022-11-03 02:43:02,337 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 3 case distinctions, treesize of input 127 treesize of output 71 [2022-11-03 02:43:02,345 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:43:02,346 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 37 [2022-11-03 02:43:02,417 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:43:02,469 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 5 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:43:02,469 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:43:02,626 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1181 (Array Int Int)) (v_ArrVal_1182 Int) (v_ArrVal_1180 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse0 (+ |c_ULTIMATE.start_sll_append_~last~0#1.offset| 4))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_append_~last~0#1.base| v_ArrVal_1181) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~last~0#1.base|) .cse0 v_ArrVal_1182)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base|) .cse0 v_ArrVal_1180)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) is different from false [2022-11-03 02:43:04,104 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1511585200] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:43:04,104 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [271600943] [2022-11-03 02:43:04,106 INFO L159 IcfgInterpreter]: Started Sifa with 18 locations of interest [2022-11-03 02:43:04,107 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 02:43:04,107 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 02:43:04,107 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 02:43:04,107 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 02:43:04,124 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:43:04,135 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-03 02:43:04,136 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:43:04,146 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:43:04,160 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-03 02:43:04,161 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:43:04,187 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:43:04,194 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:43:04,201 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:43:04,202 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 20 treesize of output 9 [2022-11-03 02:43:04,207 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:43:04,208 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 20 treesize of output 9 [2022-11-03 02:43:04,217 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:43:04,220 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:43:04,240 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:43:04,241 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:43:04,252 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:43:04,253 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:43:04,296 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:43:04,297 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:43:04,307 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:43:04,308 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:43:04,357 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:43:04,358 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:43:04,359 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 207 treesize of output 187 [2022-11-03 02:43:04,371 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:43:04,372 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 201 treesize of output 187 [2022-11-03 02:43:04,387 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:43:04,388 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 203 treesize of output 98 [2022-11-03 02:43:04,440 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:43:04,450 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:43:04,460 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:43:04,485 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:43:04,493 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:43:04,540 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:43:04,549 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:43:04,557 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:43:04,566 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:43:04,576 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:43:04,632 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2022-11-03 02:43:04,641 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:43:04,652 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:43:04,746 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 76 treesize of output 58 [2022-11-03 02:43:04,754 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 45 [2022-11-03 02:43:04,841 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 51 [2022-11-03 02:43:04,850 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 70 treesize of output 52 [2022-11-03 02:43:04,896 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2022-11-03 02:43:04,909 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:43:04,918 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:43:05,068 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:43:05,079 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:43:05,157 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:43:05,175 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:43:05,307 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 23 treesize of output 13 [2022-11-03 02:43:05,315 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2022-11-03 02:43:05,323 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 23 treesize of output 13 [2022-11-03 02:43:05,398 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 20 for LOIs [2022-11-03 02:43:05,405 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:43:05,410 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:43:05,425 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:43:05,426 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 20 treesize of output 9 [2022-11-03 02:43:05,437 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:43:05,438 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:43:05,448 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:43:05,448 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 20 treesize of output 9 [2022-11-03 02:43:05,451 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 02:43:08,933 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2569#(and (<= 0 |ULTIMATE.start_sll_append_~head#1.offset|) (<= 1 |ULTIMATE.start_sll_create_#in~data#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_append_~data#1| 1) (<= |ULTIMATE.start_sll_create_#in~data#1| 1) (or (not (= |ULTIMATE.start_main_~ptr~0#1.base| 0)) (not (= |ULTIMATE.start_main_~ptr~0#1.offset| 0))) (<= 0 |ULTIMATE.start_sll_append_~head#1.base|) (<= |ULTIMATE.start_sll_create_~head~0#1.offset| 0) (<= 0 |ULTIMATE.start_sll_append_#in~head#1.offset|) (= |ULTIMATE.start_main_~temp~2#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~ptr~0#1.base|) (+ |ULTIMATE.start_main_~ptr~0#1.offset| 4))) (<= |ULTIMATE.start_sll_create_~len#1| 0) (<= |ULTIMATE.start_sll_create_#res#1.offset| 0) (= |ULTIMATE.start_main_~count~0#1| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_append_~last~0#1.base|) (+ |ULTIMATE.start_sll_append_~last~0#1.offset| 4)) |ULTIMATE.start_sll_append_~new_last~0#1.offset|) (<= 1 |ULTIMATE.start_sll_create_~data#1|) (<= |ULTIMATE.start_sll_append_#in~data#1| 1) (<= 0 |ULTIMATE.start_sll_append_#in~head#1.base|) (= |ULTIMATE.start_sll_append_~new_last~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_append_~last~0#1.base|) (+ |ULTIMATE.start_sll_append_~last~0#1.offset| 4))) (<= |ULTIMATE.start_sll_append_#in~head#1.offset| 0) (not (= |ULTIMATE.start_main_~data~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~ptr~0#1.base|) |ULTIMATE.start_main_~ptr~0#1.offset|))) (= |ULTIMATE.start_main_~data~0#1| 1) (<= 1 |ULTIMATE.start_sll_append_~data#1|) (<= |ULTIMATE.start_sll_create_~data#1| 1) (<= |ULTIMATE.start_sll_create_#in~len#1| 2) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (= |#NULL.offset| 0) (<= 0 |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_sll_append_~new_last~0#1.offset| 0) (<= |ULTIMATE.start_sll_append_~head#1.offset| 0) (<= 0 |ULTIMATE.start_sll_create_#res#1.offset|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~ptr~0#1.base|) (+ |ULTIMATE.start_main_~ptr~0#1.offset| 4)) |ULTIMATE.start_main_~temp~2#1.offset|) (<= 0 |#StackHeapBarrier|) (<= 2 |ULTIMATE.start_sll_create_#in~len#1|) (<= 0 |ULTIMATE.start_sll_create_~head~0#1.offset|) (<= 1 |ULTIMATE.start_sll_append_#in~data#1|) (= |#NULL.base| 0))' at error location [2022-11-03 02:43:08,933 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-03 02:43:08,933 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-03 02:43:08,933 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 25] total 43 [2022-11-03 02:43:08,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403958939] [2022-11-03 02:43:08,933 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-03 02:43:08,934 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-11-03 02:43:08,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:43:08,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-11-03 02:43:08,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=217, Invalid=4337, Unknown=6, NotChecked=132, Total=4692 [2022-11-03 02:43:08,936 INFO L87 Difference]: Start difference. First operand 46 states and 56 transitions. Second operand has 43 states, 35 states have (on average 1.4) internal successors, (49), 35 states have internal predecessors, (49), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-03 02:43:11,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:43:11,575 INFO L93 Difference]: Finished difference Result 57 states and 70 transitions. [2022-11-03 02:43:11,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-03 02:43:11,576 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 35 states have (on average 1.4) internal successors, (49), 35 states have internal predecessors, (49), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 31 [2022-11-03 02:43:11,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:43:11,577 INFO L225 Difference]: With dead ends: 57 [2022-11-03 02:43:11,577 INFO L226 Difference]: Without dead ends: 47 [2022-11-03 02:43:11,579 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1434 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=335, Invalid=6142, Unknown=7, NotChecked=158, Total=6642 [2022-11-03 02:43:11,579 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 16 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 541 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 606 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 541 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 44 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-03 02:43:11,580 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 215 Invalid, 606 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 541 Invalid, 0 Unknown, 44 Unchecked, 0.6s Time] [2022-11-03 02:43:11,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-11-03 02:43:11,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 46. [2022-11-03 02:43:11,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 39 states have (on average 1.1538461538461537) internal successors, (45), 39 states have internal predecessors, (45), 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-03 02:43:11,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 55 transitions. [2022-11-03 02:43:11,595 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 55 transitions. Word has length 31 [2022-11-03 02:43:11,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:43:11,596 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 55 transitions. [2022-11-03 02:43:11,596 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 35 states have (on average 1.4) internal successors, (49), 35 states have internal predecessors, (49), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-03 02:43:11,596 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 55 transitions. [2022-11-03 02:43:11,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-11-03 02:43:11,597 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:43:11,597 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:43:11,638 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cd72669-52b2-4744-a5dd-aea796699620/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-03 02:43:11,820 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cd72669-52b2-4744-a5dd-aea796699620/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-11-03 02:43:11,821 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:43:11,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:43:11,821 INFO L85 PathProgramCache]: Analyzing trace with hash 1095457078, now seen corresponding path program 2 times [2022-11-03 02:43:11,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:43:11,821 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932249211] [2022-11-03 02:43:11,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:43:11,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:43:11,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:43:14,710 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:43:14,710 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:43:14,710 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932249211] [2022-11-03 02:43:14,710 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1932249211] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:43:14,710 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1087197195] [2022-11-03 02:43:14,711 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 02:43:14,711 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:43:14,711 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cd72669-52b2-4744-a5dd-aea796699620/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:43:14,712 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cd72669-52b2-4744-a5dd-aea796699620/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:43:14,717 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cd72669-52b2-4744-a5dd-aea796699620/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-03 02:43:15,036 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-03 02:43:15,036 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 02:43:15,041 INFO L263 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 155 conjunts are in the unsatisfiable core [2022-11-03 02:43:15,045 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:43:15,052 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:43:15,123 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:43:15,231 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-03 02:43:15,232 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:43:15,385 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:43:15,445 WARN L833 $PredicateComparison]: unable to prove that (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_#valid_BEFORE_CALL_170| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_170| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_170| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_170| |c_#valid|))) (store |v_#valid_BEFORE_CALL_170| .cse0 (select |c_#valid| .cse0)))) (= (select |v_#valid_BEFORE_CALL_170| |c_ULTIMATE.start_sll_create_#t~ret5#1.base|) 0))) (= |c_ULTIMATE.start_sll_create_#t~ret5#1.offset| 0) (not (= |c_ULTIMATE.start_sll_create_~head~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_#t~ret5#1.base|) 1)) is different from false [2022-11-03 02:43:15,448 WARN L855 $PredicateComparison]: unable to prove that (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_#valid_BEFORE_CALL_170| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_170| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_170| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_170| |c_#valid|))) (store |v_#valid_BEFORE_CALL_170| .cse0 (select |c_#valid| .cse0)))) (= (select |v_#valid_BEFORE_CALL_170| |c_ULTIMATE.start_sll_create_#t~ret5#1.base|) 0))) (= |c_ULTIMATE.start_sll_create_#t~ret5#1.offset| 0) (not (= |c_ULTIMATE.start_sll_create_~head~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_#t~ret5#1.base|) 1)) is different from true [2022-11-03 02:43:15,462 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 13 treesize of output 9 [2022-11-03 02:43:15,492 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:43:15,497 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) (+ 4 |c_ULTIMATE.start_sll_create_~head~0#1.offset|)))) (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_170| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_170| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_170| .cse0) 1) (= |c_#valid| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_170| |c_#valid|))) (store |v_#valid_BEFORE_CALL_170| .cse1 (select |c_#valid| .cse1)))) (= (select |v_#valid_BEFORE_CALL_170| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0))) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (not (= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|)) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0))) is different from false [2022-11-03 02:43:15,506 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) (+ 4 |c_ULTIMATE.start_sll_create_~head~0#1.offset|)))) (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_170| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_170| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_170| .cse0) 1) (= |c_#valid| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_170| |c_#valid|))) (store |v_#valid_BEFORE_CALL_170| .cse1 (select |c_#valid| .cse1)))) (= (select |v_#valid_BEFORE_CALL_170| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0))) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (not (= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|)) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0))) is different from true [2022-11-03 02:43:15,554 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| .cse0) 4))) (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| |c_ULTIMATE.start_sll_append_~data#1|) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= |c_ULTIMATE.start_sll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select |c_#valid| .cse0) 1) (= |c_ULTIMATE.start_sll_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (exists ((|v_#valid_BEFORE_CALL_170| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_170| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_170| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_#valid| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_170| |c_#valid|))) (store |v_#valid_BEFORE_CALL_170| .cse2 (select |c_#valid| .cse2)))) (= (select |v_#valid_BEFORE_CALL_170| .cse0) 0))) (not (= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|))))) is different from false [2022-11-03 02:43:15,556 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| .cse0) 4))) (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| |c_ULTIMATE.start_sll_append_~data#1|) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= |c_ULTIMATE.start_sll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select |c_#valid| .cse0) 1) (= |c_ULTIMATE.start_sll_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (exists ((|v_#valid_BEFORE_CALL_170| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_170| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_170| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_#valid| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_170| |c_#valid|))) (store |v_#valid_BEFORE_CALL_170| .cse2 (select |c_#valid| .cse2)))) (= (select |v_#valid_BEFORE_CALL_170| .cse0) 0))) (not (= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|))))) is different from true [2022-11-03 02:43:15,573 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:43:15,573 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 23 [2022-11-03 02:43:15,580 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:43:15,608 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (exists ((|v_#valid_BEFORE_CALL_170| (Array Int Int)) (|v_#valid_BEFORE_CALL_171| (Array Int Int)) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_32| Int) (v_arrayElimCell_589 Int) (v_arrayElimIndex_34 Int)) (and (= (select |v_#valid_BEFORE_CALL_171| v_arrayElimIndex_34) 1) (= |v_#valid_BEFORE_CALL_171| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_170| |v_#valid_BEFORE_CALL_171|))) (store |v_#valid_BEFORE_CALL_170| .cse0 (select |v_#valid_BEFORE_CALL_171| .cse0)))) (not (= |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_32| v_arrayElimCell_589)) (= (select |v_#valid_BEFORE_CALL_170| v_arrayElimIndex_34) 0) (= (select |v_#valid_BEFORE_CALL_170| v_arrayElimCell_589) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_32|) (= (select |v_#valid_BEFORE_CALL_170| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_32|) 1))) (= |c_#valid| |c_old(#valid)|) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|)) is different from false [2022-11-03 02:43:15,611 WARN L855 $PredicateComparison]: unable to prove that (and (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (exists ((|v_#valid_BEFORE_CALL_170| (Array Int Int)) (|v_#valid_BEFORE_CALL_171| (Array Int Int)) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_32| Int) (v_arrayElimCell_589 Int) (v_arrayElimIndex_34 Int)) (and (= (select |v_#valid_BEFORE_CALL_171| v_arrayElimIndex_34) 1) (= |v_#valid_BEFORE_CALL_171| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_170| |v_#valid_BEFORE_CALL_171|))) (store |v_#valid_BEFORE_CALL_170| .cse0 (select |v_#valid_BEFORE_CALL_171| .cse0)))) (not (= |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_32| v_arrayElimCell_589)) (= (select |v_#valid_BEFORE_CALL_170| v_arrayElimIndex_34) 0) (= (select |v_#valid_BEFORE_CALL_170| v_arrayElimCell_589) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_32|) (= (select |v_#valid_BEFORE_CALL_170| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_32|) 1))) (= |c_#valid| |c_old(#valid)|) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|)) is different from true [2022-11-03 02:43:15,664 WARN L833 $PredicateComparison]: unable to prove that (and (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (exists ((|v_#valid_BEFORE_CALL_170| (Array Int Int)) (|v_#valid_BEFORE_CALL_171| (Array Int Int)) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_32| Int) (v_arrayElimCell_589 Int) (v_arrayElimIndex_34 Int)) (and (= (select |v_#valid_BEFORE_CALL_171| v_arrayElimIndex_34) 1) (= |v_#valid_BEFORE_CALL_171| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_170| |v_#valid_BEFORE_CALL_171|))) (store |v_#valid_BEFORE_CALL_170| .cse0 (select |v_#valid_BEFORE_CALL_171| .cse0)))) (not (= |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_32| v_arrayElimCell_589)) (= (select |v_#valid_BEFORE_CALL_170| v_arrayElimIndex_34) 0) (= (select |v_#valid_BEFORE_CALL_170| v_arrayElimCell_589) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_32|) (= (select |v_#valid_BEFORE_CALL_170| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_32|) 1))) (= |c_node_create_#in~data#1| |c_node_create_~data#1|) (= |c_node_create_~temp~0#1.offset| 0) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0)) is different from false [2022-11-03 02:43:15,667 WARN L855 $PredicateComparison]: unable to prove that (and (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (exists ((|v_#valid_BEFORE_CALL_170| (Array Int Int)) (|v_#valid_BEFORE_CALL_171| (Array Int Int)) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_32| Int) (v_arrayElimCell_589 Int) (v_arrayElimIndex_34 Int)) (and (= (select |v_#valid_BEFORE_CALL_171| v_arrayElimIndex_34) 1) (= |v_#valid_BEFORE_CALL_171| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_170| |v_#valid_BEFORE_CALL_171|))) (store |v_#valid_BEFORE_CALL_170| .cse0 (select |v_#valid_BEFORE_CALL_171| .cse0)))) (not (= |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_32| v_arrayElimCell_589)) (= (select |v_#valid_BEFORE_CALL_170| v_arrayElimIndex_34) 0) (= (select |v_#valid_BEFORE_CALL_170| v_arrayElimCell_589) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_32|) (= (select |v_#valid_BEFORE_CALL_170| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_32|) 1))) (= |c_node_create_#in~data#1| |c_node_create_~data#1|) (= |c_node_create_~temp~0#1.offset| 0) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0)) is different from true [2022-11-03 02:43:15,683 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:43:15,713 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_node_create_#res#1.offset| 0) (< |c_node_create_#res#1.base| |c_#StackHeapBarrier|) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (exists ((|v_#valid_BEFORE_CALL_170| (Array Int Int)) (|v_#valid_BEFORE_CALL_171| (Array Int Int)) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_32| Int) (v_arrayElimCell_589 Int) (v_arrayElimIndex_34 Int)) (and (= (select |v_#valid_BEFORE_CALL_171| v_arrayElimIndex_34) 1) (= |v_#valid_BEFORE_CALL_171| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_170| |v_#valid_BEFORE_CALL_171|))) (store |v_#valid_BEFORE_CALL_170| .cse0 (select |v_#valid_BEFORE_CALL_171| .cse0)))) (not (= |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_32| v_arrayElimCell_589)) (= (select |v_#valid_BEFORE_CALL_170| v_arrayElimIndex_34) 0) (= (select |v_#valid_BEFORE_CALL_170| v_arrayElimCell_589) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_32|) (= (select |v_#valid_BEFORE_CALL_170| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_32|) 1))) (exists ((v_ArrVal_1316 (Array Int Int))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_node_create_#res#1.base| v_ArrVal_1316))) (= (select (select |c_#memory_int| |c_node_create_#res#1.base|) |c_node_create_#res#1.offset|) |c_node_create_#in~data#1|) (exists ((v_ArrVal_1317 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.base)| |c_node_create_#res#1.base| v_ArrVal_1317) |c_#memory_$Pointer$.base|))) is different from false [2022-11-03 02:43:15,716 WARN L855 $PredicateComparison]: unable to prove that (and (= |c_node_create_#res#1.offset| 0) (< |c_node_create_#res#1.base| |c_#StackHeapBarrier|) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (exists ((|v_#valid_BEFORE_CALL_170| (Array Int Int)) (|v_#valid_BEFORE_CALL_171| (Array Int Int)) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_32| Int) (v_arrayElimCell_589 Int) (v_arrayElimIndex_34 Int)) (and (= (select |v_#valid_BEFORE_CALL_171| v_arrayElimIndex_34) 1) (= |v_#valid_BEFORE_CALL_171| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_170| |v_#valid_BEFORE_CALL_171|))) (store |v_#valid_BEFORE_CALL_170| .cse0 (select |v_#valid_BEFORE_CALL_171| .cse0)))) (not (= |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_32| v_arrayElimCell_589)) (= (select |v_#valid_BEFORE_CALL_170| v_arrayElimIndex_34) 0) (= (select |v_#valid_BEFORE_CALL_170| v_arrayElimCell_589) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_32|) (= (select |v_#valid_BEFORE_CALL_170| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_32|) 1))) (exists ((v_ArrVal_1316 (Array Int Int))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_node_create_#res#1.base| v_ArrVal_1316))) (= (select (select |c_#memory_int| |c_node_create_#res#1.base|) |c_node_create_#res#1.offset|) |c_node_create_#in~data#1|) (exists ((v_ArrVal_1317 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.base)| |c_node_create_#res#1.base| v_ArrVal_1317) |c_#memory_$Pointer$.base|))) is different from true [2022-11-03 02:43:15,737 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:43:15,738 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:43:15,749 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:43:15,760 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-03 02:43:15,760 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 50 treesize of output 48 [2022-11-03 02:43:15,835 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse4 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (+ |c_ULTIMATE.start_sll_append_#t~ret7#1.base| 2)) (.cse2 (select (select |c_#memory_$Pointer$.base| .cse4) 4))) (and (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= |c_ULTIMATE.start_sll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_sll_append_#t~ret7#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_#valid_BEFORE_CALL_173| (Array Int Int)) (|v_#valid_BEFORE_CALL_171| (Array Int Int)) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_32| Int) (v_arrayElimCell_589 Int) (v_arrayElimIndex_34 Int)) (and (= 1 (select |v_#valid_BEFORE_CALL_173| v_arrayElimCell_589)) (<= .cse0 |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_32|) (= (select |v_#valid_BEFORE_CALL_171| v_arrayElimIndex_34) 1) (= (select |v_#valid_BEFORE_CALL_173| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_32|) 1) (not (= |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_32| v_arrayElimCell_589)) (= |v_#valid_BEFORE_CALL_171| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_173| |v_#valid_BEFORE_CALL_171|))) (store |v_#valid_BEFORE_CALL_173| .cse1 (select |v_#valid_BEFORE_CALL_171| .cse1)))) (= (select |v_#valid_BEFORE_CALL_173| v_arrayElimIndex_34) 0))) (= |c_ULTIMATE.start_sll_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| |c_ULTIMATE.start_sll_append_#t~ret7#1.base|) |c_ULTIMATE.start_sll_append_#t~ret7#1.offset|)) (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_170| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_93| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_170| .cse2) 1) (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_170| |v_old(#valid)_AFTER_CALL_93|))) (store |v_#valid_BEFORE_CALL_170| .cse3 (select |v_old(#valid)_AFTER_CALL_93| .cse3))) |v_old(#valid)_AFTER_CALL_93|) (= (select |v_#valid_BEFORE_CALL_170| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= 0 (select |v_old(#valid)_AFTER_CALL_93| |c_ULTIMATE.start_sll_append_#t~ret7#1.base|)) (= (select |v_old(#valid)_AFTER_CALL_93| .cse4) 1) (= (select |v_#valid_BEFORE_CALL_170| .cse4) 0))) (not (= .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|))))) is different from false [2022-11-03 02:43:15,839 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse4 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (+ |c_ULTIMATE.start_sll_append_#t~ret7#1.base| 2)) (.cse2 (select (select |c_#memory_$Pointer$.base| .cse4) 4))) (and (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= |c_ULTIMATE.start_sll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_sll_append_#t~ret7#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_#valid_BEFORE_CALL_173| (Array Int Int)) (|v_#valid_BEFORE_CALL_171| (Array Int Int)) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_32| Int) (v_arrayElimCell_589 Int) (v_arrayElimIndex_34 Int)) (and (= 1 (select |v_#valid_BEFORE_CALL_173| v_arrayElimCell_589)) (<= .cse0 |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_32|) (= (select |v_#valid_BEFORE_CALL_171| v_arrayElimIndex_34) 1) (= (select |v_#valid_BEFORE_CALL_173| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_32|) 1) (not (= |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_32| v_arrayElimCell_589)) (= |v_#valid_BEFORE_CALL_171| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_173| |v_#valid_BEFORE_CALL_171|))) (store |v_#valid_BEFORE_CALL_173| .cse1 (select |v_#valid_BEFORE_CALL_171| .cse1)))) (= (select |v_#valid_BEFORE_CALL_173| v_arrayElimIndex_34) 0))) (= |c_ULTIMATE.start_sll_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| |c_ULTIMATE.start_sll_append_#t~ret7#1.base|) |c_ULTIMATE.start_sll_append_#t~ret7#1.offset|)) (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_170| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_93| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_170| .cse2) 1) (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_170| |v_old(#valid)_AFTER_CALL_93|))) (store |v_#valid_BEFORE_CALL_170| .cse3 (select |v_old(#valid)_AFTER_CALL_93| .cse3))) |v_old(#valid)_AFTER_CALL_93|) (= (select |v_#valid_BEFORE_CALL_170| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= 0 (select |v_old(#valid)_AFTER_CALL_93| |c_ULTIMATE.start_sll_append_#t~ret7#1.base|)) (= (select |v_old(#valid)_AFTER_CALL_93| .cse4) 1) (= (select |v_#valid_BEFORE_CALL_170| .cse4) 0))) (not (= .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|))))) is different from true [2022-11-03 02:43:15,932 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse4 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1 (+ 2 |c_ULTIMATE.start_sll_append_~new_last~0#1.base|)) (.cse2 (select (select |c_#memory_$Pointer$.base| .cse4) 4))) (and (exists ((|v_#valid_BEFORE_CALL_173| (Array Int Int)) (|v_#valid_BEFORE_CALL_171| (Array Int Int)) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_32| Int) (v_arrayElimCell_589 Int) (v_arrayElimIndex_34 Int)) (and (= 1 (select |v_#valid_BEFORE_CALL_173| v_arrayElimCell_589)) (= (select |v_#valid_BEFORE_CALL_171| v_arrayElimIndex_34) 1) (= (select |v_#valid_BEFORE_CALL_173| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_32|) 1) (not (= |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_32| v_arrayElimCell_589)) (= |v_#valid_BEFORE_CALL_171| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_173| |v_#valid_BEFORE_CALL_171|))) (store |v_#valid_BEFORE_CALL_173| .cse0 (select |v_#valid_BEFORE_CALL_171| .cse0)))) (= (select |v_#valid_BEFORE_CALL_173| v_arrayElimIndex_34) 0) (<= .cse1 |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_32|))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= |c_ULTIMATE.start_sll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_170| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_93| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_170| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_93| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) 0) (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_170| |v_old(#valid)_AFTER_CALL_93|))) (store |v_#valid_BEFORE_CALL_170| .cse3 (select |v_old(#valid)_AFTER_CALL_93| .cse3))) |v_old(#valid)_AFTER_CALL_93|) (= (select |v_#valid_BEFORE_CALL_170| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_93| .cse4) 1) (= (select |v_#valid_BEFORE_CALL_170| .cse4) 0))) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (<= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) |c_ULTIMATE.start_sll_append_~new_last~0#1.offset|)) (= |c_ULTIMATE.start_sll_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (not (= .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|))))) is different from false [2022-11-03 02:43:15,936 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse4 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1 (+ 2 |c_ULTIMATE.start_sll_append_~new_last~0#1.base|)) (.cse2 (select (select |c_#memory_$Pointer$.base| .cse4) 4))) (and (exists ((|v_#valid_BEFORE_CALL_173| (Array Int Int)) (|v_#valid_BEFORE_CALL_171| (Array Int Int)) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_32| Int) (v_arrayElimCell_589 Int) (v_arrayElimIndex_34 Int)) (and (= 1 (select |v_#valid_BEFORE_CALL_173| v_arrayElimCell_589)) (= (select |v_#valid_BEFORE_CALL_171| v_arrayElimIndex_34) 1) (= (select |v_#valid_BEFORE_CALL_173| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_32|) 1) (not (= |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_32| v_arrayElimCell_589)) (= |v_#valid_BEFORE_CALL_171| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_173| |v_#valid_BEFORE_CALL_171|))) (store |v_#valid_BEFORE_CALL_173| .cse0 (select |v_#valid_BEFORE_CALL_171| .cse0)))) (= (select |v_#valid_BEFORE_CALL_173| v_arrayElimIndex_34) 0) (<= .cse1 |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_32|))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= |c_ULTIMATE.start_sll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_170| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_93| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_170| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_93| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) 0) (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_170| |v_old(#valid)_AFTER_CALL_93|))) (store |v_#valid_BEFORE_CALL_170| .cse3 (select |v_old(#valid)_AFTER_CALL_93| .cse3))) |v_old(#valid)_AFTER_CALL_93|) (= (select |v_#valid_BEFORE_CALL_170| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_93| .cse4) 1) (= (select |v_#valid_BEFORE_CALL_170| .cse4) 0))) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (<= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) |c_ULTIMATE.start_sll_append_~new_last~0#1.offset|)) (= |c_ULTIMATE.start_sll_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (not (= .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|))))) is different from true [2022-11-03 02:43:16,029 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1 (+ 2 |c_ULTIMATE.start_sll_append_~new_last~0#1.base|)) (.cse2 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (select (select |c_#memory_$Pointer$.base| .cse5) 4))) (and (exists ((|v_#valid_BEFORE_CALL_173| (Array Int Int)) (|v_#valid_BEFORE_CALL_171| (Array Int Int)) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_32| Int) (v_arrayElimCell_589 Int) (v_arrayElimIndex_34 Int)) (and (= 1 (select |v_#valid_BEFORE_CALL_173| v_arrayElimCell_589)) (= (select |v_#valid_BEFORE_CALL_171| v_arrayElimIndex_34) 1) (= (select |v_#valid_BEFORE_CALL_173| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_32|) 1) (not (= |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_32| v_arrayElimCell_589)) (= |v_#valid_BEFORE_CALL_171| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_173| |v_#valid_BEFORE_CALL_171|))) (store |v_#valid_BEFORE_CALL_173| .cse0 (select |v_#valid_BEFORE_CALL_171| .cse0)))) (= (select |v_#valid_BEFORE_CALL_173| v_arrayElimIndex_34) 0) (<= .cse1 |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_32|))) (= .cse2 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_170| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_93| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_170| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_93| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) 0) (= (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_170| |v_old(#valid)_AFTER_CALL_93|))) (store |v_#valid_BEFORE_CALL_170| .cse4 (select |v_old(#valid)_AFTER_CALL_93| .cse4))) |v_old(#valid)_AFTER_CALL_93|) (= (select |v_#valid_BEFORE_CALL_170| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_93| .cse5) 1) (= (select |v_#valid_BEFORE_CALL_170| .cse5) 0))) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (<= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) |c_ULTIMATE.start_sll_append_~new_last~0#1.offset|)) (= |c_ULTIMATE.start_sll_append_~last~0#1.base| .cse5) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| .cse2) (not (= .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|))))) is different from false [2022-11-03 02:43:16,033 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1 (+ 2 |c_ULTIMATE.start_sll_append_~new_last~0#1.base|)) (.cse2 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (select (select |c_#memory_$Pointer$.base| .cse5) 4))) (and (exists ((|v_#valid_BEFORE_CALL_173| (Array Int Int)) (|v_#valid_BEFORE_CALL_171| (Array Int Int)) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_32| Int) (v_arrayElimCell_589 Int) (v_arrayElimIndex_34 Int)) (and (= 1 (select |v_#valid_BEFORE_CALL_173| v_arrayElimCell_589)) (= (select |v_#valid_BEFORE_CALL_171| v_arrayElimIndex_34) 1) (= (select |v_#valid_BEFORE_CALL_173| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_32|) 1) (not (= |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_32| v_arrayElimCell_589)) (= |v_#valid_BEFORE_CALL_171| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_173| |v_#valid_BEFORE_CALL_171|))) (store |v_#valid_BEFORE_CALL_173| .cse0 (select |v_#valid_BEFORE_CALL_171| .cse0)))) (= (select |v_#valid_BEFORE_CALL_173| v_arrayElimIndex_34) 0) (<= .cse1 |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_32|))) (= .cse2 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_170| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_93| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_170| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_93| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) 0) (= (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_170| |v_old(#valid)_AFTER_CALL_93|))) (store |v_#valid_BEFORE_CALL_170| .cse4 (select |v_old(#valid)_AFTER_CALL_93| .cse4))) |v_old(#valid)_AFTER_CALL_93|) (= (select |v_#valid_BEFORE_CALL_170| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_93| .cse5) 1) (= (select |v_#valid_BEFORE_CALL_170| .cse5) 0))) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (<= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) |c_ULTIMATE.start_sll_append_~new_last~0#1.offset|)) (= |c_ULTIMATE.start_sll_append_~last~0#1.base| .cse5) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| .cse2) (not (= .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|))))) is different from true [2022-11-03 02:43:16,228 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse7 (select |c_#memory_$Pointer$.base| .cse5)) (.cse2 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1 (+ 2 |c_ULTIMATE.start_sll_append_~new_last~0#1.base|)) (.cse6 (+ .cse2 4)) (.cse3 (select .cse7 4))) (and (exists ((|v_#valid_BEFORE_CALL_173| (Array Int Int)) (|v_#valid_BEFORE_CALL_171| (Array Int Int)) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_32| Int) (v_arrayElimCell_589 Int) (v_arrayElimIndex_34 Int)) (and (= 1 (select |v_#valid_BEFORE_CALL_173| v_arrayElimCell_589)) (= (select |v_#valid_BEFORE_CALL_171| v_arrayElimIndex_34) 1) (= (select |v_#valid_BEFORE_CALL_173| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_32|) 1) (not (= |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_32| v_arrayElimCell_589)) (= |v_#valid_BEFORE_CALL_171| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_173| |v_#valid_BEFORE_CALL_171|))) (store |v_#valid_BEFORE_CALL_173| .cse0 (select |v_#valid_BEFORE_CALL_171| .cse0)))) (= (select |v_#valid_BEFORE_CALL_173| v_arrayElimIndex_34) 0) (<= .cse1 |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_32|))) (= .cse2 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_170| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_93| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_170| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_93| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) 0) (= (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_170| |v_old(#valid)_AFTER_CALL_93|))) (store |v_#valid_BEFORE_CALL_170| .cse4 (select |v_old(#valid)_AFTER_CALL_93| .cse4))) |v_old(#valid)_AFTER_CALL_93|) (= (select |v_#valid_BEFORE_CALL_170| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_93| .cse5) 1) (= (select |v_#valid_BEFORE_CALL_170| .cse5) 0))) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| (select (select |c_#memory_$Pointer$.offset| .cse5) .cse6)) (<= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) |c_ULTIMATE.start_sll_append_~new_last~0#1.offset|)) (= (select .cse7 .cse6) |c_ULTIMATE.start_sll_append_~last~0#1.base|) (not (= .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|)))))) is different from false [2022-11-03 02:43:16,231 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse7 (select |c_#memory_$Pointer$.base| .cse5)) (.cse2 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1 (+ 2 |c_ULTIMATE.start_sll_append_~new_last~0#1.base|)) (.cse6 (+ .cse2 4)) (.cse3 (select .cse7 4))) (and (exists ((|v_#valid_BEFORE_CALL_173| (Array Int Int)) (|v_#valid_BEFORE_CALL_171| (Array Int Int)) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_32| Int) (v_arrayElimCell_589 Int) (v_arrayElimIndex_34 Int)) (and (= 1 (select |v_#valid_BEFORE_CALL_173| v_arrayElimCell_589)) (= (select |v_#valid_BEFORE_CALL_171| v_arrayElimIndex_34) 1) (= (select |v_#valid_BEFORE_CALL_173| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_32|) 1) (not (= |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_32| v_arrayElimCell_589)) (= |v_#valid_BEFORE_CALL_171| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_173| |v_#valid_BEFORE_CALL_171|))) (store |v_#valid_BEFORE_CALL_173| .cse0 (select |v_#valid_BEFORE_CALL_171| .cse0)))) (= (select |v_#valid_BEFORE_CALL_173| v_arrayElimIndex_34) 0) (<= .cse1 |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_32|))) (= .cse2 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_170| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_93| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_170| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_93| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) 0) (= (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_170| |v_old(#valid)_AFTER_CALL_93|))) (store |v_#valid_BEFORE_CALL_170| .cse4 (select |v_old(#valid)_AFTER_CALL_93| .cse4))) |v_old(#valid)_AFTER_CALL_93|) (= (select |v_#valid_BEFORE_CALL_170| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_93| .cse5) 1) (= (select |v_#valid_BEFORE_CALL_170| .cse5) 0))) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| (select (select |c_#memory_$Pointer$.offset| .cse5) .cse6)) (<= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) |c_ULTIMATE.start_sll_append_~new_last~0#1.offset|)) (= (select .cse7 .cse6) |c_ULTIMATE.start_sll_append_~last~0#1.base|) (not (= .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|)))))) is different from true [2022-11-03 02:43:16,446 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:43:16,447 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:43:16,490 INFO L356 Elim1Store]: treesize reduction 103, result has 14.9 percent of original size [2022-11-03 02:43:16,491 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 6 new quantified variables, introduced 6 case distinctions, treesize of input 174 treesize of output 94 [2022-11-03 02:43:16,511 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:43:16,512 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 52 [2022-11-03 02:43:16,526 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:43:16,527 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:43:16,528 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 185 treesize of output 125 [2022-11-03 02:43:16,603 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| .cse3) 4)) (.cse4 (+ (select (select |c_#memory_$Pointer$.offset| .cse3) 4) 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| .cse0) .cse4))) (let ((.cse5 (+ 2 .cse1))) (and (exists ((|v_#valid_BEFORE_CALL_170| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_93| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_170| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_93| .cse1) 0) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_170| |v_old(#valid)_AFTER_CALL_93|))) (store |v_#valid_BEFORE_CALL_170| .cse2 (select |v_old(#valid)_AFTER_CALL_93| .cse2))) |v_old(#valid)_AFTER_CALL_93|) (= (select |v_#valid_BEFORE_CALL_170| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_93| .cse3) 1) (= (select |v_#valid_BEFORE_CALL_170| .cse3) 0))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= (select (select |c_#memory_$Pointer$.offset| .cse0) .cse4) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (<= .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse1) 0)) (exists ((|v_#valid_BEFORE_CALL_173| (Array Int Int)) (|v_#valid_BEFORE_CALL_171| (Array Int Int)) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_32| Int) (v_arrayElimCell_589 Int) (v_arrayElimIndex_34 Int)) (and (= 1 (select |v_#valid_BEFORE_CALL_173| v_arrayElimCell_589)) (= (select |v_#valid_BEFORE_CALL_171| v_arrayElimIndex_34) 1) (= (select |v_#valid_BEFORE_CALL_173| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_32|) 1) (not (= |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_32| v_arrayElimCell_589)) (= |v_#valid_BEFORE_CALL_171| (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_173| |v_#valid_BEFORE_CALL_171|))) (store |v_#valid_BEFORE_CALL_173| .cse6 (select |v_#valid_BEFORE_CALL_171| .cse6)))) (<= .cse5 |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_32|) (= (select |v_#valid_BEFORE_CALL_173| v_arrayElimIndex_34) 0))) (not (= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|))))))) is different from false [2022-11-03 02:43:16,607 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| .cse3) 4)) (.cse4 (+ (select (select |c_#memory_$Pointer$.offset| .cse3) 4) 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| .cse0) .cse4))) (let ((.cse5 (+ 2 .cse1))) (and (exists ((|v_#valid_BEFORE_CALL_170| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_93| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_170| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_93| .cse1) 0) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_170| |v_old(#valid)_AFTER_CALL_93|))) (store |v_#valid_BEFORE_CALL_170| .cse2 (select |v_old(#valid)_AFTER_CALL_93| .cse2))) |v_old(#valid)_AFTER_CALL_93|) (= (select |v_#valid_BEFORE_CALL_170| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_93| .cse3) 1) (= (select |v_#valid_BEFORE_CALL_170| .cse3) 0))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= (select (select |c_#memory_$Pointer$.offset| .cse0) .cse4) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (<= .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse1) 0)) (exists ((|v_#valid_BEFORE_CALL_173| (Array Int Int)) (|v_#valid_BEFORE_CALL_171| (Array Int Int)) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_32| Int) (v_arrayElimCell_589 Int) (v_arrayElimIndex_34 Int)) (and (= 1 (select |v_#valid_BEFORE_CALL_173| v_arrayElimCell_589)) (= (select |v_#valid_BEFORE_CALL_171| v_arrayElimIndex_34) 1) (= (select |v_#valid_BEFORE_CALL_173| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_32|) 1) (not (= |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_32| v_arrayElimCell_589)) (= |v_#valid_BEFORE_CALL_171| (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_173| |v_#valid_BEFORE_CALL_171|))) (store |v_#valid_BEFORE_CALL_173| .cse6 (select |v_#valid_BEFORE_CALL_171| .cse6)))) (<= .cse5 |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_32|) (= (select |v_#valid_BEFORE_CALL_173| v_arrayElimIndex_34) 0))) (not (= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|))))))) is different from true [2022-11-03 02:43:16,734 WARN L833 $PredicateComparison]: unable to prove that (and (exists ((|v_#valid_BEFORE_CALL_173| (Array Int Int)) (|v_#valid_BEFORE_CALL_170| (Array Int Int)) (|v_#valid_BEFORE_CALL_171| (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_32| Int) (v_arrayElimCell_589 Int) (v_arrayElimIndex_34 Int) (|v_old(#valid)_AFTER_CALL_93| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse6 (select (select |c_#memory_$Pointer$.base| .cse0) 4)) (.cse7 (+ (select (select |c_#memory_$Pointer$.offset| .cse0) 4) 4))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| .cse6) .cse7))) (let ((.cse1 (select (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (.cse5 (+ 2 .cse3))) (and (= .cse0 |c_ULTIMATE.start_main_~ptr~0#1.base|) (= 1 (select |v_#valid_BEFORE_CALL_173| v_arrayElimCell_589)) (= (select |v_#valid_BEFORE_CALL_171| v_arrayElimIndex_34) 1) (= (select |v_#valid_BEFORE_CALL_170| .cse0) 0) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| .cse1) (= (select |v_#valid_BEFORE_CALL_173| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_32|) 1) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_170| |v_old(#valid)_AFTER_CALL_93|))) (store |v_#valid_BEFORE_CALL_170| .cse2 (select |v_old(#valid)_AFTER_CALL_93| .cse2))) |v_old(#valid)_AFTER_CALL_93|) (= (select |v_#valid_BEFORE_CALL_170| |ULTIMATE.start_main_~#s~0#1.base|) 1) (not (= |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_32| v_arrayElimCell_589)) (= .cse1 0) (= (select |v_old(#valid)_AFTER_CALL_93| .cse3) 0) (= |v_#valid_BEFORE_CALL_171| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_173| |v_#valid_BEFORE_CALL_171|))) (store |v_#valid_BEFORE_CALL_173| .cse4 (select |v_#valid_BEFORE_CALL_171| .cse4)))) (= (select |v_old(#valid)_AFTER_CALL_93| .cse0) 1) (<= .cse5 |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_32|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse3) 0)) (<= .cse5 |ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_170| .cse6) 1) (= (select |v_#valid_BEFORE_CALL_173| v_arrayElimIndex_34) 0) (not (= .cse6 |ULTIMATE.start_main_~#s~0#1.base|)) (= (select (select |c_#memory_$Pointer$.offset| .cse6) .cse7) 0))))))) (= |c_ULTIMATE.start_main_~data~0#1| 1)) is different from false [2022-11-03 02:43:16,738 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((|v_#valid_BEFORE_CALL_173| (Array Int Int)) (|v_#valid_BEFORE_CALL_170| (Array Int Int)) (|v_#valid_BEFORE_CALL_171| (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_32| Int) (v_arrayElimCell_589 Int) (v_arrayElimIndex_34 Int) (|v_old(#valid)_AFTER_CALL_93| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse6 (select (select |c_#memory_$Pointer$.base| .cse0) 4)) (.cse7 (+ (select (select |c_#memory_$Pointer$.offset| .cse0) 4) 4))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| .cse6) .cse7))) (let ((.cse1 (select (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (.cse5 (+ 2 .cse3))) (and (= .cse0 |c_ULTIMATE.start_main_~ptr~0#1.base|) (= 1 (select |v_#valid_BEFORE_CALL_173| v_arrayElimCell_589)) (= (select |v_#valid_BEFORE_CALL_171| v_arrayElimIndex_34) 1) (= (select |v_#valid_BEFORE_CALL_170| .cse0) 0) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| .cse1) (= (select |v_#valid_BEFORE_CALL_173| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_32|) 1) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_170| |v_old(#valid)_AFTER_CALL_93|))) (store |v_#valid_BEFORE_CALL_170| .cse2 (select |v_old(#valid)_AFTER_CALL_93| .cse2))) |v_old(#valid)_AFTER_CALL_93|) (= (select |v_#valid_BEFORE_CALL_170| |ULTIMATE.start_main_~#s~0#1.base|) 1) (not (= |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_32| v_arrayElimCell_589)) (= .cse1 0) (= (select |v_old(#valid)_AFTER_CALL_93| .cse3) 0) (= |v_#valid_BEFORE_CALL_171| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_173| |v_#valid_BEFORE_CALL_171|))) (store |v_#valid_BEFORE_CALL_173| .cse4 (select |v_#valid_BEFORE_CALL_171| .cse4)))) (= (select |v_old(#valid)_AFTER_CALL_93| .cse0) 1) (<= .cse5 |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_32|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse3) 0)) (<= .cse5 |ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_170| .cse6) 1) (= (select |v_#valid_BEFORE_CALL_173| v_arrayElimIndex_34) 0) (not (= .cse6 |ULTIMATE.start_main_~#s~0#1.base|)) (= (select (select |c_#memory_$Pointer$.offset| .cse6) .cse7) 0))))))) (= |c_ULTIMATE.start_main_~data~0#1| 1)) is different from true [2022-11-03 02:43:16,878 WARN L833 $PredicateComparison]: unable to prove that (and (exists ((|v_#valid_BEFORE_CALL_173| (Array Int Int)) (|v_#valid_BEFORE_CALL_170| (Array Int Int)) (|v_#valid_BEFORE_CALL_171| (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_32| Int) (v_arrayElimCell_589 Int) (v_arrayElimIndex_34 Int) (|v_old(#valid)_AFTER_CALL_93| (Array Int Int))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse0 (select |c_#memory_$Pointer$.offset| .cse2)) (.cse4 (select |c_#memory_$Pointer$.base| .cse2))) (let ((.cse9 (select .cse4 4)) (.cse10 (+ (select .cse0 4) 4))) (let ((.cse6 (select (select |c_#memory_$Pointer$.base| .cse9) .cse10)) (.cse5 (select (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse1 (+ .cse5 4)) (.cse8 (+ 2 .cse6))) (and (= 1 (select |v_#valid_BEFORE_CALL_173| v_arrayElimCell_589)) (= (select |v_#valid_BEFORE_CALL_171| v_arrayElimIndex_34) 1) (= |c_ULTIMATE.start_main_~temp~2#1.offset| (select .cse0 .cse1)) (= (select |v_#valid_BEFORE_CALL_170| .cse2) 0) (= (select |v_#valid_BEFORE_CALL_173| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_32|) 1) (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_170| |v_old(#valid)_AFTER_CALL_93|))) (store |v_#valid_BEFORE_CALL_170| .cse3 (select |v_old(#valid)_AFTER_CALL_93| .cse3))) |v_old(#valid)_AFTER_CALL_93|) (= (select .cse4 .cse1) |c_ULTIMATE.start_main_~temp~2#1.base|) (= (select |v_#valid_BEFORE_CALL_170| |ULTIMATE.start_main_~#s~0#1.base|) 1) (not (= |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_32| v_arrayElimCell_589)) (= .cse5 0) (= (select |v_old(#valid)_AFTER_CALL_93| .cse6) 0) (= |v_#valid_BEFORE_CALL_171| (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_173| |v_#valid_BEFORE_CALL_171|))) (store |v_#valid_BEFORE_CALL_173| .cse7 (select |v_#valid_BEFORE_CALL_171| .cse7)))) (= (select |v_old(#valid)_AFTER_CALL_93| .cse2) 1) (<= .cse8 |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_32|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse6) 0)) (<= .cse8 |ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_170| .cse9) 1) (= (select |v_#valid_BEFORE_CALL_173| v_arrayElimIndex_34) 0) (not (= .cse9 |ULTIMATE.start_main_~#s~0#1.base|)) (= (select (select |c_#memory_$Pointer$.offset| .cse9) .cse10) 0)))))))) (= |c_ULTIMATE.start_main_~data~0#1| 1)) is different from false [2022-11-03 02:43:16,882 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((|v_#valid_BEFORE_CALL_173| (Array Int Int)) (|v_#valid_BEFORE_CALL_170| (Array Int Int)) (|v_#valid_BEFORE_CALL_171| (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_32| Int) (v_arrayElimCell_589 Int) (v_arrayElimIndex_34 Int) (|v_old(#valid)_AFTER_CALL_93| (Array Int Int))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse0 (select |c_#memory_$Pointer$.offset| .cse2)) (.cse4 (select |c_#memory_$Pointer$.base| .cse2))) (let ((.cse9 (select .cse4 4)) (.cse10 (+ (select .cse0 4) 4))) (let ((.cse6 (select (select |c_#memory_$Pointer$.base| .cse9) .cse10)) (.cse5 (select (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse1 (+ .cse5 4)) (.cse8 (+ 2 .cse6))) (and (= 1 (select |v_#valid_BEFORE_CALL_173| v_arrayElimCell_589)) (= (select |v_#valid_BEFORE_CALL_171| v_arrayElimIndex_34) 1) (= |c_ULTIMATE.start_main_~temp~2#1.offset| (select .cse0 .cse1)) (= (select |v_#valid_BEFORE_CALL_170| .cse2) 0) (= (select |v_#valid_BEFORE_CALL_173| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_32|) 1) (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_170| |v_old(#valid)_AFTER_CALL_93|))) (store |v_#valid_BEFORE_CALL_170| .cse3 (select |v_old(#valid)_AFTER_CALL_93| .cse3))) |v_old(#valid)_AFTER_CALL_93|) (= (select .cse4 .cse1) |c_ULTIMATE.start_main_~temp~2#1.base|) (= (select |v_#valid_BEFORE_CALL_170| |ULTIMATE.start_main_~#s~0#1.base|) 1) (not (= |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_32| v_arrayElimCell_589)) (= .cse5 0) (= (select |v_old(#valid)_AFTER_CALL_93| .cse6) 0) (= |v_#valid_BEFORE_CALL_171| (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_173| |v_#valid_BEFORE_CALL_171|))) (store |v_#valid_BEFORE_CALL_173| .cse7 (select |v_#valid_BEFORE_CALL_171| .cse7)))) (= (select |v_old(#valid)_AFTER_CALL_93| .cse2) 1) (<= .cse8 |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_32|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse6) 0)) (<= .cse8 |ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_170| .cse9) 1) (= (select |v_#valid_BEFORE_CALL_173| v_arrayElimIndex_34) 0) (not (= .cse9 |ULTIMATE.start_main_~#s~0#1.base|)) (= (select (select |c_#memory_$Pointer$.offset| .cse9) .cse10) 0)))))))) (= |c_ULTIMATE.start_main_~data~0#1| 1)) is different from true [2022-11-03 02:43:17,026 WARN L833 $PredicateComparison]: unable to prove that (and (exists ((|v_#valid_BEFORE_CALL_173| (Array Int Int)) (|v_#valid_BEFORE_CALL_170| (Array Int Int)) (|v_#valid_BEFORE_CALL_171| (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_32| Int) (v_arrayElimCell_589 Int) (v_arrayElimIndex_34 Int) (|v_old(#valid)_AFTER_CALL_93| (Array Int Int))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse10 (select |c_#memory_$Pointer$.offset| .cse2)) (.cse0 (select |c_#memory_$Pointer$.base| .cse2))) (let ((.cse8 (select .cse0 4)) (.cse9 (+ (select .cse10 4) 4))) (let ((.cse4 (select (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (.cse5 (select (select |c_#memory_$Pointer$.base| .cse8) .cse9))) (let ((.cse7 (+ 2 .cse5)) (.cse1 (+ .cse4 4))) (and (= 1 (select |v_#valid_BEFORE_CALL_173| v_arrayElimCell_589)) (= |c_ULTIMATE.start_main_~ptr~0#1.base| (select .cse0 .cse1)) (= (select |v_#valid_BEFORE_CALL_171| v_arrayElimIndex_34) 1) (= (select |v_#valid_BEFORE_CALL_170| .cse2) 0) (= (select |v_#valid_BEFORE_CALL_173| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_32|) 1) (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_170| |v_old(#valid)_AFTER_CALL_93|))) (store |v_#valid_BEFORE_CALL_170| .cse3 (select |v_old(#valid)_AFTER_CALL_93| .cse3))) |v_old(#valid)_AFTER_CALL_93|) (= (select |v_#valid_BEFORE_CALL_170| |ULTIMATE.start_main_~#s~0#1.base|) 1) (not (= |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_32| v_arrayElimCell_589)) (= .cse4 0) (= (select |v_old(#valid)_AFTER_CALL_93| .cse5) 0) (= |v_#valid_BEFORE_CALL_171| (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_173| |v_#valid_BEFORE_CALL_171|))) (store |v_#valid_BEFORE_CALL_173| .cse6 (select |v_#valid_BEFORE_CALL_171| .cse6)))) (= (select |v_old(#valid)_AFTER_CALL_93| .cse2) 1) (<= .cse7 |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_32|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse5) 0)) (<= .cse7 |ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_170| .cse8) 1) (= (select |v_#valid_BEFORE_CALL_173| v_arrayElimIndex_34) 0) (not (= .cse8 |ULTIMATE.start_main_~#s~0#1.base|)) (= (select (select |c_#memory_$Pointer$.offset| .cse8) .cse9) 0) (= (select .cse10 .cse1) |c_ULTIMATE.start_main_~ptr~0#1.offset|)))))))) (= |c_ULTIMATE.start_main_~data~0#1| 1)) is different from false [2022-11-03 02:43:17,030 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((|v_#valid_BEFORE_CALL_173| (Array Int Int)) (|v_#valid_BEFORE_CALL_170| (Array Int Int)) (|v_#valid_BEFORE_CALL_171| (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_32| Int) (v_arrayElimCell_589 Int) (v_arrayElimIndex_34 Int) (|v_old(#valid)_AFTER_CALL_93| (Array Int Int))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse10 (select |c_#memory_$Pointer$.offset| .cse2)) (.cse0 (select |c_#memory_$Pointer$.base| .cse2))) (let ((.cse8 (select .cse0 4)) (.cse9 (+ (select .cse10 4) 4))) (let ((.cse4 (select (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (.cse5 (select (select |c_#memory_$Pointer$.base| .cse8) .cse9))) (let ((.cse7 (+ 2 .cse5)) (.cse1 (+ .cse4 4))) (and (= 1 (select |v_#valid_BEFORE_CALL_173| v_arrayElimCell_589)) (= |c_ULTIMATE.start_main_~ptr~0#1.base| (select .cse0 .cse1)) (= (select |v_#valid_BEFORE_CALL_171| v_arrayElimIndex_34) 1) (= (select |v_#valid_BEFORE_CALL_170| .cse2) 0) (= (select |v_#valid_BEFORE_CALL_173| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_32|) 1) (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_170| |v_old(#valid)_AFTER_CALL_93|))) (store |v_#valid_BEFORE_CALL_170| .cse3 (select |v_old(#valid)_AFTER_CALL_93| .cse3))) |v_old(#valid)_AFTER_CALL_93|) (= (select |v_#valid_BEFORE_CALL_170| |ULTIMATE.start_main_~#s~0#1.base|) 1) (not (= |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_32| v_arrayElimCell_589)) (= .cse4 0) (= (select |v_old(#valid)_AFTER_CALL_93| .cse5) 0) (= |v_#valid_BEFORE_CALL_171| (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_173| |v_#valid_BEFORE_CALL_171|))) (store |v_#valid_BEFORE_CALL_173| .cse6 (select |v_#valid_BEFORE_CALL_171| .cse6)))) (= (select |v_old(#valid)_AFTER_CALL_93| .cse2) 1) (<= .cse7 |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_32|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse5) 0)) (<= .cse7 |ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_170| .cse8) 1) (= (select |v_#valid_BEFORE_CALL_173| v_arrayElimIndex_34) 0) (not (= .cse8 |ULTIMATE.start_main_~#s~0#1.base|)) (= (select (select |c_#memory_$Pointer$.offset| .cse8) .cse9) 0) (= (select .cse10 .cse1) |c_ULTIMATE.start_main_~ptr~0#1.offset|)))))))) (= |c_ULTIMATE.start_main_~data~0#1| 1)) is different from true [2022-11-03 02:43:17,060 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:43:17,061 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:43:17,092 INFO L356 Elim1Store]: treesize reduction 93, result has 7.0 percent of original size [2022-11-03 02:43:17,092 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 10 new quantified variables, introduced 10 case distinctions, treesize of input 253 treesize of output 116 [2022-11-03 02:43:17,126 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:43:17,127 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:43:17,140 INFO L356 Elim1Store]: treesize reduction 10, result has 41.2 percent of original size [2022-11-03 02:43:17,141 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 8 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 31 [2022-11-03 02:43:17,184 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 2 |c_ULTIMATE.start_main_~temp~2#1.base|))) (and (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| |c_ULTIMATE.start_main_~temp~2#1.base|) 0)) (exists ((v_arrayElimIndex_41 Int) (|v_#valid_BEFORE_CALL_170| (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int) (|v_old(#valid)_AFTER_CALL_93| (Array Int Int)) (v_arrayElimIndex_44 Int)) (and (= (select |v_old(#valid)_AFTER_CALL_93| |c_ULTIMATE.start_main_~temp~2#1.base|) 0) (<= .cse0 |ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_old(#valid)_AFTER_CALL_93| v_arrayElimIndex_41) 1) (= (select |v_#valid_BEFORE_CALL_170| v_arrayElimIndex_41) 0) (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_170| |v_old(#valid)_AFTER_CALL_93|))) (store |v_#valid_BEFORE_CALL_170| .cse1 (select |v_old(#valid)_AFTER_CALL_93| .cse1))) |v_old(#valid)_AFTER_CALL_93|) (= (select |v_#valid_BEFORE_CALL_170| |ULTIMATE.start_main_~#s~0#1.base|) 1) (not (= v_arrayElimIndex_44 |ULTIMATE.start_main_~#s~0#1.base|)) (= (select |v_#valid_BEFORE_CALL_170| v_arrayElimIndex_44) 1))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_#valid_BEFORE_CALL_173| (Array Int Int)) (|v_#valid_BEFORE_CALL_171| (Array Int Int)) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_32| Int) (v_arrayElimCell_589 Int) (v_arrayElimIndex_34 Int)) (and (= 1 (select |v_#valid_BEFORE_CALL_173| v_arrayElimCell_589)) (= (select |v_#valid_BEFORE_CALL_171| v_arrayElimIndex_34) 1) (= (select |v_#valid_BEFORE_CALL_173| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_32|) 1) (not (= |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_32| v_arrayElimCell_589)) (= |v_#valid_BEFORE_CALL_171| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_173| |v_#valid_BEFORE_CALL_171|))) (store |v_#valid_BEFORE_CALL_173| .cse2 (select |v_#valid_BEFORE_CALL_171| .cse2)))) (<= .cse0 |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_32|) (= (select |v_#valid_BEFORE_CALL_173| v_arrayElimIndex_34) 0))) (= |c_ULTIMATE.start_main_~temp~2#1.offset| 0))) is different from false [2022-11-03 02:43:17,188 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 2 |c_ULTIMATE.start_main_~temp~2#1.base|))) (and (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| |c_ULTIMATE.start_main_~temp~2#1.base|) 0)) (exists ((v_arrayElimIndex_41 Int) (|v_#valid_BEFORE_CALL_170| (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int) (|v_old(#valid)_AFTER_CALL_93| (Array Int Int)) (v_arrayElimIndex_44 Int)) (and (= (select |v_old(#valid)_AFTER_CALL_93| |c_ULTIMATE.start_main_~temp~2#1.base|) 0) (<= .cse0 |ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_old(#valid)_AFTER_CALL_93| v_arrayElimIndex_41) 1) (= (select |v_#valid_BEFORE_CALL_170| v_arrayElimIndex_41) 0) (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_170| |v_old(#valid)_AFTER_CALL_93|))) (store |v_#valid_BEFORE_CALL_170| .cse1 (select |v_old(#valid)_AFTER_CALL_93| .cse1))) |v_old(#valid)_AFTER_CALL_93|) (= (select |v_#valid_BEFORE_CALL_170| |ULTIMATE.start_main_~#s~0#1.base|) 1) (not (= v_arrayElimIndex_44 |ULTIMATE.start_main_~#s~0#1.base|)) (= (select |v_#valid_BEFORE_CALL_170| v_arrayElimIndex_44) 1))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_#valid_BEFORE_CALL_173| (Array Int Int)) (|v_#valid_BEFORE_CALL_171| (Array Int Int)) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_32| Int) (v_arrayElimCell_589 Int) (v_arrayElimIndex_34 Int)) (and (= 1 (select |v_#valid_BEFORE_CALL_173| v_arrayElimCell_589)) (= (select |v_#valid_BEFORE_CALL_171| v_arrayElimIndex_34) 1) (= (select |v_#valid_BEFORE_CALL_173| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_32|) 1) (not (= |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_32| v_arrayElimCell_589)) (= |v_#valid_BEFORE_CALL_171| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_173| |v_#valid_BEFORE_CALL_171|))) (store |v_#valid_BEFORE_CALL_173| .cse2 (select |v_#valid_BEFORE_CALL_171| .cse2)))) (<= .cse0 |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_32|) (= (select |v_#valid_BEFORE_CALL_173| v_arrayElimIndex_34) 0))) (= |c_ULTIMATE.start_main_~temp~2#1.offset| 0))) is different from true [2022-11-03 02:43:17,265 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~ptr~0#1.base| 2))) (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_#valid_BEFORE_CALL_173| (Array Int Int)) (|v_#valid_BEFORE_CALL_171| (Array Int Int)) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_32| Int) (v_arrayElimCell_589 Int) (v_arrayElimIndex_34 Int)) (and (= 1 (select |v_#valid_BEFORE_CALL_173| v_arrayElimCell_589)) (= (select |v_#valid_BEFORE_CALL_171| v_arrayElimIndex_34) 1) (= (select |v_#valid_BEFORE_CALL_173| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_32|) 1) (<= .cse0 |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_32|) (not (= |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_32| v_arrayElimCell_589)) (= |v_#valid_BEFORE_CALL_171| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_173| |v_#valid_BEFORE_CALL_171|))) (store |v_#valid_BEFORE_CALL_173| .cse1 (select |v_#valid_BEFORE_CALL_171| .cse1)))) (= (select |v_#valid_BEFORE_CALL_173| v_arrayElimIndex_34) 0))) (exists ((v_arrayElimIndex_41 Int) (|v_#valid_BEFORE_CALL_170| (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int) (|v_old(#valid)_AFTER_CALL_93| (Array Int Int)) (v_arrayElimIndex_44 Int)) (and (= (select |v_old(#valid)_AFTER_CALL_93| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_93| v_arrayElimIndex_41) 1) (= (select |v_#valid_BEFORE_CALL_170| v_arrayElimIndex_41) 0) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_170| |v_old(#valid)_AFTER_CALL_93|))) (store |v_#valid_BEFORE_CALL_170| .cse2 (select |v_old(#valid)_AFTER_CALL_93| .cse2))) |v_old(#valid)_AFTER_CALL_93|) (= (select |v_#valid_BEFORE_CALL_170| |ULTIMATE.start_main_~#s~0#1.base|) 1) (not (= v_arrayElimIndex_44 |ULTIMATE.start_main_~#s~0#1.base|)) (= (select |v_#valid_BEFORE_CALL_170| v_arrayElimIndex_44) 1) (<= .cse0 |ULTIMATE.start_main_~#s~0#1.base|))))) is different from false [2022-11-03 02:43:17,269 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~ptr~0#1.base| 2))) (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_#valid_BEFORE_CALL_173| (Array Int Int)) (|v_#valid_BEFORE_CALL_171| (Array Int Int)) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_32| Int) (v_arrayElimCell_589 Int) (v_arrayElimIndex_34 Int)) (and (= 1 (select |v_#valid_BEFORE_CALL_173| v_arrayElimCell_589)) (= (select |v_#valid_BEFORE_CALL_171| v_arrayElimIndex_34) 1) (= (select |v_#valid_BEFORE_CALL_173| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_32|) 1) (<= .cse0 |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_32|) (not (= |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_32| v_arrayElimCell_589)) (= |v_#valid_BEFORE_CALL_171| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_173| |v_#valid_BEFORE_CALL_171|))) (store |v_#valid_BEFORE_CALL_173| .cse1 (select |v_#valid_BEFORE_CALL_171| .cse1)))) (= (select |v_#valid_BEFORE_CALL_173| v_arrayElimIndex_34) 0))) (exists ((v_arrayElimIndex_41 Int) (|v_#valid_BEFORE_CALL_170| (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int) (|v_old(#valid)_AFTER_CALL_93| (Array Int Int)) (v_arrayElimIndex_44 Int)) (and (= (select |v_old(#valid)_AFTER_CALL_93| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_93| v_arrayElimIndex_41) 1) (= (select |v_#valid_BEFORE_CALL_170| v_arrayElimIndex_41) 0) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_170| |v_old(#valid)_AFTER_CALL_93|))) (store |v_#valid_BEFORE_CALL_170| .cse2 (select |v_old(#valid)_AFTER_CALL_93| .cse2))) |v_old(#valid)_AFTER_CALL_93|) (= (select |v_#valid_BEFORE_CALL_170| |ULTIMATE.start_main_~#s~0#1.base|) 1) (not (= v_arrayElimIndex_44 |ULTIMATE.start_main_~#s~0#1.base|)) (= (select |v_#valid_BEFORE_CALL_170| v_arrayElimIndex_44) 1) (<= .cse0 |ULTIMATE.start_main_~#s~0#1.base|))))) is different from true [2022-11-03 02:43:17,305 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:43:17,359 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 17 not checked. [2022-11-03 02:43:17,360 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:43:17,688 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1320 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse6 (+ |c_ULTIMATE.start_sll_append_~last~0#1.offset| 4))) (let ((.cse3 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base|) .cse6 |c_ULTIMATE.start_sll_append_~new_last~0#1.offset|))) (.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~last~0#1.base|) .cse6 |c_ULTIMATE.start_sll_append_~new_last~0#1.base|)))) (let ((.cse4 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse5 (+ (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (let ((.cse1 (select (select .cse0 .cse4) .cse5)) (.cse2 (+ (select (select .cse3 .cse4) .cse5) 4))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_append_~last~0#1.base| v_ArrVal_1320) (select (select .cse0 .cse1) .cse2)) (select (select .cse3 .cse1) .cse2)))))))) is different from false [2022-11-03 02:43:17,707 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1320 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse8 (+ |c_ULTIMATE.start_sll_append_~last~0#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~last~0#1.base|) .cse8)) (.cse7 (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base|) .cse8) 4))) (let ((.cse4 (store |c_#memory_$Pointer$.offset| .cse0 (store (select |c_#memory_$Pointer$.offset| .cse0) .cse7 |c_ULTIMATE.start_sll_append_~new_last~0#1.offset|))) (.cse1 (store |c_#memory_$Pointer$.base| .cse0 (store (select |c_#memory_$Pointer$.base| .cse0) .cse7 |c_ULTIMATE.start_sll_append_~new_last~0#1.base|)))) (let ((.cse5 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse6 (+ 4 (select (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (let ((.cse2 (select (select .cse1 .cse5) .cse6)) (.cse3 (+ (select (select .cse4 .cse5) .cse6) 4))) (select (select (store |c_#memory_int| .cse0 v_ArrVal_1320) (select (select .cse1 .cse2) .cse3)) (select (select .cse4 .cse2) .cse3))))))))) is different from false [2022-11-03 02:43:17,723 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1320 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse8 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (.cse9 (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| .cse8) .cse9)) (.cse7 (+ (select (select |c_#memory_$Pointer$.offset| .cse8) .cse9) 4))) (let ((.cse4 (store |c_#memory_$Pointer$.offset| .cse0 (store (select |c_#memory_$Pointer$.offset| .cse0) .cse7 |c_ULTIMATE.start_sll_append_~new_last~0#1.offset|))) (.cse1 (store |c_#memory_$Pointer$.base| .cse0 (store (select |c_#memory_$Pointer$.base| .cse0) .cse7 |c_ULTIMATE.start_sll_append_~new_last~0#1.base|)))) (let ((.cse5 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse6 (+ (select (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (let ((.cse2 (select (select .cse1 .cse5) .cse6)) (.cse3 (+ (select (select .cse4 .cse5) .cse6) 4))) (select (select (store |c_#memory_int| .cse0 v_ArrVal_1320) (select (select .cse1 .cse2) .cse3)) (select (select .cse4 .cse2) .cse3))))))))) is different from false [2022-11-03 02:43:17,734 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1320 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse8 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (.cse9 (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| .cse8) .cse9)) (.cse7 (+ (select (select |c_#memory_$Pointer$.offset| .cse8) .cse9) 4))) (let ((.cse4 (store |c_#memory_$Pointer$.offset| .cse0 (store (select |c_#memory_$Pointer$.offset| .cse0) .cse7 |c_ULTIMATE.start_sll_append_#t~ret7#1.offset|))) (.cse1 (store |c_#memory_$Pointer$.base| .cse0 (store (select |c_#memory_$Pointer$.base| .cse0) .cse7 |c_ULTIMATE.start_sll_append_#t~ret7#1.base|)))) (let ((.cse5 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse6 (+ 4 (select (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (let ((.cse2 (select (select .cse1 .cse5) .cse6)) (.cse3 (+ (select (select .cse4 .cse5) .cse6) 4))) (select (select (store |c_#memory_int| .cse0 v_ArrVal_1320) (select (select .cse1 .cse2) .cse3)) (select (select .cse4 .cse2) .cse3))))))))) is different from false [2022-11-03 02:43:17,849 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:43:17,849 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 1299 treesize of output 1300 [2022-11-03 02:43:17,877 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:43:17,878 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 3221 treesize of output 3224 [2022-11-03 02:43:17,890 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1290 treesize of output 659 [2022-11-03 02:43:21,167 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1087197195] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:43:21,167 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [56446898] [2022-11-03 02:43:21,169 INFO L159 IcfgInterpreter]: Started Sifa with 18 locations of interest [2022-11-03 02:43:21,169 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 02:43:21,170 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 02:43:21,170 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 02:43:21,170 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 02:43:21,186 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:43:21,199 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-03 02:43:21,199 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:43:21,209 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:43:21,225 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-03 02:43:21,225 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:43:21,251 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:43:21,254 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:43:21,263 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:43:21,263 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 20 treesize of output 9 [2022-11-03 02:43:21,268 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:43:21,269 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 20 treesize of output 9 [2022-11-03 02:43:21,279 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:43:21,279 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:43:21,297 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:43:21,298 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:43:21,307 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:43:21,308 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:43:21,344 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:43:21,345 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:43:21,357 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:43:21,358 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:43:21,401 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:43:21,402 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:43:21,403 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 207 treesize of output 187 [2022-11-03 02:43:21,415 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:43:21,416 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 201 treesize of output 187 [2022-11-03 02:43:21,428 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:43:21,430 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 203 treesize of output 98 [2022-11-03 02:43:21,479 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:43:21,488 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:43:21,501 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:43:21,511 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:43:21,519 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:43:21,552 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:43:21,562 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:43:21,572 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:43:21,582 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:43:21,592 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:43:21,649 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:43:21,658 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:43:21,673 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2022-11-03 02:43:21,781 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 51 [2022-11-03 02:43:21,789 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 70 treesize of output 52 [2022-11-03 02:43:21,870 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 51 [2022-11-03 02:43:21,878 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 70 treesize of output 52 [2022-11-03 02:43:21,929 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:43:21,938 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:43:21,951 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2022-11-03 02:43:22,073 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:43:22,090 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:43:22,159 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:43:22,180 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:43:22,335 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 23 treesize of output 13 [2022-11-03 02:43:22,343 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2022-11-03 02:43:22,353 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 23 treesize of output 13 [2022-11-03 02:43:22,538 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 20 for LOIs [2022-11-03 02:43:22,547 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:43:22,552 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:43:22,566 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:43:22,567 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 20 treesize of output 9 [2022-11-03 02:43:22,579 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:43:22,580 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:43:22,588 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:43:22,589 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 20 treesize of output 9 [2022-11-03 02:43:22,592 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 02:43:27,135 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2966#(and (<= 0 |ULTIMATE.start_main_~count~0#1|) (<= 0 |ULTIMATE.start_sll_append_~head#1.offset|) (<= 1 |ULTIMATE.start_sll_create_#in~data#1|) (<= |ULTIMATE.start_sll_append_~data#1| 1) (<= |ULTIMATE.start_sll_create_#in~data#1| 1) (or (not (= |ULTIMATE.start_main_~ptr~0#1.base| 0)) (not (= |ULTIMATE.start_main_~ptr~0#1.offset| 0))) (<= 0 |ULTIMATE.start_sll_append_~head#1.base|) (<= |ULTIMATE.start_sll_create_~head~0#1.offset| 0) (<= 0 |ULTIMATE.start_sll_append_#in~head#1.offset|) (= |ULTIMATE.start_main_~temp~2#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~ptr~0#1.base|) (+ |ULTIMATE.start_main_~ptr~0#1.offset| 4))) (<= |ULTIMATE.start_sll_create_~len#1| 0) (<= |ULTIMATE.start_sll_create_#res#1.offset| 0) (<= 1 |ULTIMATE.start_sll_create_~data#1|) (<= |ULTIMATE.start_sll_append_#in~data#1| 1) (<= 0 |ULTIMATE.start_sll_append_#in~head#1.base|) (<= |ULTIMATE.start_sll_append_#in~head#1.offset| 0) (not (= |ULTIMATE.start_main_~data~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~ptr~0#1.base|) |ULTIMATE.start_main_~ptr~0#1.offset|))) (= |ULTIMATE.start_main_~data~0#1| 1) (<= 1 |ULTIMATE.start_sll_append_~data#1|) (<= |ULTIMATE.start_sll_create_~data#1| 1) (<= |ULTIMATE.start_sll_create_#in~len#1| 2) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (= |#NULL.offset| 0) (<= 0 |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_sll_append_~new_last~0#1.offset| 0) (<= |ULTIMATE.start_sll_append_~head#1.offset| 0) (<= 0 |ULTIMATE.start_sll_create_#res#1.offset|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~ptr~0#1.base|) (+ |ULTIMATE.start_main_~ptr~0#1.offset| 4)) |ULTIMATE.start_main_~temp~2#1.offset|) (<= 0 |#StackHeapBarrier|) (<= 2 |ULTIMATE.start_sll_create_#in~len#1|) (<= 0 |ULTIMATE.start_sll_create_~head~0#1.offset|) (<= 1 |ULTIMATE.start_sll_append_#in~data#1|) (= |#NULL.base| 0))' at error location [2022-11-03 02:43:27,135 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-03 02:43:27,135 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-03 02:43:27,135 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 26] total 51 [2022-11-03 02:43:27,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983721429] [2022-11-03 02:43:27,136 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-03 02:43:27,136 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-11-03 02:43:27,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:43:27,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-11-03 02:43:27,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=196, Invalid=3154, Unknown=36, NotChecked=2620, Total=6006 [2022-11-03 02:43:27,139 INFO L87 Difference]: Start difference. First operand 46 states and 55 transitions. Second operand has 51 states, 44 states have (on average 1.1590909090909092) internal successors, (51), 41 states have internal predecessors, (51), 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-03 02:43:27,953 WARN L833 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start_sll_create_#t~ret5#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_#valid_BEFORE_CALL_170| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_170| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_170| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_170| |c_#valid|))) (store |v_#valid_BEFORE_CALL_170| .cse0 (select |c_#valid| .cse0)))) (= (select |v_#valid_BEFORE_CALL_170| |c_ULTIMATE.start_sll_create_#t~ret5#1.base|) 0))) (= |c_ULTIMATE.start_sll_create_#t~ret5#1.offset| 0) (not (= |c_ULTIMATE.start_sll_create_~head~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (not (= |c_ULTIMATE.start_sll_create_#t~ret5#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_#t~ret5#1.base|) 1) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0)) is different from false [2022-11-03 02:43:27,957 WARN L855 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start_sll_create_#t~ret5#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_#valid_BEFORE_CALL_170| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_170| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_170| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_170| |c_#valid|))) (store |v_#valid_BEFORE_CALL_170| .cse0 (select |c_#valid| .cse0)))) (= (select |v_#valid_BEFORE_CALL_170| |c_ULTIMATE.start_sll_create_#t~ret5#1.base|) 0))) (= |c_ULTIMATE.start_sll_create_#t~ret5#1.offset| 0) (not (= |c_ULTIMATE.start_sll_create_~head~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (not (= |c_ULTIMATE.start_sll_create_#t~ret5#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_#t~ret5#1.base|) 1) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0)) is different from true [2022-11-03 02:43:27,963 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|))) (let ((.cse1 (select .cse3 (+ 4 |c_ULTIMATE.start_sll_create_~head~0#1.offset|))) (.cse0 (select .cse3 4))) (and (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_170| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_170| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_170| .cse1) 1) (= |c_#valid| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_170| |c_#valid|))) (store |v_#valid_BEFORE_CALL_170| .cse2 (select |c_#valid| .cse2)))) (= (select |v_#valid_BEFORE_CALL_170| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0))) (= (select |c_#valid| .cse0) 1) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (not (= |c_ULTIMATE.start_sll_create_~head~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (not (= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|)) (not (= .cse0 |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0)))) is different from false [2022-11-03 02:43:27,966 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|))) (let ((.cse1 (select .cse3 (+ 4 |c_ULTIMATE.start_sll_create_~head~0#1.offset|))) (.cse0 (select .cse3 4))) (and (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_170| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_170| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_170| .cse1) 1) (= |c_#valid| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_170| |c_#valid|))) (store |v_#valid_BEFORE_CALL_170| .cse2 (select |c_#valid| .cse2)))) (= (select |v_#valid_BEFORE_CALL_170| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0))) (= (select |c_#valid| .cse0) 1) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (not (= |c_ULTIMATE.start_sll_create_~head~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (not (= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|)) (not (= .cse0 |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0)))) is different from true [2022-11-03 02:43:27,974 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| .cse1) 4))) (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| |c_ULTIMATE.start_sll_append_~data#1|) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= |c_ULTIMATE.start_sll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= .cse0 |c_ULTIMATE.start_sll_append_~head#1.base|)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| .cse0) 1) (= (select (select |c_#memory_$Pointer$.offset| .cse1) 4) 0) (not (= .cse0 .cse1)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select |c_#valid| .cse1) 1) (= |c_ULTIMATE.start_sll_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (exists ((|v_#valid_BEFORE_CALL_170| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_170| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_170| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_#valid| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_170| |c_#valid|))) (store |v_#valid_BEFORE_CALL_170| .cse2 (select |c_#valid| .cse2)))) (= (select |v_#valid_BEFORE_CALL_170| .cse1) 0))) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|))))) is different from false [2022-11-03 02:43:27,977 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| .cse1) 4))) (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| |c_ULTIMATE.start_sll_append_~data#1|) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= |c_ULTIMATE.start_sll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= .cse0 |c_ULTIMATE.start_sll_append_~head#1.base|)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| .cse0) 1) (= (select (select |c_#memory_$Pointer$.offset| .cse1) 4) 0) (not (= .cse0 .cse1)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select |c_#valid| .cse1) 1) (= |c_ULTIMATE.start_sll_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (exists ((|v_#valid_BEFORE_CALL_170| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_170| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_170| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_#valid| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_170| |c_#valid|))) (store |v_#valid_BEFORE_CALL_170| .cse2 (select |c_#valid| .cse2)))) (= (select |v_#valid_BEFORE_CALL_170| .cse1) 0))) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|))))) is different from true [2022-11-03 02:43:27,985 WARN L833 $PredicateComparison]: unable to prove that (and (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (exists ((|v_#valid_BEFORE_CALL_170| (Array Int Int)) (|v_#valid_BEFORE_CALL_171| (Array Int Int)) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_32| Int) (v_arrayElimCell_589 Int) (v_arrayElimIndex_34 Int)) (and (= (select |v_#valid_BEFORE_CALL_171| v_arrayElimIndex_34) 1) (= |v_#valid_BEFORE_CALL_171| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_170| |v_#valid_BEFORE_CALL_171|))) (store |v_#valid_BEFORE_CALL_170| .cse0 (select |v_#valid_BEFORE_CALL_171| .cse0)))) (not (= |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_32| v_arrayElimCell_589)) (= (select |v_#valid_BEFORE_CALL_170| v_arrayElimIndex_34) 0) (= (select |v_#valid_BEFORE_CALL_170| v_arrayElimCell_589) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_32|) (= (select |v_#valid_BEFORE_CALL_170| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_32|) 1))) (= |c_node_create_#in~data#1| |c_node_create_~data#1|) (= |c_node_create_~temp~0#1.offset| 0) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|) (= (select |c_#valid| |c_node_create_~temp~0#1.base|) 1) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (<= (+ |c_node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|)) is different from false [2022-11-03 02:43:27,989 WARN L855 $PredicateComparison]: unable to prove that (and (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (exists ((|v_#valid_BEFORE_CALL_170| (Array Int Int)) (|v_#valid_BEFORE_CALL_171| (Array Int Int)) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_32| Int) (v_arrayElimCell_589 Int) (v_arrayElimIndex_34 Int)) (and (= (select |v_#valid_BEFORE_CALL_171| v_arrayElimIndex_34) 1) (= |v_#valid_BEFORE_CALL_171| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_170| |v_#valid_BEFORE_CALL_171|))) (store |v_#valid_BEFORE_CALL_170| .cse0 (select |v_#valid_BEFORE_CALL_171| .cse0)))) (not (= |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_32| v_arrayElimCell_589)) (= (select |v_#valid_BEFORE_CALL_170| v_arrayElimIndex_34) 0) (= (select |v_#valid_BEFORE_CALL_170| v_arrayElimCell_589) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_32|) (= (select |v_#valid_BEFORE_CALL_170| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_32|) 1))) (= |c_node_create_#in~data#1| |c_node_create_~data#1|) (= |c_node_create_~temp~0#1.offset| 0) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|) (= (select |c_#valid| |c_node_create_~temp~0#1.base|) 1) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (<= (+ |c_node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|)) is different from true [2022-11-03 02:43:27,998 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|)) (.cse0 (@diff |c_old(#memory_$Pointer$.offset)| |c_#memory_$Pointer$.offset|)) (.cse3 (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|)) (.cse4 (@diff |c_old(#memory_$Pointer$.base)| |c_#memory_$Pointer$.base|)) (.cse5 (select |c_#memory_int| |c_node_create_#res#1.base|))) (and (= |c_node_create_#res#1.offset| 0) (< |c_node_create_#res#1.base| |c_#StackHeapBarrier|) (or (= (select |c_old(#valid)| .cse0) 0) .cse1) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (exists ((|v_#valid_BEFORE_CALL_170| (Array Int Int)) (|v_#valid_BEFORE_CALL_171| (Array Int Int)) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_32| Int) (v_arrayElimCell_589 Int) (v_arrayElimIndex_34 Int)) (and (= (select |v_#valid_BEFORE_CALL_171| v_arrayElimIndex_34) 1) (= |v_#valid_BEFORE_CALL_171| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_170| |v_#valid_BEFORE_CALL_171|))) (store |v_#valid_BEFORE_CALL_170| .cse2 (select |v_#valid_BEFORE_CALL_171| .cse2)))) (not (= |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_32| v_arrayElimCell_589)) (= (select |v_#valid_BEFORE_CALL_170| v_arrayElimIndex_34) 0) (= (select |v_#valid_BEFORE_CALL_170| v_arrayElimCell_589) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_32|) (= (select |v_#valid_BEFORE_CALL_170| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_32|) 1))) (or .cse1 (<= (+ .cse0 1) |c_#StackHeapBarrier|)) (= (select |c_#valid| |c_node_create_#res#1.base|) 1) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| .cse0 (select |c_#memory_$Pointer$.offset| .cse0))) (or .cse3 (= (select |c_old(#valid)| .cse4) 0)) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| .cse4 (select |c_#memory_$Pointer$.base| .cse4))) (exists ((v_ArrVal_1316 (Array Int Int))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_node_create_#res#1.base| v_ArrVal_1316))) (or .cse3 (<= (+ .cse4 1) |c_#StackHeapBarrier|)) (= (select .cse5 |c_node_create_#res#1.offset|) |c_node_create_#in~data#1|) (exists ((v_ArrVal_1317 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.base)| |c_node_create_#res#1.base| v_ArrVal_1317) |c_#memory_$Pointer$.base|)) (<= (+ |c_node_create_#res#1.base| 1) |c_#StackHeapBarrier|) (= (select .cse5 0) |c_node_create_#in~data#1|))) is different from false [2022-11-03 02:43:28,004 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse1 (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|)) (.cse0 (@diff |c_old(#memory_$Pointer$.offset)| |c_#memory_$Pointer$.offset|)) (.cse3 (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|)) (.cse4 (@diff |c_old(#memory_$Pointer$.base)| |c_#memory_$Pointer$.base|)) (.cse5 (select |c_#memory_int| |c_node_create_#res#1.base|))) (and (= |c_node_create_#res#1.offset| 0) (< |c_node_create_#res#1.base| |c_#StackHeapBarrier|) (or (= (select |c_old(#valid)| .cse0) 0) .cse1) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (exists ((|v_#valid_BEFORE_CALL_170| (Array Int Int)) (|v_#valid_BEFORE_CALL_171| (Array Int Int)) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_32| Int) (v_arrayElimCell_589 Int) (v_arrayElimIndex_34 Int)) (and (= (select |v_#valid_BEFORE_CALL_171| v_arrayElimIndex_34) 1) (= |v_#valid_BEFORE_CALL_171| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_170| |v_#valid_BEFORE_CALL_171|))) (store |v_#valid_BEFORE_CALL_170| .cse2 (select |v_#valid_BEFORE_CALL_171| .cse2)))) (not (= |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_32| v_arrayElimCell_589)) (= (select |v_#valid_BEFORE_CALL_170| v_arrayElimIndex_34) 0) (= (select |v_#valid_BEFORE_CALL_170| v_arrayElimCell_589) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_32|) (= (select |v_#valid_BEFORE_CALL_170| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_32|) 1))) (or .cse1 (<= (+ .cse0 1) |c_#StackHeapBarrier|)) (= (select |c_#valid| |c_node_create_#res#1.base|) 1) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| .cse0 (select |c_#memory_$Pointer$.offset| .cse0))) (or .cse3 (= (select |c_old(#valid)| .cse4) 0)) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| .cse4 (select |c_#memory_$Pointer$.base| .cse4))) (exists ((v_ArrVal_1316 (Array Int Int))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_node_create_#res#1.base| v_ArrVal_1316))) (or .cse3 (<= (+ .cse4 1) |c_#StackHeapBarrier|)) (= (select .cse5 |c_node_create_#res#1.offset|) |c_node_create_#in~data#1|) (exists ((v_ArrVal_1317 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.base)| |c_node_create_#res#1.base| v_ArrVal_1317) |c_#memory_$Pointer$.base|)) (<= (+ |c_node_create_#res#1.base| 1) |c_#StackHeapBarrier|) (= (select .cse5 0) |c_node_create_#in~data#1|))) is different from true [2022-11-03 02:43:28,030 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse7 (select (select |c_#memory_$Pointer$.base| |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_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|))) (let ((.cse4 (select |c_#memory_int| |c_ULTIMATE.start_sll_append_#t~ret7#1.base|)) (.cse0 (+ |c_ULTIMATE.start_sll_append_#t~ret7#1.base| 2)) (.cse3 (select (select |c_#memory_$Pointer$.base| .cse2) 4)) (.cse5 (select (select |c_#memory_$Pointer$.base| .cse7) 4))) (and (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= |c_ULTIMATE.start_sll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_sll_append_#t~ret7#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_#valid_BEFORE_CALL_173| (Array Int Int)) (|v_#valid_BEFORE_CALL_171| (Array Int Int)) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_32| Int) (v_arrayElimCell_589 Int) (v_arrayElimIndex_34 Int)) (and (= 1 (select |v_#valid_BEFORE_CALL_173| v_arrayElimCell_589)) (<= .cse0 |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_32|) (= (select |v_#valid_BEFORE_CALL_171| v_arrayElimIndex_34) 1) (= (select |v_#valid_BEFORE_CALL_173| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_32|) 1) (not (= |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_32| v_arrayElimCell_589)) (= |v_#valid_BEFORE_CALL_171| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_173| |v_#valid_BEFORE_CALL_171|))) (store |v_#valid_BEFORE_CALL_173| .cse1 (select |v_#valid_BEFORE_CALL_171| .cse1)))) (= (select |v_#valid_BEFORE_CALL_173| v_arrayElimIndex_34) 0))) (= (select (select |c_#memory_$Pointer$.offset| .cse2) 4) 0) (not (= .cse2 .cse3)) (= (select .cse4 0) |c_ULTIMATE.start_main_~data~0#1|) (not (= .cse3 |c_ULTIMATE.start_sll_append_~head#1.base|)) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= |c_ULTIMATE.start_sll_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse4 |c_ULTIMATE.start_sll_append_#t~ret7#1.offset|)) (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= .cse3 |c_ULTIMATE.start_sll_append_#t~ret7#1.base|)) (exists ((|v_#valid_BEFORE_CALL_170| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_93| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_170| .cse5) 1) (= (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_170| |v_old(#valid)_AFTER_CALL_93|))) (store |v_#valid_BEFORE_CALL_170| .cse6 (select |v_old(#valid)_AFTER_CALL_93| .cse6))) |v_old(#valid)_AFTER_CALL_93|) (= (select |v_#valid_BEFORE_CALL_170| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= 0 (select |v_old(#valid)_AFTER_CALL_93| |c_ULTIMATE.start_sll_append_#t~ret7#1.base|)) (= (select |v_old(#valid)_AFTER_CALL_93| .cse7) 1) (= (select |v_#valid_BEFORE_CALL_170| .cse7) 0))) (not (= .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|))))) is different from false [2022-11-03 02:43:28,035 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse7 (select (select |c_#memory_$Pointer$.base| |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_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|))) (let ((.cse4 (select |c_#memory_int| |c_ULTIMATE.start_sll_append_#t~ret7#1.base|)) (.cse0 (+ |c_ULTIMATE.start_sll_append_#t~ret7#1.base| 2)) (.cse3 (select (select |c_#memory_$Pointer$.base| .cse2) 4)) (.cse5 (select (select |c_#memory_$Pointer$.base| .cse7) 4))) (and (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= |c_ULTIMATE.start_sll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_sll_append_#t~ret7#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_#valid_BEFORE_CALL_173| (Array Int Int)) (|v_#valid_BEFORE_CALL_171| (Array Int Int)) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_32| Int) (v_arrayElimCell_589 Int) (v_arrayElimIndex_34 Int)) (and (= 1 (select |v_#valid_BEFORE_CALL_173| v_arrayElimCell_589)) (<= .cse0 |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_32|) (= (select |v_#valid_BEFORE_CALL_171| v_arrayElimIndex_34) 1) (= (select |v_#valid_BEFORE_CALL_173| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_32|) 1) (not (= |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_32| v_arrayElimCell_589)) (= |v_#valid_BEFORE_CALL_171| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_173| |v_#valid_BEFORE_CALL_171|))) (store |v_#valid_BEFORE_CALL_173| .cse1 (select |v_#valid_BEFORE_CALL_171| .cse1)))) (= (select |v_#valid_BEFORE_CALL_173| v_arrayElimIndex_34) 0))) (= (select (select |c_#memory_$Pointer$.offset| .cse2) 4) 0) (not (= .cse2 .cse3)) (= (select .cse4 0) |c_ULTIMATE.start_main_~data~0#1|) (not (= .cse3 |c_ULTIMATE.start_sll_append_~head#1.base|)) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= |c_ULTIMATE.start_sll_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse4 |c_ULTIMATE.start_sll_append_#t~ret7#1.offset|)) (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= .cse3 |c_ULTIMATE.start_sll_append_#t~ret7#1.base|)) (exists ((|v_#valid_BEFORE_CALL_170| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_93| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_170| .cse5) 1) (= (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_170| |v_old(#valid)_AFTER_CALL_93|))) (store |v_#valid_BEFORE_CALL_170| .cse6 (select |v_old(#valid)_AFTER_CALL_93| .cse6))) |v_old(#valid)_AFTER_CALL_93|) (= (select |v_#valid_BEFORE_CALL_170| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= 0 (select |v_old(#valid)_AFTER_CALL_93| |c_ULTIMATE.start_sll_append_#t~ret7#1.base|)) (= (select |v_old(#valid)_AFTER_CALL_93| .cse7) 1) (= (select |v_#valid_BEFORE_CALL_170| .cse7) 0))) (not (= .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|))))) is different from true [2022-11-03 02:43:28,062 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse6 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|))) (let ((.cse1 (+ 2 |c_ULTIMATE.start_sll_append_~new_last~0#1.base|)) (.cse2 (select (select |c_#memory_$Pointer$.base| .cse6) 4)) (.cse7 (select |c_#memory_int| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|)) (.cse3 (select (select |c_#memory_$Pointer$.base| .cse5) 4))) (and (exists ((|v_#valid_BEFORE_CALL_173| (Array Int Int)) (|v_#valid_BEFORE_CALL_171| (Array Int Int)) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_32| Int) (v_arrayElimCell_589 Int) (v_arrayElimIndex_34 Int)) (and (= 1 (select |v_#valid_BEFORE_CALL_173| v_arrayElimCell_589)) (= (select |v_#valid_BEFORE_CALL_171| v_arrayElimIndex_34) 1) (= (select |v_#valid_BEFORE_CALL_173| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_32|) 1) (not (= |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_32| v_arrayElimCell_589)) (= |v_#valid_BEFORE_CALL_171| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_173| |v_#valid_BEFORE_CALL_171|))) (store |v_#valid_BEFORE_CALL_173| .cse0 (select |v_#valid_BEFORE_CALL_171| .cse0)))) (= (select |v_#valid_BEFORE_CALL_173| v_arrayElimIndex_34) 0) (<= .cse1 |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_32|))) (not (= .cse2 |c_ULTIMATE.start_sll_append_~new_last~0#1.base|)) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= |c_ULTIMATE.start_sll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_170| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_93| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_170| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_93| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) 0) (= (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_170| |v_old(#valid)_AFTER_CALL_93|))) (store |v_#valid_BEFORE_CALL_170| .cse4 (select |v_old(#valid)_AFTER_CALL_93| .cse4))) |v_old(#valid)_AFTER_CALL_93|) (= (select |v_#valid_BEFORE_CALL_170| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_93| .cse5) 1) (= (select |v_#valid_BEFORE_CALL_170| .cse5) 0))) (= .cse6 |c_ULTIMATE.start_sll_append_#t~mem8#1.base|) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (<= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse7 |c_ULTIMATE.start_sll_append_~new_last~0#1.offset|)) (= (select (select |c_#memory_$Pointer$.offset| .cse6) 4) 0) (not (= .cse6 .cse2)) (not (= .cse2 |c_ULTIMATE.start_sll_append_~head#1.base|)) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= |c_ULTIMATE.start_sll_append_#t~mem8#1.offset| 0) (= |c_ULTIMATE.start_sll_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse7 0)) (not (= .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|))))) is different from false [2022-11-03 02:43:28,067 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse6 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|))) (let ((.cse1 (+ 2 |c_ULTIMATE.start_sll_append_~new_last~0#1.base|)) (.cse2 (select (select |c_#memory_$Pointer$.base| .cse6) 4)) (.cse7 (select |c_#memory_int| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|)) (.cse3 (select (select |c_#memory_$Pointer$.base| .cse5) 4))) (and (exists ((|v_#valid_BEFORE_CALL_173| (Array Int Int)) (|v_#valid_BEFORE_CALL_171| (Array Int Int)) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_32| Int) (v_arrayElimCell_589 Int) (v_arrayElimIndex_34 Int)) (and (= 1 (select |v_#valid_BEFORE_CALL_173| v_arrayElimCell_589)) (= (select |v_#valid_BEFORE_CALL_171| v_arrayElimIndex_34) 1) (= (select |v_#valid_BEFORE_CALL_173| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_32|) 1) (not (= |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_32| v_arrayElimCell_589)) (= |v_#valid_BEFORE_CALL_171| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_173| |v_#valid_BEFORE_CALL_171|))) (store |v_#valid_BEFORE_CALL_173| .cse0 (select |v_#valid_BEFORE_CALL_171| .cse0)))) (= (select |v_#valid_BEFORE_CALL_173| v_arrayElimIndex_34) 0) (<= .cse1 |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_32|))) (not (= .cse2 |c_ULTIMATE.start_sll_append_~new_last~0#1.base|)) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= |c_ULTIMATE.start_sll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_170| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_93| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_170| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_93| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) 0) (= (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_170| |v_old(#valid)_AFTER_CALL_93|))) (store |v_#valid_BEFORE_CALL_170| .cse4 (select |v_old(#valid)_AFTER_CALL_93| .cse4))) |v_old(#valid)_AFTER_CALL_93|) (= (select |v_#valid_BEFORE_CALL_170| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_93| .cse5) 1) (= (select |v_#valid_BEFORE_CALL_170| .cse5) 0))) (= .cse6 |c_ULTIMATE.start_sll_append_#t~mem8#1.base|) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (<= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse7 |c_ULTIMATE.start_sll_append_~new_last~0#1.offset|)) (= (select (select |c_#memory_$Pointer$.offset| .cse6) 4) 0) (not (= .cse6 .cse2)) (not (= .cse2 |c_ULTIMATE.start_sll_append_~head#1.base|)) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= |c_ULTIMATE.start_sll_append_#t~mem8#1.offset| 0) (= |c_ULTIMATE.start_sll_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse7 0)) (not (= .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|))))) is different from true [2022-11-03 02:43:28,089 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse6 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse7 (+ |c_ULTIMATE.start_sll_append_~last~0#1.offset| 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~last~0#1.base|) .cse7)) (.cse1 (+ 2 |c_ULTIMATE.start_sll_append_~new_last~0#1.base|)) (.cse3 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse8 (select |c_#memory_int| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|)) (.cse4 (select (select |c_#memory_$Pointer$.base| .cse6) 4))) (and (exists ((|v_#valid_BEFORE_CALL_173| (Array Int Int)) (|v_#valid_BEFORE_CALL_171| (Array Int Int)) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_32| Int) (v_arrayElimCell_589 Int) (v_arrayElimIndex_34 Int)) (and (= 1 (select |v_#valid_BEFORE_CALL_173| v_arrayElimCell_589)) (= (select |v_#valid_BEFORE_CALL_171| v_arrayElimIndex_34) 1) (= (select |v_#valid_BEFORE_CALL_173| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_32|) 1) (not (= |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_32| v_arrayElimCell_589)) (= |v_#valid_BEFORE_CALL_171| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_173| |v_#valid_BEFORE_CALL_171|))) (store |v_#valid_BEFORE_CALL_173| .cse0 (select |v_#valid_BEFORE_CALL_171| .cse0)))) (= (select |v_#valid_BEFORE_CALL_173| v_arrayElimIndex_34) 0) (<= .cse1 |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_32|))) (not (= .cse2 |c_ULTIMATE.start_sll_append_~new_last~0#1.base|)) (= .cse3 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_170| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_93| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_170| .cse4) 1) (= (select |v_old(#valid)_AFTER_CALL_93| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) 0) (= (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_170| |v_old(#valid)_AFTER_CALL_93|))) (store |v_#valid_BEFORE_CALL_170| .cse5 (select |v_old(#valid)_AFTER_CALL_93| .cse5))) |v_old(#valid)_AFTER_CALL_93|) (= (select |v_#valid_BEFORE_CALL_170| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_93| .cse6) 1) (= (select |v_#valid_BEFORE_CALL_170| .cse6) 0))) (not (= .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|)) (not (= .cse2 |c_ULTIMATE.start_sll_append_~last~0#1.base|)) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base|) .cse7) 0) (<= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse8 |c_ULTIMATE.start_sll_append_~new_last~0#1.offset|)) (= |c_ULTIMATE.start_sll_append_~last~0#1.base| .cse6) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| 0) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| .cse3) (not (= 0 .cse6)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse8 0)) (not (= .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|))))) is different from false [2022-11-03 02:43:28,094 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse6 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse7 (+ |c_ULTIMATE.start_sll_append_~last~0#1.offset| 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~last~0#1.base|) .cse7)) (.cse1 (+ 2 |c_ULTIMATE.start_sll_append_~new_last~0#1.base|)) (.cse3 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse8 (select |c_#memory_int| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|)) (.cse4 (select (select |c_#memory_$Pointer$.base| .cse6) 4))) (and (exists ((|v_#valid_BEFORE_CALL_173| (Array Int Int)) (|v_#valid_BEFORE_CALL_171| (Array Int Int)) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_32| Int) (v_arrayElimCell_589 Int) (v_arrayElimIndex_34 Int)) (and (= 1 (select |v_#valid_BEFORE_CALL_173| v_arrayElimCell_589)) (= (select |v_#valid_BEFORE_CALL_171| v_arrayElimIndex_34) 1) (= (select |v_#valid_BEFORE_CALL_173| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_32|) 1) (not (= |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_32| v_arrayElimCell_589)) (= |v_#valid_BEFORE_CALL_171| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_173| |v_#valid_BEFORE_CALL_171|))) (store |v_#valid_BEFORE_CALL_173| .cse0 (select |v_#valid_BEFORE_CALL_171| .cse0)))) (= (select |v_#valid_BEFORE_CALL_173| v_arrayElimIndex_34) 0) (<= .cse1 |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_32|))) (not (= .cse2 |c_ULTIMATE.start_sll_append_~new_last~0#1.base|)) (= .cse3 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_170| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_93| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_170| .cse4) 1) (= (select |v_old(#valid)_AFTER_CALL_93| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) 0) (= (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_170| |v_old(#valid)_AFTER_CALL_93|))) (store |v_#valid_BEFORE_CALL_170| .cse5 (select |v_old(#valid)_AFTER_CALL_93| .cse5))) |v_old(#valid)_AFTER_CALL_93|) (= (select |v_#valid_BEFORE_CALL_170| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_93| .cse6) 1) (= (select |v_#valid_BEFORE_CALL_170| .cse6) 0))) (not (= .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|)) (not (= .cse2 |c_ULTIMATE.start_sll_append_~last~0#1.base|)) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base|) .cse7) 0) (<= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse8 |c_ULTIMATE.start_sll_append_~new_last~0#1.offset|)) (= |c_ULTIMATE.start_sll_append_~last~0#1.base| .cse6) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| 0) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| .cse3) (not (= 0 .cse6)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse8 0)) (not (= .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|))))) is different from true [2022-11-03 02:43:28,121 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse10 (select |c_#memory_$Pointer$.base| .cse5)) (.cse12 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1 (+ 2 |c_ULTIMATE.start_sll_append_~new_last~0#1.base|)) (.cse8 (+ .cse12 4)) (.cse2 (= .cse12 0)) (.cse7 (select |c_#memory_$Pointer$.offset| .cse5)) (.cse6 (= |c_ULTIMATE.start_sll_append_~new_last~0#1.offset| 0)) (.cse9 (select |c_#memory_int| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|)) (.cse3 (select .cse10 4))) (and (exists ((|v_#valid_BEFORE_CALL_173| (Array Int Int)) (|v_#valid_BEFORE_CALL_171| (Array Int Int)) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_32| Int) (v_arrayElimCell_589 Int) (v_arrayElimIndex_34 Int)) (and (= 1 (select |v_#valid_BEFORE_CALL_173| v_arrayElimCell_589)) (= (select |v_#valid_BEFORE_CALL_171| v_arrayElimIndex_34) 1) (= (select |v_#valid_BEFORE_CALL_173| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_32|) 1) (not (= |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_32| v_arrayElimCell_589)) (= |v_#valid_BEFORE_CALL_171| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_173| |v_#valid_BEFORE_CALL_171|))) (store |v_#valid_BEFORE_CALL_173| .cse0 (select |v_#valid_BEFORE_CALL_171| .cse0)))) (= (select |v_#valid_BEFORE_CALL_173| v_arrayElimIndex_34) 0) (<= .cse1 |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_32|))) .cse2 (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_170| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_93| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_170| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_93| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) 0) (= (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_170| |v_old(#valid)_AFTER_CALL_93|))) (store |v_#valid_BEFORE_CALL_170| .cse4 (select |v_old(#valid)_AFTER_CALL_93| .cse4))) |v_old(#valid)_AFTER_CALL_93|) (= (select |v_#valid_BEFORE_CALL_170| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_93| .cse5) 1) (= (select |v_#valid_BEFORE_CALL_170| .cse5) 0))) .cse6 (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| (select .cse7 .cse8)) (<= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse9 |c_ULTIMATE.start_sll_append_~new_last~0#1.offset|)) (= (select .cse10 .cse8) |c_ULTIMATE.start_sll_append_~last~0#1.base|) (or (let ((.cse11 (+ |c_ULTIMATE.start_sll_append_~last~0#1.offset| 4))) (and (not (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~last~0#1.base|) .cse11) 0)) (= .cse11 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (not (= |c_ULTIMATE.start_sll_append_~last~0#1.base| .cse5)) (= .cse3 |c_ULTIMATE.start_sll_append_~last~0#1.base|) .cse2 (= (select .cse7 4) 0) (not (= |c_ULTIMATE.start_sll_append_~new_last~0#1.base| |c_ULTIMATE.start_sll_append_~last~0#1.base|)) .cse6 (not (= |c_ULTIMATE.start_sll_append_~last~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse9 0)))) (not (= .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|)))))) is different from false [2022-11-03 02:43:28,127 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse10 (select |c_#memory_$Pointer$.base| .cse5)) (.cse12 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1 (+ 2 |c_ULTIMATE.start_sll_append_~new_last~0#1.base|)) (.cse8 (+ .cse12 4)) (.cse2 (= .cse12 0)) (.cse7 (select |c_#memory_$Pointer$.offset| .cse5)) (.cse6 (= |c_ULTIMATE.start_sll_append_~new_last~0#1.offset| 0)) (.cse9 (select |c_#memory_int| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|)) (.cse3 (select .cse10 4))) (and (exists ((|v_#valid_BEFORE_CALL_173| (Array Int Int)) (|v_#valid_BEFORE_CALL_171| (Array Int Int)) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_32| Int) (v_arrayElimCell_589 Int) (v_arrayElimIndex_34 Int)) (and (= 1 (select |v_#valid_BEFORE_CALL_173| v_arrayElimCell_589)) (= (select |v_#valid_BEFORE_CALL_171| v_arrayElimIndex_34) 1) (= (select |v_#valid_BEFORE_CALL_173| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_32|) 1) (not (= |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_32| v_arrayElimCell_589)) (= |v_#valid_BEFORE_CALL_171| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_173| |v_#valid_BEFORE_CALL_171|))) (store |v_#valid_BEFORE_CALL_173| .cse0 (select |v_#valid_BEFORE_CALL_171| .cse0)))) (= (select |v_#valid_BEFORE_CALL_173| v_arrayElimIndex_34) 0) (<= .cse1 |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_32|))) .cse2 (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_170| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_93| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_170| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_93| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) 0) (= (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_170| |v_old(#valid)_AFTER_CALL_93|))) (store |v_#valid_BEFORE_CALL_170| .cse4 (select |v_old(#valid)_AFTER_CALL_93| .cse4))) |v_old(#valid)_AFTER_CALL_93|) (= (select |v_#valid_BEFORE_CALL_170| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_93| .cse5) 1) (= (select |v_#valid_BEFORE_CALL_170| .cse5) 0))) .cse6 (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| (select .cse7 .cse8)) (<= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse9 |c_ULTIMATE.start_sll_append_~new_last~0#1.offset|)) (= (select .cse10 .cse8) |c_ULTIMATE.start_sll_append_~last~0#1.base|) (or (let ((.cse11 (+ |c_ULTIMATE.start_sll_append_~last~0#1.offset| 4))) (and (not (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~last~0#1.base|) .cse11) 0)) (= .cse11 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (not (= |c_ULTIMATE.start_sll_append_~last~0#1.base| .cse5)) (= .cse3 |c_ULTIMATE.start_sll_append_~last~0#1.base|) .cse2 (= (select .cse7 4) 0) (not (= |c_ULTIMATE.start_sll_append_~new_last~0#1.base| |c_ULTIMATE.start_sll_append_~last~0#1.base|)) .cse6 (not (= |c_ULTIMATE.start_sll_append_~last~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse9 0)))) (not (= .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|)))))) is different from true [2022-11-03 02:43:28,151 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse10 (select |c_#memory_$Pointer$.base| .cse5)) (.cse11 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1 (+ 2 |c_ULTIMATE.start_sll_append_~new_last~0#1.base|)) (.cse8 (+ .cse11 4)) (.cse2 (= .cse11 0)) (.cse7 (select |c_#memory_$Pointer$.offset| .cse5)) (.cse6 (= |c_ULTIMATE.start_sll_append_~new_last~0#1.offset| 0)) (.cse9 (select |c_#memory_int| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|)) (.cse3 (select .cse10 4))) (and (exists ((|v_#valid_BEFORE_CALL_173| (Array Int Int)) (|v_#valid_BEFORE_CALL_171| (Array Int Int)) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_32| Int) (v_arrayElimCell_589 Int) (v_arrayElimIndex_34 Int)) (and (= 1 (select |v_#valid_BEFORE_CALL_173| v_arrayElimCell_589)) (= (select |v_#valid_BEFORE_CALL_171| v_arrayElimIndex_34) 1) (= (select |v_#valid_BEFORE_CALL_173| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_32|) 1) (not (= |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_32| v_arrayElimCell_589)) (= |v_#valid_BEFORE_CALL_171| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_173| |v_#valid_BEFORE_CALL_171|))) (store |v_#valid_BEFORE_CALL_173| .cse0 (select |v_#valid_BEFORE_CALL_171| .cse0)))) (= (select |v_#valid_BEFORE_CALL_173| v_arrayElimIndex_34) 0) (<= .cse1 |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_32|))) .cse2 (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_170| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_93| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_170| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_93| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) 0) (= (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_170| |v_old(#valid)_AFTER_CALL_93|))) (store |v_#valid_BEFORE_CALL_170| .cse4 (select |v_old(#valid)_AFTER_CALL_93| .cse4))) |v_old(#valid)_AFTER_CALL_93|) (= (select |v_#valid_BEFORE_CALL_170| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_93| .cse5) 1) (= (select |v_#valid_BEFORE_CALL_170| .cse5) 0))) .cse6 (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| (select .cse7 .cse8)) (<= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse9 |c_ULTIMATE.start_sll_append_~new_last~0#1.offset|)) (= (select .cse10 .cse8) |c_ULTIMATE.start_sll_append_~last~0#1.base|) (or (and (not (= |c_ULTIMATE.start_sll_append_#t~mem11#1.base| 0)) (= (+ |c_ULTIMATE.start_sll_append_~last~0#1.offset| 4) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (and (not (= |c_ULTIMATE.start_sll_append_~last~0#1.base| .cse5)) (= .cse3 |c_ULTIMATE.start_sll_append_~last~0#1.base|) .cse2 (= (select .cse7 4) 0) (not (= |c_ULTIMATE.start_sll_append_~new_last~0#1.base| |c_ULTIMATE.start_sll_append_~last~0#1.base|)) .cse6 (not (= |c_ULTIMATE.start_sll_append_~last~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse9 0)))) (not (= .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|)))))) is different from false [2022-11-03 02:43:28,157 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse10 (select |c_#memory_$Pointer$.base| .cse5)) (.cse11 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1 (+ 2 |c_ULTIMATE.start_sll_append_~new_last~0#1.base|)) (.cse8 (+ .cse11 4)) (.cse2 (= .cse11 0)) (.cse7 (select |c_#memory_$Pointer$.offset| .cse5)) (.cse6 (= |c_ULTIMATE.start_sll_append_~new_last~0#1.offset| 0)) (.cse9 (select |c_#memory_int| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|)) (.cse3 (select .cse10 4))) (and (exists ((|v_#valid_BEFORE_CALL_173| (Array Int Int)) (|v_#valid_BEFORE_CALL_171| (Array Int Int)) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_32| Int) (v_arrayElimCell_589 Int) (v_arrayElimIndex_34 Int)) (and (= 1 (select |v_#valid_BEFORE_CALL_173| v_arrayElimCell_589)) (= (select |v_#valid_BEFORE_CALL_171| v_arrayElimIndex_34) 1) (= (select |v_#valid_BEFORE_CALL_173| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_32|) 1) (not (= |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_32| v_arrayElimCell_589)) (= |v_#valid_BEFORE_CALL_171| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_173| |v_#valid_BEFORE_CALL_171|))) (store |v_#valid_BEFORE_CALL_173| .cse0 (select |v_#valid_BEFORE_CALL_171| .cse0)))) (= (select |v_#valid_BEFORE_CALL_173| v_arrayElimIndex_34) 0) (<= .cse1 |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_32|))) .cse2 (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_170| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_93| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_170| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_93| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) 0) (= (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_170| |v_old(#valid)_AFTER_CALL_93|))) (store |v_#valid_BEFORE_CALL_170| .cse4 (select |v_old(#valid)_AFTER_CALL_93| .cse4))) |v_old(#valid)_AFTER_CALL_93|) (= (select |v_#valid_BEFORE_CALL_170| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_93| .cse5) 1) (= (select |v_#valid_BEFORE_CALL_170| .cse5) 0))) .cse6 (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| (select .cse7 .cse8)) (<= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse9 |c_ULTIMATE.start_sll_append_~new_last~0#1.offset|)) (= (select .cse10 .cse8) |c_ULTIMATE.start_sll_append_~last~0#1.base|) (or (and (not (= |c_ULTIMATE.start_sll_append_#t~mem11#1.base| 0)) (= (+ |c_ULTIMATE.start_sll_append_~last~0#1.offset| 4) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (and (not (= |c_ULTIMATE.start_sll_append_~last~0#1.base| .cse5)) (= .cse3 |c_ULTIMATE.start_sll_append_~last~0#1.base|) .cse2 (= (select .cse7 4) 0) (not (= |c_ULTIMATE.start_sll_append_~new_last~0#1.base| |c_ULTIMATE.start_sll_append_~last~0#1.base|)) .cse6 (not (= |c_ULTIMATE.start_sll_append_~last~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse9 0)))) (not (= .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|)))))) is different from true [2022-11-03 02:43:28,174 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse9 (select |c_#memory_$Pointer$.base| .cse2)) (.cse4 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse6 (select |c_#memory_$Pointer$.offset| .cse2)) (.cse1 (+ 2 |c_ULTIMATE.start_sll_append_~new_last~0#1.base|)) (.cse7 (+ .cse4 4)) (.cse8 (select |c_#memory_int| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|)) (.cse3 (select .cse9 4))) (and (exists ((|v_#valid_BEFORE_CALL_173| (Array Int Int)) (|v_#valid_BEFORE_CALL_171| (Array Int Int)) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_32| Int) (v_arrayElimCell_589 Int) (v_arrayElimIndex_34 Int)) (and (= 1 (select |v_#valid_BEFORE_CALL_173| v_arrayElimCell_589)) (= (select |v_#valid_BEFORE_CALL_171| v_arrayElimIndex_34) 1) (= (select |v_#valid_BEFORE_CALL_173| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_32|) 1) (not (= |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_32| v_arrayElimCell_589)) (= |v_#valid_BEFORE_CALL_171| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_173| |v_#valid_BEFORE_CALL_171|))) (store |v_#valid_BEFORE_CALL_173| .cse0 (select |v_#valid_BEFORE_CALL_171| .cse0)))) (= (select |v_#valid_BEFORE_CALL_173| v_arrayElimIndex_34) 0) (<= .cse1 |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_32|))) (not (= |c_ULTIMATE.start_sll_append_~last~0#1.base| .cse2)) (= .cse3 |c_ULTIMATE.start_sll_append_~last~0#1.base|) (= .cse4 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_170| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_93| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_170| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_93| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) 0) (= (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_170| |v_old(#valid)_AFTER_CALL_93|))) (store |v_#valid_BEFORE_CALL_170| .cse5 (select |v_old(#valid)_AFTER_CALL_93| .cse5))) |v_old(#valid)_AFTER_CALL_93|) (= (select |v_#valid_BEFORE_CALL_170| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_93| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_170| .cse2) 0))) (= (select .cse6 4) 0) (not (= |c_ULTIMATE.start_sll_append_~new_last~0#1.base| |c_ULTIMATE.start_sll_append_~last~0#1.base|)) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| (select .cse6 .cse7)) (<= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse8 |c_ULTIMATE.start_sll_append_~new_last~0#1.offset|)) (not (= |c_ULTIMATE.start_sll_append_~last~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (= (select .cse9 .cse7) |c_ULTIMATE.start_sll_append_~last~0#1.base|) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse8 0)) (not (= .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|)))))) is different from false [2022-11-03 02:43:28,178 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse9 (select |c_#memory_$Pointer$.base| .cse2)) (.cse4 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse6 (select |c_#memory_$Pointer$.offset| .cse2)) (.cse1 (+ 2 |c_ULTIMATE.start_sll_append_~new_last~0#1.base|)) (.cse7 (+ .cse4 4)) (.cse8 (select |c_#memory_int| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|)) (.cse3 (select .cse9 4))) (and (exists ((|v_#valid_BEFORE_CALL_173| (Array Int Int)) (|v_#valid_BEFORE_CALL_171| (Array Int Int)) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_32| Int) (v_arrayElimCell_589 Int) (v_arrayElimIndex_34 Int)) (and (= 1 (select |v_#valid_BEFORE_CALL_173| v_arrayElimCell_589)) (= (select |v_#valid_BEFORE_CALL_171| v_arrayElimIndex_34) 1) (= (select |v_#valid_BEFORE_CALL_173| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_32|) 1) (not (= |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_32| v_arrayElimCell_589)) (= |v_#valid_BEFORE_CALL_171| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_173| |v_#valid_BEFORE_CALL_171|))) (store |v_#valid_BEFORE_CALL_173| .cse0 (select |v_#valid_BEFORE_CALL_171| .cse0)))) (= (select |v_#valid_BEFORE_CALL_173| v_arrayElimIndex_34) 0) (<= .cse1 |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_32|))) (not (= |c_ULTIMATE.start_sll_append_~last~0#1.base| .cse2)) (= .cse3 |c_ULTIMATE.start_sll_append_~last~0#1.base|) (= .cse4 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_170| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_93| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_170| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_93| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) 0) (= (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_170| |v_old(#valid)_AFTER_CALL_93|))) (store |v_#valid_BEFORE_CALL_170| .cse5 (select |v_old(#valid)_AFTER_CALL_93| .cse5))) |v_old(#valid)_AFTER_CALL_93|) (= (select |v_#valid_BEFORE_CALL_170| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_93| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_170| .cse2) 0))) (= (select .cse6 4) 0) (not (= |c_ULTIMATE.start_sll_append_~new_last~0#1.base| |c_ULTIMATE.start_sll_append_~last~0#1.base|)) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| (select .cse6 .cse7)) (<= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse8 |c_ULTIMATE.start_sll_append_~new_last~0#1.offset|)) (not (= |c_ULTIMATE.start_sll_append_~last~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (= (select .cse9 .cse7) |c_ULTIMATE.start_sll_append_~last~0#1.base|) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse8 0)) (not (= .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|)))))) is different from true [2022-11-03 02:43:28,190 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse7 (select (select |c_#memory_$Pointer$.offset| .cse3) 4)) (.cse0 (select (select |c_#memory_$Pointer$.base| .cse3) 4))) (let ((.cse8 (select |c_#memory_$Pointer$.base| .cse0)) (.cse5 (+ .cse7 4))) (let ((.cse1 (select .cse8 .cse5))) (let ((.cse4 (select |c_#memory_$Pointer$.offset| .cse0)) (.cse6 (+ 2 .cse1))) (and (exists ((|v_#valid_BEFORE_CALL_170| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_93| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_170| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_93| .cse1) 0) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_170| |v_old(#valid)_AFTER_CALL_93|))) (store |v_#valid_BEFORE_CALL_170| .cse2 (select |v_old(#valid)_AFTER_CALL_93| .cse2))) |v_old(#valid)_AFTER_CALL_93|) (= (select |v_#valid_BEFORE_CALL_170| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_93| .cse3) 1) (= (select |v_#valid_BEFORE_CALL_170| .cse3) 0))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= (select .cse4 .cse5) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (<= .cse6 |c_ULTIMATE.start_main_~#s~0#1.base|) (= .cse7 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| (select .cse8 4)) 0)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse1) 0)) (= (select .cse4 4) 0) (exists ((|v_#valid_BEFORE_CALL_173| (Array Int Int)) (|v_#valid_BEFORE_CALL_171| (Array Int Int)) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_32| Int) (v_arrayElimCell_589 Int) (v_arrayElimIndex_34 Int)) (and (= 1 (select |v_#valid_BEFORE_CALL_173| v_arrayElimCell_589)) (= (select |v_#valid_BEFORE_CALL_171| v_arrayElimIndex_34) 1) (= (select |v_#valid_BEFORE_CALL_173| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_32|) 1) (not (= |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_32| v_arrayElimCell_589)) (= |v_#valid_BEFORE_CALL_171| (let ((.cse9 (@diff |v_#valid_BEFORE_CALL_173| |v_#valid_BEFORE_CALL_171|))) (store |v_#valid_BEFORE_CALL_173| .cse9 (select |v_#valid_BEFORE_CALL_171| .cse9)))) (<= .cse6 |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_32|) (= (select |v_#valid_BEFORE_CALL_173| v_arrayElimIndex_34) 0))) (not (= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|)))))))) is different from false [2022-11-03 02:43:28,194 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse7 (select (select |c_#memory_$Pointer$.offset| .cse3) 4)) (.cse0 (select (select |c_#memory_$Pointer$.base| .cse3) 4))) (let ((.cse8 (select |c_#memory_$Pointer$.base| .cse0)) (.cse5 (+ .cse7 4))) (let ((.cse1 (select .cse8 .cse5))) (let ((.cse4 (select |c_#memory_$Pointer$.offset| .cse0)) (.cse6 (+ 2 .cse1))) (and (exists ((|v_#valid_BEFORE_CALL_170| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_93| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_170| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_93| .cse1) 0) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_170| |v_old(#valid)_AFTER_CALL_93|))) (store |v_#valid_BEFORE_CALL_170| .cse2 (select |v_old(#valid)_AFTER_CALL_93| .cse2))) |v_old(#valid)_AFTER_CALL_93|) (= (select |v_#valid_BEFORE_CALL_170| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_93| .cse3) 1) (= (select |v_#valid_BEFORE_CALL_170| .cse3) 0))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= (select .cse4 .cse5) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (<= .cse6 |c_ULTIMATE.start_main_~#s~0#1.base|) (= .cse7 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| (select .cse8 4)) 0)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse1) 0)) (= (select .cse4 4) 0) (exists ((|v_#valid_BEFORE_CALL_173| (Array Int Int)) (|v_#valid_BEFORE_CALL_171| (Array Int Int)) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_32| Int) (v_arrayElimCell_589 Int) (v_arrayElimIndex_34 Int)) (and (= 1 (select |v_#valid_BEFORE_CALL_173| v_arrayElimCell_589)) (= (select |v_#valid_BEFORE_CALL_171| v_arrayElimIndex_34) 1) (= (select |v_#valid_BEFORE_CALL_173| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_32|) 1) (not (= |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_32| v_arrayElimCell_589)) (= |v_#valid_BEFORE_CALL_171| (let ((.cse9 (@diff |v_#valid_BEFORE_CALL_173| |v_#valid_BEFORE_CALL_171|))) (store |v_#valid_BEFORE_CALL_173| .cse9 (select |v_#valid_BEFORE_CALL_171| .cse9)))) (<= .cse6 |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_32|) (= (select |v_#valid_BEFORE_CALL_173| v_arrayElimIndex_34) 0))) (not (= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|)))))))) is different from true [2022-11-03 02:43:28,204 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~ptr~0#1.offset| 4))) (let ((.cse9 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) .cse0))) (and (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~ptr~0#1.base|) .cse0) 0) (exists ((|v_#valid_BEFORE_CALL_173| (Array Int Int)) (|v_#valid_BEFORE_CALL_170| (Array Int Int)) (|v_#valid_BEFORE_CALL_171| (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_32| Int) (v_arrayElimCell_589 Int) (v_arrayElimIndex_34 Int) (|v_old(#valid)_AFTER_CALL_93| (Array Int Int))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse7 (select (select |c_#memory_$Pointer$.base| .cse1) 4)) (.cse8 (+ (select (select |c_#memory_$Pointer$.offset| .cse1) 4) 4))) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| .cse7) .cse8))) (let ((.cse2 (select (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (.cse6 (+ 2 .cse4))) (and (= .cse1 |c_ULTIMATE.start_main_~ptr~0#1.base|) (= 1 (select |v_#valid_BEFORE_CALL_173| v_arrayElimCell_589)) (= (select |v_#valid_BEFORE_CALL_171| v_arrayElimIndex_34) 1) (= (select |v_#valid_BEFORE_CALL_170| .cse1) 0) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| .cse2) (= (select |v_#valid_BEFORE_CALL_173| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_32|) 1) (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_170| |v_old(#valid)_AFTER_CALL_93|))) (store |v_#valid_BEFORE_CALL_170| .cse3 (select |v_old(#valid)_AFTER_CALL_93| .cse3))) |v_old(#valid)_AFTER_CALL_93|) (= (select |v_#valid_BEFORE_CALL_170| |ULTIMATE.start_main_~#s~0#1.base|) 1) (not (= |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_32| v_arrayElimCell_589)) (= .cse2 0) (= (select |v_old(#valid)_AFTER_CALL_93| .cse4) 0) (= |v_#valid_BEFORE_CALL_171| (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_173| |v_#valid_BEFORE_CALL_171|))) (store |v_#valid_BEFORE_CALL_173| .cse5 (select |v_#valid_BEFORE_CALL_171| .cse5)))) (= (select |v_old(#valid)_AFTER_CALL_93| .cse1) 1) (<= .cse6 |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_32|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse4) 0)) (<= .cse6 |ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_170| .cse7) 1) (= (select |v_#valid_BEFORE_CALL_173| v_arrayElimIndex_34) 0) (not (= .cse7 |ULTIMATE.start_main_~#s~0#1.base|)) (= (select (select |c_#memory_$Pointer$.offset| .cse7) .cse8) 0))))))) (= (select (select |c_#memory_$Pointer$.offset| .cse9) 4) 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| (select (select |c_#memory_$Pointer$.base| .cse9) 4)) 0))))) is different from false [2022-11-03 02:43:28,219 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~ptr~0#1.offset| 4))) (let ((.cse9 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) .cse0))) (and (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~ptr~0#1.base|) .cse0) 0) (exists ((|v_#valid_BEFORE_CALL_173| (Array Int Int)) (|v_#valid_BEFORE_CALL_170| (Array Int Int)) (|v_#valid_BEFORE_CALL_171| (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_32| Int) (v_arrayElimCell_589 Int) (v_arrayElimIndex_34 Int) (|v_old(#valid)_AFTER_CALL_93| (Array Int Int))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse7 (select (select |c_#memory_$Pointer$.base| .cse1) 4)) (.cse8 (+ (select (select |c_#memory_$Pointer$.offset| .cse1) 4) 4))) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| .cse7) .cse8))) (let ((.cse2 (select (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (.cse6 (+ 2 .cse4))) (and (= .cse1 |c_ULTIMATE.start_main_~ptr~0#1.base|) (= 1 (select |v_#valid_BEFORE_CALL_173| v_arrayElimCell_589)) (= (select |v_#valid_BEFORE_CALL_171| v_arrayElimIndex_34) 1) (= (select |v_#valid_BEFORE_CALL_170| .cse1) 0) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| .cse2) (= (select |v_#valid_BEFORE_CALL_173| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_32|) 1) (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_170| |v_old(#valid)_AFTER_CALL_93|))) (store |v_#valid_BEFORE_CALL_170| .cse3 (select |v_old(#valid)_AFTER_CALL_93| .cse3))) |v_old(#valid)_AFTER_CALL_93|) (= (select |v_#valid_BEFORE_CALL_170| |ULTIMATE.start_main_~#s~0#1.base|) 1) (not (= |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_32| v_arrayElimCell_589)) (= .cse2 0) (= (select |v_old(#valid)_AFTER_CALL_93| .cse4) 0) (= |v_#valid_BEFORE_CALL_171| (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_173| |v_#valid_BEFORE_CALL_171|))) (store |v_#valid_BEFORE_CALL_173| .cse5 (select |v_#valid_BEFORE_CALL_171| .cse5)))) (= (select |v_old(#valid)_AFTER_CALL_93| .cse1) 1) (<= .cse6 |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_32|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse4) 0)) (<= .cse6 |ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_170| .cse7) 1) (= (select |v_#valid_BEFORE_CALL_173| v_arrayElimIndex_34) 0) (not (= .cse7 |ULTIMATE.start_main_~#s~0#1.base|)) (= (select (select |c_#memory_$Pointer$.offset| .cse7) .cse8) 0))))))) (= (select (select |c_#memory_$Pointer$.offset| .cse9) 4) 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| (select (select |c_#memory_$Pointer$.base| .cse9) 4)) 0))))) is different from true [2022-11-03 02:43:28,242 WARN L833 $PredicateComparison]: unable to prove that (and (exists ((|v_#valid_BEFORE_CALL_173| (Array Int Int)) (|v_#valid_BEFORE_CALL_170| (Array Int Int)) (|v_#valid_BEFORE_CALL_171| (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_32| Int) (v_arrayElimCell_589 Int) (v_arrayElimIndex_34 Int) (|v_old(#valid)_AFTER_CALL_93| (Array Int Int))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse0 (select |c_#memory_$Pointer$.offset| .cse2)) (.cse4 (select |c_#memory_$Pointer$.base| .cse2))) (let ((.cse9 (select .cse4 4)) (.cse10 (+ (select .cse0 4) 4))) (let ((.cse6 (select (select |c_#memory_$Pointer$.base| .cse9) .cse10)) (.cse5 (select (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse1 (+ .cse5 4)) (.cse8 (+ 2 .cse6))) (and (= 1 (select |v_#valid_BEFORE_CALL_173| v_arrayElimCell_589)) (= (select |v_#valid_BEFORE_CALL_171| v_arrayElimIndex_34) 1) (= |c_ULTIMATE.start_main_~temp~2#1.offset| (select .cse0 .cse1)) (= (select |v_#valid_BEFORE_CALL_170| .cse2) 0) (= (select |v_#valid_BEFORE_CALL_173| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_32|) 1) (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_170| |v_old(#valid)_AFTER_CALL_93|))) (store |v_#valid_BEFORE_CALL_170| .cse3 (select |v_old(#valid)_AFTER_CALL_93| .cse3))) |v_old(#valid)_AFTER_CALL_93|) (= (select .cse4 .cse1) |c_ULTIMATE.start_main_~temp~2#1.base|) (= (select |v_#valid_BEFORE_CALL_170| |ULTIMATE.start_main_~#s~0#1.base|) 1) (not (= |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_32| v_arrayElimCell_589)) (= .cse5 0) (= (select |v_old(#valid)_AFTER_CALL_93| .cse6) 0) (= |v_#valid_BEFORE_CALL_171| (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_173| |v_#valid_BEFORE_CALL_171|))) (store |v_#valid_BEFORE_CALL_173| .cse7 (select |v_#valid_BEFORE_CALL_171| .cse7)))) (= (select |v_old(#valid)_AFTER_CALL_93| .cse2) 1) (<= .cse8 |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_32|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse6) 0)) (<= .cse8 |ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_170| .cse9) 1) (= (select |v_#valid_BEFORE_CALL_173| v_arrayElimIndex_34) 0) (not (= .cse9 |ULTIMATE.start_main_~#s~0#1.base|)) (= (select (select |c_#memory_$Pointer$.offset| .cse9) .cse10) 0)))))))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~temp~2#1.base|) 4)) 0)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~temp~2#1.base|) 4) 0) (= |c_ULTIMATE.start_main_~temp~2#1.offset| 0)) is different from false [2022-11-03 02:43:28,247 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((|v_#valid_BEFORE_CALL_173| (Array Int Int)) (|v_#valid_BEFORE_CALL_170| (Array Int Int)) (|v_#valid_BEFORE_CALL_171| (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_32| Int) (v_arrayElimCell_589 Int) (v_arrayElimIndex_34 Int) (|v_old(#valid)_AFTER_CALL_93| (Array Int Int))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse0 (select |c_#memory_$Pointer$.offset| .cse2)) (.cse4 (select |c_#memory_$Pointer$.base| .cse2))) (let ((.cse9 (select .cse4 4)) (.cse10 (+ (select .cse0 4) 4))) (let ((.cse6 (select (select |c_#memory_$Pointer$.base| .cse9) .cse10)) (.cse5 (select (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse1 (+ .cse5 4)) (.cse8 (+ 2 .cse6))) (and (= 1 (select |v_#valid_BEFORE_CALL_173| v_arrayElimCell_589)) (= (select |v_#valid_BEFORE_CALL_171| v_arrayElimIndex_34) 1) (= |c_ULTIMATE.start_main_~temp~2#1.offset| (select .cse0 .cse1)) (= (select |v_#valid_BEFORE_CALL_170| .cse2) 0) (= (select |v_#valid_BEFORE_CALL_173| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_32|) 1) (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_170| |v_old(#valid)_AFTER_CALL_93|))) (store |v_#valid_BEFORE_CALL_170| .cse3 (select |v_old(#valid)_AFTER_CALL_93| .cse3))) |v_old(#valid)_AFTER_CALL_93|) (= (select .cse4 .cse1) |c_ULTIMATE.start_main_~temp~2#1.base|) (= (select |v_#valid_BEFORE_CALL_170| |ULTIMATE.start_main_~#s~0#1.base|) 1) (not (= |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_32| v_arrayElimCell_589)) (= .cse5 0) (= (select |v_old(#valid)_AFTER_CALL_93| .cse6) 0) (= |v_#valid_BEFORE_CALL_171| (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_173| |v_#valid_BEFORE_CALL_171|))) (store |v_#valid_BEFORE_CALL_173| .cse7 (select |v_#valid_BEFORE_CALL_171| .cse7)))) (= (select |v_old(#valid)_AFTER_CALL_93| .cse2) 1) (<= .cse8 |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_32|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse6) 0)) (<= .cse8 |ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_170| .cse9) 1) (= (select |v_#valid_BEFORE_CALL_173| v_arrayElimIndex_34) 0) (not (= .cse9 |ULTIMATE.start_main_~#s~0#1.base|)) (= (select (select |c_#memory_$Pointer$.offset| .cse9) .cse10) 0)))))))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~temp~2#1.base|) 4)) 0)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~temp~2#1.base|) 4) 0) (= |c_ULTIMATE.start_main_~temp~2#1.offset| 0)) is different from true [2022-11-03 02:43:28,262 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~ptr~0#1.offset| 4))) (and (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) .cse0)) 0)) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~ptr~0#1.base|) .cse0) 0) (exists ((|v_#valid_BEFORE_CALL_173| (Array Int Int)) (|v_#valid_BEFORE_CALL_170| (Array Int Int)) (|v_#valid_BEFORE_CALL_171| (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_32| Int) (v_arrayElimCell_589 Int) (v_arrayElimIndex_34 Int) (|v_old(#valid)_AFTER_CALL_93| (Array Int Int))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse11 (select |c_#memory_$Pointer$.offset| .cse3)) (.cse1 (select |c_#memory_$Pointer$.base| .cse3))) (let ((.cse9 (select .cse1 4)) (.cse10 (+ (select .cse11 4) 4))) (let ((.cse5 (select (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (.cse6 (select (select |c_#memory_$Pointer$.base| .cse9) .cse10))) (let ((.cse8 (+ 2 .cse6)) (.cse2 (+ .cse5 4))) (and (= 1 (select |v_#valid_BEFORE_CALL_173| v_arrayElimCell_589)) (= |c_ULTIMATE.start_main_~ptr~0#1.base| (select .cse1 .cse2)) (= (select |v_#valid_BEFORE_CALL_171| v_arrayElimIndex_34) 1) (= (select |v_#valid_BEFORE_CALL_170| .cse3) 0) (= (select |v_#valid_BEFORE_CALL_173| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_32|) 1) (= (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_170| |v_old(#valid)_AFTER_CALL_93|))) (store |v_#valid_BEFORE_CALL_170| .cse4 (select |v_old(#valid)_AFTER_CALL_93| .cse4))) |v_old(#valid)_AFTER_CALL_93|) (= (select |v_#valid_BEFORE_CALL_170| |ULTIMATE.start_main_~#s~0#1.base|) 1) (not (= |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_32| v_arrayElimCell_589)) (= .cse5 0) (= (select |v_old(#valid)_AFTER_CALL_93| .cse6) 0) (= |v_#valid_BEFORE_CALL_171| (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_173| |v_#valid_BEFORE_CALL_171|))) (store |v_#valid_BEFORE_CALL_173| .cse7 (select |v_#valid_BEFORE_CALL_171| .cse7)))) (= (select |v_old(#valid)_AFTER_CALL_93| .cse3) 1) (<= .cse8 |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_32|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse6) 0)) (<= .cse8 |ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_170| .cse9) 1) (= (select |v_#valid_BEFORE_CALL_173| v_arrayElimIndex_34) 0) (not (= .cse9 |ULTIMATE.start_main_~#s~0#1.base|)) (= (select (select |c_#memory_$Pointer$.offset| .cse9) .cse10) 0) (= (select .cse11 .cse2) |c_ULTIMATE.start_main_~ptr~0#1.offset|)))))))) (= |c_ULTIMATE.start_main_~data~0#1| 1))) is different from false [2022-11-03 02:43:28,267 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~ptr~0#1.offset| 4))) (and (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) .cse0)) 0)) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~ptr~0#1.base|) .cse0) 0) (exists ((|v_#valid_BEFORE_CALL_173| (Array Int Int)) (|v_#valid_BEFORE_CALL_170| (Array Int Int)) (|v_#valid_BEFORE_CALL_171| (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_32| Int) (v_arrayElimCell_589 Int) (v_arrayElimIndex_34 Int) (|v_old(#valid)_AFTER_CALL_93| (Array Int Int))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse11 (select |c_#memory_$Pointer$.offset| .cse3)) (.cse1 (select |c_#memory_$Pointer$.base| .cse3))) (let ((.cse9 (select .cse1 4)) (.cse10 (+ (select .cse11 4) 4))) (let ((.cse5 (select (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (.cse6 (select (select |c_#memory_$Pointer$.base| .cse9) .cse10))) (let ((.cse8 (+ 2 .cse6)) (.cse2 (+ .cse5 4))) (and (= 1 (select |v_#valid_BEFORE_CALL_173| v_arrayElimCell_589)) (= |c_ULTIMATE.start_main_~ptr~0#1.base| (select .cse1 .cse2)) (= (select |v_#valid_BEFORE_CALL_171| v_arrayElimIndex_34) 1) (= (select |v_#valid_BEFORE_CALL_170| .cse3) 0) (= (select |v_#valid_BEFORE_CALL_173| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_32|) 1) (= (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_170| |v_old(#valid)_AFTER_CALL_93|))) (store |v_#valid_BEFORE_CALL_170| .cse4 (select |v_old(#valid)_AFTER_CALL_93| .cse4))) |v_old(#valid)_AFTER_CALL_93|) (= (select |v_#valid_BEFORE_CALL_170| |ULTIMATE.start_main_~#s~0#1.base|) 1) (not (= |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_32| v_arrayElimCell_589)) (= .cse5 0) (= (select |v_old(#valid)_AFTER_CALL_93| .cse6) 0) (= |v_#valid_BEFORE_CALL_171| (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_173| |v_#valid_BEFORE_CALL_171|))) (store |v_#valid_BEFORE_CALL_173| .cse7 (select |v_#valid_BEFORE_CALL_171| .cse7)))) (= (select |v_old(#valid)_AFTER_CALL_93| .cse3) 1) (<= .cse8 |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_32|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse6) 0)) (<= .cse8 |ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_170| .cse9) 1) (= (select |v_#valid_BEFORE_CALL_173| v_arrayElimIndex_34) 0) (not (= .cse9 |ULTIMATE.start_main_~#s~0#1.base|)) (= (select (select |c_#memory_$Pointer$.offset| .cse9) .cse10) 0) (= (select .cse11 .cse2) |c_ULTIMATE.start_main_~ptr~0#1.offset|)))))))) (= |c_ULTIMATE.start_main_~data~0#1| 1))) is different from true [2022-11-03 02:43:28,285 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~ptr~0#1.base|)) (.cse1 (+ |c_ULTIMATE.start_main_~ptr~0#1.base| 2))) (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse0 |c_ULTIMATE.start_main_~ptr~0#1.offset|)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse0 0)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_#valid_BEFORE_CALL_173| (Array Int Int)) (|v_#valid_BEFORE_CALL_171| (Array Int Int)) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_32| Int) (v_arrayElimCell_589 Int) (v_arrayElimIndex_34 Int)) (and (= 1 (select |v_#valid_BEFORE_CALL_173| v_arrayElimCell_589)) (= (select |v_#valid_BEFORE_CALL_171| v_arrayElimIndex_34) 1) (= (select |v_#valid_BEFORE_CALL_173| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_32|) 1) (<= .cse1 |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_32|) (not (= |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_32| v_arrayElimCell_589)) (= |v_#valid_BEFORE_CALL_171| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_173| |v_#valid_BEFORE_CALL_171|))) (store |v_#valid_BEFORE_CALL_173| .cse2 (select |v_#valid_BEFORE_CALL_171| .cse2)))) (= (select |v_#valid_BEFORE_CALL_173| v_arrayElimIndex_34) 0))) (exists ((v_arrayElimIndex_41 Int) (|v_#valid_BEFORE_CALL_170| (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int) (|v_old(#valid)_AFTER_CALL_93| (Array Int Int)) (v_arrayElimIndex_44 Int)) (and (= (select |v_old(#valid)_AFTER_CALL_93| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_93| v_arrayElimIndex_41) 1) (= (select |v_#valid_BEFORE_CALL_170| v_arrayElimIndex_41) 0) (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_170| |v_old(#valid)_AFTER_CALL_93|))) (store |v_#valid_BEFORE_CALL_170| .cse3 (select |v_old(#valid)_AFTER_CALL_93| .cse3))) |v_old(#valid)_AFTER_CALL_93|) (= (select |v_#valid_BEFORE_CALL_170| |ULTIMATE.start_main_~#s~0#1.base|) 1) (not (= v_arrayElimIndex_44 |ULTIMATE.start_main_~#s~0#1.base|)) (= (select |v_#valid_BEFORE_CALL_170| v_arrayElimIndex_44) 1) (<= .cse1 |ULTIMATE.start_main_~#s~0#1.base|))))) is different from false [2022-11-03 02:43:28,289 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~ptr~0#1.base|)) (.cse1 (+ |c_ULTIMATE.start_main_~ptr~0#1.base| 2))) (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse0 |c_ULTIMATE.start_main_~ptr~0#1.offset|)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse0 0)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_#valid_BEFORE_CALL_173| (Array Int Int)) (|v_#valid_BEFORE_CALL_171| (Array Int Int)) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_32| Int) (v_arrayElimCell_589 Int) (v_arrayElimIndex_34 Int)) (and (= 1 (select |v_#valid_BEFORE_CALL_173| v_arrayElimCell_589)) (= (select |v_#valid_BEFORE_CALL_171| v_arrayElimIndex_34) 1) (= (select |v_#valid_BEFORE_CALL_173| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_32|) 1) (<= .cse1 |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_32|) (not (= |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_32| v_arrayElimCell_589)) (= |v_#valid_BEFORE_CALL_171| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_173| |v_#valid_BEFORE_CALL_171|))) (store |v_#valid_BEFORE_CALL_173| .cse2 (select |v_#valid_BEFORE_CALL_171| .cse2)))) (= (select |v_#valid_BEFORE_CALL_173| v_arrayElimIndex_34) 0))) (exists ((v_arrayElimIndex_41 Int) (|v_#valid_BEFORE_CALL_170| (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int) (|v_old(#valid)_AFTER_CALL_93| (Array Int Int)) (v_arrayElimIndex_44 Int)) (and (= (select |v_old(#valid)_AFTER_CALL_93| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_93| v_arrayElimIndex_41) 1) (= (select |v_#valid_BEFORE_CALL_170| v_arrayElimIndex_41) 0) (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_170| |v_old(#valid)_AFTER_CALL_93|))) (store |v_#valid_BEFORE_CALL_170| .cse3 (select |v_old(#valid)_AFTER_CALL_93| .cse3))) |v_old(#valid)_AFTER_CALL_93|) (= (select |v_#valid_BEFORE_CALL_170| |ULTIMATE.start_main_~#s~0#1.base|) 1) (not (= v_arrayElimIndex_44 |ULTIMATE.start_main_~#s~0#1.base|)) (= (select |v_#valid_BEFORE_CALL_170| v_arrayElimIndex_44) 1) (<= .cse1 |ULTIMATE.start_main_~#s~0#1.base|))))) is different from true [2022-11-03 02:43:28,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:43:28,356 INFO L93 Difference]: Finished difference Result 57 states and 68 transitions. [2022-11-03 02:43:28,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-11-03 02:43:28,357 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 44 states have (on average 1.1590909090909092) internal successors, (51), 41 states have internal predecessors, (51), 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 33 [2022-11-03 02:43:28,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:43:28,357 INFO L225 Difference]: With dead ends: 57 [2022-11-03 02:43:28,358 INFO L226 Difference]: Without dead ends: 55 [2022-11-03 02:43:28,359 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 96 ConstructedPredicates, 36 IntricatePredicates, 0 DeprecatedPredicates, 734 ImplicationChecksByTransitivity, 10.3s TimeCoverageRelationStatistics Valid=255, Invalid=3603, Unknown=68, NotChecked=5580, Total=9506 [2022-11-03 02:43:28,360 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 0 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 466 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 239 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-03 02:43:28,360 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 150 Invalid, 466 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 219 Invalid, 0 Unknown, 239 Unchecked, 0.3s Time] [2022-11-03 02:43:28,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-11-03 02:43:28,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2022-11-03 02:43:28,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 47 states have (on average 1.1914893617021276) internal successors, (56), 47 states have internal predecessors, (56), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-11-03 02:43:28,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 66 transitions. [2022-11-03 02:43:28,387 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 66 transitions. Word has length 33 [2022-11-03 02:43:28,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:43:28,387 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 66 transitions. [2022-11-03 02:43:28,387 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 44 states have (on average 1.1590909090909092) internal successors, (51), 41 states have internal predecessors, (51), 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-03 02:43:28,388 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 66 transitions. [2022-11-03 02:43:28,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-11-03 02:43:28,388 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:43:28,389 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:43:28,432 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cd72669-52b2-4744-a5dd-aea796699620/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-03 02:43:28,606 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cd72669-52b2-4744-a5dd-aea796699620/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-11-03 02:43:28,606 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:43:28,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:43:28,607 INFO L85 PathProgramCache]: Analyzing trace with hash 1095513064, now seen corresponding path program 1 times [2022-11-03 02:43:28,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:43:28,607 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134978908] [2022-11-03 02:43:28,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:43:28,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:43:28,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:43:30,914 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-03 02:43:30,914 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:43:30,914 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134978908] [2022-11-03 02:43:30,914 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [134978908] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:43:30,915 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2094330440] [2022-11-03 02:43:30,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:43:30,915 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:43:30,915 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cd72669-52b2-4744-a5dd-aea796699620/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:43:30,916 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cd72669-52b2-4744-a5dd-aea796699620/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:43:30,917 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cd72669-52b2-4744-a5dd-aea796699620/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-03 02:43:31,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:43:31,289 INFO L263 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 139 conjunts are in the unsatisfiable core [2022-11-03 02:43:31,293 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:43:31,340 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:43:31,556 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:43:31,692 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-03 02:43:31,692 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-03 02:43:31,785 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 13 treesize of output 9 [2022-11-03 02:43:31,795 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 13 treesize of output 9 [2022-11-03 02:43:32,021 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:43:32,021 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 32 [2022-11-03 02:43:32,027 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 02:43:32,034 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:43:32,035 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 02:43:32,220 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:43:32,221 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:43:32,224 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-03 02:43:32,224 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 1 case distinctions, treesize of input 25 treesize of output 30 [2022-11-03 02:43:32,233 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:43:32,242 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-03 02:43:32,243 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 77 treesize of output 65 [2022-11-03 02:43:32,267 INFO L356 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-11-03 02:43:32,267 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 2 case distinctions, treesize of input 28 treesize of output 30 [2022-11-03 02:43:33,180 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:43:33,181 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:43:33,223 INFO L356 Elim1Store]: treesize reduction 139, result has 14.7 percent of original size [2022-11-03 02:43:33,223 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 9 case distinctions, treesize of input 200 treesize of output 102 [2022-11-03 02:43:33,264 INFO L356 Elim1Store]: treesize reduction 120, result has 20.0 percent of original size [2022-11-03 02:43:33,265 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 6 new quantified variables, introduced 6 case distinctions, treesize of input 264 treesize of output 176 [2022-11-03 02:43:33,561 INFO L356 Elim1Store]: treesize reduction 22, result has 12.0 percent of original size [2022-11-03 02:43:33,562 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 243 treesize of output 141 [2022-11-03 02:43:33,823 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-03 02:43:33,823 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 114 treesize of output 40 [2022-11-03 02:43:33,829 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:43:33,829 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:43:42,282 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2094330440] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:43:42,282 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1688349915] [2022-11-03 02:43:42,284 INFO L159 IcfgInterpreter]: Started Sifa with 19 locations of interest [2022-11-03 02:43:42,285 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 02:43:42,285 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 02:43:42,285 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 02:43:42,285 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 02:43:42,307 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:43:42,320 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-03 02:43:42,321 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:43:42,330 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:43:42,348 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-03 02:43:42,348 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:43:42,380 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:43:42,385 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:43:42,393 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:43:42,394 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 20 treesize of output 9 [2022-11-03 02:43:42,404 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:43:42,405 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:43:42,412 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:43:42,413 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 20 treesize of output 9 [2022-11-03 02:43:42,433 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:43:42,434 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:43:42,443 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:43:42,444 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:43:42,486 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:43:42,487 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:43:42,496 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:43:42,496 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:43:42,531 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:43:42,532 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2022-11-03 02:43:42,541 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:43:42,542 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2022-11-03 02:43:42,552 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:43:42,553 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2022-11-03 02:43:42,595 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:43:42,603 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:43:42,613 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:43:42,623 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:43:42,634 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:43:42,672 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:43:42,682 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:43:42,690 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:43:42,699 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:43:42,710 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:43:42,754 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2022-11-03 02:43:42,760 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:43:42,768 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:43:42,795 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-11-03 02:43:42,823 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-11-03 02:43:42,856 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:43:42,862 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:43:42,869 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2022-11-03 02:43:43,175 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 141 treesize of output 133 [2022-11-03 02:43:43,208 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:43:43,208 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 133 treesize of output 150 [2022-11-03 02:43:43,235 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:43:43,236 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 125 treesize of output 136 [2022-11-03 02:43:43,258 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:43:43,265 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:43:43,266 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 127 treesize of output 111 [2022-11-03 02:43:43,391 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:43:43,579 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:43:43,579 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 141 treesize of output 158 [2022-11-03 02:43:43,593 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 133 treesize of output 125 [2022-11-03 02:43:43,626 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:43:43,626 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 125 treesize of output 136 [2022-11-03 02:43:43,643 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:43:43,651 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:43:43,651 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 127 treesize of output 111 [2022-11-03 02:43:44,034 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:43:44,199 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 23 treesize of output 13 [2022-11-03 02:43:44,209 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2022-11-03 02:43:44,218 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 23 treesize of output 13 [2022-11-03 02:43:44,435 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 20 for LOIs [2022-11-03 02:43:44,443 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:43:44,448 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:43:44,473 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:43:44,474 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:43:44,481 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:43:44,481 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 20 treesize of output 9 [2022-11-03 02:43:44,491 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:43:44,491 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 20 treesize of output 9 [2022-11-03 02:43:44,493 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 02:43:50,209 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '3387#(and (<= 0 |ULTIMATE.start_main_~count~0#1|) (not (= |ULTIMATE.start_main_~count~0#1| (+ |ULTIMATE.start_main_~len~0#1| 1))) (<= 0 |ULTIMATE.start_sll_append_~head#1.offset|) (<= 1 |ULTIMATE.start_sll_create_#in~data#1|) (<= |ULTIMATE.start_sll_append_~data#1| 1) (<= |ULTIMATE.start_sll_create_#in~data#1| 1) (<= 0 |ULTIMATE.start_sll_append_~head#1.base|) (<= |ULTIMATE.start_sll_create_~head~0#1.offset| 0) (<= 0 |ULTIMATE.start_sll_append_#in~head#1.offset|) (<= 0 |ULTIMATE.start_sll_create_~new_head~0#1.offset|) (<= |ULTIMATE.start_sll_create_~len#1| 0) (<= |ULTIMATE.start_sll_create_#res#1.offset| 0) (<= |#NULL.offset| 0) (<= |ULTIMATE.start_sll_create_~new_head~0#1.offset| 0) (= |ULTIMATE.start_main_~ptr~0#1.offset| 0) (= |ULTIMATE.start_main_~ptr~0#1.base| 0) (<= 1 |ULTIMATE.start_sll_create_~data#1|) (<= |ULTIMATE.start_sll_append_#in~data#1| 1) (<= 0 |ULTIMATE.start_sll_append_#in~head#1.base|) (<= |ULTIMATE.start_sll_append_#in~head#1.offset| 0) (= |ULTIMATE.start_main_~data~0#1| 1) (<= 1 |ULTIMATE.start_sll_append_~data#1|) (<= |ULTIMATE.start_sll_create_~data#1| 1) (<= |ULTIMATE.start_sll_create_#in~len#1| 2) (= |ULTIMATE.start_main_~len~0#1| 2) (<= |ULTIMATE.start_main_~#s~0#1.offset| 0) (<= 0 |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_sll_append_~new_last~0#1.offset| 0) (<= |ULTIMATE.start_sll_append_~head#1.offset| 0) (<= 0 |ULTIMATE.start_sll_create_#res#1.offset|) (<= 0 |#NULL.offset|) (<= 0 |#StackHeapBarrier|) (<= 2 |ULTIMATE.start_sll_create_#in~len#1|) (<= 0 |ULTIMATE.start_main_~#s~0#1.offset|) (<= 0 |ULTIMATE.start_sll_create_~head~0#1.offset|) (<= 1 |ULTIMATE.start_sll_append_#in~data#1|) (= |#NULL.base| 0))' at error location [2022-11-03 02:43:50,210 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-03 02:43:50,210 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-03 02:43:50,210 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 28] total 46 [2022-11-03 02:43:50,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601060001] [2022-11-03 02:43:50,210 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-03 02:43:50,210 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-11-03 02:43:50,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:43:50,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-11-03 02:43:50,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=221, Invalid=5172, Unknown=9, NotChecked=0, Total=5402 [2022-11-03 02:43:50,212 INFO L87 Difference]: Start difference. First operand 55 states and 66 transitions. Second operand has 46 states, 39 states have (on average 1.2307692307692308) internal successors, (48), 37 states have internal predecessors, (48), 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-03 02:43:52,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:43:52,735 INFO L93 Difference]: Finished difference Result 60 states and 69 transitions. [2022-11-03 02:43:52,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-03 02:43:52,736 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 39 states have (on average 1.2307692307692308) internal successors, (48), 37 states have internal predecessors, (48), 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 33 [2022-11-03 02:43:52,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:43:52,736 INFO L225 Difference]: With dead ends: 60 [2022-11-03 02:43:52,736 INFO L226 Difference]: Without dead ends: 57 [2022-11-03 02:43:52,737 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1358 ImplicationChecksByTransitivity, 18.3s TimeCoverageRelationStatistics Valid=368, Invalid=7455, Unknown=9, NotChecked=0, Total=7832 [2022-11-03 02:43:52,738 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 27 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 615 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 684 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 615 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 50 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-03 02:43:52,738 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 327 Invalid, 684 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 615 Invalid, 0 Unknown, 50 Unchecked, 0.5s Time] [2022-11-03 02:43:52,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-11-03 02:43:52,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 55. [2022-11-03 02:43:52,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 47 states have (on average 1.1702127659574468) internal successors, (55), 47 states have internal predecessors, (55), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-11-03 02:43:52,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 65 transitions. [2022-11-03 02:43:52,762 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 65 transitions. Word has length 33 [2022-11-03 02:43:52,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:43:52,762 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 65 transitions. [2022-11-03 02:43:52,763 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 39 states have (on average 1.2307692307692308) internal successors, (48), 37 states have internal predecessors, (48), 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-03 02:43:52,763 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 65 transitions. [2022-11-03 02:43:52,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-11-03 02:43:52,764 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:43:52,764 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:43:52,804 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cd72669-52b2-4744-a5dd-aea796699620/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-03 02:43:52,980 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cd72669-52b2-4744-a5dd-aea796699620/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-11-03 02:43:52,981 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:43:52,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:43:52,981 INFO L85 PathProgramCache]: Analyzing trace with hash 467298897, now seen corresponding path program 3 times [2022-11-03 02:43:52,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:43:52,981 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895784573] [2022-11-03 02:43:52,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:43:52,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:43:53,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:43:55,622 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 7 proven. 20 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 02:43:55,622 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:43:55,622 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895784573] [2022-11-03 02:43:55,622 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [895784573] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:43:55,622 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1132268965] [2022-11-03 02:43:55,622 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-03 02:43:55,623 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:43:55,623 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cd72669-52b2-4744-a5dd-aea796699620/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:43:55,623 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cd72669-52b2-4744-a5dd-aea796699620/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:43:55,634 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cd72669-52b2-4744-a5dd-aea796699620/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-03 02:43:55,829 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-03 02:43:55,829 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 02:43:55,833 WARN L261 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 171 conjunts are in the unsatisfiable core [2022-11-03 02:43:55,837 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:43:55,840 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:43:56,112 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-03 02:43:56,112 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:43:56,167 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:43:56,176 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:43:58,148 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:43:58,149 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:43:58,196 INFO L356 Elim1Store]: treesize reduction 69, result has 31.7 percent of original size [2022-11-03 02:43:58,196 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 68 [2022-11-03 02:43:58,219 INFO L356 Elim1Store]: treesize reduction 20, result has 39.4 percent of original size [2022-11-03 02:43:58,220 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 3 case distinctions, treesize of input 20 treesize of output 22 [2022-11-03 02:43:58,228 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:43:58,251 INFO L356 Elim1Store]: treesize reduction 63, result has 19.2 percent of original size [2022-11-03 02:43:58,252 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 2 case distinctions, treesize of input 31 treesize of output 45 [2022-11-03 02:44:00,267 INFO L356 Elim1Store]: treesize reduction 263, result has 28.5 percent of original size [2022-11-03 02:44:00,267 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 9 new quantified variables, introduced 20 case distinctions, treesize of input 305 treesize of output 252 [2022-11-03 02:44:00,405 INFO L356 Elim1Store]: treesize reduction 340, result has 11.5 percent of original size [2022-11-03 02:44:00,405 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 10 new quantified variables, introduced 20 case distinctions, treesize of input 826 treesize of output 479 [2022-11-03 02:46:07,051 WARN L234 SmtUtils]: Spent 1.85m on a formula simplification. DAG size of input: 2701 DAG size of output: 2561 (called from [L 353] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2022-11-03 02:46:07,061 INFO L356 Elim1Store]: treesize reduction 402, result has 94.8 percent of original size [2022-11-03 02:46:07,065 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 36 select indices, 36 select index equivalence classes, 1 disjoint index pairs (out of 630 index pairs), introduced 65 new quantified variables, introduced 630 case distinctions, treesize of input 2825 treesize of output 8294 [2022-11-03 02:46:10,392 INFO L244 Elim1Store]: Index analysis took 675 ms [2022-11-03 02:52:15,091 WARN L234 SmtUtils]: Spent 6.08m on a formula simplification. DAG size of input: 2684 DAG size of output: 2544 (called from [L 353] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2022-11-03 02:52:15,101 INFO L356 Elim1Store]: treesize reduction 386, result has 94.0 percent of original size [2022-11-03 02:52:15,105 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 36 select indices, 36 select index equivalence classes, 1 disjoint index pairs (out of 630 index pairs), introduced 52 new quantified variables, introduced 630 case distinctions, treesize of input 9997 treesize of output 11781