./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-ext3-properties/sll_circular_traversal-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 5e519f3a Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08cad0f5-7fd6-4b8b-ac30-51cdbff926c9/bin/utaipan-7li7fVZpFI/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08cad0f5-7fd6-4b8b-ac30-51cdbff926c9/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_08cad0f5-7fd6-4b8b-ac30-51cdbff926c9/bin/utaipan-7li7fVZpFI/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08cad0f5-7fd6-4b8b-ac30-51cdbff926c9/bin/utaipan-7li7fVZpFI/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-ext3-properties/sll_circular_traversal-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08cad0f5-7fd6-4b8b-ac30-51cdbff926c9/bin/utaipan-7li7fVZpFI/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08cad0f5-7fd6-4b8b-ac30-51cdbff926c9/bin/utaipan-7li7fVZpFI --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c0706d1a5964bb8391155a217bd6084c2519a4607ef121976461541c97aecebc --- 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 01:43:23,657 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-03 01:43:23,659 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-03 01:43:23,715 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-03 01:43:23,716 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-03 01:43:23,721 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-03 01:43:23,722 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-03 01:43:23,724 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-03 01:43:23,726 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-03 01:43:23,727 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-03 01:43:23,728 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-03 01:43:23,729 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-03 01:43:23,729 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-03 01:43:23,730 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-03 01:43:23,736 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-03 01:43:23,739 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-03 01:43:23,741 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-03 01:43:23,749 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-03 01:43:23,752 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-03 01:43:23,756 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-03 01:43:23,762 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-03 01:43:23,765 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-03 01:43:23,767 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-03 01:43:23,769 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-03 01:43:23,773 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-03 01:43:23,776 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-03 01:43:23,776 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-03 01:43:23,777 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-03 01:43:23,779 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-03 01:43:23,780 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-03 01:43:23,781 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-03 01:43:23,782 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-03 01:43:23,784 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-03 01:43:23,785 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-03 01:43:23,787 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-03 01:43:23,787 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-03 01:43:23,788 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-03 01:43:23,788 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-03 01:43:23,788 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-03 01:43:23,789 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-03 01:43:23,790 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-03 01:43:23,791 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08cad0f5-7fd6-4b8b-ac30-51cdbff926c9/bin/utaipan-7li7fVZpFI/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2022-11-03 01:43:23,856 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-03 01:43:23,856 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-03 01:43:23,857 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-03 01:43:23,857 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-03 01:43:23,858 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-03 01:43:23,859 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-03 01:43:23,859 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-03 01:43:23,860 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-03 01:43:23,860 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-03 01:43:23,860 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-03 01:43:23,862 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-03 01:43:23,862 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-03 01:43:23,862 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-03 01:43:23,863 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-03 01:43:23,863 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-03 01:43:23,864 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-03 01:43:23,864 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-03 01:43:23,864 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-03 01:43:23,865 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-03 01:43:23,865 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-03 01:43:23,866 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-03 01:43:23,866 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-03 01:43:23,866 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-03 01:43:23,866 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-03 01:43:23,867 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-03 01:43:23,867 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-03 01:43:23,880 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-03 01:43:23,880 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-03 01:43:23,880 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-03 01:43:23,881 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-03 01:43:23,881 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-03 01:43:23,881 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-03 01:43:23,881 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-03 01:43:23,882 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-03 01:43:23,882 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-03 01:43:23,882 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 01:43:23,883 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-03 01:43:23,884 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-03 01:43:23,884 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-03 01:43:23,884 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-03 01:43:23,884 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-03 01:43:23,885 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-03 01:43:23,885 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_08cad0f5-7fd6-4b8b-ac30-51cdbff926c9/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_08cad0f5-7fd6-4b8b-ac30-51cdbff926c9/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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> c0706d1a5964bb8391155a217bd6084c2519a4607ef121976461541c97aecebc [2022-11-03 01:43:24,195 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-03 01:43:24,229 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-03 01:43:24,235 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-03 01:43:24,236 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-03 01:43:24,237 INFO L275 PluginConnector]: CDTParser initialized [2022-11-03 01:43:24,239 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08cad0f5-7fd6-4b8b-ac30-51cdbff926c9/bin/utaipan-7li7fVZpFI/../../sv-benchmarks/c/list-ext3-properties/sll_circular_traversal-2.i [2022-11-03 01:43:24,326 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08cad0f5-7fd6-4b8b-ac30-51cdbff926c9/bin/utaipan-7li7fVZpFI/data/80ea758d9/330a0784d07d4ffd8816b3b98efd76c5/FLAG64b4342ea [2022-11-03 01:43:24,954 INFO L306 CDTParser]: Found 1 translation units. [2022-11-03 01:43:24,955 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08cad0f5-7fd6-4b8b-ac30-51cdbff926c9/sv-benchmarks/c/list-ext3-properties/sll_circular_traversal-2.i [2022-11-03 01:43:24,967 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08cad0f5-7fd6-4b8b-ac30-51cdbff926c9/bin/utaipan-7li7fVZpFI/data/80ea758d9/330a0784d07d4ffd8816b3b98efd76c5/FLAG64b4342ea [2022-11-03 01:43:25,228 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08cad0f5-7fd6-4b8b-ac30-51cdbff926c9/bin/utaipan-7li7fVZpFI/data/80ea758d9/330a0784d07d4ffd8816b3b98efd76c5 [2022-11-03 01:43:25,234 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-03 01:43:25,237 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-03 01:43:25,241 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-03 01:43:25,241 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-03 01:43:25,245 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-03 01:43:25,246 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 01:43:25" (1/1) ... [2022-11-03 01:43:25,247 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f2526ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:43:25, skipping insertion in model container [2022-11-03 01:43:25,247 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 01:43:25" (1/1) ... [2022-11-03 01:43:25,256 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-03 01:43:25,326 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-03 01:43:25,671 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_08cad0f5-7fd6-4b8b-ac30-51cdbff926c9/sv-benchmarks/c/list-ext3-properties/sll_circular_traversal-2.i[24092,24105] [2022-11-03 01:43:25,674 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 01:43:25,682 INFO L203 MainTranslator]: Completed pre-run [2022-11-03 01:43:25,723 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_08cad0f5-7fd6-4b8b-ac30-51cdbff926c9/sv-benchmarks/c/list-ext3-properties/sll_circular_traversal-2.i[24092,24105] [2022-11-03 01:43:25,724 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 01:43:25,750 INFO L208 MainTranslator]: Completed translation [2022-11-03 01:43:25,750 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:43:25 WrapperNode [2022-11-03 01:43:25,751 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-03 01:43:25,752 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-03 01:43:25,752 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-03 01:43:25,752 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-03 01:43:25,760 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:43:25" (1/1) ... [2022-11-03 01:43:25,773 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:43:25" (1/1) ... [2022-11-03 01:43:25,795 INFO L138 Inliner]: procedures = 122, calls = 22, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 88 [2022-11-03 01:43:25,795 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-03 01:43:25,796 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-03 01:43:25,796 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-03 01:43:25,796 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-03 01:43:25,806 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:43:25" (1/1) ... [2022-11-03 01:43:25,806 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:43:25" (1/1) ... [2022-11-03 01:43:25,811 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:43:25" (1/1) ... [2022-11-03 01:43:25,811 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:43:25" (1/1) ... [2022-11-03 01:43:25,818 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:43:25" (1/1) ... [2022-11-03 01:43:25,822 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:43:25" (1/1) ... [2022-11-03 01:43:25,824 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:43:25" (1/1) ... [2022-11-03 01:43:25,825 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:43:25" (1/1) ... [2022-11-03 01:43:25,828 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-03 01:43:25,829 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-03 01:43:25,829 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-03 01:43:25,829 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-03 01:43:25,831 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:43:25" (1/1) ... [2022-11-03 01:43:25,839 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 01:43:25,859 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08cad0f5-7fd6-4b8b-ac30-51cdbff926c9/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:43:25,874 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08cad0f5-7fd6-4b8b-ac30-51cdbff926c9/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-03 01:43:25,906 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08cad0f5-7fd6-4b8b-ac30-51cdbff926c9/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-03 01:43:25,937 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2022-11-03 01:43:25,937 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2022-11-03 01:43:25,938 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-03 01:43:25,938 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-03 01:43:25,938 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-03 01:43:25,938 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-03 01:43:25,939 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-03 01:43:25,939 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-03 01:43:25,939 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-03 01:43:25,939 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-03 01:43:25,940 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-03 01:43:25,940 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-03 01:43:26,068 INFO L235 CfgBuilder]: Building ICFG [2022-11-03 01:43:26,071 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-03 01:43:26,114 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2022-11-03 01:43:26,435 INFO L276 CfgBuilder]: Performing block encoding [2022-11-03 01:43:26,475 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-03 01:43:26,476 INFO L300 CfgBuilder]: Removed 3 assume(true) statements. [2022-11-03 01:43:26,478 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 01:43:26 BoogieIcfgContainer [2022-11-03 01:43:26,479 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-03 01:43:26,481 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-03 01:43:26,482 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-03 01:43:26,489 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-03 01:43:26,489 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.11 01:43:25" (1/3) ... [2022-11-03 01:43:26,491 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f0bbf41 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 01:43:26, skipping insertion in model container [2022-11-03 01:43:26,491 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:43:25" (2/3) ... [2022-11-03 01:43:26,491 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f0bbf41 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 01:43:26, skipping insertion in model container [2022-11-03 01:43:26,491 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 01:43:26" (3/3) ... [2022-11-03 01:43:26,493 INFO L112 eAbstractionObserver]: Analyzing ICFG sll_circular_traversal-2.i [2022-11-03 01:43:26,514 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-03 01:43:26,514 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 25 error locations. [2022-11-03 01:43:26,568 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-03 01:43:26,574 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=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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;@292a07c2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-03 01:43:26,574 INFO L358 AbstractCegarLoop]: Starting to check reachability of 25 error locations. [2022-11-03 01:43:26,583 INFO L276 IsEmpty]: Start isEmpty. Operand has 55 states, 27 states have (on average 2.259259259259259) internal successors, (61), 53 states have internal predecessors, (61), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:43:26,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-03 01:43:26,590 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:43:26,591 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-03 01:43:26,592 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-11-03 01:43:26,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:43:26,597 INFO L85 PathProgramCache]: Analyzing trace with hash 152257, now seen corresponding path program 1 times [2022-11-03 01:43:26,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:43:26,627 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674693530] [2022-11-03 01:43:26,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:43:26,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:43:26,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:43:26,949 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 01:43:26,950 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:43:26,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674693530] [2022-11-03 01:43:26,951 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [674693530] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:43:26,951 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:43:26,951 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-03 01:43:26,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129482239] [2022-11-03 01:43:26,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:43:26,971 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 01:43:26,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:43:27,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 01:43:27,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 01:43:27,016 INFO L87 Difference]: Start difference. First operand has 55 states, 27 states have (on average 2.259259259259259) internal successors, (61), 53 states have internal predecessors, (61), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:43:27,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:43:27,177 INFO L93 Difference]: Finished difference Result 67 states and 72 transitions. [2022-11-03 01:43:27,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 01:43:27,180 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-11-03 01:43:27,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:43:27,186 INFO L225 Difference]: With dead ends: 67 [2022-11-03 01:43:27,186 INFO L226 Difference]: Without dead ends: 62 [2022-11-03 01:43:27,194 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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 01:43:27,197 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 44 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 01:43:27,199 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 43 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 01:43:27,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-11-03 01:43:27,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 47. [2022-11-03 01:43:27,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 25 states have (on average 2.0) internal successors, (50), 46 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:43:27,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 50 transitions. [2022-11-03 01:43:27,247 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 50 transitions. Word has length 3 [2022-11-03 01:43:27,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:43:27,248 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 50 transitions. [2022-11-03 01:43:27,249 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:43:27,250 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 50 transitions. [2022-11-03 01:43:27,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-03 01:43:27,251 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:43:27,251 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-03 01:43:27,252 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-03 01:43:27,252 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-11-03 01:43:27,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:43:27,253 INFO L85 PathProgramCache]: Analyzing trace with hash 152258, now seen corresponding path program 1 times [2022-11-03 01:43:27,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:43:27,254 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770836837] [2022-11-03 01:43:27,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:43:27,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:43:27,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:43:27,416 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 01:43:27,416 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:43:27,416 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770836837] [2022-11-03 01:43:27,417 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [770836837] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:43:27,417 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:43:27,417 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-03 01:43:27,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114449303] [2022-11-03 01:43:27,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:43:27,419 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 01:43:27,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:43:27,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 01:43:27,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 01:43:27,421 INFO L87 Difference]: Start difference. First operand 47 states and 50 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:43:27,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:43:27,503 INFO L93 Difference]: Finished difference Result 78 states and 84 transitions. [2022-11-03 01:43:27,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 01:43:27,503 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-11-03 01:43:27,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:43:27,505 INFO L225 Difference]: With dead ends: 78 [2022-11-03 01:43:27,505 INFO L226 Difference]: Without dead ends: 78 [2022-11-03 01:43:27,505 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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 01:43:27,507 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 37 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 01:43:27,508 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 56 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 01:43:27,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-11-03 01:43:27,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 47. [2022-11-03 01:43:27,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 27 states have (on average 1.8888888888888888) internal successors, (51), 46 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:43:27,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2022-11-03 01:43:27,515 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 3 [2022-11-03 01:43:27,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:43:27,516 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2022-11-03 01:43:27,516 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:43:27,516 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2022-11-03 01:43:27,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-03 01:43:27,517 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:43:27,517 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:43:27,517 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-03 01:43:27,518 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-11-03 01:43:27,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:43:27,519 INFO L85 PathProgramCache]: Analyzing trace with hash -1118452546, now seen corresponding path program 1 times [2022-11-03 01:43:27,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:43:27,519 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24519013] [2022-11-03 01:43:27,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:43:27,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:43:27,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:43:27,657 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 01:43:27,657 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:43:27,657 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24519013] [2022-11-03 01:43:27,657 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [24519013] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:43:27,658 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:43:27,658 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-03 01:43:27,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179203474] [2022-11-03 01:43:27,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:43:27,659 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-03 01:43:27,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:43:27,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-03 01:43:27,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-03 01:43:27,660 INFO L87 Difference]: Start difference. First operand 47 states and 51 transitions. Second operand has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:43:27,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:43:27,824 INFO L93 Difference]: Finished difference Result 88 states and 94 transitions. [2022-11-03 01:43:27,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-03 01:43:27,825 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-11-03 01:43:27,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:43:27,826 INFO L225 Difference]: With dead ends: 88 [2022-11-03 01:43:27,827 INFO L226 Difference]: Without dead ends: 88 [2022-11-03 01:43:27,827 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-11-03 01:43:27,828 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 136 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 01:43:27,829 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 47 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 01:43:27,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2022-11-03 01:43:27,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 44. [2022-11-03 01:43:27,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 28 states have (on average 1.75) internal successors, (49), 43 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:43:27,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 49 transitions. [2022-11-03 01:43:27,835 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 49 transitions. Word has length 7 [2022-11-03 01:43:27,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:43:27,836 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 49 transitions. [2022-11-03 01:43:27,836 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:43:27,836 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 49 transitions. [2022-11-03 01:43:27,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-03 01:43:27,837 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:43:27,837 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:43:27,837 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-03 01:43:27,837 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-11-03 01:43:27,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:43:27,838 INFO L85 PathProgramCache]: Analyzing trace with hash -1118452545, now seen corresponding path program 1 times [2022-11-03 01:43:27,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:43:27,839 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41187944] [2022-11-03 01:43:27,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:43:27,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:43:27,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:43:27,907 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 01:43:27,907 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:43:27,908 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41187944] [2022-11-03 01:43:27,908 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [41187944] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:43:27,908 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:43:27,908 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-03 01:43:27,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879100833] [2022-11-03 01:43:27,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:43:27,909 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 01:43:27,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:43:27,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 01:43:27,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 01:43:27,910 INFO L87 Difference]: Start difference. First operand 44 states and 49 transitions. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:43:27,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:43:27,934 INFO L93 Difference]: Finished difference Result 49 states and 52 transitions. [2022-11-03 01:43:27,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 01:43:27,934 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-11-03 01:43:27,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:43:27,935 INFO L225 Difference]: With dead ends: 49 [2022-11-03 01:43:27,935 INFO L226 Difference]: Without dead ends: 49 [2022-11-03 01:43:27,936 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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 01:43:27,937 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 7 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-03 01:43:27,938 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 70 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-03 01:43:27,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-11-03 01:43:27,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 42. [2022-11-03 01:43:27,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 26 states have (on average 1.7307692307692308) internal successors, (45), 41 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:43:27,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 45 transitions. [2022-11-03 01:43:27,943 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 45 transitions. Word has length 7 [2022-11-03 01:43:27,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:43:27,944 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 45 transitions. [2022-11-03 01:43:27,944 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:43:27,944 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 45 transitions. [2022-11-03 01:43:27,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-03 01:43:27,948 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:43:27,948 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:43:27,948 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-03 01:43:27,949 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-11-03 01:43:27,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:43:27,949 INFO L85 PathProgramCache]: Analyzing trace with hash -1118553532, now seen corresponding path program 1 times [2022-11-03 01:43:27,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:43:27,950 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837564001] [2022-11-03 01:43:27,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:43:27,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:43:27,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:43:28,112 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 01:43:28,112 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:43:28,112 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837564001] [2022-11-03 01:43:28,113 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [837564001] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:43:28,113 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:43:28,113 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-03 01:43:28,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984755853] [2022-11-03 01:43:28,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:43:28,114 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 01:43:28,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:43:28,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 01:43:28,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 01:43:28,115 INFO L87 Difference]: Start difference. First operand 42 states and 45 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:43:28,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:43:28,177 INFO L93 Difference]: Finished difference Result 53 states and 56 transitions. [2022-11-03 01:43:28,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 01:43:28,181 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-11-03 01:43:28,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:43:28,182 INFO L225 Difference]: With dead ends: 53 [2022-11-03 01:43:28,182 INFO L226 Difference]: Without dead ends: 53 [2022-11-03 01:43:28,182 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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 01:43:28,183 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 31 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 01:43:28,184 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 38 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 01:43:28,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-11-03 01:43:28,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 40. [2022-11-03 01:43:28,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 26 states have (on average 1.6538461538461537) internal successors, (43), 39 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:43:28,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 43 transitions. [2022-11-03 01:43:28,188 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 43 transitions. Word has length 7 [2022-11-03 01:43:28,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:43:28,189 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 43 transitions. [2022-11-03 01:43:28,189 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:43:28,189 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2022-11-03 01:43:28,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-03 01:43:28,190 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:43:28,190 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:43:28,190 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-03 01:43:28,191 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-11-03 01:43:28,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:43:28,191 INFO L85 PathProgramCache]: Analyzing trace with hash -1118553531, now seen corresponding path program 1 times [2022-11-03 01:43:28,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:43:28,192 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525818391] [2022-11-03 01:43:28,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:43:28,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:43:28,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:43:28,344 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 01:43:28,344 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:43:28,345 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525818391] [2022-11-03 01:43:28,345 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1525818391] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:43:28,345 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:43:28,345 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-03 01:43:28,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894370484] [2022-11-03 01:43:28,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:43:28,346 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 01:43:28,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:43:28,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 01:43:28,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 01:43:28,349 INFO L87 Difference]: Start difference. First operand 40 states and 43 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:43:28,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:43:28,423 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2022-11-03 01:43:28,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 01:43:28,424 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-11-03 01:43:28,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:43:28,424 INFO L225 Difference]: With dead ends: 38 [2022-11-03 01:43:28,425 INFO L226 Difference]: Without dead ends: 38 [2022-11-03 01:43:28,425 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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 01:43:28,426 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 34 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 01:43:28,427 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 23 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 01:43:28,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-11-03 01:43:28,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2022-11-03 01:43:28,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 26 states have (on average 1.5769230769230769) internal successors, (41), 37 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:43:28,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2022-11-03 01:43:28,430 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 7 [2022-11-03 01:43:28,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:43:28,431 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 41 transitions. [2022-11-03 01:43:28,431 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:43:28,431 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2022-11-03 01:43:28,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-03 01:43:28,432 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:43:28,432 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:43:28,432 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-03 01:43:28,432 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-11-03 01:43:28,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:43:28,433 INFO L85 PathProgramCache]: Analyzing trace with hash 1823073289, now seen corresponding path program 1 times [2022-11-03 01:43:28,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:43:28,434 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903411583] [2022-11-03 01:43:28,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:43:28,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:43:28,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:43:28,511 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:43:28,511 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:43:28,512 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903411583] [2022-11-03 01:43:28,512 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1903411583] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:43:28,512 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2024782327] [2022-11-03 01:43:28,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:43:28,513 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:43:28,513 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08cad0f5-7fd6-4b8b-ac30-51cdbff926c9/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:43:28,522 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08cad0f5-7fd6-4b8b-ac30-51cdbff926c9/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:43:28,542 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08cad0f5-7fd6-4b8b-ac30-51cdbff926c9/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-03 01:43:28,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:43:28,648 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-03 01:43:28,654 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:43:28,729 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:43:28,730 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:43:28,772 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:43:28,773 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2024782327] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 01:43:28,773 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [125731260] [2022-11-03 01:43:28,809 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2022-11-03 01:43:28,810 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 01:43:28,818 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 01:43:28,824 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 01:43:28,824 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 01:43:28,923 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:43:28,925 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:43:28,940 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 01:43:29,001 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 01:43:29,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, 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 01:43:29,035 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:43:29,038 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 0 case distinctions, treesize of input 30 treesize of output 21 [2022-11-03 01:43:29,082 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:43:29,084 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 01:43:29,104 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:43:29,105 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 01:43:29,125 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:43:29,127 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 0 case distinctions, treesize of input 28 treesize of output 30 [2022-11-03 01:43:29,205 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:43:29,207 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:43:29,208 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:43:29,209 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:43:29,211 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:43:29,214 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 35 [2022-11-03 01:43:29,295 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:43:29,299 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 19 treesize of output 18 [2022-11-03 01:43:29,320 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:43:29,321 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 19 treesize of output 18 [2022-11-03 01:43:29,346 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:43:29,348 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:43:29,349 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:43:29,353 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 33 [2022-11-03 01:43:29,440 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:43:29,442 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:43:29,446 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 0 case distinctions, treesize of input 34 treesize of output 21 [2022-11-03 01:43:29,472 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:43:29,473 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:43:29,475 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:43:29,476 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 42 [2022-11-03 01:43:29,499 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:43:29,500 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:43:29,502 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 0 case distinctions, treesize of input 34 treesize of output 21 [2022-11-03 01:43:29,567 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:43:29,569 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:43:29,578 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:43:29,580 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:43:29,581 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:43:29,584 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:43:29,586 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:43:29,588 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:43:29,590 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:43:29,592 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 13 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 43 [2022-11-03 01:43:29,821 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:43:29,822 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:43:29,864 INFO L356 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2022-11-03 01:43:29,865 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 3 case distinctions, treesize of input 370 treesize of output 368 [2022-11-03 01:43:29,901 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:43:29,903 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:43:29,905 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:43:29,906 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:43:29,908 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:43:29,909 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:43:29,934 INFO L356 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2022-11-03 01:43:29,934 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 374 treesize of output 357 [2022-11-03 01:43:29,957 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:43:29,958 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:43:29,995 INFO L356 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2022-11-03 01:43:29,996 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 3 case distinctions, treesize of input 370 treesize of output 368 [2022-11-03 01:43:30,185 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:43:30,188 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:43:30,190 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:43:30,191 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:43:30,192 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:43:30,204 INFO L356 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-11-03 01:43:30,205 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 448 treesize of output 397 [2022-11-03 01:43:30,236 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:43:30,238 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:43:30,240 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:43:30,274 INFO L356 Elim1Store]: treesize reduction 87, result has 11.2 percent of original size [2022-11-03 01:43:30,275 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 4 new quantified variables, introduced 4 case distinctions, treesize of input 462 treesize of output 423 [2022-11-03 01:43:30,315 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:43:30,316 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:43:30,318 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:43:30,319 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:43:30,361 INFO L356 Elim1Store]: treesize reduction 64, result has 29.7 percent of original size [2022-11-03 01:43:30,362 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 442 treesize of output 436 [2022-11-03 01:43:30,542 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:43:30,682 INFO L356 Elim1Store]: treesize reduction 156, result has 13.8 percent of original size [2022-11-03 01:43:30,682 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 13 case distinctions, treesize of input 436 treesize of output 434 [2022-11-03 01:43:30,923 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 01:43:30,934 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 01:43:30,952 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 01:43:30,997 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:43:30,998 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 80 treesize of output 56 [2022-11-03 01:43:31,020 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 01:43:31,034 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 01:43:31,100 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-03 01:43:31,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 1 case distinctions, treesize of input 14 treesize of output 20 [2022-11-03 01:43:31,144 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-03 01:43:31,144 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 01:43:31,197 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 01:43:31,206 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 01:43:31,217 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 01:43:31,248 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 01:43:31,259 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 01:43:31,271 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:43:31,272 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 80 treesize of output 56 [2022-11-03 01:43:31,395 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-03 01:43:31,395 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 01:43:31,412 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 01:43:31,432 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 01:43:32,623 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '773#(and (<= |ULTIMATE.start_sll_circular_create_#in~data#1| 1) (= |ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (<= |#NULL.offset| 0) (<= 5 |ULTIMATE.start_main_~len~0#1|) (= |ULTIMATE.start_main_~data_init~0#1| 1) (<= 1 |ULTIMATE.start_sll_circular_create_~data#1|) (<= 0 |ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (<= 1 |ULTIMATE.start_sll_circular_create_#in~data#1|) (< (select |#length| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (+ |ULTIMATE.start_sll_circular_create_~last~0#1.offset| 4)) (<= |ULTIMATE.start_sll_circular_create_~len#1| 1) (<= |ULTIMATE.start_sll_circular_create_~data#1| 1) (<= |ULTIMATE.start_main_~len~0#1| 5) (<= 5 |ULTIMATE.start_sll_circular_create_#in~len#1|) (<= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (<= |ULTIMATE.start_sll_circular_create_#in~len#1| 5) (<= 0 |#NULL.offset|) (<= 0 |#StackHeapBarrier|) (= |#NULL.base| 0))' at error location [2022-11-03 01:43:32,624 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-03 01:43:32,624 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 01:43:32,624 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2022-11-03 01:43:32,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495958593] [2022-11-03 01:43:32,624 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 01:43:32,625 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-03 01:43:32,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:43:32,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-03 01:43:32,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2022-11-03 01:43:32,626 INFO L87 Difference]: Start difference. First operand 38 states and 41 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:43:32,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:43:32,664 INFO L93 Difference]: Finished difference Result 50 states and 53 transitions. [2022-11-03 01:43:32,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-03 01:43:32,664 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-11-03 01:43:32,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:43:32,665 INFO L225 Difference]: With dead ends: 50 [2022-11-03 01:43:32,665 INFO L226 Difference]: Without dead ends: 50 [2022-11-03 01:43:32,666 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2022-11-03 01:43:32,667 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 24 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-03 01:43:32,667 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 94 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-03 01:43:32,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-11-03 01:43:32,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2022-11-03 01:43:32,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 38 states have (on average 1.394736842105263) internal successors, (53), 49 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:43:32,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 53 transitions. [2022-11-03 01:43:32,684 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 53 transitions. Word has length 10 [2022-11-03 01:43:32,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:43:32,685 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 53 transitions. [2022-11-03 01:43:32,685 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:43:32,685 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 53 transitions. [2022-11-03 01:43:32,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-03 01:43:32,686 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:43:32,686 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1] [2022-11-03 01:43:32,734 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08cad0f5-7fd6-4b8b-ac30-51cdbff926c9/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-03 01:43:32,894 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08cad0f5-7fd6-4b8b-ac30-51cdbff926c9/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2022-11-03 01:43:32,895 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-11-03 01:43:32,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:43:32,895 INFO L85 PathProgramCache]: Analyzing trace with hash 1395492387, now seen corresponding path program 2 times [2022-11-03 01:43:32,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:43:32,896 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68576022] [2022-11-03 01:43:32,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:43:32,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:43:32,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:43:33,767 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-03 01:43:33,767 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:43:33,767 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68576022] [2022-11-03 01:43:33,768 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [68576022] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:43:33,768 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [229658291] [2022-11-03 01:43:33,768 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 01:43:33,768 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:43:33,768 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08cad0f5-7fd6-4b8b-ac30-51cdbff926c9/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:43:33,769 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08cad0f5-7fd6-4b8b-ac30-51cdbff926c9/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:43:33,773 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08cad0f5-7fd6-4b8b-ac30-51cdbff926c9/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-03 01:43:34,281 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-11-03 01:43:34,281 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 01:43:34,285 INFO L263 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 18 conjunts are in the unsatisfiable core [2022-11-03 01:43:34,288 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:43:34,297 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 01:43:34,358 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-03 01:43:34,359 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 01:43:34,367 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 14 treesize of output 16 [2022-11-03 01:43:34,434 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:43:34,435 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 14 treesize of output 16 [2022-11-03 01:43:34,448 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-03 01:43:34,449 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 11 treesize of output 11 [2022-11-03 01:43:34,515 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-03 01:43:34,515 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 14 treesize of output 20 [2022-11-03 01:43:34,584 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-03 01:43:34,585 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 14 treesize of output 20 [2022-11-03 01:43:34,653 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-11-03 01:43:34,653 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:43:36,834 WARN L833 $PredicateComparison]: unable to prove that (and (<= 0 |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset|) (forall ((v_ArrVal_277 Int)) (or (not (<= 8 v_ArrVal_277)) (forall ((|v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_22| Int) (v_ArrVal_278 Int)) (or (not (<= 8 v_ArrVal_278)) (forall ((|v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_21| Int)) (<= (+ |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 4) (select (store (store |c_#length| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_22| v_ArrVal_277) |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_21| v_ArrVal_278) |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|)))))))) is different from false [2022-11-03 01:43:37,446 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 1000 treesize of output 982 [2022-11-03 01:43:39,241 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 13 not checked. [2022-11-03 01:43:39,241 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [229658291] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 01:43:39,241 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1846406023] [2022-11-03 01:43:39,245 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2022-11-03 01:43:39,246 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 01:43:39,247 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 01:43:39,247 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 01:43:39,247 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 01:43:39,272 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:43:39,274 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:43:39,275 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 01:43:39,303 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:43:39,305 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 0 case distinctions, treesize of input 30 treesize of output 21 [2022-11-03 01:43:39,318 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 01:43:39,327 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 01:43:39,357 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:43:39,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, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2022-11-03 01:43:39,375 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:43:39,377 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 01:43:39,389 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:43:39,390 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 01:43:39,424 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:43:39,425 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:43:39,427 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:43:39,429 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:43:39,430 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:43:39,431 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 35 [2022-11-03 01:43:39,475 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:43:39,479 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 19 treesize of output 18 [2022-11-03 01:43:39,493 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:43:39,494 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:43:39,496 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:43:39,497 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 33 [2022-11-03 01:43:39,517 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:43:39,518 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 19 treesize of output 18 [2022-11-03 01:43:39,553 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:43:39,554 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:43:39,555 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 0 case distinctions, treesize of input 34 treesize of output 21 [2022-11-03 01:43:39,575 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:43:39,577 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:43:39,578 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 0 case distinctions, treesize of input 34 treesize of output 21 [2022-11-03 01:43:39,596 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:43:39,598 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:43:39,599 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:43:39,603 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 42 [2022-11-03 01:43:39,657 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:43:39,659 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:43:39,661 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:43:39,663 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:43:39,665 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:43:39,667 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:43:39,669 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:43:39,671 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:43:39,673 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:43:39,675 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 13 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 48 [2022-11-03 01:43:39,807 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:43:39,808 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:43:39,850 INFO L356 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2022-11-03 01:43:39,850 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 3 case distinctions, treesize of input 370 treesize of output 368 [2022-11-03 01:43:39,882 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:43:39,884 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:43:39,887 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:43:39,889 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:43:39,890 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:43:39,891 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:43:39,919 INFO L356 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2022-11-03 01:43:39,920 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 374 treesize of output 357 [2022-11-03 01:43:39,941 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:43:39,942 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:43:39,978 INFO L356 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2022-11-03 01:43:39,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 3 case distinctions, treesize of input 370 treesize of output 368 [2022-11-03 01:43:40,120 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:43:40,122 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:43:40,123 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:43:40,159 INFO L356 Elim1Store]: treesize reduction 87, result has 11.2 percent of original size [2022-11-03 01:43:40,160 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 4 new quantified variables, introduced 4 case distinctions, treesize of input 454 treesize of output 419 [2022-11-03 01:43:40,184 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:43:40,186 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:43:40,188 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:43:40,189 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:43:40,191 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:43:40,202 INFO L356 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-11-03 01:43:40,202 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 440 treesize of output 393 [2022-11-03 01:43:40,225 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:43:40,226 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:43:40,227 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:43:40,228 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:43:40,276 INFO L356 Elim1Store]: treesize reduction 64, result has 29.7 percent of original size [2022-11-03 01:43:40,277 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 434 treesize of output 428 [2022-11-03 01:43:40,442 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:43:40,557 INFO L356 Elim1Store]: treesize reduction 156, result has 13.8 percent of original size [2022-11-03 01:43:40,558 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 13 case distinctions, treesize of input 428 treesize of output 430 [2022-11-03 01:43:40,731 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 01:43:40,740 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 01:43:40,752 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 01:43:40,777 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 01:43:40,788 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 01:43:40,798 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:43:40,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 80 treesize of output 56 [2022-11-03 01:43:40,867 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-03 01:43:40,867 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 01:43:40,892 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 01:43:40,939 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 01:43:40,950 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 01:43:40,958 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 01:43:40,995 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:43:40,998 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 80 treesize of output 56 [2022-11-03 01:43:41,016 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 01:43:41,030 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 01:43:41,118 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-03 01:43:41,119 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 1 case distinctions, treesize of input 14 treesize of output 20 [2022-11-03 01:43:41,154 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-03 01:43:41,155 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 01:43:41,181 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 01:43:42,422 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1021#(and (<= |ULTIMATE.start_sll_circular_create_#in~data#1| 1) (= |ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (<= |#NULL.offset| 0) (<= 5 |ULTIMATE.start_main_~len~0#1|) (= |ULTIMATE.start_main_~data_init~0#1| 1) (<= 1 |ULTIMATE.start_sll_circular_create_~data#1|) (<= 0 |ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (<= 1 |ULTIMATE.start_sll_circular_create_#in~data#1|) (< (select |#length| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (+ |ULTIMATE.start_sll_circular_create_~last~0#1.offset| 4)) (<= |ULTIMATE.start_sll_circular_create_~len#1| 1) (<= |ULTIMATE.start_sll_circular_create_~data#1| 1) (<= |ULTIMATE.start_main_~len~0#1| 5) (<= 5 |ULTIMATE.start_sll_circular_create_#in~len#1|) (<= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (<= |ULTIMATE.start_sll_circular_create_#in~len#1| 5) (<= 0 |#NULL.offset|) (<= 0 |#StackHeapBarrier|) (= |#NULL.base| 0))' at error location [2022-11-03 01:43:42,422 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-03 01:43:42,422 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 01:43:42,423 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 3, 5] total 12 [2022-11-03 01:43:42,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084512480] [2022-11-03 01:43:42,423 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 01:43:42,423 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-03 01:43:42,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:43:42,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-03 01:43:42,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=326, Unknown=1, NotChecked=38, Total=462 [2022-11-03 01:43:42,425 INFO L87 Difference]: Start difference. First operand 50 states and 53 transitions. Second operand has 14 states, 13 states have (on average 4.230769230769231) internal successors, (55), 13 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:43:42,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:43:42,571 INFO L93 Difference]: Finished difference Result 62 states and 65 transitions. [2022-11-03 01:43:42,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-03 01:43:42,571 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.230769230769231) internal successors, (55), 13 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-11-03 01:43:42,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:43:42,572 INFO L225 Difference]: With dead ends: 62 [2022-11-03 01:43:42,572 INFO L226 Difference]: Without dead ends: 62 [2022-11-03 01:43:42,573 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 53 SyntacticMatches, 4 SemanticMatches, 22 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=125, Invalid=384, Unknown=1, NotChecked=42, Total=552 [2022-11-03 01:43:42,574 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 136 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 64 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 01:43:42,574 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 49 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 35 Invalid, 0 Unknown, 64 Unchecked, 0.1s Time] [2022-11-03 01:43:42,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-11-03 01:43:42,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 49. [2022-11-03 01:43:42,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 38 states have (on average 1.368421052631579) internal successors, (52), 48 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:43:42,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 52 transitions. [2022-11-03 01:43:42,579 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 52 transitions. Word has length 22 [2022-11-03 01:43:42,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:43:42,580 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 52 transitions. [2022-11-03 01:43:42,580 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.230769230769231) internal successors, (55), 13 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:43:42,580 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 52 transitions. [2022-11-03 01:43:42,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-03 01:43:42,581 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:43:42,581 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:43:42,626 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08cad0f5-7fd6-4b8b-ac30-51cdbff926c9/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-03 01:43:42,802 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08cad0f5-7fd6-4b8b-ac30-51cdbff926c9/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:43:42,803 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-11-03 01:43:42,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:43:42,803 INFO L85 PathProgramCache]: Analyzing trace with hash 310593606, now seen corresponding path program 1 times [2022-11-03 01:43:42,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:43:42,804 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129268312] [2022-11-03 01:43:42,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:43:42,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:43:42,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:43:42,988 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-11-03 01:43:42,988 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:43:42,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129268312] [2022-11-03 01:43:42,989 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2129268312] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:43:42,989 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:43:42,989 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-03 01:43:42,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680187059] [2022-11-03 01:43:42,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:43:42,990 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-03 01:43:42,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:43:42,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-03 01:43:42,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-03 01:43:42,991 INFO L87 Difference]: Start difference. First operand 49 states and 52 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:43:43,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:43:43,087 INFO L93 Difference]: Finished difference Result 64 states and 67 transitions. [2022-11-03 01:43:43,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-03 01:43:43,087 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-11-03 01:43:43,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:43:43,088 INFO L225 Difference]: With dead ends: 64 [2022-11-03 01:43:43,088 INFO L226 Difference]: Without dead ends: 64 [2022-11-03 01:43:43,089 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-03 01:43:43,089 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 81 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 01:43:43,090 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 40 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 01:43:43,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-11-03 01:43:43,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 50. [2022-11-03 01:43:43,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 39 states have (on average 1.3846153846153846) internal successors, (54), 49 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:43:43,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2022-11-03 01:43:43,094 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 23 [2022-11-03 01:43:43,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:43:43,095 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2022-11-03 01:43:43,095 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:43:43,095 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2022-11-03 01:43:43,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-03 01:43:43,096 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:43:43,096 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:43:43,096 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-03 01:43:43,097 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-11-03 01:43:43,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:43:43,097 INFO L85 PathProgramCache]: Analyzing trace with hash 310593607, now seen corresponding path program 1 times [2022-11-03 01:43:43,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:43:43,098 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43415093] [2022-11-03 01:43:43,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:43:43,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:43:43,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:43:43,344 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-11-03 01:43:43,345 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:43:43,345 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43415093] [2022-11-03 01:43:43,345 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43415093] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:43:43,345 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:43:43,345 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-03 01:43:43,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959155210] [2022-11-03 01:43:43,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:43:43,346 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-03 01:43:43,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:43:43,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-03 01:43:43,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-03 01:43:43,347 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:43:43,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:43:43,461 INFO L93 Difference]: Finished difference Result 55 states and 58 transitions. [2022-11-03 01:43:43,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-03 01:43:43,461 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-11-03 01:43:43,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:43:43,462 INFO L225 Difference]: With dead ends: 55 [2022-11-03 01:43:43,462 INFO L226 Difference]: Without dead ends: 55 [2022-11-03 01:43:43,462 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-03 01:43:43,463 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 79 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 01:43:43,464 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 33 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 01:43:43,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-11-03 01:43:43,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 53. [2022-11-03 01:43:43,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 42 states have (on average 1.3571428571428572) internal successors, (57), 52 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:43:43,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 57 transitions. [2022-11-03 01:43:43,467 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 57 transitions. Word has length 23 [2022-11-03 01:43:43,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:43:43,468 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 57 transitions. [2022-11-03 01:43:43,468 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:43:43,468 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 57 transitions. [2022-11-03 01:43:43,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-03 01:43:43,468 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:43:43,469 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:43:43,469 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-03 01:43:43,469 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-11-03 01:43:43,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:43:43,469 INFO L85 PathProgramCache]: Analyzing trace with hash 2127713017, now seen corresponding path program 1 times [2022-11-03 01:43:43,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:43:43,470 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378256945] [2022-11-03 01:43:43,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:43:43,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:43:43,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:43:44,366 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-03 01:43:44,366 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:43:44,366 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378256945] [2022-11-03 01:43:44,366 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1378256945] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:43:44,366 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [572115729] [2022-11-03 01:43:44,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:43:44,366 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:43:44,367 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08cad0f5-7fd6-4b8b-ac30-51cdbff926c9/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:43:44,367 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08cad0f5-7fd6-4b8b-ac30-51cdbff926c9/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:43:44,368 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08cad0f5-7fd6-4b8b-ac30-51cdbff926c9/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-03 01:43:44,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:43:44,522 INFO L263 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 33 conjunts are in the unsatisfiable core [2022-11-03 01:43:44,525 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:43:44,679 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 01:43:44,735 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:43:44,736 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 20 [2022-11-03 01:43:44,770 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 01:43:44,789 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-11-03 01:43:44,790 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:43:46,823 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_586 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_586)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (+ |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 4)))) is different from false [2022-11-03 01:43:46,998 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 4 not checked. [2022-11-03 01:43:46,998 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [572115729] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 01:43:46,998 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1690574593] [2022-11-03 01:43:47,000 INFO L159 IcfgInterpreter]: Started Sifa with 13 locations of interest [2022-11-03 01:43:47,001 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 01:43:47,001 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 01:43:47,001 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 01:43:47,002 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 01:43:47,031 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:43:47,032 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:43:47,035 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 01:43:47,068 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:43:47,070 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 0 case distinctions, treesize of input 30 treesize of output 21 [2022-11-03 01:43:47,080 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 01:43:47,093 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 01:43:47,116 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:43:47,117 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 0 case distinctions, treesize of input 28 treesize of output 30 [2022-11-03 01:43:47,129 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:43:47,130 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 01:43:47,143 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:43:47,144 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 01:43:47,168 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:43:47,169 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:43:47,171 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:43:47,172 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:43:47,174 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:43:47,175 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 35 [2022-11-03 01:43:47,210 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:43:47,211 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:43:47,213 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:43:47,214 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 33 [2022-11-03 01:43:47,229 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:43:47,230 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 19 treesize of output 18 [2022-11-03 01:43:47,250 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:43:47,251 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 19 treesize of output 18 [2022-11-03 01:43:47,282 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:43:47,285 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:43:47,286 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 0 case distinctions, treesize of input 34 treesize of output 21 [2022-11-03 01:43:47,300 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:43:47,302 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:43:47,303 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:43:47,305 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 42 [2022-11-03 01:43:47,328 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:43:47,330 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:43:47,331 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 0 case distinctions, treesize of input 34 treesize of output 21 [2022-11-03 01:43:47,522 INFO L356 Elim1Store]: treesize reduction 92, result has 21.4 percent of original size [2022-11-03 01:43:47,522 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 327 treesize of output 332 [2022-11-03 01:43:47,781 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:43:47,782 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:43:47,807 INFO L356 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2022-11-03 01:43:47,808 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 336 treesize of output 319 [2022-11-03 01:43:47,831 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:43:47,873 INFO L356 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2022-11-03 01:43:47,873 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 3 case distinctions, treesize of input 332 treesize of output 330 [2022-11-03 01:43:47,903 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:43:47,939 INFO L356 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2022-11-03 01:43:47,940 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 3 case distinctions, treesize of input 332 treesize of output 330 [2022-11-03 01:43:48,076 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:43:48,078 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:43:48,079 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:43:48,089 INFO L356 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-11-03 01:43:48,089 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 390 treesize of output 343 [2022-11-03 01:43:48,114 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:43:48,123 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:43:48,124 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:43:48,126 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:43:48,168 INFO L356 Elim1Store]: treesize reduction 58, result has 26.6 percent of original size [2022-11-03 01:43:48,168 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 384 treesize of output 378 [2022-11-03 01:43:48,201 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:43:48,205 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:43:48,206 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:43:48,217 INFO L356 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2022-11-03 01:43:48,218 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 404 treesize of output 378 [2022-11-03 01:43:48,318 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 01:43:48,328 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 01:43:48,347 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 15 treesize of output 1 [2022-11-03 01:43:48,355 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 01:43:48,367 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 01:43:48,385 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:43:48,386 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 34 treesize of output 14 [2022-11-03 01:43:48,396 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 19 treesize of output 1 [2022-11-03 01:43:48,408 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 01:43:48,436 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 01:43:48,460 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 01:43:48,486 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 01:43:48,497 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 15 treesize of output 1 [2022-11-03 01:43:48,506 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 01:43:48,550 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 01:43:48,563 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 01:43:48,574 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 01:43:48,629 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 01:43:50,217 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1551#(and (= |ULTIMATE.start_main_~data_new~0#1| 1) (<= (+ |ULTIMATE.start_sll_circular_create_~last~0#1.offset| 4) (select |#length| |ULTIMATE.start_sll_circular_create_~last~0#1.base|)) (= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| |ULTIMATE.start_sll_circular_create_#res#1.offset|) (= (select |#valid| |ULTIMATE.start_main_~ptr~0#1.base|) 1) (<= (+ |ULTIMATE.start_main_~ptr~0#1.offset| 8) (select |#length| |ULTIMATE.start_main_~ptr~0#1.base|)) (<= |ULTIMATE.start_sll_circular_create_#in~data#1| 1) (= |ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |ULTIMATE.start_sll_circular_create_~last~0#1.offset|)) (not (= |ULTIMATE.start_main_~data_init~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~ptr~0#1.base|) (+ |ULTIMATE.start_main_~ptr~0#1.offset| 4)))) (= |ULTIMATE.start_main_~head~1#1.offset| |ULTIMATE.start_sll_circular_create_#res#1.offset|) (<= |#NULL.offset| 0) (<= 5 |ULTIMATE.start_main_~len~0#1|) (= |ULTIMATE.start_main_~data_init~0#1| 1) (<= 1 |ULTIMATE.start_sll_circular_create_~data#1|) (<= 0 |ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (= |ULTIMATE.start_main_~head~1#1.offset| |ULTIMATE.start_main_~ptr~0#1.offset|) (<= 1 |ULTIMATE.start_sll_circular_create_#in~data#1|) (= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |ULTIMATE.start_sll_circular_create_~last~0#1.offset|)) (<= |ULTIMATE.start_sll_circular_create_~len#1| 1) (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_#res#1.base|) (<= |ULTIMATE.start_sll_circular_create_~data#1| 1) (<= |ULTIMATE.start_main_~len~0#1| 5) (<= 5 |ULTIMATE.start_sll_circular_create_#in~len#1|) (<= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (<= |ULTIMATE.start_sll_circular_create_#in~len#1| 5) (<= 0 |#NULL.offset|) (= |ULTIMATE.start_main_~head~1#1.base| |ULTIMATE.start_sll_circular_create_#res#1.base|) (= (select |#valid| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1) (<= 0 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~ptr~0#1.base| |ULTIMATE.start_main_~head~1#1.base|) (= |#NULL.base| 0))' at error location [2022-11-03 01:43:50,218 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-03 01:43:50,218 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 01:43:50,218 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 17 [2022-11-03 01:43:50,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440671834] [2022-11-03 01:43:50,218 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 01:43:50,219 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-11-03 01:43:50,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:43:50,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-11-03 01:43:50,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=542, Unknown=1, NotChecked=48, Total=702 [2022-11-03 01:43:50,220 INFO L87 Difference]: Start difference. First operand 53 states and 57 transitions. Second operand has 18 states, 18 states have (on average 2.888888888888889) internal successors, (52), 17 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:43:51,022 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|)) (.cse1 (+ |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 4))) (and (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|)) (<= 0 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse0 .cse1)) (= (select .cse0 (+ |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 4)) |c_ULTIMATE.start_main_~data_init~0#1|) (not (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|)) (<= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (<= 0 |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset|) (= |c_ULTIMATE.start_sll_circular_create_~data#1| |c_ULTIMATE.start_main_~data_init~0#1|) (<= 0 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1) (= |c_ULTIMATE.start_main_~data_init~0#1| 1) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| 0) (forall ((v_ArrVal_586 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_586)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse1))) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) is different from false [2022-11-03 01:43:52,210 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|)) (.cse1 (+ |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 4))) (and (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse0 .cse1)) (= (select .cse0 (+ |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 4)) |c_ULTIMATE.start_main_~data_init~0#1|) (<= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (<= 0 |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset|) (<= 0 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (= |c_ULTIMATE.start_main_~data_init~0#1| 1) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (forall ((v_ArrVal_586 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_586)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse1))))) is different from false [2022-11-03 01:43:52,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:43:52,352 INFO L93 Difference]: Finished difference Result 53 states and 56 transitions. [2022-11-03 01:43:52,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-03 01:43:52,353 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.888888888888889) internal successors, (52), 17 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-11-03 01:43:52,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:43:52,354 INFO L225 Difference]: With dead ends: 53 [2022-11-03 01:43:52,354 INFO L226 Difference]: Without dead ends: 53 [2022-11-03 01:43:52,355 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 61 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=172, Invalid=829, Unknown=3, NotChecked=186, Total=1190 [2022-11-03 01:43:52,356 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 13 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 19 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 01:43:52,356 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 265 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 153 Invalid, 0 Unknown, 19 Unchecked, 0.2s Time] [2022-11-03 01:43:52,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-11-03 01:43:52,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2022-11-03 01:43:52,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 42 states have (on average 1.3333333333333333) internal successors, (56), 52 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:43:52,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 56 transitions. [2022-11-03 01:43:52,360 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 56 transitions. Word has length 25 [2022-11-03 01:43:52,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:43:52,361 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 56 transitions. [2022-11-03 01:43:52,361 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.888888888888889) internal successors, (52), 17 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:43:52,361 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 56 transitions. [2022-11-03 01:43:52,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-03 01:43:52,362 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:43:52,362 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:43:52,395 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08cad0f5-7fd6-4b8b-ac30-51cdbff926c9/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-03 01:43:52,582 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08cad0f5-7fd6-4b8b-ac30-51cdbff926c9/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:43:52,583 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-11-03 01:43:52,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:43:52,583 INFO L85 PathProgramCache]: Analyzing trace with hash 1571648776, now seen corresponding path program 1 times [2022-11-03 01:43:52,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:43:52,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193924463] [2022-11-03 01:43:52,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:43:52,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:43:52,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:43:53,795 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 18 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-03 01:43:53,795 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:43:53,795 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193924463] [2022-11-03 01:43:53,795 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [193924463] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:43:53,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [352148831] [2022-11-03 01:43:53,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:43:53,796 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:43:53,796 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08cad0f5-7fd6-4b8b-ac30-51cdbff926c9/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:43:53,803 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08cad0f5-7fd6-4b8b-ac30-51cdbff926c9/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:43:53,808 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08cad0f5-7fd6-4b8b-ac30-51cdbff926c9/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-03 01:43:53,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:43:53,997 INFO L263 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 60 conjunts are in the unsatisfiable core [2022-11-03 01:43:54,003 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:43:54,026 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 01:43:54,068 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-03 01:43:54,070 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 18 [2022-11-03 01:43:54,131 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 01:43:54,148 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 01:43:54,198 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:43:54,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, 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 20 [2022-11-03 01:43:54,209 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:43:54,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2022-11-03 01:43:54,297 INFO L356 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-03 01:43:54,298 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 29 treesize of output 28 [2022-11-03 01:43:54,324 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-03 01:43:54,324 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 19 treesize of output 18 [2022-11-03 01:43:54,543 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:43:54,549 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-03 01:43:54,549 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 53 treesize of output 55 [2022-11-03 01:43:54,558 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:43:54,561 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-03 01:43:54,562 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 46 treesize of output 44 [2022-11-03 01:43:54,605 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 01:43:54,605 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 32 [2022-11-03 01:43:54,616 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 01:43:54,617 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 31 [2022-11-03 01:43:54,677 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 18 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-03 01:43:54,677 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:43:56,803 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (or (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse0) (= (select |c_#valid| .cse0) 1)))) (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (or (= (select (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) 1)))) is different from false [2022-11-03 01:43:58,856 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|)) (.cse3 (+ 4 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (and (forall ((v_ArrVal_760 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (let ((.cse0 (select (select (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store .cse2 .cse3 v_ArrVal_760)))) (store .cse1 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse1 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (or (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| .cse0) (= (select |c_#valid| .cse0) 1)))) (forall ((v_ArrVal_760 Int) (v_ArrVal_759 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (or (= (select (select (let ((.cse4 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse3 v_ArrVal_759)))) (store .cse4 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse4 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) (= (select |c_#valid| (select (select (let ((.cse5 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store .cse2 .cse3 v_ArrVal_760)))) (store .cse5 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse5 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) 1))))) is different from false [2022-11-03 01:43:59,138 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 18 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 2 not checked. [2022-11-03 01:43:59,138 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [352148831] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 01:43:59,138 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1540659411] [2022-11-03 01:43:59,142 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2022-11-03 01:43:59,143 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 01:43:59,143 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 01:43:59,143 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 01:43:59,144 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 01:43:59,176 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:43:59,177 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:43:59,178 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 01:43:59,204 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 01:43:59,214 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 01:43:59,225 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:43:59,226 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 0 case distinctions, treesize of input 30 treesize of output 21 [2022-11-03 01:43:59,251 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:43:59,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, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2022-11-03 01:43:59,266 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:43:59,267 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 01:43:59,280 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:43:59,280 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 01:43:59,310 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:43:59,312 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:43:59,313 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:43:59,314 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:43:59,316 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:43:59,317 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 35 [2022-11-03 01:43:59,355 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:43:59,356 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 19 treesize of output 18 [2022-11-03 01:43:59,368 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:43:59,369 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 19 treesize of output 18 [2022-11-03 01:43:59,384 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:43:59,386 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:43:59,387 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:43:59,388 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 33 [2022-11-03 01:43:59,418 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:43:59,419 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:43:59,420 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 0 case distinctions, treesize of input 34 treesize of output 21 [2022-11-03 01:43:59,437 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:43:59,438 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:43:59,440 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 0 case distinctions, treesize of input 34 treesize of output 21 [2022-11-03 01:43:59,454 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:43:59,456 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:43:59,457 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:43:59,459 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 42 [2022-11-03 01:43:59,625 INFO L356 Elim1Store]: treesize reduction 92, result has 21.4 percent of original size [2022-11-03 01:43:59,625 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 334 treesize of output 337 [2022-11-03 01:43:59,847 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:43:59,848 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:43:59,878 INFO L356 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2022-11-03 01:43:59,879 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 3 case distinctions, treesize of input 345 treesize of output 343 [2022-11-03 01:43:59,897 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:43:59,898 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:43:59,927 INFO L356 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2022-11-03 01:43:59,928 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 3 case distinctions, treesize of input 345 treesize of output 343 [2022-11-03 01:43:59,957 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:43:59,959 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:43:59,960 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:43:59,962 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:43:59,963 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:43:59,982 INFO L356 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2022-11-03 01:43:59,983 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 349 treesize of output 332 [2022-11-03 01:44:00,083 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:00,089 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:00,090 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:00,091 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:44:00,092 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:44:00,102 INFO L356 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-11-03 01:44:00,103 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 419 treesize of output 368 [2022-11-03 01:44:00,124 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:00,125 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:44:00,126 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:00,127 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:44:00,166 INFO L356 Elim1Store]: treesize reduction 64, result has 29.7 percent of original size [2022-11-03 01:44:00,167 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 413 treesize of output 407 [2022-11-03 01:44:00,185 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:00,191 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:00,192 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:44:00,218 INFO L356 Elim1Store]: treesize reduction 87, result has 11.2 percent of original size [2022-11-03 01:44:00,219 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 4 new quantified variables, introduced 4 case distinctions, treesize of input 433 treesize of output 398 [2022-11-03 01:44:00,308 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 01:44:00,316 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 01:44:00,332 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 01:44:00,346 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 01:44:00,354 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 15 treesize of output 1 [2022-11-03 01:44:00,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, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2022-11-03 01:44:00,386 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 01:44:00,394 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:00,395 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 34 treesize of output 14 [2022-11-03 01:44:00,417 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 01:44:00,424 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 01:44:00,444 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 15 treesize of output 1 [2022-11-03 01:44:00,451 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 01:44:00,458 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 01:44:00,488 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 01:44:00,504 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 01:44:00,514 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 01:44:00,597 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 01:44:00,611 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:00,612 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 27 treesize of output 11 [2022-11-03 01:44:00,626 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:00,627 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 27 treesize of output 11 [2022-11-03 01:44:00,739 INFO L356 Elim1Store]: treesize reduction 39, result has 18.8 percent of original size [2022-11-03 01:44:00,740 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 30 [2022-11-03 01:44:00,763 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:44:00,833 INFO L356 Elim1Store]: treesize reduction 48, result has 47.3 percent of original size [2022-11-03 01:44:00,833 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 3 case distinctions, treesize of input 34 treesize of output 49 [2022-11-03 01:44:00,863 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:44:00,913 INFO L356 Elim1Store]: treesize reduction 56, result has 38.5 percent of original size [2022-11-03 01:44:00,913 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 3 case distinctions, treesize of input 34 treesize of output 41 [2022-11-03 01:44:00,924 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2022-11-03 01:44:00,936 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2022-11-03 01:44:01,204 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 01:44:01,212 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 01:44:01,237 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 01:44:01,361 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 01:44:01,371 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 01:44:01,382 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 01:44:01,389 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 01:44:02,881 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1868#(and (<= 0 |#NULL.base|) (<= 1 |ULTIMATE.start_main_~data_init~0#1|) (<= |ULTIMATE.start_sll_circular_create_#in~data#1| 1) (<= |ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (<= |ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (<= |ULTIMATE.start_main_~data_init~0#1| 1) (not (= (select |#valid| |ULTIMATE.start_main_~ptr~0#1.base|) 1)) (<= |#NULL.offset| 0) (<= 5 |ULTIMATE.start_main_~len~0#1|) (<= |ULTIMATE.start_main_~head~1#1.offset| 0) (<= 0 |ULTIMATE.start_sll_circular_create_~last~0#1.offset|) (<= 1 |ULTIMATE.start_sll_circular_create_~data#1|) (<= 0 |ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (<= 1 |ULTIMATE.start_sll_circular_create_#in~data#1|) (<= 0 |ULTIMATE.start_main_~head~1#1.offset|) (<= |ULTIMATE.start_sll_circular_create_~len#1| 1) (<= |ULTIMATE.start_sll_circular_create_~data#1| 1) (<= |ULTIMATE.start_main_~len~0#1| 5) (<= |#NULL.base| 0) (<= 5 |ULTIMATE.start_sll_circular_create_#in~len#1|) (<= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (<= |ULTIMATE.start_sll_circular_create_#in~len#1| 5) (<= 0 |#NULL.offset|) (<= 0 |ULTIMATE.start_sll_circular_create_#res#1.offset|) (<= 0 |#StackHeapBarrier|))' at error location [2022-11-03 01:44:02,882 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-03 01:44:02,882 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 01:44:02,882 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 22 [2022-11-03 01:44:02,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712651892] [2022-11-03 01:44:02,882 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 01:44:02,883 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-11-03 01:44:02,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:44:02,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-11-03 01:44:02,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=867, Unknown=2, NotChecked=122, Total=1122 [2022-11-03 01:44:02,885 INFO L87 Difference]: Start difference. First operand 53 states and 56 transitions. Second operand has 23 states, 22 states have (on average 2.6363636363636362) internal successors, (58), 23 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:44:53,202 WARN L234 SmtUtils]: Spent 27.84s on a formula simplification. DAG size of input: 57 DAG size of output: 39 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-03 01:44:55,206 WARN L833 $PredicateComparison]: unable to prove that (and (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (or (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse0) (= (select |c_#valid| .cse0) 1))) (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (or (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse1) (= (select |c_#valid| .cse1) 1)))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) 0) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (or (= (select (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) 1)))) is different from false [2022-11-03 01:44:55,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:44:55,514 INFO L93 Difference]: Finished difference Result 84 states and 89 transitions. [2022-11-03 01:44:55,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-03 01:44:55,515 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.6363636363636362) internal successors, (58), 23 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-11-03 01:44:55,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:44:55,516 INFO L225 Difference]: With dead ends: 84 [2022-11-03 01:44:55,516 INFO L226 Difference]: Without dead ends: 84 [2022-11-03 01:44:55,517 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 60 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 372 ImplicationChecksByTransitivity, 58.3s TimeCoverageRelationStatistics Valid=196, Invalid=1209, Unknown=13, NotChecked=222, Total=1640 [2022-11-03 01:44:55,518 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 93 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 286 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 496 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 186 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-03 01:44:55,518 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 149 Invalid, 496 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 286 Invalid, 0 Unknown, 186 Unchecked, 0.3s Time] [2022-11-03 01:44:55,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2022-11-03 01:44:55,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 60. [2022-11-03 01:44:55,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 49 states have (on average 1.4081632653061225) internal successors, (69), 59 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:44:55,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 69 transitions. [2022-11-03 01:44:55,522 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 69 transitions. Word has length 28 [2022-11-03 01:44:55,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:44:55,523 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 69 transitions. [2022-11-03 01:44:55,523 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.6363636363636362) internal successors, (58), 23 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:44:55,523 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 69 transitions. [2022-11-03 01:44:55,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-03 01:44:55,524 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:44:55,524 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:44:55,573 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08cad0f5-7fd6-4b8b-ac30-51cdbff926c9/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-03 01:44:55,728 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08cad0f5-7fd6-4b8b-ac30-51cdbff926c9/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-11-03 01:44:55,728 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-11-03 01:44:55,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:44:55,729 INFO L85 PathProgramCache]: Analyzing trace with hash 1571648777, now seen corresponding path program 1 times [2022-11-03 01:44:55,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:44:55,729 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340945959] [2022-11-03 01:44:55,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:44:55,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:44:55,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:44:57,169 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 9 proven. 14 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-03 01:44:57,169 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:44:57,169 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340945959] [2022-11-03 01:44:57,169 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340945959] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:44:57,169 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2063002044] [2022-11-03 01:44:57,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:44:57,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:44:57,170 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08cad0f5-7fd6-4b8b-ac30-51cdbff926c9/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:44:57,175 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08cad0f5-7fd6-4b8b-ac30-51cdbff926c9/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:44:57,201 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08cad0f5-7fd6-4b8b-ac30-51cdbff926c9/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-03 01:44:57,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:44:57,362 INFO L263 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 59 conjunts are in the unsatisfiable core [2022-11-03 01:44:57,365 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:44:57,516 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-03 01:44:57,517 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 14 treesize of output 20 [2022-11-03 01:44:57,599 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 01:44:57,609 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 01:44:57,696 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:57,697 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 20 [2022-11-03 01:44:57,706 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:57,708 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 31 treesize of output 26 [2022-11-03 01:44:57,802 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:44:57,819 INFO L356 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-03 01:44:57,820 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 29 treesize of output 28 [2022-11-03 01:44:57,829 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:44:57,842 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-03 01:44:57,843 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 19 treesize of output 18 [2022-11-03 01:44:58,284 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:58,344 INFO L356 Elim1Store]: treesize reduction 64, result has 32.6 percent of original size [2022-11-03 01:44:58,344 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 73 treesize of output 94 [2022-11-03 01:44:58,359 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:58,436 INFO L356 Elim1Store]: treesize reduction 64, result has 32.6 percent of original size [2022-11-03 01:44:58,436 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 58 treesize of output 79 [2022-11-03 01:44:58,768 INFO L356 Elim1Store]: treesize reduction 12, result has 63.6 percent of original size [2022-11-03 01:44:58,768 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 67 treesize of output 71 [2022-11-03 01:44:58,818 INFO L356 Elim1Store]: treesize reduction 12, result has 63.6 percent of original size [2022-11-03 01:44:58,818 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 52 treesize of output 56 [2022-11-03 01:44:59,053 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 21 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-03 01:44:59,053 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:45:27,621 WARN L234 SmtUtils]: Spent 28.19s on a formula simplification. DAG size of input: 38 DAG size of output: 36 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-03 01:45:41,969 WARN L234 SmtUtils]: Spent 14.10s on a formula simplification that was a NOOP. DAG size: 45 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-03 01:45:44,367 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 38 treesize of output 34 [2022-11-03 01:45:44,419 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 18 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-03 01:45:44,419 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2063002044] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 01:45:44,419 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1773375319] [2022-11-03 01:45:44,422 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2022-11-03 01:45:44,422 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 01:45:44,422 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 01:45:44,423 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 01:45:44,423 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 01:45:44,445 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:45:44,446 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:45:44,447 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 01:45:44,475 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:45:44,476 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 0 case distinctions, treesize of input 30 treesize of output 21 [2022-11-03 01:45:44,487 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 01:45:44,499 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 01:45:44,518 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:45:44,520 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 01:45:44,532 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:45:44,533 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 0 case distinctions, treesize of input 28 treesize of output 30 [2022-11-03 01:45:44,544 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:45:44,545 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 01:45:44,565 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:45:44,567 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:45:44,568 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:45:44,570 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:45:44,571 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:45:44,573 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 35 [2022-11-03 01:45:44,607 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:45:44,608 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:45:44,610 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:45:44,611 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 33 [2022-11-03 01:45:44,624 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:45:44,625 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 19 treesize of output 18 [2022-11-03 01:45:44,642 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:45:44,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, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2022-11-03 01:45:44,669 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:45:44,671 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:45:44,689 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 0 case distinctions, treesize of input 34 treesize of output 21 [2022-11-03 01:45:44,702 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:45:44,703 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:45:44,704 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 0 case distinctions, treesize of input 34 treesize of output 21 [2022-11-03 01:45:44,721 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:45:44,722 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:45:44,724 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:45:44,725 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 42 [2022-11-03 01:45:44,914 INFO L356 Elim1Store]: treesize reduction 92, result has 21.4 percent of original size [2022-11-03 01:45:44,914 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 327 treesize of output 332 [2022-11-03 01:45:45,134 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:45:45,135 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:45:45,162 INFO L356 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2022-11-03 01:45:45,162 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 340 treesize of output 323 [2022-11-03 01:45:45,182 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:45:45,232 INFO L356 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2022-11-03 01:45:45,233 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 3 case distinctions, treesize of input 336 treesize of output 334 [2022-11-03 01:45:45,255 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:45:45,299 INFO L356 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2022-11-03 01:45:45,299 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 3 case distinctions, treesize of input 336 treesize of output 334 [2022-11-03 01:45:45,432 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:45:45,434 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:45:45,435 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:45:45,436 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:45:45,480 INFO L356 Elim1Store]: treesize reduction 58, result has 26.6 percent of original size [2022-11-03 01:45:45,481 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 392 treesize of output 386 [2022-11-03 01:45:45,505 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:45:45,507 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:45:45,508 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:45:45,519 INFO L356 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2022-11-03 01:45:45,520 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 412 treesize of output 386 [2022-11-03 01:45:45,542 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:45:45,544 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:45:45,545 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:45:45,556 INFO L356 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-11-03 01:45:45,557 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 398 treesize of output 347 [2022-11-03 01:45:45,676 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 01:45:45,684 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 01:45:45,703 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 01:45:45,711 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 01:45:45,720 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 15 treesize of output 1 [2022-11-03 01:45:45,741 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 01:45:45,749 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 19 treesize of output 1 [2022-11-03 01:45:45,762 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:45:45,763 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 34 treesize of output 14 [2022-11-03 01:45:45,784 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 01:45:45,794 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 01:45:45,814 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 01:45:45,824 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 01:45:45,834 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 15 treesize of output 1 [2022-11-03 01:45:45,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 11 treesize of output 7 [2022-11-03 01:45:45,882 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 01:45:45,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 11 treesize of output 7 [2022-11-03 01:45:45,947 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 01:45:45,963 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:45:45,964 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 27 treesize of output 11 [2022-11-03 01:45:45,986 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:45:45,987 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 27 treesize of output 11 [2022-11-03 01:45:46,075 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:45:46,154 INFO L356 Elim1Store]: treesize reduction 48, result has 47.3 percent of original size [2022-11-03 01:45:46,155 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 3 case distinctions, treesize of input 34 treesize of output 49 [2022-11-03 01:45:46,201 INFO L356 Elim1Store]: treesize reduction 39, result has 18.8 percent of original size [2022-11-03 01:45:46,202 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 30 [2022-11-03 01:45:46,237 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:45:46,302 INFO L356 Elim1Store]: treesize reduction 56, result has 38.5 percent of original size [2022-11-03 01:45:46,302 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 3 case distinctions, treesize of input 34 treesize of output 41 [2022-11-03 01:45:46,320 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2022-11-03 01:45:46,327 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2022-11-03 01:45:46,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, 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 01:45:46,598 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 01:45:46,611 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 01:45:46,710 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 01:45:46,720 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 01:45:46,731 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 01:45:46,741 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 01:45:48,654 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2227#(and (<= 0 |#NULL.base|) (<= 1 |ULTIMATE.start_main_~data_init~0#1|) (<= |ULTIMATE.start_sll_circular_create_#in~data#1| 1) (<= |ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (or (not (<= (+ |ULTIMATE.start_main_~ptr~0#1.offset| 8) (select |#length| |ULTIMATE.start_main_~ptr~0#1.base|))) (not (<= 0 (+ |ULTIMATE.start_main_~ptr~0#1.offset| 4)))) (<= |ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (<= |ULTIMATE.start_main_~data_init~0#1| 1) (<= |#NULL.offset| 0) (<= 5 |ULTIMATE.start_main_~len~0#1|) (<= |ULTIMATE.start_main_~head~1#1.offset| 0) (<= 0 |ULTIMATE.start_sll_circular_create_~last~0#1.offset|) (<= 1 |ULTIMATE.start_sll_circular_create_~data#1|) (<= 0 |ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (<= 1 |ULTIMATE.start_sll_circular_create_#in~data#1|) (<= 0 |ULTIMATE.start_main_~head~1#1.offset|) (<= |ULTIMATE.start_sll_circular_create_~len#1| 1) (<= |ULTIMATE.start_sll_circular_create_~data#1| 1) (<= |ULTIMATE.start_main_~len~0#1| 5) (<= |#NULL.base| 0) (<= 5 |ULTIMATE.start_sll_circular_create_#in~len#1|) (<= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (<= |ULTIMATE.start_sll_circular_create_#in~len#1| 5) (<= 0 |#NULL.offset|) (<= 0 |ULTIMATE.start_sll_circular_create_#res#1.offset|) (<= 0 |#StackHeapBarrier|))' at error location [2022-11-03 01:45:48,654 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-03 01:45:48,654 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 01:45:48,654 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 26 [2022-11-03 01:45:48,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105486225] [2022-11-03 01:45:48,655 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 01:45:48,656 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-11-03 01:45:48,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:45:48,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-11-03 01:45:48,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=1251, Unknown=0, NotChecked=0, Total=1406 [2022-11-03 01:45:48,657 INFO L87 Difference]: Start difference. First operand 60 states and 69 transitions. Second operand has 27 states, 26 states have (on average 2.4615384615384617) internal successors, (64), 27 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:45:50,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:45:50,536 INFO L93 Difference]: Finished difference Result 72 states and 75 transitions. [2022-11-03 01:45:50,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-03 01:45:50,538 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 2.4615384615384617) internal successors, (64), 27 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-11-03 01:45:50,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:45:50,539 INFO L225 Difference]: With dead ends: 72 [2022-11-03 01:45:50,539 INFO L226 Difference]: Without dead ends: 72 [2022-11-03 01:45:50,540 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 54 SyntacticMatches, 6 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 619 ImplicationChecksByTransitivity, 49.0s TimeCoverageRelationStatistics Valid=302, Invalid=2050, Unknown=0, NotChecked=0, Total=2352 [2022-11-03 01:45:50,541 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 48 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 426 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 552 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 426 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 92 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-03 01:45:50,541 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 219 Invalid, 552 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 426 Invalid, 0 Unknown, 92 Unchecked, 0.5s Time] [2022-11-03 01:45:50,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-11-03 01:45:50,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 60. [2022-11-03 01:45:50,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 49 states have (on average 1.3673469387755102) internal successors, (67), 59 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:45:50,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 67 transitions. [2022-11-03 01:45:50,545 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 67 transitions. Word has length 28 [2022-11-03 01:45:50,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:45:50,546 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 67 transitions. [2022-11-03 01:45:50,546 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 2.4615384615384617) internal successors, (64), 27 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:45:50,546 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 67 transitions. [2022-11-03 01:45:50,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-03 01:45:50,547 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:45:50,547 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:45:50,589 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08cad0f5-7fd6-4b8b-ac30-51cdbff926c9/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-03 01:45:50,762 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08cad0f5-7fd6-4b8b-ac30-51cdbff926c9/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-11-03 01:45:50,763 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-11-03 01:45:50,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:45:50,763 INFO L85 PathProgramCache]: Analyzing trace with hash 1476470677, now seen corresponding path program 1 times [2022-11-03 01:45:50,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:45:50,763 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951358782] [2022-11-03 01:45:50,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:45:50,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:45:50,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:45:50,951 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-11-03 01:45:50,951 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:45:50,952 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951358782] [2022-11-03 01:45:50,952 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1951358782] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:45:50,952 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:45:50,952 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-03 01:45:50,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294751242] [2022-11-03 01:45:50,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:45:50,953 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-03 01:45:50,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:45:50,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-03 01:45:50,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-03 01:45:50,955 INFO L87 Difference]: Start difference. First operand 60 states and 67 transitions. Second operand has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:45:51,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:45:51,079 INFO L93 Difference]: Finished difference Result 72 states and 78 transitions. [2022-11-03 01:45:51,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-03 01:45:51,079 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-11-03 01:45:51,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:45:51,082 INFO L225 Difference]: With dead ends: 72 [2022-11-03 01:45:51,082 INFO L226 Difference]: Without dead ends: 72 [2022-11-03 01:45:51,083 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-11-03 01:45:51,083 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 110 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 01:45:51,084 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 48 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 01:45:51,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-11-03 01:45:51,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 61. [2022-11-03 01:45:51,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 50 states have (on average 1.36) internal successors, (68), 60 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:45:51,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 68 transitions. [2022-11-03 01:45:51,088 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 68 transitions. Word has length 29 [2022-11-03 01:45:51,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:45:51,088 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 68 transitions. [2022-11-03 01:45:51,089 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:45:51,089 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 68 transitions. [2022-11-03 01:45:51,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-03 01:45:51,090 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:45:51,090 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:45:51,090 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-03 01:45:51,090 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-11-03 01:45:51,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:45:51,091 INFO L85 PathProgramCache]: Analyzing trace with hash 1476470678, now seen corresponding path program 1 times [2022-11-03 01:45:51,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:45:51,091 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520415298] [2022-11-03 01:45:51,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:45:51,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:45:51,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:45:51,409 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-11-03 01:45:51,410 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:45:51,410 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520415298] [2022-11-03 01:45:51,410 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520415298] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:45:51,410 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:45:51,410 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-03 01:45:51,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441907468] [2022-11-03 01:45:51,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:45:51,411 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-03 01:45:51,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:45:51,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-03 01:45:51,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-11-03 01:45:51,411 INFO L87 Difference]: Start difference. First operand 61 states and 68 transitions. Second operand has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:45:51,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:45:51,701 INFO L93 Difference]: Finished difference Result 88 states and 94 transitions. [2022-11-03 01:45:51,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-03 01:45:51,702 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-11-03 01:45:51,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:45:51,702 INFO L225 Difference]: With dead ends: 88 [2022-11-03 01:45:51,702 INFO L226 Difference]: Without dead ends: 88 [2022-11-03 01:45:51,703 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2022-11-03 01:45:51,703 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 154 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 01:45:51,703 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 64 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 01:45:51,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2022-11-03 01:45:51,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 61. [2022-11-03 01:45:51,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 50 states have (on average 1.34) internal successors, (67), 60 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:45:51,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 67 transitions. [2022-11-03 01:45:51,707 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 67 transitions. Word has length 29 [2022-11-03 01:45:51,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:45:51,707 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 67 transitions. [2022-11-03 01:45:51,707 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:45:51,707 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 67 transitions. [2022-11-03 01:45:51,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-03 01:45:51,708 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:45:51,708 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:45:51,708 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-03 01:45:51,708 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-11-03 01:45:51,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:45:51,709 INFO L85 PathProgramCache]: Analyzing trace with hash -1474013366, now seen corresponding path program 1 times [2022-11-03 01:45:51,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:45:51,709 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602495370] [2022-11-03 01:45:51,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:45:51,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:45:51,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:45:51,803 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-11-03 01:45:51,803 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:45:51,803 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602495370] [2022-11-03 01:45:51,803 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1602495370] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:45:51,804 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:45:51,804 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-03 01:45:51,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982727767] [2022-11-03 01:45:51,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:45:51,805 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 01:45:51,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:45:51,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 01:45:51,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 01:45:51,806 INFO L87 Difference]: Start difference. First operand 61 states and 67 transitions. Second operand has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:45:51,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:45:51,861 INFO L93 Difference]: Finished difference Result 60 states and 66 transitions. [2022-11-03 01:45:51,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 01:45:51,862 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-11-03 01:45:51,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:45:51,865 INFO L225 Difference]: With dead ends: 60 [2022-11-03 01:45:51,865 INFO L226 Difference]: Without dead ends: 60 [2022-11-03 01:45:51,865 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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 01:45:51,866 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 12 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 01:45:51,866 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 28 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 01:45:51,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-11-03 01:45:51,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2022-11-03 01:45:51,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 50 states have (on average 1.32) internal successors, (66), 59 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:45:51,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 66 transitions. [2022-11-03 01:45:51,884 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 66 transitions. Word has length 30 [2022-11-03 01:45:51,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:45:51,885 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 66 transitions. [2022-11-03 01:45:51,885 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:45:51,885 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 66 transitions. [2022-11-03 01:45:51,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-03 01:45:51,886 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:45:51,886 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:45:51,886 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-03 01:45:51,888 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-11-03 01:45:51,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:45:51,889 INFO L85 PathProgramCache]: Analyzing trace with hash -1474013381, now seen corresponding path program 1 times [2022-11-03 01:45:51,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:45:51,889 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201301528] [2022-11-03 01:45:51,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:45:51,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:45:51,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:45:54,124 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 01:45:54,125 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:45:54,125 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201301528] [2022-11-03 01:45:54,125 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1201301528] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:45:54,125 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [491296869] [2022-11-03 01:45:54,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:45:54,125 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:45:54,125 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08cad0f5-7fd6-4b8b-ac30-51cdbff926c9/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:45:54,127 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08cad0f5-7fd6-4b8b-ac30-51cdbff926c9/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:45:54,139 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08cad0f5-7fd6-4b8b-ac30-51cdbff926c9/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-03 01:45:54,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:45:54,349 INFO L263 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 73 conjunts are in the unsatisfiable core [2022-11-03 01:45:54,358 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:45:54,569 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 01:45:54,708 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 01:45:54,752 INFO L356 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-11-03 01:45:54,753 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 18 treesize of output 28 [2022-11-03 01:45:54,759 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 01:45:54,776 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 01:45:54,866 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:45:54,867 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 33 treesize of output 28 [2022-11-03 01:45:54,887 INFO L356 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-11-03 01:45:54,888 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 26 treesize of output 36 [2022-11-03 01:45:54,916 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:45:54,918 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 20 [2022-11-03 01:45:55,051 INFO L356 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-03 01:45:55,052 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 31 treesize of output 30 [2022-11-03 01:45:55,071 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 22 [2022-11-03 01:45:55,099 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-03 01:45:55,099 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 19 treesize of output 18 [2022-11-03 01:45:55,364 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:45:55,370 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-03 01:45:55,371 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 28 treesize of output 30 [2022-11-03 01:45:55,384 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:45:55,389 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-03 01:45:55,389 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 40 treesize of output 38 [2022-11-03 01:45:55,412 INFO L356 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-11-03 01:45:55,413 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 26 treesize of output 36 [2022-11-03 01:45:55,419 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 01:45:55,546 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-03 01:45:55,546 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 10 [2022-11-03 01:45:55,569 INFO L356 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2022-11-03 01:45:55,570 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 29 [2022-11-03 01:45:55,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, 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 01:45:55,737 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 18 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-03 01:45:55,738 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:45:56,075 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1373 Int) (v_ArrVal_1378 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (or (= .cse0 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (= (select (select (store (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_1373)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| v_ArrVal_1378) (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (+ .cse0 4)) |c_ULTIMATE.start_main_~data_init~0#1|)))) (forall ((v_ArrVal_1373 Int) (v_ArrVal_1378 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (or (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse1) (= (select (select (store (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_1373)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| v_ArrVal_1378) .cse1) (+ (select (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) 4)) |c_ULTIMATE.start_main_~data_init~0#1|))))) is different from false [2022-11-03 01:45:56,158 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|)) (.cse3 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|)) (.cse4 (+ 4 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (and (forall ((v_ArrVal_1371 Int) (v_ArrVal_1368 (Array Int Int)) (v_ArrVal_1373 Int) (v_ArrVal_1378 (Array Int Int)) (v_ArrVal_1369 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (let ((.cse1 (select (select (let ((.cse5 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store .cse6 .cse4 v_ArrVal_1369)))) (store .cse5 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse5 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (or (= (select (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1368))) (store .cse0 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse0 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_1373))) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1378) .cse1) (+ (select (select (let ((.cse2 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store .cse3 .cse4 v_ArrVal_1371)))) (store .cse2 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse2 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) 4)) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| .cse1)))) (forall ((v_ArrVal_1371 Int) (v_ArrVal_1368 (Array Int Int)) (v_ArrVal_1373 Int) (v_ArrVal_1378 (Array Int Int)) (v_ArrVal_1369 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (let ((.cse9 (select (select (let ((.cse10 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store .cse3 .cse4 v_ArrVal_1371)))) (store .cse10 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse10 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (or (= (select (select (store (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1368))) (store .cse7 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse7 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_1373))) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1378) (select (select (let ((.cse8 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store .cse6 .cse4 v_ArrVal_1369)))) (store .cse8 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse8 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) (+ .cse9 4)) |c_ULTIMATE.start_main_~data_init~0#1|) (= .cse9 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)))))) is different from false [2022-11-03 01:45:57,421 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse7 (+ 4 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) (.cse2 (+ |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 4))) (let ((.cse0 (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (forall ((v_ArrVal_1368 (Array Int Int)) (v_ArrVal_1373 Int) (v_ArrVal_1378 (Array Int Int))) (let ((.cse47 (select (store (let ((.cse48 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1368))) (store .cse48 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse48 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_1373))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1378) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select v_ArrVal_1378 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse47 .cse7) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse47 .cse2)))))))))) (.cse1 (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (forall ((v_ArrVal_1368 (Array Int Int)) (v_ArrVal_1373 Int) (v_ArrVal_1378 (Array Int Int))) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (let ((.cse46 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1368))) (store .cse46 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse46 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_1373))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1378) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse2)))))))) (.cse29 (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (forall ((v_ArrVal_1368 (Array Int Int)) (v_ArrVal_1373 Int) (v_ArrVal_1378 (Array Int Int))) (let ((.cse44 (select (store (let ((.cse45 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1368))) (store .cse45 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse45 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_1373))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1378) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select .cse44 .cse7) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse44 .cse2))))))) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|)))) (.cse4 (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) (.cse31 (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (forall ((v_ArrVal_1368 (Array Int Int)) (v_ArrVal_1373 Int) (v_ArrVal_1378 (Array Int Int))) (or (= (select v_ArrVal_1378 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (let ((.cse43 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1368))) (store .cse43 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse43 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_1373))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1378) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse2)))))) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))))) (and .cse0 .cse1 (or (let ((.cse5 (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (forall ((v_ArrVal_1368 (Array Int Int)) (v_ArrVal_1373 Int) (v_ArrVal_1378 (Array Int Int))) (let ((.cse26 (select (store (let ((.cse27 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1368))) (store .cse27 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse27 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_1373))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1378) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select .cse26 .cse7) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse26 .cse2)))))))) (.cse10 (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (forall ((v_ArrVal_1368 (Array Int Int)) (v_ArrVal_1373 Int) (v_ArrVal_1378 (Array Int Int))) (let ((.cse24 (select (store (let ((.cse25 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1368))) (store .cse25 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse25 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_1373))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1378) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select v_ArrVal_1378 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse24 .cse7) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse24 .cse2)))))))) (.cse11 (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (forall ((v_ArrVal_1368 (Array Int Int)) (v_ArrVal_1373 Int) (v_ArrVal_1378 (Array Int Int))) (or (= (select v_ArrVal_1378 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (let ((.cse23 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1368))) (store .cse23 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse23 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_1373))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1378) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse2))))))) (.cse9 (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (forall ((v_ArrVal_1368 (Array Int Int)) (v_ArrVal_1373 Int) (v_ArrVal_1378 (Array Int Int))) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (let ((.cse22 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1368))) (store .cse22 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse22 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_1373))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1378) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse2))))))) (and (or (forall ((v_ArrVal_1368 (Array Int Int)) (v_ArrVal_1373 Int) (v_ArrVal_1378 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (= (select v_ArrVal_1378 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (let ((.cse3 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1368))) (store .cse3 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse3 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_1373))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1378) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse2)))) .cse4) .cse5 (or (forall ((v_ArrVal_1368 (Array Int Int)) (v_ArrVal_1373 Int) (v_ArrVal_1378 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (let ((.cse6 (select (store (let ((.cse8 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1368))) (store .cse8 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse8 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_1373))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1378) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (= (select v_ArrVal_1378 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse6 .cse7) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse6 .cse2))))) .cse4) (or (and .cse5 .cse9) .cse4) .cse10 .cse11 .cse9 (or (and (forall ((v_ArrVal_1368 (Array Int Int)) (v_ArrVal_1373 Int) (v_ArrVal_1378 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (let ((.cse12 (select (store (let ((.cse13 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1368))) (store .cse13 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse13 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_1373))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1378) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select .cse12 .cse7) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse12 .cse2))))) .cse5 (forall ((v_ArrVal_1368 (Array Int Int)) (v_ArrVal_1373 Int) (v_ArrVal_1378 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= (select v_ArrVal_1378 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (let ((.cse14 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1368))) (store .cse14 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse14 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_1373))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1378) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse2)))) .cse10 (forall ((v_ArrVal_1368 (Array Int Int)) (v_ArrVal_1373 Int) (v_ArrVal_1378 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (let ((.cse15 (select (store (let ((.cse16 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1368))) (store .cse16 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse16 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_1373))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1378) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select v_ArrVal_1378 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse15 .cse7) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse15 .cse2))))) (forall ((v_ArrVal_1368 (Array Int Int)) (v_ArrVal_1373 Int) (v_ArrVal_1378 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (let ((.cse17 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1368))) (store .cse17 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse17 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_1373))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1378) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse2))) .cse11 .cse9 (forall ((v_ArrVal_1368 (Array Int Int)) (v_ArrVal_1373 Int) (v_ArrVal_1378 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (let ((.cse18 (select (store (let ((.cse19 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1368))) (store .cse19 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse19 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_1373))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1378) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_ArrVal_1378 .cse7)) (= (select v_ArrVal_1378 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse18 .cse7) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse18 .cse2)))))) .cse4) (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (forall ((v_ArrVal_1368 (Array Int Int)) (v_ArrVal_1373 Int) (v_ArrVal_1378 (Array Int Int))) (let ((.cse20 (select (store (let ((.cse21 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1368))) (store .cse21 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse21 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_1373))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1378) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_ArrVal_1378 .cse7)) (= (select v_ArrVal_1378 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse20 .cse7) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse20 .cse2))))) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|))))) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) (or (and .cse0 .cse1 (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (forall ((v_ArrVal_1368 (Array Int Int)) (v_ArrVal_1373 Int) (v_ArrVal_1378 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (let ((.cse28 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1368))) (store .cse28 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse28 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_1373))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1378) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse2))) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) .cse29 (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (forall ((v_ArrVal_1368 (Array Int Int)) (v_ArrVal_1373 Int) (v_ArrVal_1378 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (or (= (select v_ArrVal_1378 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (let ((.cse30 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1368))) (store .cse30 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse30 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_1373))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1378) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse2)))) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) .cse31 (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (forall ((v_ArrVal_1368 (Array Int Int)) (v_ArrVal_1373 Int) (v_ArrVal_1378 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (let ((.cse32 (select (store (let ((.cse33 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1368))) (store .cse33 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse33 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_1373))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1378) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select v_ArrVal_1378 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse32 .cse7) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse32 .cse2))))) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (forall ((v_ArrVal_1368 (Array Int Int)) (v_ArrVal_1373 Int) (v_ArrVal_1378 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (let ((.cse34 (select (store (let ((.cse35 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1368))) (store .cse35 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse35 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_1373))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1378) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_ArrVal_1378 .cse7)) (= (select v_ArrVal_1378 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse34 .cse7) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse34 .cse2))))) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (forall ((v_ArrVal_1368 (Array Int Int)) (v_ArrVal_1373 Int) (v_ArrVal_1378 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (let ((.cse36 (select (store (let ((.cse37 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1368))) (store .cse37 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse37 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_1373))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1378) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select .cse36 .cse7) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse36 .cse2))))) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|)))) .cse4) (or (forall ((v_ArrVal_1368 (Array Int Int)) (v_ArrVal_1373 Int) (v_ArrVal_1378 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (let ((.cse38 (select (store (let ((.cse39 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1368))) (store .cse39 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse39 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_1373))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1378) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (= (select v_ArrVal_1378 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse38 .cse7) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse38 .cse2))))) .cse4) .cse29 (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (or (forall ((v_ArrVal_1368 (Array Int Int)) (v_ArrVal_1373 Int) (v_ArrVal_1378 (Array Int Int))) (let ((.cse40 (select (store (let ((.cse41 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1368))) (store .cse41 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse41 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_1373))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1378) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_ArrVal_1378 .cse7)) (= (select v_ArrVal_1378 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse40 .cse7) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse40 .cse2))))) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|))))) (or (forall ((v_ArrVal_1368 (Array Int Int)) (v_ArrVal_1373 Int) (v_ArrVal_1378 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (= (select v_ArrVal_1378 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (let ((.cse42 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1368))) (store .cse42 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse42 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_1373))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1378) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse2)))) .cse4) (or (and .cse1 .cse29) .cse4) .cse31))) is different from false [2022-11-03 01:45:59,312 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 4))) (let ((.cse0 (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (forall ((v_ArrVal_1368 (Array Int Int)) (v_ArrVal_1373 Int) (v_ArrVal_1378 (Array Int Int))) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (let ((.cse47 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1368))) (store .cse47 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse47 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_1373))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1378) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse4)))))))) (.cse8 (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (or (forall ((v_ArrVal_1368 (Array Int Int)) (v_ArrVal_1373 Int) (v_ArrVal_1378 (Array Int Int))) (let ((.cse45 (select (store (let ((.cse46 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1368))) (store .cse46 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse46 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_1373))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1378) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse45 4)) (= (select v_ArrVal_1378 .cse4) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse45 .cse4))))) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|))) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|)))) (.cse1 (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (forall ((v_ArrVal_1368 (Array Int Int)) (v_ArrVal_1373 Int) (v_ArrVal_1378 (Array Int Int))) (let ((.cse43 (select (store (let ((.cse44 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1368))) (store .cse44 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse44 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_1373))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1378) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse43 4)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse43 .cse4)))))))))) (.cse14 (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (forall ((v_ArrVal_1368 (Array Int Int)) (v_ArrVal_1373 Int) (v_ArrVal_1378 (Array Int Int))) (or (= (select v_ArrVal_1378 .cse4) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (let ((.cse42 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1368))) (store .cse42 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse42 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_1373))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1378) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse4)))))) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|)))) (.cse2 (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0))) (and .cse0 (or (and .cse0 .cse1) .cse2) (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (or (forall ((v_ArrVal_1368 (Array Int Int)) (v_ArrVal_1373 Int) (v_ArrVal_1378 (Array Int Int))) (let ((.cse3 (select (store (let ((.cse5 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1368))) (store .cse5 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse5 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_1373))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1378) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse3 4)) (= (select v_ArrVal_1378 .cse4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_ArrVal_1378 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse3 .cse4))))) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|))))) (or .cse2 (forall ((v_ArrVal_1368 (Array Int Int)) (v_ArrVal_1373 Int) (v_ArrVal_1378 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (= (select v_ArrVal_1378 .cse4) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (let ((.cse6 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1368))) (store .cse6 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse6 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_1373))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1378) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse4))))) (or (and .cse0 (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (forall ((v_ArrVal_1368 (Array Int Int)) (v_ArrVal_1373 Int) (v_ArrVal_1378 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (let ((.cse7 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1368))) (store .cse7 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse7 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_1373))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1378) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse4))) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) .cse8 (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (forall ((v_ArrVal_1368 (Array Int Int)) (v_ArrVal_1373 Int) (v_ArrVal_1378 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (let ((.cse9 (select (store (let ((.cse10 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1368))) (store .cse10 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse10 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_1373))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1378) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse9 4)) (= (select v_ArrVal_1378 .cse4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_ArrVal_1378 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse9 .cse4))))) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) .cse1 (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (forall ((v_ArrVal_1368 (Array Int Int)) (v_ArrVal_1373 Int) (v_ArrVal_1378 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (or (= (select v_ArrVal_1378 .cse4) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (let ((.cse11 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1368))) (store .cse11 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse11 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_1373))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1378) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse4)))) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (forall ((v_ArrVal_1368 (Array Int Int)) (v_ArrVal_1373 Int) (v_ArrVal_1378 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (let ((.cse12 (select (store (let ((.cse13 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1368))) (store .cse13 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse13 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_1373))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1378) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse12 4)) (= (select v_ArrVal_1378 .cse4) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse12 .cse4))))) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) .cse14 (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (forall ((v_ArrVal_1368 (Array Int Int)) (v_ArrVal_1373 Int) (v_ArrVal_1378 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (let ((.cse15 (select (store (let ((.cse16 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1368))) (store .cse16 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse16 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_1373))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1378) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse15 4)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse15 .cse4)))))))) .cse2) .cse8 (or (forall ((v_ArrVal_1368 (Array Int Int)) (v_ArrVal_1373 Int) (v_ArrVal_1378 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (let ((.cse17 (select (store (let ((.cse18 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1368))) (store .cse18 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse18 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_1373))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1378) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse17 4)) (= (select v_ArrVal_1378 .cse4) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse17 .cse4))))) .cse2) .cse1 .cse14 (or (let ((.cse19 (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (forall ((v_ArrVal_1368 (Array Int Int)) (v_ArrVal_1373 Int) (v_ArrVal_1378 (Array Int Int))) (let ((.cse40 (select (store (let ((.cse41 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1368))) (store .cse41 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse41 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_1373))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1378) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse40 4)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse40 .cse4)))))))) (.cse26 (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (forall ((v_ArrVal_1368 (Array Int Int)) (v_ArrVal_1373 Int) (v_ArrVal_1378 (Array Int Int))) (or (= (select v_ArrVal_1378 .cse4) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (let ((.cse39 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1368))) (store .cse39 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse39 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_1373))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1378) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse4))))))) (.cse23 (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (forall ((v_ArrVal_1368 (Array Int Int)) (v_ArrVal_1373 Int) (v_ArrVal_1378 (Array Int Int))) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (let ((.cse38 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1368))) (store .cse38 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse38 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_1373))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1378) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse4)))))) (.cse27 (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (forall ((v_ArrVal_1368 (Array Int Int)) (v_ArrVal_1373 Int) (v_ArrVal_1378 (Array Int Int))) (let ((.cse36 (select (store (let ((.cse37 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1368))) (store .cse37 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse37 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_1373))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1378) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse36 4)) (= (select v_ArrVal_1378 .cse4) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse36 .cse4))))) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|))))) (and .cse19 (or (forall ((v_ArrVal_1368 (Array Int Int)) (v_ArrVal_1373 Int) (v_ArrVal_1378 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (= (select v_ArrVal_1378 .cse4) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (let ((.cse20 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1368))) (store .cse20 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse20 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_1373))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1378) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse4)))) .cse2) (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (forall ((v_ArrVal_1368 (Array Int Int)) (v_ArrVal_1373 Int) (v_ArrVal_1378 (Array Int Int))) (let ((.cse21 (select (store (let ((.cse22 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1368))) (store .cse22 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse22 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_1373))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1378) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse21 4)) (= (select v_ArrVal_1378 .cse4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_ArrVal_1378 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse21 .cse4))))) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|))) (or .cse2 (and .cse19 .cse23)) (or .cse2 (forall ((v_ArrVal_1368 (Array Int Int)) (v_ArrVal_1373 Int) (v_ArrVal_1378 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (let ((.cse24 (select (store (let ((.cse25 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1368))) (store .cse25 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse25 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_1373))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1378) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse24 4)) (= (select v_ArrVal_1378 .cse4) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse24 .cse4)))))) .cse26 .cse23 .cse27 (or (and .cse19 (forall ((v_ArrVal_1368 (Array Int Int)) (v_ArrVal_1373 Int) (v_ArrVal_1378 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (let ((.cse28 (select (store (let ((.cse29 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1368))) (store .cse29 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse29 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_1373))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1378) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse28 4)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse28 .cse4))))) (forall ((v_ArrVal_1368 (Array Int Int)) (v_ArrVal_1373 Int) (v_ArrVal_1378 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (let ((.cse30 (select (store (let ((.cse31 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1368))) (store .cse31 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse31 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_1373))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1378) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse30 4)) (= (select v_ArrVal_1378 .cse4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_ArrVal_1378 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse30 .cse4))))) (forall ((v_ArrVal_1368 (Array Int Int)) (v_ArrVal_1373 Int) (v_ArrVal_1378 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= (select v_ArrVal_1378 .cse4) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (let ((.cse32 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1368))) (store .cse32 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse32 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_1373))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1378) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse4)))) (forall ((v_ArrVal_1368 (Array Int Int)) (v_ArrVal_1373 Int) (v_ArrVal_1378 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (let ((.cse33 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1368))) (store .cse33 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse33 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_1373))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1378) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse4))) .cse26 (forall ((v_ArrVal_1368 (Array Int Int)) (v_ArrVal_1373 Int) (v_ArrVal_1378 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (let ((.cse34 (select (store (let ((.cse35 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1368))) (store .cse35 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse35 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_1373))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1378) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse34 4)) (= (select v_ArrVal_1378 .cse4) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse34 .cse4))))) .cse23 .cse27) .cse2))) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0))))) is different from false [2022-11-03 01:45:59,773 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 01:45:59,773 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 61 [2022-11-03 01:45:59,777 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:45:59,778 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:45:59,788 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 01:45:59,789 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 67 treesize of output 65 [2022-11-03 01:45:59,859 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 01:45:59,859 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 83 treesize of output 73 [2022-11-03 01:45:59,925 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-03 01:45:59,926 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 1 [2022-11-03 01:45:59,937 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-03 01:45:59,937 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 1 [2022-11-03 01:45:59,951 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 01:45:59,952 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 46 treesize of output 37 [2022-11-03 01:45:59,956 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:45:59,969 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-03 01:45:59,970 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 296 treesize of output 285 [2022-11-03 01:45:59,978 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:45:59,982 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 131 treesize of output 115 [2022-11-03 01:45:59,992 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 246 treesize of output 214 [2022-11-03 01:46:00,001 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 222 treesize of output 210 [2022-11-03 01:46:00,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 206 treesize of output 198 [2022-11-03 01:46:00,098 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-03 01:46:00,098 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 1 [2022-11-03 01:46:00,109 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-03 01:46:00,109 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 1 [2022-11-03 01:46:00,124 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-03 01:46:00,124 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 1 [2022-11-03 01:46:00,134 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-03 01:46:00,134 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 1 [2022-11-03 01:46:00,143 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-03 01:46:00,143 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 1 [2022-11-03 01:46:00,153 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-03 01:46:00,153 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 1 [2022-11-03 01:46:00,161 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-03 01:46:00,162 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 1 [2022-11-03 01:46:00,171 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-03 01:46:00,172 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 1 [2022-11-03 01:46:00,180 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-03 01:46:00,181 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 1 [2022-11-03 01:46:00,189 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-03 01:46:00,190 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 1 [2022-11-03 01:46:00,202 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-03 01:46:00,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 1 [2022-11-03 01:46:00,212 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-03 01:46:00,212 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 1 [2022-11-03 01:46:00,221 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-03 01:46:00,221 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 1 [2022-11-03 01:46:00,231 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-03 01:46:00,231 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 1 [2022-11-03 01:46:00,241 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-03 01:46:00,242 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 1 [2022-11-03 01:46:00,417 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 16 not checked. [2022-11-03 01:46:00,417 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [491296869] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 01:46:00,417 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1864073558] [2022-11-03 01:46:00,420 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2022-11-03 01:46:00,420 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 01:46:00,421 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 01:46:00,421 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 01:46:00,421 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 01:46:00,440 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:46:00,442 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:46:00,442 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 01:46:00,478 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 01:46:00,494 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:46:00,496 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 0 case distinctions, treesize of input 30 treesize of output 21 [2022-11-03 01:46:00,506 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 01:46:00,529 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:46:00,530 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 0 case distinctions, treesize of input 28 treesize of output 30 [2022-11-03 01:46:00,545 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:46:00,546 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 01:46:00,559 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:46:00,560 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 01:46:00,591 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:46:00,593 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:46:00,594 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:46:00,596 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:46:00,598 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:46:00,599 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 35 [2022-11-03 01:46:00,634 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:46:00,635 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 19 treesize of output 18 [2022-11-03 01:46:00,653 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:46:00,655 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:46:00,656 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:46:00,657 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 33 [2022-11-03 01:46:00,675 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:46:00,676 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 19 treesize of output 18 [2022-11-03 01:46:00,707 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:46:00,709 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:46:00,710 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 0 case distinctions, treesize of input 34 treesize of output 21 [2022-11-03 01:46:00,728 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:46:00,730 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:46:00,732 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:46:00,733 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 42 [2022-11-03 01:46:00,749 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:46:00,751 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:46:00,752 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 0 case distinctions, treesize of input 34 treesize of output 21 [2022-11-03 01:46:00,933 INFO L356 Elim1Store]: treesize reduction 92, result has 21.4 percent of original size [2022-11-03 01:46:00,933 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 334 treesize of output 337 [2022-11-03 01:46:01,184 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:46:01,185 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:46:01,232 INFO L356 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2022-11-03 01:46:01,233 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 3 case distinctions, treesize of input 345 treesize of output 343 [2022-11-03 01:46:01,253 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:46:01,254 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:46:01,291 INFO L356 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2022-11-03 01:46:01,292 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 3 case distinctions, treesize of input 345 treesize of output 343 [2022-11-03 01:46:01,326 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:46:01,328 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:46:01,330 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:46:01,332 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:46:01,334 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:46:01,362 INFO L356 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2022-11-03 01:46:01,362 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 349 treesize of output 332 [2022-11-03 01:46:01,493 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:46:01,495 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:46:01,497 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:46:01,533 INFO L356 Elim1Store]: treesize reduction 87, result has 11.2 percent of original size [2022-11-03 01:46:01,533 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 4 new quantified variables, introduced 4 case distinctions, treesize of input 433 treesize of output 398 [2022-11-03 01:46:01,562 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:46:01,563 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:46:01,564 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:46:01,565 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:46:01,623 INFO L356 Elim1Store]: treesize reduction 64, result has 29.7 percent of original size [2022-11-03 01:46:01,623 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 413 treesize of output 407 [2022-11-03 01:46:01,644 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:46:01,647 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:46:01,648 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:46:01,649 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:46:01,650 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:46:01,661 INFO L356 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-11-03 01:46:01,662 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 419 treesize of output 368 [2022-11-03 01:46:01,750 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 01:46:01,758 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 01:46:01,774 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 01:46:01,782 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 01:46:01,794 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 15 treesize of output 1 [2022-11-03 01:46:01,811 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 19 treesize of output 1 [2022-11-03 01:46:01,820 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:46:01,821 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 34 treesize of output 14 [2022-11-03 01:46:01,831 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 01:46:01,857 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 01:46:01,864 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 01:46:01,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, 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 01:46:01,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, 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 01:46:01,902 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 15 treesize of output 1 [2022-11-03 01:46:01,932 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 01:46:01,945 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 01:46:01,957 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 01:46:02,024 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:46:02,025 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 27 treesize of output 11 [2022-11-03 01:46:02,040 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:46:02,041 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 27 treesize of output 11 [2022-11-03 01:46:02,052 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 01:46:02,158 INFO L356 Elim1Store]: treesize reduction 39, result has 18.8 percent of original size [2022-11-03 01:46:02,159 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 32 treesize of output 25 [2022-11-03 01:46:02,185 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:46:02,241 INFO L356 Elim1Store]: treesize reduction 48, result has 47.3 percent of original size [2022-11-03 01:46:02,241 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 3 case distinctions, treesize of input 34 treesize of output 49 [2022-11-03 01:46:02,271 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:46:02,320 INFO L356 Elim1Store]: treesize reduction 56, result has 38.5 percent of original size [2022-11-03 01:46:02,320 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 3 case distinctions, treesize of input 34 treesize of output 41 [2022-11-03 01:46:02,329 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2022-11-03 01:46:02,339 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2022-11-03 01:46:02,570 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 01:46:02,582 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 01:46:02,593 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 01:46:02,698 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 01:46:02,708 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 01:46:02,717 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 01:46:02,723 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 01:46:04,832 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '3044#(and (<= 0 |#NULL.base|) (<= 1 |ULTIMATE.start_main_~data_init~0#1|) (= (select |#valid| |ULTIMATE.start_main_~ptr~0#1.base|) 1) (<= (+ |ULTIMATE.start_main_~ptr~0#1.offset| 8) (select |#length| |ULTIMATE.start_main_~ptr~0#1.base|)) (<= |ULTIMATE.start_sll_circular_create_#in~data#1| 1) (<= |ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (<= |ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (<= |ULTIMATE.start_main_~data_init~0#1| 1) (not (= |ULTIMATE.start_main_~data_init~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~ptr~0#1.base|) (+ |ULTIMATE.start_main_~ptr~0#1.offset| 4)))) (<= |#NULL.offset| 0) (<= 5 |ULTIMATE.start_main_~len~0#1|) (<= |ULTIMATE.start_main_~head~1#1.offset| 0) (<= 0 |ULTIMATE.start_sll_circular_create_~last~0#1.offset|) (<= 1 |ULTIMATE.start_sll_circular_create_~data#1|) (<= 0 |ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (<= 1 |ULTIMATE.start_sll_circular_create_#in~data#1|) (<= 0 |ULTIMATE.start_main_~head~1#1.offset|) (<= |ULTIMATE.start_sll_circular_create_~len#1| 1) (<= 1 |ULTIMATE.start_main_~data_new~0#1|) (<= |ULTIMATE.start_sll_circular_create_~data#1| 1) (<= |ULTIMATE.start_main_~len~0#1| 5) (<= |#NULL.base| 0) (<= 5 |ULTIMATE.start_sll_circular_create_#in~len#1|) (<= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (<= 0 (+ |ULTIMATE.start_main_~ptr~0#1.offset| 4)) (<= |ULTIMATE.start_sll_circular_create_#in~len#1| 5) (<= 0 |#NULL.offset|) (<= 0 |ULTIMATE.start_sll_circular_create_#res#1.offset|) (<= 0 |#StackHeapBarrier|))' at error location [2022-11-03 01:46:04,832 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-03 01:46:04,833 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 01:46:04,833 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 11, 12] total 37 [2022-11-03 01:46:04,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568657348] [2022-11-03 01:46:04,833 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 01:46:04,834 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-11-03 01:46:04,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:46:04,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-11-03 01:46:04,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=201, Invalid=1880, Unknown=5, NotChecked=364, Total=2450 [2022-11-03 01:46:04,835 INFO L87 Difference]: Start difference. First operand 60 states and 66 transitions. Second operand has 38 states, 38 states have (on average 2.0789473684210527) internal successors, (79), 37 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:46:05,399 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|)) (.cse5 (+ |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 4))) (let ((.cse0 (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (forall ((v_ArrVal_1368 (Array Int Int)) (v_ArrVal_1373 Int) (v_ArrVal_1378 (Array Int Int))) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (let ((.cse55 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1368))) (store .cse55 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse55 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_1373))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1378) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse5)))))))) (.cse11 (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (or (forall ((v_ArrVal_1368 (Array Int Int)) (v_ArrVal_1373 Int) (v_ArrVal_1378 (Array Int Int))) (let ((.cse53 (select (store (let ((.cse54 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1368))) (store .cse54 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse54 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_1373))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1378) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse53 4)) (= (select v_ArrVal_1378 .cse5) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse53 .cse5))))) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|))) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|)))) (.cse1 (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (forall ((v_ArrVal_1368 (Array Int Int)) (v_ArrVal_1373 Int) (v_ArrVal_1378 (Array Int Int))) (let ((.cse51 (select (store (let ((.cse52 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1368))) (store .cse52 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse52 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_1373))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1378) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse51 4)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse51 .cse5)))))))))) (.cse17 (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (forall ((v_ArrVal_1368 (Array Int Int)) (v_ArrVal_1373 Int) (v_ArrVal_1378 (Array Int Int))) (or (= (select v_ArrVal_1378 .cse5) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (let ((.cse50 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1368))) (store .cse50 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse50 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_1373))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1378) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse5)))))) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|)))) (.cse2 (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0)) (.cse26 (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0)) (.cse21 (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|)) (.cse3 (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|))) (.cse20 (= (select .cse4 (+ |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 4)) |c_ULTIMATE.start_main_~data_init~0#1|)) (.cse24 (= |c_ULTIMATE.start_main_~data_init~0#1| 1))) (and .cse0 (or (and .cse0 .cse1) .cse2) .cse3 (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse4 .cse5)) (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (or (forall ((v_ArrVal_1368 (Array Int Int)) (v_ArrVal_1373 Int) (v_ArrVal_1378 (Array Int Int))) (let ((.cse6 (select (store (let ((.cse7 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1368))) (store .cse7 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse7 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_1373))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1378) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse6 4)) (= (select v_ArrVal_1378 .cse5) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_ArrVal_1378 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse6 .cse5))))) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|))))) (let ((.cse8 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (or (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| .cse8) (= (select (select |c_#memory_int| .cse8) 4) |c_ULTIMATE.start_main_~data_init~0#1|))) (or .cse2 (forall ((v_ArrVal_1368 (Array Int Int)) (v_ArrVal_1373 Int) (v_ArrVal_1378 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (= (select v_ArrVal_1378 .cse5) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (let ((.cse9 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1368))) (store .cse9 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse9 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_1373))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1378) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse5))))) (or (and .cse0 (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (forall ((v_ArrVal_1368 (Array Int Int)) (v_ArrVal_1373 Int) (v_ArrVal_1378 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (let ((.cse10 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1368))) (store .cse10 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse10 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_1373))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1378) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse5))) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) .cse11 (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (forall ((v_ArrVal_1368 (Array Int Int)) (v_ArrVal_1373 Int) (v_ArrVal_1378 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (let ((.cse12 (select (store (let ((.cse13 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1368))) (store .cse13 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse13 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_1373))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1378) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse12 4)) (= (select v_ArrVal_1378 .cse5) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_ArrVal_1378 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse12 .cse5))))) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) .cse1 (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (forall ((v_ArrVal_1368 (Array Int Int)) (v_ArrVal_1373 Int) (v_ArrVal_1378 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (or (= (select v_ArrVal_1378 .cse5) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (let ((.cse14 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1368))) (store .cse14 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse14 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_1373))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1378) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse5)))) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (forall ((v_ArrVal_1368 (Array Int Int)) (v_ArrVal_1373 Int) (v_ArrVal_1378 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (let ((.cse15 (select (store (let ((.cse16 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1368))) (store .cse16 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse16 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_1373))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1378) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse15 4)) (= (select v_ArrVal_1378 .cse5) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse15 .cse5))))) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) .cse17 (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (forall ((v_ArrVal_1368 (Array Int Int)) (v_ArrVal_1373 Int) (v_ArrVal_1378 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (let ((.cse18 (select (store (let ((.cse19 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1368))) (store .cse19 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse19 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_1373))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1378) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse18 4)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse18 .cse5)))))))) .cse2) .cse20 (not .cse21) .cse11 (or (forall ((v_ArrVal_1368 (Array Int Int)) (v_ArrVal_1373 Int) (v_ArrVal_1378 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (let ((.cse22 (select (store (let ((.cse23 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1368))) (store .cse23 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse23 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_1373))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1378) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse22 4)) (= (select v_ArrVal_1378 .cse5) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse22 .cse5))))) .cse2) (= |c_ULTIMATE.start_sll_circular_create_~data#1| |c_ULTIMATE.start_main_~data_init~0#1|) .cse1 (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) 0) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) 0) .cse24 .cse2 (let ((.cse25 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (or (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse25) (= (select (select |c_#memory_int| .cse25) 4) |c_ULTIMATE.start_main_~data_init~0#1|))) .cse26 .cse17 (or (let ((.cse27 (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (forall ((v_ArrVal_1368 (Array Int Int)) (v_ArrVal_1373 Int) (v_ArrVal_1378 (Array Int Int))) (let ((.cse48 (select (store (let ((.cse49 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1368))) (store .cse49 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse49 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_1373))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1378) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse48 4)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse48 .cse5)))))))) (.cse34 (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (forall ((v_ArrVal_1368 (Array Int Int)) (v_ArrVal_1373 Int) (v_ArrVal_1378 (Array Int Int))) (or (= (select v_ArrVal_1378 .cse5) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (let ((.cse47 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1368))) (store .cse47 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse47 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_1373))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1378) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse5))))))) (.cse31 (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (forall ((v_ArrVal_1368 (Array Int Int)) (v_ArrVal_1373 Int) (v_ArrVal_1378 (Array Int Int))) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (let ((.cse46 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1368))) (store .cse46 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse46 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_1373))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1378) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse5)))))) (.cse35 (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (forall ((v_ArrVal_1368 (Array Int Int)) (v_ArrVal_1373 Int) (v_ArrVal_1378 (Array Int Int))) (let ((.cse44 (select (store (let ((.cse45 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1368))) (store .cse45 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse45 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_1373))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1378) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse44 4)) (= (select v_ArrVal_1378 .cse5) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse44 .cse5))))) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|))))) (and .cse27 (or (forall ((v_ArrVal_1368 (Array Int Int)) (v_ArrVal_1373 Int) (v_ArrVal_1378 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (= (select v_ArrVal_1378 .cse5) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (let ((.cse28 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1368))) (store .cse28 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse28 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_1373))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1378) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse5)))) .cse2) (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (forall ((v_ArrVal_1368 (Array Int Int)) (v_ArrVal_1373 Int) (v_ArrVal_1378 (Array Int Int))) (let ((.cse29 (select (store (let ((.cse30 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1368))) (store .cse30 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse30 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_1373))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1378) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse29 4)) (= (select v_ArrVal_1378 .cse5) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_ArrVal_1378 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse29 .cse5))))) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|))) (or .cse2 (and .cse27 .cse31)) (or .cse2 (forall ((v_ArrVal_1368 (Array Int Int)) (v_ArrVal_1373 Int) (v_ArrVal_1378 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (let ((.cse32 (select (store (let ((.cse33 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1368))) (store .cse33 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse33 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_1373))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1378) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse32 4)) (= (select v_ArrVal_1378 .cse5) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse32 .cse5)))))) .cse34 .cse31 .cse35 (or (and .cse27 (forall ((v_ArrVal_1368 (Array Int Int)) (v_ArrVal_1373 Int) (v_ArrVal_1378 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (let ((.cse36 (select (store (let ((.cse37 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1368))) (store .cse37 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse37 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_1373))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1378) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse36 4)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse36 .cse5))))) (forall ((v_ArrVal_1368 (Array Int Int)) (v_ArrVal_1373 Int) (v_ArrVal_1378 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (let ((.cse38 (select (store (let ((.cse39 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1368))) (store .cse39 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse39 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_1373))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1378) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse38 4)) (= (select v_ArrVal_1378 .cse5) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_ArrVal_1378 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse38 .cse5))))) (forall ((v_ArrVal_1368 (Array Int Int)) (v_ArrVal_1373 Int) (v_ArrVal_1378 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= (select v_ArrVal_1378 .cse5) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (let ((.cse40 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1368))) (store .cse40 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse40 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_1373))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1378) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse5)))) (forall ((v_ArrVal_1368 (Array Int Int)) (v_ArrVal_1373 Int) (v_ArrVal_1378 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (let ((.cse41 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1368))) (store .cse41 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse41 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_1373))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1378) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse5))) .cse34 (forall ((v_ArrVal_1368 (Array Int Int)) (v_ArrVal_1373 Int) (v_ArrVal_1378 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (let ((.cse42 (select (store (let ((.cse43 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1368))) (store .cse43 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse43 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_1373))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1378) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse42 4)) (= (select v_ArrVal_1378 .cse5) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse42 .cse5))))) .cse31 .cse35) .cse2))) .cse26) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| 0) (or .cse21 (and (or (and .cse3 .cse20) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|)) .cse24)) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)))) is different from false [2022-11-03 01:46:05,446 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse8 (+ 4 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) (.cse3 (+ |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 4))) (let ((.cse0 (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (forall ((v_ArrVal_1368 (Array Int Int)) (v_ArrVal_1373 Int) (v_ArrVal_1378 (Array Int Int))) (let ((.cse51 (select (store (let ((.cse52 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1368))) (store .cse52 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse52 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_1373))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1378) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select v_ArrVal_1378 .cse3) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse51 .cse8) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse51 .cse3)))))))))) (.cse1 (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (forall ((v_ArrVal_1368 (Array Int Int)) (v_ArrVal_1373 Int) (v_ArrVal_1378 (Array Int Int))) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (let ((.cse50 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1368))) (store .cse50 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse50 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_1373))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1378) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse3)))))))) (.cse32 (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (forall ((v_ArrVal_1368 (Array Int Int)) (v_ArrVal_1373 Int) (v_ArrVal_1378 (Array Int Int))) (let ((.cse48 (select (store (let ((.cse49 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1368))) (store .cse49 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse49 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_1373))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1378) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select .cse48 .cse8) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse48 .cse3))))))) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|)))) (.cse34 (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (forall ((v_ArrVal_1368 (Array Int Int)) (v_ArrVal_1373 Int) (v_ArrVal_1378 (Array Int Int))) (or (= (select v_ArrVal_1378 .cse3) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (let ((.cse47 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1368))) (store .cse47 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse47 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_1373))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1378) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse3)))))) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|)))) (.cse29 (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) (.cse30 (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|)) (.cse2 (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|)) (.cse46 (= |c_ULTIMATE.start_main_~data_init~0#1| 1)) (.cse5 (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (and .cse0 .cse1 (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse2 .cse3)) (or (let ((.cse6 (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (forall ((v_ArrVal_1368 (Array Int Int)) (v_ArrVal_1373 Int) (v_ArrVal_1378 (Array Int Int))) (let ((.cse27 (select (store (let ((.cse28 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1368))) (store .cse28 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse28 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_1373))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1378) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select .cse27 .cse8) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse27 .cse3)))))))) (.cse11 (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (forall ((v_ArrVal_1368 (Array Int Int)) (v_ArrVal_1373 Int) (v_ArrVal_1378 (Array Int Int))) (let ((.cse25 (select (store (let ((.cse26 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1368))) (store .cse26 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse26 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_1373))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1378) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select v_ArrVal_1378 .cse3) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse25 .cse8) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse25 .cse3)))))))) (.cse12 (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (forall ((v_ArrVal_1368 (Array Int Int)) (v_ArrVal_1373 Int) (v_ArrVal_1378 (Array Int Int))) (or (= (select v_ArrVal_1378 .cse3) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (let ((.cse24 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1368))) (store .cse24 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse24 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_1373))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1378) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse3))))))) (.cse10 (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (forall ((v_ArrVal_1368 (Array Int Int)) (v_ArrVal_1373 Int) (v_ArrVal_1378 (Array Int Int))) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (let ((.cse23 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1368))) (store .cse23 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse23 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_1373))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1378) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse3))))))) (and (or (forall ((v_ArrVal_1368 (Array Int Int)) (v_ArrVal_1373 Int) (v_ArrVal_1378 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (= (select v_ArrVal_1378 .cse3) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (let ((.cse4 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1368))) (store .cse4 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse4 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_1373))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1378) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse3)))) .cse5) .cse6 (or (forall ((v_ArrVal_1368 (Array Int Int)) (v_ArrVal_1373 Int) (v_ArrVal_1378 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (let ((.cse7 (select (store (let ((.cse9 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1368))) (store .cse9 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse9 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_1373))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1378) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (= (select v_ArrVal_1378 .cse3) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse7 .cse8) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse7 .cse3))))) .cse5) (or (and .cse6 .cse10) .cse5) .cse11 .cse12 .cse10 (or (and (forall ((v_ArrVal_1368 (Array Int Int)) (v_ArrVal_1373 Int) (v_ArrVal_1378 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (let ((.cse13 (select (store (let ((.cse14 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1368))) (store .cse14 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse14 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_1373))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1378) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select .cse13 .cse8) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse13 .cse3))))) .cse6 (forall ((v_ArrVal_1368 (Array Int Int)) (v_ArrVal_1373 Int) (v_ArrVal_1378 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= (select v_ArrVal_1378 .cse3) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (let ((.cse15 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1368))) (store .cse15 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse15 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_1373))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1378) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse3)))) .cse11 (forall ((v_ArrVal_1368 (Array Int Int)) (v_ArrVal_1373 Int) (v_ArrVal_1378 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (let ((.cse16 (select (store (let ((.cse17 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1368))) (store .cse17 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse17 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_1373))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1378) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select v_ArrVal_1378 .cse3) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse16 .cse8) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse16 .cse3))))) (forall ((v_ArrVal_1368 (Array Int Int)) (v_ArrVal_1373 Int) (v_ArrVal_1378 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (let ((.cse18 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1368))) (store .cse18 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse18 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_1373))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1378) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse3))) .cse12 .cse10 (forall ((v_ArrVal_1368 (Array Int Int)) (v_ArrVal_1373 Int) (v_ArrVal_1378 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (let ((.cse19 (select (store (let ((.cse20 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1368))) (store .cse20 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse20 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_1373))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1378) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_ArrVal_1378 .cse8)) (= (select v_ArrVal_1378 .cse3) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse19 .cse8) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse19 .cse3)))))) .cse5) (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (forall ((v_ArrVal_1368 (Array Int Int)) (v_ArrVal_1373 Int) (v_ArrVal_1378 (Array Int Int))) (let ((.cse21 (select (store (let ((.cse22 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1368))) (store .cse22 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse22 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_1373))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1378) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_ArrVal_1378 .cse8)) (= (select v_ArrVal_1378 .cse3) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse21 .cse8) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse21 .cse3))))) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|))))) .cse29) (not .cse30) (or (and .cse0 .cse1 (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (forall ((v_ArrVal_1368 (Array Int Int)) (v_ArrVal_1373 Int) (v_ArrVal_1378 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (let ((.cse31 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1368))) (store .cse31 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse31 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_1373))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1378) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse3))) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) .cse32 (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (forall ((v_ArrVal_1368 (Array Int Int)) (v_ArrVal_1373 Int) (v_ArrVal_1378 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (or (= (select v_ArrVal_1378 .cse3) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (let ((.cse33 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1368))) (store .cse33 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse33 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_1373))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1378) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse3)))) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) .cse34 (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (forall ((v_ArrVal_1368 (Array Int Int)) (v_ArrVal_1373 Int) (v_ArrVal_1378 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (let ((.cse35 (select (store (let ((.cse36 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1368))) (store .cse36 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse36 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_1373))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1378) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select v_ArrVal_1378 .cse3) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse35 .cse8) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse35 .cse3))))) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (forall ((v_ArrVal_1368 (Array Int Int)) (v_ArrVal_1373 Int) (v_ArrVal_1378 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (let ((.cse37 (select (store (let ((.cse38 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1368))) (store .cse38 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse38 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_1373))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1378) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_ArrVal_1378 .cse8)) (= (select v_ArrVal_1378 .cse3) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse37 .cse8) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse37 .cse3))))) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (forall ((v_ArrVal_1368 (Array Int Int)) (v_ArrVal_1373 Int) (v_ArrVal_1378 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (let ((.cse39 (select (store (let ((.cse40 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1368))) (store .cse40 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse40 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_1373))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1378) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select .cse39 .cse8) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse39 .cse3))))) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|)))) .cse5) (or (forall ((v_ArrVal_1368 (Array Int Int)) (v_ArrVal_1373 Int) (v_ArrVal_1378 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (let ((.cse41 (select (store (let ((.cse42 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1368))) (store .cse42 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse42 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_1373))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1378) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (= (select v_ArrVal_1378 .cse3) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse41 .cse8) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse41 .cse3))))) .cse5) .cse32 (= |c_ULTIMATE.start_sll_circular_create_~data#1| |c_ULTIMATE.start_main_~data_init~0#1|) (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (or (forall ((v_ArrVal_1368 (Array Int Int)) (v_ArrVal_1373 Int) (v_ArrVal_1378 (Array Int Int))) (let ((.cse43 (select (store (let ((.cse44 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1368))) (store .cse44 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse44 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_1373))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1378) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_ArrVal_1378 .cse8)) (= (select v_ArrVal_1378 .cse3) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse43 .cse8) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse43 .cse3))))) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|))))) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1) (or (forall ((v_ArrVal_1368 (Array Int Int)) (v_ArrVal_1373 Int) (v_ArrVal_1378 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (= (select v_ArrVal_1378 .cse3) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (let ((.cse45 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1368))) (store .cse45 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse45 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_1373))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1378) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse3)))) .cse5) .cse46 (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (or (and .cse1 .cse32) .cse5) .cse34 .cse29 (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| 0) (or .cse30 (and (or (and (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|)) (= (select .cse2 (+ |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 4)) |c_ULTIMATE.start_main_~data_init~0#1|)) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|)) .cse46)) .cse5))) is different from false [2022-11-03 01:46:06,026 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse9 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (let ((.cse6 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|)) (.cse10 (select .cse9 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (let ((.cse1 (select |c_#memory_int| .cse10)) (.cse0 (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| .cse10)) (.cse2 (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|)) (.cse12 (select .cse6 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) (.cse11 (= |c_ULTIMATE.start_main_~data_init~0#1| 1)) (.cse7 (+ 4 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (and (or .cse0 (= (select .cse1 4) |c_ULTIMATE.start_main_~data_init~0#1|)) (not .cse2) (forall ((v_ArrVal_1371 Int) (v_ArrVal_1368 (Array Int Int)) (v_ArrVal_1373 Int) (v_ArrVal_1378 (Array Int Int)) (v_ArrVal_1369 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (let ((.cse4 (select (select (let ((.cse8 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store .cse9 .cse7 v_ArrVal_1369)))) (store .cse8 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse8 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (or (= (select (select (store (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1368))) (store .cse3 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse3 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_1373))) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1378) .cse4) (+ (select (select (let ((.cse5 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store .cse6 .cse7 v_ArrVal_1371)))) (store .cse5 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse5 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) 4)) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| .cse4)))) (or (and (or (and (= (select .cse1 (+ |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 4)) |c_ULTIMATE.start_main_~data_init~0#1|) (not (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| .cse10))) .cse0) .cse11) .cse2) (= |c_ULTIMATE.start_sll_circular_create_~data#1| |c_ULTIMATE.start_main_~data_init~0#1|) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1) (= .cse12 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) (= .cse12 0) .cse11 (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| 0) (forall ((v_ArrVal_1371 Int) (v_ArrVal_1368 (Array Int Int)) (v_ArrVal_1373 Int) (v_ArrVal_1378 (Array Int Int)) (v_ArrVal_1369 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (let ((.cse15 (select (select (let ((.cse16 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store .cse6 .cse7 v_ArrVal_1371)))) (store .cse16 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse16 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (or (= (select (select (store (let ((.cse13 (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1368))) (store .cse13 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse13 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_1373))) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1378) (select (select (let ((.cse14 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store .cse9 .cse7 v_ArrVal_1369)))) (store .cse14 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse14 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) (+ .cse15 4)) |c_ULTIMATE.start_main_~data_init~0#1|) (= .cse15 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)))) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))))) is different from false [2022-11-03 01:46:06,083 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse27 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (.cse5 (+ |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 4))) (let ((.cse0 (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (forall ((v_ArrVal_1368 (Array Int Int)) (v_ArrVal_1373 Int) (v_ArrVal_1378 (Array Int Int))) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (let ((.cse57 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1368))) (store .cse57 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse57 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_1373))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1378) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse5)))))))) (.cse10 (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (or (forall ((v_ArrVal_1368 (Array Int Int)) (v_ArrVal_1373 Int) (v_ArrVal_1378 (Array Int Int))) (let ((.cse55 (select (store (let ((.cse56 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1368))) (store .cse56 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse56 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_1373))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1378) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse55 4)) (= (select v_ArrVal_1378 .cse5) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse55 .cse5))))) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|))) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|)))) (.cse1 (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (forall ((v_ArrVal_1368 (Array Int Int)) (v_ArrVal_1373 Int) (v_ArrVal_1378 (Array Int Int))) (let ((.cse53 (select (store (let ((.cse54 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1368))) (store .cse54 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse54 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_1373))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1378) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse53 4)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse53 .cse5)))))))))) (.cse7 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (.cse23 (= |c_ULTIMATE.start_main_~data_init~0#1| 1)) (.cse24 (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse27)) (.cse25 (select |c_#memory_int| .cse27)) (.cse19 (+ |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 4)) (.cse3 (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|)) (.cse16 (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (forall ((v_ArrVal_1368 (Array Int Int)) (v_ArrVal_1373 Int) (v_ArrVal_1378 (Array Int Int))) (or (= (select v_ArrVal_1378 .cse5) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (let ((.cse52 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1368))) (store .cse52 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse52 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_1373))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1378) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse5)))))) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|)))) (.cse2 (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0)) (.cse28 (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0))) (and .cse0 (or (and .cse0 .cse1) .cse2) (not .cse3) (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (or (forall ((v_ArrVal_1368 (Array Int Int)) (v_ArrVal_1373 Int) (v_ArrVal_1378 (Array Int Int))) (let ((.cse4 (select (store (let ((.cse6 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1368))) (store .cse6 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse6 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_1373))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1378) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse4 4)) (= (select v_ArrVal_1378 .cse5) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_ArrVal_1378 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse4 .cse5))))) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|))))) (or (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| .cse7) .cse3) (or .cse2 (forall ((v_ArrVal_1368 (Array Int Int)) (v_ArrVal_1373 Int) (v_ArrVal_1378 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (= (select v_ArrVal_1378 .cse5) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (let ((.cse8 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1368))) (store .cse8 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse8 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_1373))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1378) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse5))))) (or (and .cse0 (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (forall ((v_ArrVal_1368 (Array Int Int)) (v_ArrVal_1373 Int) (v_ArrVal_1378 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (let ((.cse9 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1368))) (store .cse9 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse9 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_1373))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1378) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse5))) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) .cse10 (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (forall ((v_ArrVal_1368 (Array Int Int)) (v_ArrVal_1373 Int) (v_ArrVal_1378 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (let ((.cse11 (select (store (let ((.cse12 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1368))) (store .cse12 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse12 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_1373))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1378) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse11 4)) (= (select v_ArrVal_1378 .cse5) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_ArrVal_1378 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse11 .cse5))))) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) .cse1 (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (forall ((v_ArrVal_1368 (Array Int Int)) (v_ArrVal_1373 Int) (v_ArrVal_1378 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (or (= (select v_ArrVal_1378 .cse5) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (let ((.cse13 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1368))) (store .cse13 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse13 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_1373))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1378) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse5)))) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (forall ((v_ArrVal_1368 (Array Int Int)) (v_ArrVal_1373 Int) (v_ArrVal_1378 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (let ((.cse14 (select (store (let ((.cse15 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1368))) (store .cse15 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse15 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_1373))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1378) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse14 4)) (= (select v_ArrVal_1378 .cse5) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse14 .cse5))))) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) .cse16 (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (forall ((v_ArrVal_1368 (Array Int Int)) (v_ArrVal_1373 Int) (v_ArrVal_1378 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (let ((.cse17 (select (store (let ((.cse18 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1368))) (store .cse18 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse18 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_1373))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1378) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse17 4)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse17 .cse5)))))))) .cse2) (= (select (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse19) |c_ULTIMATE.start_main_~data_init~0#1|) .cse10 (forall ((v_ArrVal_1373 Int) (v_ArrVal_1378 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (let ((.cse20 (select (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (or (= .cse20 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (= (select (select (store (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_1373)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| v_ArrVal_1378) (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (+ .cse20 4)) |c_ULTIMATE.start_main_~data_init~0#1|)))) (or (forall ((v_ArrVal_1368 (Array Int Int)) (v_ArrVal_1373 Int) (v_ArrVal_1378 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (let ((.cse21 (select (store (let ((.cse22 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1368))) (store .cse22 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse22 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_1373))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1378) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse21 4)) (= (select v_ArrVal_1378 .cse5) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse21 .cse5))))) .cse2) (= |c_ULTIMATE.start_sll_circular_create_~data#1| |c_ULTIMATE.start_main_~data_init~0#1|) .cse1 (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1) (= .cse7 0) .cse23 .cse2 (or .cse24 (= (select .cse25 4) |c_ULTIMATE.start_main_~data_init~0#1|)) (forall ((v_ArrVal_1373 Int) (v_ArrVal_1378 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (let ((.cse26 (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (or (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse26) (= (select (select (store (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_1373)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| v_ArrVal_1378) .cse26) (+ (select (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) 4)) |c_ULTIMATE.start_main_~data_init~0#1|)))) (or (and .cse23 (or .cse24 (and (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse25 .cse19)) (not (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| .cse27))))) .cse3) .cse28 .cse16 (or (let ((.cse29 (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (forall ((v_ArrVal_1368 (Array Int Int)) (v_ArrVal_1373 Int) (v_ArrVal_1378 (Array Int Int))) (let ((.cse50 (select (store (let ((.cse51 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1368))) (store .cse51 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse51 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_1373))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1378) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse50 4)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse50 .cse5)))))))) (.cse36 (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (forall ((v_ArrVal_1368 (Array Int Int)) (v_ArrVal_1373 Int) (v_ArrVal_1378 (Array Int Int))) (or (= (select v_ArrVal_1378 .cse5) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (let ((.cse49 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1368))) (store .cse49 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse49 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_1373))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1378) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse5))))))) (.cse33 (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (forall ((v_ArrVal_1368 (Array Int Int)) (v_ArrVal_1373 Int) (v_ArrVal_1378 (Array Int Int))) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (let ((.cse48 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1368))) (store .cse48 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse48 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_1373))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1378) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse5)))))) (.cse37 (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (forall ((v_ArrVal_1368 (Array Int Int)) (v_ArrVal_1373 Int) (v_ArrVal_1378 (Array Int Int))) (let ((.cse46 (select (store (let ((.cse47 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1368))) (store .cse47 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse47 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_1373))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1378) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse46 4)) (= (select v_ArrVal_1378 .cse5) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse46 .cse5))))) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|))))) (and .cse29 (or (forall ((v_ArrVal_1368 (Array Int Int)) (v_ArrVal_1373 Int) (v_ArrVal_1378 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (= (select v_ArrVal_1378 .cse5) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (let ((.cse30 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1368))) (store .cse30 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse30 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_1373))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1378) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse5)))) .cse2) (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (forall ((v_ArrVal_1368 (Array Int Int)) (v_ArrVal_1373 Int) (v_ArrVal_1378 (Array Int Int))) (let ((.cse31 (select (store (let ((.cse32 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1368))) (store .cse32 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse32 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_1373))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1378) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse31 4)) (= (select v_ArrVal_1378 .cse5) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_ArrVal_1378 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse31 .cse5))))) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|))) (or .cse2 (and .cse29 .cse33)) (or .cse2 (forall ((v_ArrVal_1368 (Array Int Int)) (v_ArrVal_1373 Int) (v_ArrVal_1378 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (let ((.cse34 (select (store (let ((.cse35 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1368))) (store .cse35 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse35 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_1373))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1378) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse34 4)) (= (select v_ArrVal_1378 .cse5) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse34 .cse5)))))) .cse36 .cse33 .cse37 (or (and .cse29 (forall ((v_ArrVal_1368 (Array Int Int)) (v_ArrVal_1373 Int) (v_ArrVal_1378 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (let ((.cse38 (select (store (let ((.cse39 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1368))) (store .cse39 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse39 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_1373))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1378) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse38 4)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse38 .cse5))))) (forall ((v_ArrVal_1368 (Array Int Int)) (v_ArrVal_1373 Int) (v_ArrVal_1378 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (let ((.cse40 (select (store (let ((.cse41 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1368))) (store .cse41 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse41 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_1373))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1378) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse40 4)) (= (select v_ArrVal_1378 .cse5) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_ArrVal_1378 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse40 .cse5))))) (forall ((v_ArrVal_1368 (Array Int Int)) (v_ArrVal_1373 Int) (v_ArrVal_1378 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= (select v_ArrVal_1378 .cse5) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (let ((.cse42 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1368))) (store .cse42 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse42 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_1373))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1378) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse5)))) (forall ((v_ArrVal_1368 (Array Int Int)) (v_ArrVal_1373 Int) (v_ArrVal_1378 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (let ((.cse43 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1368))) (store .cse43 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse43 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_1373))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1378) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse5))) .cse36 (forall ((v_ArrVal_1368 (Array Int Int)) (v_ArrVal_1373 Int) (v_ArrVal_1378 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (let ((.cse44 (select (store (let ((.cse45 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1368))) (store .cse45 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse45 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_1373))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1378) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse44 4)) (= (select v_ArrVal_1378 .cse5) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse44 .cse5))))) .cse33 .cse37) .cse2))) .cse28)))) is different from false [2022-11-03 01:46:06,156 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse7 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (.cse3 (= |c_ULTIMATE.start_main_~data_init~0#1| 1)) (.cse4 (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse7)) (.cse5 (select |c_#memory_int| .cse7)) (.cse1 (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|))) (and (or (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| .cse0) .cse1) (forall ((v_ArrVal_1373 Int) (v_ArrVal_1378 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (or (= .cse2 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (= (select (select (store (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_1373)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| v_ArrVal_1378) (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (+ .cse2 4)) |c_ULTIMATE.start_main_~data_init~0#1|)))) (= .cse0 0) .cse3 (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (or .cse4 (= (select .cse5 4) |c_ULTIMATE.start_main_~data_init~0#1|)) (forall ((v_ArrVal_1373 Int) (v_ArrVal_1378 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (let ((.cse6 (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (or (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse6) (= (select (select (store (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_1373)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| v_ArrVal_1378) .cse6) (+ (select (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) 4)) |c_ULTIMATE.start_main_~data_init~0#1|)))) (or (and .cse3 (or .cse4 (and (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse5 (+ |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 4))) (not (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| .cse7))))) .cse1) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0)))) is different from false [2022-11-03 01:46:06,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:46:06,767 INFO L93 Difference]: Finished difference Result 78 states and 82 transitions. [2022-11-03 01:46:06,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-03 01:46:06,768 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 2.0789473684210527) internal successors, (79), 37 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-11-03 01:46:06,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:46:06,768 INFO L225 Difference]: With dead ends: 78 [2022-11-03 01:46:06,769 INFO L226 Difference]: Without dead ends: 78 [2022-11-03 01:46:06,770 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 61 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 710 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=302, Invalid=2586, Unknown=10, NotChecked=1008, Total=3906 [2022-11-03 01:46:06,770 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 32 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 403 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 620 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 403 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 196 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-03 01:46:06,771 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 239 Invalid, 620 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 403 Invalid, 0 Unknown, 196 Unchecked, 0.4s Time] [2022-11-03 01:46:06,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-11-03 01:46:06,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 61. [2022-11-03 01:46:06,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 51 states have (on average 1.3137254901960784) internal successors, (67), 60 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:46:06,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 67 transitions. [2022-11-03 01:46:06,773 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 67 transitions. Word has length 30 [2022-11-03 01:46:06,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:46:06,774 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 67 transitions. [2022-11-03 01:46:06,774 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 2.0789473684210527) internal successors, (79), 37 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:46:06,775 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 67 transitions. [2022-11-03 01:46:06,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-03 01:46:06,782 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:46:06,783 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:46:06,830 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08cad0f5-7fd6-4b8b-ac30-51cdbff926c9/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-11-03 01:46:07,002 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08cad0f5-7fd6-4b8b-ac30-51cdbff926c9/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-11-03 01:46:07,002 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-11-03 01:46:07,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:46:07,003 INFO L85 PathProgramCache]: Analyzing trace with hash 1549114860, now seen corresponding path program 1 times [2022-11-03 01:46:07,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:46:07,003 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5789834] [2022-11-03 01:46:07,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:46:07,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:46:07,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:46:07,665 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 3 proven. 19 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-03 01:46:07,665 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:46:07,665 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5789834] [2022-11-03 01:46:07,666 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5789834] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:46:07,666 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1004850629] [2022-11-03 01:46:07,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:46:07,666 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:46:07,666 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08cad0f5-7fd6-4b8b-ac30-51cdbff926c9/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:46:07,671 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08cad0f5-7fd6-4b8b-ac30-51cdbff926c9/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:46:07,677 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08cad0f5-7fd6-4b8b-ac30-51cdbff926c9/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-03 01:46:07,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:46:07,906 INFO L263 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 49 conjunts are in the unsatisfiable core [2022-11-03 01:46:07,914 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:46:07,917 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 01:46:07,948 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-03 01:46:07,949 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 01:46:07,971 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-03 01:46:07,972 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 01:46:07,995 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-03 01:46:07,996 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 01:46:08,032 INFO L356 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-03 01:46:08,033 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 18 [2022-11-03 01:46:08,050 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 11 treesize of output 7 [2022-11-03 01:46:08,072 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:46:08,073 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 22 treesize of output 21 [2022-11-03 01:46:08,101 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 01:46:08,159 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:46:08,160 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 22 treesize of output 21 [2022-11-03 01:46:08,174 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 01:46:08,174 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 16 treesize of output 11 [2022-11-03 01:46:08,194 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 9 proven. 13 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-03 01:46:08,194 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:46:08,211 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1555 (Array Int Int))) (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1555) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)))) is different from false [2022-11-03 01:46:08,220 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1555 (Array Int Int)) (v_ArrVal_1553 Int)) (not (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) (+ 4 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) v_ArrVal_1553)) |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1555) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)))) is different from false [2022-11-03 01:46:08,234 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 01:46:08,234 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 2 case distinctions, treesize of input 24 treesize of output 30 [2022-11-03 01:46:08,238 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 33 treesize of output 25 [2022-11-03 01:46:08,250 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 6 treesize of output 4 [2022-11-03 01:46:08,474 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 7 not checked. [2022-11-03 01:46:08,474 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1004850629] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 01:46:08,475 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1582756806] [2022-11-03 01:46:08,477 INFO L159 IcfgInterpreter]: Started Sifa with 19 locations of interest [2022-11-03 01:46:08,477 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 01:46:08,477 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 01:46:08,477 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 01:46:08,477 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 01:46:08,500 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:46:08,502 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:46:08,503 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 01:46:08,526 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 01:46:08,535 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:46:08,536 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 0 case distinctions, treesize of input 30 treesize of output 21 [2022-11-03 01:46:08,545 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 01:46:08,563 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:46:08,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, 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 01:46:08,573 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:46:08,574 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 01:46:08,584 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:46:08,584 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 0 case distinctions, treesize of input 28 treesize of output 30 [2022-11-03 01:46:08,607 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:46:08,609 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:46:08,610 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:46:08,611 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:46:08,613 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:46:08,613 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 35 [2022-11-03 01:46:08,640 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:46:08,641 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:46:08,643 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:46:08,644 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 33 [2022-11-03 01:46:08,655 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:46:08,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, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2022-11-03 01:46:08,671 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:46:08,671 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 19 treesize of output 18 [2022-11-03 01:46:08,696 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:46:08,697 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:46:08,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, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2022-11-03 01:46:08,713 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:46:08,715 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:46:08,716 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 0 case distinctions, treesize of input 34 treesize of output 21 [2022-11-03 01:46:08,731 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:46:08,733 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:46:08,734 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:46:08,736 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 42 [2022-11-03 01:46:08,871 INFO L356 Elim1Store]: treesize reduction 92, result has 21.4 percent of original size [2022-11-03 01:46:08,872 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 327 treesize of output 332 [2022-11-03 01:46:09,045 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:46:09,046 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:46:09,048 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:46:09,049 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:46:09,050 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:46:09,069 INFO L356 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2022-11-03 01:46:09,070 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 345 treesize of output 328 [2022-11-03 01:46:09,084 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:46:09,084 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:46:09,122 INFO L356 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2022-11-03 01:46:09,123 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 3 case distinctions, treesize of input 341 treesize of output 339 [2022-11-03 01:46:09,141 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:46:09,146 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:46:09,188 INFO L356 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2022-11-03 01:46:09,189 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 3 case distinctions, treesize of input 341 treesize of output 339 [2022-11-03 01:46:09,298 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:46:09,300 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:46:09,301 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:46:09,340 INFO L356 Elim1Store]: treesize reduction 87, result has 11.2 percent of original size [2022-11-03 01:46:09,341 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 4 new quantified variables, introduced 4 case distinctions, treesize of input 433 treesize of output 394 [2022-11-03 01:46:09,366 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:46:09,368 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:46:09,369 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:46:09,370 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:46:09,371 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:46:09,381 INFO L356 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-11-03 01:46:09,382 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 419 treesize of output 368 [2022-11-03 01:46:09,399 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:46:09,399 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:46:09,401 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:46:09,401 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:46:09,441 INFO L356 Elim1Store]: treesize reduction 64, result has 29.7 percent of original size [2022-11-03 01:46:09,442 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 413 treesize of output 407 [2022-11-03 01:46:09,523 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 01:46:09,532 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 01:46:09,547 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 01:46:09,555 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 01:46:09,564 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 15 treesize of output 1 [2022-11-03 01:46:09,579 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 01:46:09,591 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:46:09,591 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 34 treesize of output 14 [2022-11-03 01:46:09,600 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 19 treesize of output 1 [2022-11-03 01:46:09,618 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 01:46:09,627 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 01:46:09,650 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 01:46:09,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 15 treesize of output 1 [2022-11-03 01:46:09,676 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 01:46:09,699 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 01:46:09,709 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 01:46:09,724 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 01:46:09,786 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:46:09,786 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 27 treesize of output 11 [2022-11-03 01:46:09,799 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:46:09,800 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 27 treesize of output 11 [2022-11-03 01:46:09,817 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 01:46:09,879 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 01:46:13,089 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '3421#(and (<= (+ |ULTIMATE.start_sll_circular_create_~last~0#1.offset| 4) (select |#length| |ULTIMATE.start_sll_circular_create_~last~0#1.base|)) (= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| |ULTIMATE.start_sll_circular_create_#res#1.offset|) (<= |ULTIMATE.start_sll_circular_create_#in~data#1| 1) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~1#1.base|) |ULTIMATE.start_main_~head~1#1.offset|) |ULTIMATE.start_main_~ptr~0#1.offset|) (= |ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (= |ULTIMATE.start_main_~ptr~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~1#1.base|) |ULTIMATE.start_main_~head~1#1.offset|)) (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |ULTIMATE.start_sll_circular_create_~last~0#1.offset|)) (= |ULTIMATE.start_main_~head~1#1.offset| |ULTIMATE.start_sll_circular_create_#res#1.offset|) (<= |#NULL.offset| 0) (<= 5 |ULTIMATE.start_main_~len~0#1|) (= |ULTIMATE.start_main_~data_init~0#1| 1) (<= 1 |ULTIMATE.start_sll_circular_create_~data#1|) (= |ULTIMATE.start_main_~head~1#1.offset| |ULTIMATE.start_main_~ptr~0#1.offset|) (<= 1 |ULTIMATE.start_sll_circular_create_#in~data#1|) (= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |ULTIMATE.start_sll_circular_create_~last~0#1.offset|)) (<= 0 |ULTIMATE.start_main_~head~1#1.offset|) (<= |ULTIMATE.start_sll_circular_create_~len#1| 1) (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_#res#1.base|) (<= |ULTIMATE.start_sll_circular_create_~data#1| 1) (<= |ULTIMATE.start_main_~len~0#1| 5) (<= (+ |ULTIMATE.start_main_~head~1#1.offset| 8) (select |#length| |ULTIMATE.start_main_~head~1#1.base|)) (<= 5 |ULTIMATE.start_sll_circular_create_#in~len#1|) (<= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (= (+ (select (select |#memory_int| |ULTIMATE.start_main_~head~1#1.base|) (+ |ULTIMATE.start_main_~head~1#1.offset| 4)) 1) (+ |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_main_~data_new~0#1|)) (= (select (select |#memory_int| |ULTIMATE.start_main_~head~1#1.base|) (+ |ULTIMATE.start_main_~head~1#1.offset| 4)) 1) (<= |ULTIMATE.start_sll_circular_create_#in~len#1| 5) (<= 0 |#NULL.offset|) (= |ULTIMATE.start_main_~head~1#1.base| |ULTIMATE.start_sll_circular_create_#res#1.base|) (= (select |#valid| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1) (<= 0 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~ptr~0#1.base| |ULTIMATE.start_main_~head~1#1.base|) (= |#NULL.base| 0) (= (select |#valid| |ULTIMATE.start_main_~head~1#1.base|) 1))' at error location [2022-11-03 01:46:13,089 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-03 01:46:13,089 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 01:46:13,090 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 19 [2022-11-03 01:46:13,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087614206] [2022-11-03 01:46:13,090 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 01:46:13,090 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-11-03 01:46:13,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:46:13,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-03 01:46:13,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=793, Unknown=2, NotChecked=118, Total=1056 [2022-11-03 01:46:13,092 INFO L87 Difference]: Start difference. First operand 61 states and 67 transitions. Second operand has 20 states, 20 states have (on average 2.9) internal successors, (58), 19 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:46:13,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:46:13,638 INFO L93 Difference]: Finished difference Result 70 states and 73 transitions. [2022-11-03 01:46:13,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-03 01:46:13,639 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.9) internal successors, (58), 19 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-11-03 01:46:13,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:46:13,639 INFO L225 Difference]: With dead ends: 70 [2022-11-03 01:46:13,640 INFO L226 Difference]: Without dead ends: 70 [2022-11-03 01:46:13,640 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 70 SyntacticMatches, 5 SemanticMatches, 40 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 429 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=274, Invalid=1292, Unknown=2, NotChecked=154, Total=1722 [2022-11-03 01:46:13,641 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 113 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 91 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 01:46:13,641 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 178 Invalid, 293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 171 Invalid, 0 Unknown, 91 Unchecked, 0.2s Time] [2022-11-03 01:46:13,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-11-03 01:46:13,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 56. [2022-11-03 01:46:13,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 46 states have (on average 1.3043478260869565) internal successors, (60), 55 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:46:13,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 60 transitions. [2022-11-03 01:46:13,643 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 60 transitions. Word has length 31 [2022-11-03 01:46:13,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:46:13,644 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 60 transitions. [2022-11-03 01:46:13,644 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.9) internal successors, (58), 19 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:46:13,644 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 60 transitions. [2022-11-03 01:46:13,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-03 01:46:13,644 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:46:13,645 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:46:13,691 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08cad0f5-7fd6-4b8b-ac30-51cdbff926c9/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-03 01:46:13,845 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08cad0f5-7fd6-4b8b-ac30-51cdbff926c9/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-11-03 01:46:13,845 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-11-03 01:46:13,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:46:13,846 INFO L85 PathProgramCache]: Analyzing trace with hash 1550225918, now seen corresponding path program 1 times [2022-11-03 01:46:13,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:46:13,846 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691067096] [2022-11-03 01:46:13,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:46:13,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:46:13,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:46:14,704 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 9 proven. 17 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-03 01:46:14,704 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:46:14,704 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691067096] [2022-11-03 01:46:14,704 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [691067096] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:46:14,704 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1340088172] [2022-11-03 01:46:14,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:46:14,705 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:46:14,705 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08cad0f5-7fd6-4b8b-ac30-51cdbff926c9/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:46:14,706 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08cad0f5-7fd6-4b8b-ac30-51cdbff926c9/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:46:14,721 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08cad0f5-7fd6-4b8b-ac30-51cdbff926c9/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-03 01:46:14,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:46:14,962 INFO L263 TraceCheckSpWp]: Trace formula consists of 382 conjuncts, 41 conjunts are in the unsatisfiable core [2022-11-03 01:46:14,968 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:46:15,112 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 01:46:15,149 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:46:15,149 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 20 [2022-11-03 01:46:15,197 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-03 01:46:15,198 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 19 treesize of output 18 [2022-11-03 01:46:15,229 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:46:15,230 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 20 [2022-11-03 01:46:15,238 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 01:46:15,254 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 22 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-03 01:46:15,255 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:46:15,294 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 8 treesize of output 6 [2022-11-03 01:46:19,277 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 18 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-03 01:46:19,277 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1340088172] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 01:46:19,277 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1111020718] [2022-11-03 01:46:19,279 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2022-11-03 01:46:19,279 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 01:46:19,279 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 01:46:19,279 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 01:46:19,279 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 01:46:19,300 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:46:19,301 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:46:19,302 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 01:46:19,325 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:46:19,326 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 0 case distinctions, treesize of input 30 treesize of output 21 [2022-11-03 01:46:19,334 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 01:46:19,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, 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 01:46:19,363 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:46:19,363 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 0 case distinctions, treesize of input 28 treesize of output 30 [2022-11-03 01:46:19,374 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:46:19,375 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 01:46:19,392 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:46:19,393 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 01:46:19,411 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:46:19,412 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:46:19,414 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:46:19,415 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:46:19,416 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:46:19,417 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 35 [2022-11-03 01:46:19,448 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:46:19,448 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 19 treesize of output 18 [2022-11-03 01:46:19,461 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:46:19,462 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:46:19,464 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:46:19,464 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 33 [2022-11-03 01:46:19,478 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:46:19,479 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 19 treesize of output 18 [2022-11-03 01:46:19,506 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:46:19,507 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:46:19,508 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 0 case distinctions, treesize of input 34 treesize of output 21 [2022-11-03 01:46:19,521 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:46:19,522 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:46:19,523 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 0 case distinctions, treesize of input 34 treesize of output 21 [2022-11-03 01:46:19,537 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:46:19,539 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:46:19,540 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:46:19,541 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 42 [2022-11-03 01:46:19,661 INFO L356 Elim1Store]: treesize reduction 92, result has 21.4 percent of original size [2022-11-03 01:46:19,662 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 334 treesize of output 337 [2022-11-03 01:46:19,839 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:46:19,840 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:46:19,863 INFO L356 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2022-11-03 01:46:19,864 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 347 treesize of output 330 [2022-11-03 01:46:19,880 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:46:19,915 INFO L356 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2022-11-03 01:46:19,916 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 3 case distinctions, treesize of input 343 treesize of output 341 [2022-11-03 01:46:19,935 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:46:19,969 INFO L356 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2022-11-03 01:46:19,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 2 new quantified variables, introduced 3 case distinctions, treesize of input 343 treesize of output 341 [2022-11-03 01:46:20,071 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:46:20,073 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:46:20,074 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:46:20,084 INFO L356 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-11-03 01:46:20,084 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 405 treesize of output 354 [2022-11-03 01:46:20,115 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:46:20,117 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:46:20,119 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:46:20,129 INFO L356 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2022-11-03 01:46:20,130 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 419 treesize of output 393 [2022-11-03 01:46:20,155 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:46:20,157 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:46:20,158 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:46:20,159 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:46:20,203 INFO L356 Elim1Store]: treesize reduction 58, result has 26.6 percent of original size [2022-11-03 01:46:20,203 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 399 treesize of output 393 [2022-11-03 01:46:20,293 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 01:46:20,303 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 01:46:20,322 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 01:46:20,331 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 01:46:20,341 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 15 treesize of output 1 [2022-11-03 01:46:20,360 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 01:46:20,368 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 19 treesize of output 1 [2022-11-03 01:46:20,378 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:46:20,379 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 34 treesize of output 14 [2022-11-03 01:46:20,404 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 01:46:20,415 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 01:46:20,434 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 01:46:20,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, 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 01:46:20,455 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 15 treesize of output 1 [2022-11-03 01:46:20,488 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 01:46:20,500 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 01:46:20,510 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 01:46:20,561 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 01:46:20,575 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:46:20,576 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 27 treesize of output 11 [2022-11-03 01:46:20,589 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:46:20,590 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 27 treesize of output 11 [2022-11-03 01:46:20,680 INFO L356 Elim1Store]: treesize reduction 39, result has 18.8 percent of original size [2022-11-03 01:46:20,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, 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 30 [2022-11-03 01:46:20,708 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:46:20,768 INFO L356 Elim1Store]: treesize reduction 48, result has 47.3 percent of original size [2022-11-03 01:46:20,768 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 3 case distinctions, treesize of input 34 treesize of output 49 [2022-11-03 01:46:20,795 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:46:20,846 INFO L356 Elim1Store]: treesize reduction 56, result has 38.5 percent of original size [2022-11-03 01:46:20,846 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 3 case distinctions, treesize of input 34 treesize of output 41 [2022-11-03 01:46:20,859 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2022-11-03 01:46:20,866 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2022-11-03 01:46:21,098 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 01:46:21,113 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 01:46:21,127 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 01:46:21,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, 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 01:46:21,216 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 01:46:21,224 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 01:46:21,235 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 01:46:22,812 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '3783#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~ptr~0#1.base|) (+ |ULTIMATE.start_main_~ptr~0#1.offset| 4)) |ULTIMATE.start_main_~data_new~0#1|) (<= 0 |#NULL.base|) (<= 1 |ULTIMATE.start_main_~data_init~0#1|) (= (select |#valid| |ULTIMATE.start_main_~ptr~0#1.base|) 1) (<= (+ |ULTIMATE.start_main_~ptr~0#1.offset| 8) (select |#length| |ULTIMATE.start_main_~ptr~0#1.base|)) (<= |ULTIMATE.start_sll_circular_create_#in~data#1| 1) (<= |ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (<= |ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (<= |ULTIMATE.start_main_~data_init~0#1| 1) (<= |#NULL.offset| 0) (<= 5 |ULTIMATE.start_main_~len~0#1|) (<= |ULTIMATE.start_main_~head~1#1.offset| 0) (<= 0 |ULTIMATE.start_sll_circular_create_~last~0#1.offset|) (<= 1 |ULTIMATE.start_sll_circular_create_~data#1|) (<= 0 |ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (<= 1 |ULTIMATE.start_sll_circular_create_#in~data#1|) (<= 0 |ULTIMATE.start_main_~head~1#1.offset|) (<= |ULTIMATE.start_sll_circular_create_~len#1| 1) (< |ULTIMATE.start_main_~ptr~0#1.offset| 0) (<= |ULTIMATE.start_sll_circular_create_~data#1| 1) (<= |ULTIMATE.start_main_~len~0#1| 5) (<= |#NULL.base| 0) (<= 5 |ULTIMATE.start_sll_circular_create_#in~len#1|) (<= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (<= 0 (+ |ULTIMATE.start_main_~ptr~0#1.offset| 4)) (<= |ULTIMATE.start_sll_circular_create_#in~len#1| 5) (<= 0 |#NULL.offset|) (<= 0 |ULTIMATE.start_sll_circular_create_#res#1.offset|) (<= 0 |#StackHeapBarrier|))' at error location [2022-11-03 01:46:22,812 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-03 01:46:22,812 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 01:46:22,813 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 24 [2022-11-03 01:46:22,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537215996] [2022-11-03 01:46:22,813 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 01:46:22,813 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-11-03 01:46:22,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:46:22,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-11-03 01:46:22,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=214, Invalid=1046, Unknown=0, NotChecked=0, Total=1260 [2022-11-03 01:46:22,815 INFO L87 Difference]: Start difference. First operand 56 states and 60 transitions. Second operand has 25 states, 24 states have (on average 3.0) internal successors, (72), 25 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:46:23,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:46:23,474 INFO L93 Difference]: Finished difference Result 83 states and 90 transitions. [2022-11-03 01:46:23,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-03 01:46:23,475 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 3.0) internal successors, (72), 25 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-11-03 01:46:23,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:46:23,475 INFO L225 Difference]: With dead ends: 83 [2022-11-03 01:46:23,475 INFO L226 Difference]: Without dead ends: 83 [2022-11-03 01:46:23,477 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 72 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 563 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=535, Invalid=1915, Unknown=0, NotChecked=0, Total=2450 [2022-11-03 01:46:23,478 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 275 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 275 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 34 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 01:46:23,478 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [275 Valid, 156 Invalid, 270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 177 Invalid, 0 Unknown, 34 Unchecked, 0.2s Time] [2022-11-03 01:46:23,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2022-11-03 01:46:23,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 58. [2022-11-03 01:46:23,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 48 states have (on average 1.2916666666666667) internal successors, (62), 57 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:46:23,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 62 transitions. [2022-11-03 01:46:23,481 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 62 transitions. Word has length 31 [2022-11-03 01:46:23,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:46:23,482 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 62 transitions. [2022-11-03 01:46:23,482 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 3.0) internal successors, (72), 25 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:46:23,482 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 62 transitions. [2022-11-03 01:46:23,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-11-03 01:46:23,483 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:46:23,483 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:46:23,511 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08cad0f5-7fd6-4b8b-ac30-51cdbff926c9/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-11-03 01:46:23,686 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08cad0f5-7fd6-4b8b-ac30-51cdbff926c9/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:46:23,687 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-11-03 01:46:23,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:46:23,687 INFO L85 PathProgramCache]: Analyzing trace with hash -586485370, now seen corresponding path program 2 times [2022-11-03 01:46:23,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:46:23,687 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102395400] [2022-11-03 01:46:23,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:46:23,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:46:23,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:46:25,492 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 2 proven. 32 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 01:46:25,492 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:46:25,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102395400] [2022-11-03 01:46:25,493 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [102395400] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:46:25,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [557927053] [2022-11-03 01:46:25,493 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 01:46:25,493 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:46:25,493 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08cad0f5-7fd6-4b8b-ac30-51cdbff926c9/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:46:25,494 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08cad0f5-7fd6-4b8b-ac30-51cdbff926c9/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:46:25,495 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08cad0f5-7fd6-4b8b-ac30-51cdbff926c9/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-03 01:46:26,072 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-11-03 01:46:26,072 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 01:46:26,076 INFO L263 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 76 conjunts are in the unsatisfiable core [2022-11-03 01:46:26,081 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:46:26,176 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-03 01:46:26,177 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 18 [2022-11-03 01:46:26,242 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 01:46:26,305 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 22 [2022-11-03 01:46:26,392 INFO L356 Elim1Store]: treesize reduction 40, result has 40.3 percent of original size [2022-11-03 01:46:26,393 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 3 case distinctions, treesize of input 21 treesize of output 38 [2022-11-03 01:46:26,514 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:46:26,528 INFO L356 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-03 01:46:26,529 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 29 treesize of output 28 [2022-11-03 01:46:26,540 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 01:46:26,635 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:46:26,636 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:46:26,640 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-03 01:46:26,640 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 1 case distinctions, treesize of input 40 treesize of output 41 [2022-11-03 01:46:26,648 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 45 treesize of output 36 [2022-11-03 01:46:26,788 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:46:26,789 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:46:26,833 INFO L356 Elim1Store]: treesize reduction 28, result has 55.6 percent of original size [2022-11-03 01:46:26,834 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 55 [2022-11-03 01:46:26,844 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:46:26,856 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-03 01:46:26,857 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 41 treesize of output 32 [2022-11-03 01:46:27,219 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:46:27,221 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:46:27,222 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:46:27,223 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:46:27,226 INFO L356 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-11-03 01:46:27,227 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 51 [2022-11-03 01:46:27,239 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:46:27,240 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:46:27,243 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-03 01:46:27,244 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 52 treesize of output 46 [2022-11-03 01:46:27,293 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:46:27,296 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-03 01:46:27,296 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 46 treesize of output 26 [2022-11-03 01:46:27,610 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:46:27,611 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:46:27,612 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:46:27,613 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:46:27,617 INFO L356 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-11-03 01:46:27,617 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 3 case distinctions, treesize of input 72 treesize of output 59 [2022-11-03 01:46:27,713 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:46:27,714 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:46:27,734 INFO L356 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2022-11-03 01:46:27,734 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 71 treesize of output 41 [2022-11-03 01:46:29,864 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 24 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-03 01:46:29,864 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:46:34,151 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 4))) (and (forall ((v_ArrVal_1937 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (let ((.cse0 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|)))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (let ((.cse3 (select .cse1 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (or (= (select |c_#valid| (select (select (store .cse0 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (store .cse1 .cse2 v_ArrVal_1937)) .cse3) (select (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) 1) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse3)))))) (forall ((v_ArrVal_1937 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (let ((.cse6 (select (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (or (= (select |c_#valid| (select (let ((.cse4 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|)))) (let ((.cse5 (select .cse4 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (select (store .cse4 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (store .cse5 .cse2 v_ArrVal_1937)) (select .cse5 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)))) .cse6)) 1) (= .cse6 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)))))) is different from false [2022-11-03 01:46:36,205 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|)) (.cse4 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|)) (.cse2 (+ 4 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (and (forall ((v_ArrVal_1937 Int) (v_ArrVal_1930 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_1931 Int)) (let ((.cse5 (select (select (let ((.cse6 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store .cse7 .cse2 v_ArrVal_1931)))) (store .cse6 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse6 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (or (= (select |c_#valid| (select (let ((.cse0 (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store .cse4 .cse2 v_ArrVal_1930)))) (store .cse3 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse3 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (select (store .cse0 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store .cse1 .cse2 v_ArrVal_1937)) (select .cse1 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)))) .cse5)) 1) (= .cse5 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)))) (forall ((v_ArrVal_1937 Int) (v_ArrVal_1930 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_1931 Int)) (let ((.cse8 (let ((.cse12 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store .cse4 .cse2 v_ArrVal_1930)))) (store .cse12 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse12 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))))) (let ((.cse9 (select .cse8 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (let ((.cse10 (select .cse9 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (or (= (select |c_#valid| (select (select (store .cse8 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store .cse9 .cse2 v_ArrVal_1937)) .cse10) (select (select (let ((.cse11 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store .cse7 .cse2 v_ArrVal_1931)))) (store .cse11 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse11 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) 1) (= .cse10 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|)))))))) is different from false [2022-11-03 01:46:58,741 WARN L234 SmtUtils]: Spent 19.05s on a formula simplification. DAG size of input: 68 DAG size of output: 39 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-03 01:47:00,793 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset_63| Int) (v_ArrVal_1937 Int) (|v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_53| Int) (v_ArrVal_1930 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (or (= (select (store |c_#valid| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_53| 1) (select (let ((.cse2 (+ |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset_63| 4))) (let ((.cse0 (let ((.cse3 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_53| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_53|) |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset_63| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse2 v_ArrVal_1930)))) (store .cse3 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse3 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_53|))))) (let ((.cse1 (select .cse0 |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_53|))) (select (store .cse0 |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_53| (store .cse1 .cse2 v_ArrVal_1937)) (select .cse1 |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset_63|))))) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) 1) (= |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_53| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (not (<= 0 |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset_63|)) (not (<= |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset_63| 0)))) is different from false [2022-11-03 01:47:02,828 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset_63| Int) (v_ArrVal_1937 Int) (|v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_53| Int) (v_ArrVal_1930 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_1921 Int)) (or (= (select (store |c_#valid| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_53| 1) (select (let ((.cse2 (+ |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset_63| 4))) (let ((.cse0 (let ((.cse3 (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) (+ 4 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) v_ArrVal_1921)))) (store .cse4 |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_53| (store (store (select .cse4 |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_53|) |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset_63| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse2 v_ArrVal_1930))))) (store .cse3 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse3 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_53|))))) (let ((.cse1 (select .cse0 |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_53|))) (select (store .cse0 |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_53| (store .cse1 .cse2 v_ArrVal_1937)) (select .cse1 |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset_63|))))) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) 1) (= |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_53| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (not (<= 0 |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset_63|)) (not (<= |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset_63| 0)))) is different from false [2022-11-03 01:47:02,850 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:47:02,851 INFO L173 IndexEqualityManager]: detected equality via solver