./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-ext3-properties/sll_circular_traversal-1.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_0afaf1dc-a57a-4f92-a996-a03ff1c427d9/bin/utaipan-7li7fVZpFI/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0afaf1dc-a57a-4f92-a996-a03ff1c427d9/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_0afaf1dc-a57a-4f92-a996-a03ff1c427d9/bin/utaipan-7li7fVZpFI/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0afaf1dc-a57a-4f92-a996-a03ff1c427d9/bin/utaipan-7li7fVZpFI/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-ext3-properties/sll_circular_traversal-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0afaf1dc-a57a-4f92-a996-a03ff1c427d9/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_0afaf1dc-a57a-4f92-a996-a03ff1c427d9/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 5b4659b27a54f579598b48dab11e67b47aff28d030592fa757cae575afffc3b5 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-5e519f3 [2022-11-03 02:51:55,325 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-03 02:51:55,328 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-03 02:51:55,385 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-03 02:51:55,385 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-03 02:51:55,389 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-03 02:51:55,392 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-03 02:51:55,398 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-03 02:51:55,400 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-03 02:51:55,410 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-03 02:51:55,411 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-03 02:51:55,412 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-03 02:51:55,413 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-03 02:51:55,416 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-03 02:51:55,417 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-03 02:51:55,419 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-03 02:51:55,421 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-03 02:51:55,422 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-03 02:51:55,424 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-03 02:51:55,432 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-03 02:51:55,434 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-03 02:51:55,436 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-03 02:51:55,440 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-03 02:51:55,441 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-03 02:51:55,451 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-03 02:51:55,451 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-03 02:51:55,452 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-03 02:51:55,454 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-03 02:51:55,455 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-03 02:51:55,456 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-03 02:51:55,456 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-03 02:51:55,458 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-03 02:51:55,460 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-03 02:51:55,461 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-03 02:51:55,464 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-03 02:51:55,464 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-03 02:51:55,465 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-03 02:51:55,466 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-03 02:51:55,466 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-03 02:51:55,467 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-03 02:51:55,468 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-03 02:51:55,469 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0afaf1dc-a57a-4f92-a996-a03ff1c427d9/bin/utaipan-7li7fVZpFI/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2022-11-03 02:51:55,514 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-03 02:51:55,514 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-03 02:51:55,515 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-03 02:51:55,515 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-03 02:51:55,517 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-03 02:51:55,517 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-03 02:51:55,517 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-03 02:51:55,517 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-03 02:51:55,518 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-03 02:51:55,518 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-03 02:51:55,519 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-03 02:51:55,519 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-03 02:51:55,520 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-03 02:51:55,520 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-03 02:51:55,520 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-03 02:51:55,520 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-03 02:51:55,521 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-03 02:51:55,521 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-03 02:51:55,522 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-03 02:51:55,522 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-03 02:51:55,524 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-03 02:51:55,524 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-03 02:51:55,524 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-03 02:51:55,525 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-03 02:51:55,525 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-03 02:51:55,525 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-03 02:51:55,525 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-03 02:51:55,526 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-03 02:51:55,526 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-03 02:51:55,526 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-03 02:51:55,526 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-03 02:51:55,527 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-03 02:51:55,527 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-03 02:51:55,527 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-03 02:51:55,527 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-03 02:51:55,528 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 02:51:55,528 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-03 02:51:55,528 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-03 02:51:55,528 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-03 02:51:55,529 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-03 02:51:55,529 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-03 02:51:55,529 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-03 02:51:55,529 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_0afaf1dc-a57a-4f92-a996-a03ff1c427d9/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_0afaf1dc-a57a-4f92-a996-a03ff1c427d9/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 -> 5b4659b27a54f579598b48dab11e67b47aff28d030592fa757cae575afffc3b5 [2022-11-03 02:51:55,839 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-03 02:51:55,862 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-03 02:51:55,865 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-03 02:51:55,866 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-03 02:51:55,868 INFO L275 PluginConnector]: CDTParser initialized [2022-11-03 02:51:55,869 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0afaf1dc-a57a-4f92-a996-a03ff1c427d9/bin/utaipan-7li7fVZpFI/../../sv-benchmarks/c/list-ext3-properties/sll_circular_traversal-1.i [2022-11-03 02:51:55,936 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0afaf1dc-a57a-4f92-a996-a03ff1c427d9/bin/utaipan-7li7fVZpFI/data/b1c13b5e4/88fc83a7772f4b58802f3cce82ba8c1a/FLAG8a99d2c5c [2022-11-03 02:51:56,536 INFO L306 CDTParser]: Found 1 translation units. [2022-11-03 02:51:56,537 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0afaf1dc-a57a-4f92-a996-a03ff1c427d9/sv-benchmarks/c/list-ext3-properties/sll_circular_traversal-1.i [2022-11-03 02:51:56,552 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0afaf1dc-a57a-4f92-a996-a03ff1c427d9/bin/utaipan-7li7fVZpFI/data/b1c13b5e4/88fc83a7772f4b58802f3cce82ba8c1a/FLAG8a99d2c5c [2022-11-03 02:51:56,826 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0afaf1dc-a57a-4f92-a996-a03ff1c427d9/bin/utaipan-7li7fVZpFI/data/b1c13b5e4/88fc83a7772f4b58802f3cce82ba8c1a [2022-11-03 02:51:56,829 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-03 02:51:56,831 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-03 02:51:56,834 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-03 02:51:56,834 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-03 02:51:56,841 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-03 02:51:56,842 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 02:51:56" (1/1) ... [2022-11-03 02:51:56,843 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4990fb90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:51:56, skipping insertion in model container [2022-11-03 02:51:56,844 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 02:51:56" (1/1) ... [2022-11-03 02:51:56,853 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-03 02:51:56,894 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-03 02:51:57,337 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_0afaf1dc-a57a-4f92-a996-a03ff1c427d9/sv-benchmarks/c/list-ext3-properties/sll_circular_traversal-1.i[24132,24145] [2022-11-03 02:51:57,342 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 02:51:57,355 INFO L203 MainTranslator]: Completed pre-run [2022-11-03 02:51:57,417 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_0afaf1dc-a57a-4f92-a996-a03ff1c427d9/sv-benchmarks/c/list-ext3-properties/sll_circular_traversal-1.i[24132,24145] [2022-11-03 02:51:57,418 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 02:51:57,452 INFO L208 MainTranslator]: Completed translation [2022-11-03 02:51:57,453 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:51:57 WrapperNode [2022-11-03 02:51:57,453 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-03 02:51:57,454 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-03 02:51:57,455 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-03 02:51:57,455 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-03 02:51:57,462 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:51:57" (1/1) ... [2022-11-03 02:51:57,476 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:51:57" (1/1) ... [2022-11-03 02:51:57,501 INFO L138 Inliner]: procedures = 122, calls = 23, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 93 [2022-11-03 02:51:57,501 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-03 02:51:57,502 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-03 02:51:57,502 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-03 02:51:57,502 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-03 02:51:57,511 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:51:57" (1/1) ... [2022-11-03 02:51:57,512 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:51:57" (1/1) ... [2022-11-03 02:51:57,516 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:51:57" (1/1) ... [2022-11-03 02:51:57,516 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:51:57" (1/1) ... [2022-11-03 02:51:57,524 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:51:57" (1/1) ... [2022-11-03 02:51:57,528 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:51:57" (1/1) ... [2022-11-03 02:51:57,530 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:51:57" (1/1) ... [2022-11-03 02:51:57,531 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:51:57" (1/1) ... [2022-11-03 02:51:57,534 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-03 02:51:57,535 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-03 02:51:57,535 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-03 02:51:57,535 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-03 02:51:57,536 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:51:57" (1/1) ... [2022-11-03 02:51:57,557 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 02:51:57,568 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0afaf1dc-a57a-4f92-a996-a03ff1c427d9/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:51:57,581 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0afaf1dc-a57a-4f92-a996-a03ff1c427d9/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-03 02:51:57,606 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0afaf1dc-a57a-4f92-a996-a03ff1c427d9/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-03 02:51:57,636 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2022-11-03 02:51:57,636 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2022-11-03 02:51:57,637 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-03 02:51:57,637 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-03 02:51:57,637 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-03 02:51:57,637 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-03 02:51:57,637 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-03 02:51:57,637 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-03 02:51:57,638 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-03 02:51:57,638 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-03 02:51:57,638 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-03 02:51:57,638 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-03 02:51:57,759 INFO L235 CfgBuilder]: Building ICFG [2022-11-03 02:51:57,762 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-03 02:51:57,800 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2022-11-03 02:51:58,185 INFO L276 CfgBuilder]: Performing block encoding [2022-11-03 02:51:58,251 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-03 02:51:58,265 INFO L300 CfgBuilder]: Removed 3 assume(true) statements. [2022-11-03 02:51:58,268 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 02:51:58 BoogieIcfgContainer [2022-11-03 02:51:58,269 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-03 02:51:58,272 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-03 02:51:58,272 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-03 02:51:58,276 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-03 02:51:58,276 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.11 02:51:56" (1/3) ... [2022-11-03 02:51:58,277 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51174164 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 02:51:58, skipping insertion in model container [2022-11-03 02:51:58,278 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:51:57" (2/3) ... [2022-11-03 02:51:58,278 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51174164 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 02:51:58, skipping insertion in model container [2022-11-03 02:51:58,278 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 02:51:58" (3/3) ... [2022-11-03 02:51:58,281 INFO L112 eAbstractionObserver]: Analyzing ICFG sll_circular_traversal-1.i [2022-11-03 02:51:58,304 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-03 02:51:58,305 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 28 error locations. [2022-11-03 02:51:58,354 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-03 02:51:58,361 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;@49294d26, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-03 02:51:58,361 INFO L358 AbstractCegarLoop]: Starting to check reachability of 28 error locations. [2022-11-03 02:51:58,366 INFO L276 IsEmpty]: Start isEmpty. Operand has 62 states, 31 states have (on average 2.225806451612903) internal successors, (69), 60 states have internal predecessors, (69), 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 02:51:58,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-03 02:51:58,374 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:51:58,375 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-03 02:51:58,375 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-11-03 02:51:58,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:51:58,382 INFO L85 PathProgramCache]: Analyzing trace with hash 163789, now seen corresponding path program 1 times [2022-11-03 02:51:58,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:51:58,393 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159395563] [2022-11-03 02:51:58,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:51:58,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:51:58,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:51:58,660 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:51:58,660 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:51:58,661 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159395563] [2022-11-03 02:51:58,662 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [159395563] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:51:58,662 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:51:58,662 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-03 02:51:58,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979711040] [2022-11-03 02:51:58,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:51:58,671 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 02:51:58,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:51:58,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 02:51:58,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 02:51:58,722 INFO L87 Difference]: Start difference. First operand has 62 states, 31 states have (on average 2.225806451612903) internal successors, (69), 60 states have internal predecessors, (69), 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 02:51:58,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:51:58,888 INFO L93 Difference]: Finished difference Result 83 states and 91 transitions. [2022-11-03 02:51:58,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 02:51:58,891 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 02:51:58,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:51:58,900 INFO L225 Difference]: With dead ends: 83 [2022-11-03 02:51:58,901 INFO L226 Difference]: Without dead ends: 78 [2022-11-03 02:51:58,903 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 02:51:58,908 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 54 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 02:51:58,909 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 55 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 02:51:58,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-11-03 02:51:58,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 54. [2022-11-03 02:51:58,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 29 states have (on average 2.0) internal successors, (58), 53 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 02:51:58,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 58 transitions. [2022-11-03 02:51:58,963 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 58 transitions. Word has length 3 [2022-11-03 02:51:58,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:51:58,963 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 58 transitions. [2022-11-03 02:51:58,964 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 02:51:58,966 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2022-11-03 02:51:58,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-03 02:51:58,967 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:51:58,967 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-03 02:51:58,967 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-03 02:51:58,968 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-11-03 02:51:58,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:51:58,969 INFO L85 PathProgramCache]: Analyzing trace with hash 163790, now seen corresponding path program 1 times [2022-11-03 02:51:58,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:51:58,970 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65274909] [2022-11-03 02:51:58,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:51:58,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:51:59,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:51:59,097 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:51:59,097 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:51:59,098 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65274909] [2022-11-03 02:51:59,098 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [65274909] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:51:59,098 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:51:59,098 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-03 02:51:59,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566067425] [2022-11-03 02:51:59,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:51:59,100 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 02:51:59,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:51:59,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 02:51:59,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 02:51:59,101 INFO L87 Difference]: Start difference. First operand 54 states and 58 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 02:51:59,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:51:59,180 INFO L93 Difference]: Finished difference Result 92 states and 100 transitions. [2022-11-03 02:51:59,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 02:51:59,181 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 02:51:59,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:51:59,183 INFO L225 Difference]: With dead ends: 92 [2022-11-03 02:51:59,183 INFO L226 Difference]: Without dead ends: 92 [2022-11-03 02:51:59,184 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 02:51:59,185 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 45 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 72 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 02:51:59,186 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 72 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 02:51:59,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-11-03 02:51:59,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 54. [2022-11-03 02:51:59,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 31 states have (on average 1.903225806451613) internal successors, (59), 53 states have internal predecessors, (59), 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 02:51:59,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 59 transitions. [2022-11-03 02:51:59,194 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 59 transitions. Word has length 3 [2022-11-03 02:51:59,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:51:59,194 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 59 transitions. [2022-11-03 02:51:59,194 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 02:51:59,195 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 59 transitions. [2022-11-03 02:51:59,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-03 02:51:59,195 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:51:59,196 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:51:59,196 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-03 02:51:59,196 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-11-03 02:51:59,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:51:59,197 INFO L85 PathProgramCache]: Analyzing trace with hash 942026430, now seen corresponding path program 1 times [2022-11-03 02:51:59,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:51:59,198 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865593287] [2022-11-03 02:51:59,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:51:59,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:51:59,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:51:59,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:51:59,346 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:51:59,347 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865593287] [2022-11-03 02:51:59,347 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [865593287] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:51:59,347 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:51:59,347 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-03 02:51:59,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251645314] [2022-11-03 02:51:59,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:51:59,348 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-03 02:51:59,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:51:59,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-03 02:51:59,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-03 02:51:59,350 INFO L87 Difference]: Start difference. First operand 54 states and 59 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 02:51:59,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:51:59,565 INFO L93 Difference]: Finished difference Result 114 states and 125 transitions. [2022-11-03 02:51:59,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-03 02:51:59,566 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 02:51:59,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:51:59,571 INFO L225 Difference]: With dead ends: 114 [2022-11-03 02:51:59,571 INFO L226 Difference]: Without dead ends: 114 [2022-11-03 02:51:59,572 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 02:51:59,579 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 172 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 02:51:59,580 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 66 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 02:51:59,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2022-11-03 02:51:59,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 51. [2022-11-03 02:51:59,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 32 states have (on average 1.78125) internal successors, (57), 50 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 02:51:59,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 57 transitions. [2022-11-03 02:51:59,586 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 57 transitions. Word has length 7 [2022-11-03 02:51:59,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:51:59,586 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 57 transitions. [2022-11-03 02:51:59,586 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 02:51:59,587 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 57 transitions. [2022-11-03 02:51:59,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-03 02:51:59,587 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:51:59,587 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:51:59,587 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-03 02:51:59,588 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-11-03 02:51:59,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:51:59,588 INFO L85 PathProgramCache]: Analyzing trace with hash 942026431, now seen corresponding path program 1 times [2022-11-03 02:51:59,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:51:59,592 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130530387] [2022-11-03 02:51:59,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:51:59,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:51:59,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:51:59,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:51:59,695 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:51:59,695 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130530387] [2022-11-03 02:51:59,695 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [130530387] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:51:59,696 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:51:59,696 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-03 02:51:59,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593387181] [2022-11-03 02:51:59,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:51:59,697 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 02:51:59,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:51:59,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 02:51:59,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 02:51:59,698 INFO L87 Difference]: Start difference. First operand 51 states and 57 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 02:51:59,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:51:59,719 INFO L93 Difference]: Finished difference Result 56 states and 60 transitions. [2022-11-03 02:51:59,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 02:51:59,720 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 02:51:59,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:51:59,721 INFO L225 Difference]: With dead ends: 56 [2022-11-03 02:51:59,721 INFO L226 Difference]: Without dead ends: 56 [2022-11-03 02:51:59,721 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 02:51:59,723 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 7 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 86 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 02:51:59,723 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 86 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-03 02:51:59,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-11-03 02:51:59,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 49. [2022-11-03 02:51:59,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 30 states have (on average 1.7666666666666666) internal successors, (53), 48 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 02:51:59,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 53 transitions. [2022-11-03 02:51:59,728 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 53 transitions. Word has length 7 [2022-11-03 02:51:59,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:51:59,729 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 53 transitions. [2022-11-03 02:51:59,729 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 02:51:59,729 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2022-11-03 02:51:59,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-03 02:51:59,730 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:51:59,730 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:51:59,730 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-03 02:51:59,731 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-11-03 02:51:59,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:51:59,731 INFO L85 PathProgramCache]: Analyzing trace with hash 941913540, now seen corresponding path program 1 times [2022-11-03 02:51:59,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:51:59,732 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799216607] [2022-11-03 02:51:59,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:51:59,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:51:59,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:51:59,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:51:59,791 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:51:59,792 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799216607] [2022-11-03 02:51:59,792 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1799216607] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:51:59,792 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:51:59,792 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-03 02:51:59,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979013348] [2022-11-03 02:51:59,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:51:59,793 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 02:51:59,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:51:59,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 02:51:59,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 02:51:59,795 INFO L87 Difference]: Start difference. First operand 49 states and 53 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 02:51:59,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:51:59,842 INFO L93 Difference]: Finished difference Result 69 states and 75 transitions. [2022-11-03 02:51:59,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 02:51:59,842 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 02:51:59,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:51:59,843 INFO L225 Difference]: With dead ends: 69 [2022-11-03 02:51:59,843 INFO L226 Difference]: Without dead ends: 69 [2022-11-03 02:51:59,844 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 02:51:59,845 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 41 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-03 02:51:59,845 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 50 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-03 02:51:59,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-11-03 02:51:59,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 47. [2022-11-03 02:51:59,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 30 states have (on average 1.7) 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 02:51:59,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2022-11-03 02:51:59,850 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 7 [2022-11-03 02:51:59,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:51:59,851 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2022-11-03 02:51:59,851 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 02:51:59,851 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2022-11-03 02:51:59,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-03 02:51:59,852 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:51:59,852 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:51:59,852 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-03 02:51:59,853 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-11-03 02:51:59,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:51:59,854 INFO L85 PathProgramCache]: Analyzing trace with hash 941913541, now seen corresponding path program 1 times [2022-11-03 02:51:59,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:51:59,854 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646617174] [2022-11-03 02:51:59,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:51:59,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:51:59,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:51:59,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:51:59,966 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:51:59,966 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646617174] [2022-11-03 02:51:59,967 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [646617174] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:51:59,967 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:51:59,967 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-03 02:51:59,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176453915] [2022-11-03 02:51:59,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:51:59,968 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 02:51:59,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:51:59,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 02:51:59,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 02:51:59,969 INFO L87 Difference]: Start difference. First operand 47 states and 51 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 02:52:00,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:52:00,007 INFO L93 Difference]: Finished difference Result 45 states and 49 transitions. [2022-11-03 02:52:00,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 02:52:00,008 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 02:52:00,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:52:00,008 INFO L225 Difference]: With dead ends: 45 [2022-11-03 02:52:00,009 INFO L226 Difference]: Without dead ends: 45 [2022-11-03 02:52:00,009 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 02:52:00,010 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 42 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 31 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.0s IncrementalHoareTripleChecker+Time [2022-11-03 02:52:00,010 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 31 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-03 02:52:00,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-11-03 02:52:00,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2022-11-03 02:52:00,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 30 states have (on average 1.6333333333333333) internal successors, (49), 44 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 02:52:00,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2022-11-03 02:52:00,015 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 7 [2022-11-03 02:52:00,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:52:00,015 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2022-11-03 02:52:00,015 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 02:52:00,016 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2022-11-03 02:52:00,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-03 02:52:00,016 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:52:00,016 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:52:00,017 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-03 02:52:00,017 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-11-03 02:52:00,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:52:00,018 INFO L85 PathProgramCache]: Analyzing trace with hash 1525032713, now seen corresponding path program 1 times [2022-11-03 02:52:00,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:52:00,018 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303669312] [2022-11-03 02:52:00,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:52:00,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:52:00,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:52:00,095 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 02:52:00,096 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:52:00,096 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303669312] [2022-11-03 02:52:00,096 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [303669312] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:52:00,096 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [736458918] [2022-11-03 02:52:00,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:52:00,097 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:52:00,097 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0afaf1dc-a57a-4f92-a996-a03ff1c427d9/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:52:00,099 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0afaf1dc-a57a-4f92-a996-a03ff1c427d9/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:52:00,139 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0afaf1dc-a57a-4f92-a996-a03ff1c427d9/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-03 02:52:00,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:52:00,223 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-03 02:52:00,229 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:52:00,319 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 02:52:00,319 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:52:00,365 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 02:52:00,366 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [736458918] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:52:00,366 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1923413549] [2022-11-03 02:52:00,392 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2022-11-03 02:52:00,392 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 02:52:00,407 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 02:52:00,413 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 02:52:00,414 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 02:52:00,494 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:52:00,495 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:52:00,505 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2022-11-03 02:52:00,559 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 02:52:00,571 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 02:52:00,584 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:52:00,586 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 02:52:00,630 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:52:00,632 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2022-11-03 02:52:00,648 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:52:00,650 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2022-11-03 02:52:00,668 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:52:00,670 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 02:52:00,734 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:52:00,736 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:52:00,737 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:52:00,739 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:52:00,741 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:52:00,743 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 02:52:00,859 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:52:00,860 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 02:52:00,882 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:52:00,884 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 02:52:00,904 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:52:00,907 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:52:00,909 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:52:00,910 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 02:52:00,979 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:52:00,980 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:52:00,982 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 02:52:01,007 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:52:01,009 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:52:01,010 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:52:01,012 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 02:52:01,034 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:52:01,036 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:52:01,037 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 02:52:01,103 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:52:01,105 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:52:01,112 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:52:01,114 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:52:01,115 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:52:01,117 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:52:01,119 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:52:01,121 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:52:01,123 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:52:01,125 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 02:52:01,402 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:52:01,403 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:52:01,447 INFO L356 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2022-11-03 02:52:01,447 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 02:52:01,495 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:52:01,497 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:52:01,499 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:52:01,501 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:52:01,502 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:52:01,503 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:52:01,530 INFO L356 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2022-11-03 02:52:01,530 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 02:52:01,564 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:52:01,565 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:52:01,601 INFO L356 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2022-11-03 02:52:01,602 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 02:52:01,928 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:52:01,930 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:52:01,932 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:52:01,933 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:52:01,935 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:52:01,946 INFO L356 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-11-03 02:52:01,947 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 02:52:01,989 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:52:01,991 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:52:01,993 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:52:02,025 INFO L356 Elim1Store]: treesize reduction 87, result has 11.2 percent of original size [2022-11-03 02:52:02,026 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 02:52:02,076 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:52:02,077 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:52:02,079 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:52:02,080 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:52:02,136 INFO L356 Elim1Store]: treesize reduction 64, result has 29.7 percent of original size [2022-11-03 02:52:02,140 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 02:52:02,375 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:52:02,497 INFO L356 Elim1Store]: treesize reduction 156, result has 13.8 percent of original size [2022-11-03 02:52:02,498 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 02:52:02,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, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-03 02:52:02,783 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 02:52:02,799 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 02:52:02,834 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:52:02,835 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 02:52:02,855 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2022-11-03 02:52:02,868 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 02:52:02,945 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-03 02:52:02,945 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-03 02:52:02,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, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-03 02:52:03,027 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-03 02:52:03,036 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 02:52:03,047 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 02:52:03,092 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2022-11-03 02:52:03,102 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 02:52:03,115 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:52:03,116 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 02:52:03,238 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-03 02:52:03,238 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-03 02:52:03,257 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 02:52:03,279 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 02:52:04,437 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '908#(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 02:52:04,438 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-03 02:52:04,438 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 02:52:04,438 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2022-11-03 02:52:04,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102261737] [2022-11-03 02:52:04,438 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 02:52:04,439 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-03 02:52:04,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:52:04,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-03 02:52:04,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2022-11-03 02:52:04,440 INFO L87 Difference]: Start difference. First operand 45 states and 49 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 02:52:04,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:52:04,481 INFO L93 Difference]: Finished difference Result 57 states and 61 transitions. [2022-11-03 02:52:04,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-03 02:52:04,482 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 02:52:04,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:52:04,482 INFO L225 Difference]: With dead ends: 57 [2022-11-03 02:52:04,482 INFO L226 Difference]: Without dead ends: 57 [2022-11-03 02:52:04,483 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 02:52:04,483 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 15 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-03 02:52:04,484 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 154 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-03 02:52:04,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-11-03 02:52:04,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2022-11-03 02:52:04,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 42 states have (on average 1.4523809523809523) internal successors, (61), 56 states have internal predecessors, (61), 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 02:52:04,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 61 transitions. [2022-11-03 02:52:04,487 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 61 transitions. Word has length 10 [2022-11-03 02:52:04,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:52:04,488 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 61 transitions. [2022-11-03 02:52:04,488 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 02:52:04,488 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 61 transitions. [2022-11-03 02:52:04,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-03 02:52:04,488 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:52:04,492 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1] [2022-11-03 02:52:04,539 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0afaf1dc-a57a-4f92-a996-a03ff1c427d9/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-03 02:52:04,709 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0afaf1dc-a57a-4f92-a996-a03ff1c427d9/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2022-11-03 02:52:04,709 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-11-03 02:52:04,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:52:04,710 INFO L85 PathProgramCache]: Analyzing trace with hash -247780281, now seen corresponding path program 2 times [2022-11-03 02:52:04,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:52:04,710 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017741171] [2022-11-03 02:52:04,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:52:04,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:52:04,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:52:05,620 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 02:52:05,621 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:52:05,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017741171] [2022-11-03 02:52:05,621 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2017741171] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:52:05,622 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1194487499] [2022-11-03 02:52:05,622 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 02:52:05,622 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:52:05,622 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0afaf1dc-a57a-4f92-a996-a03ff1c427d9/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:52:05,623 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0afaf1dc-a57a-4f92-a996-a03ff1c427d9/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:52:05,649 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0afaf1dc-a57a-4f92-a996-a03ff1c427d9/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-03 02:52:06,017 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-11-03 02:52:06,017 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 02:52:06,020 INFO L263 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 20 conjunts are in the unsatisfiable core [2022-11-03 02:52:06,025 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:52:06,034 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-03 02:52:06,097 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-03 02:52:06,097 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-03 02:52:06,104 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 02:52:06,194 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:52:06,195 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 02:52:06,210 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-03 02:52:06,210 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 02:52:06,259 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-03 02:52:06,260 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 02:52:06,371 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-03 02:52:06,371 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 02:52:06,435 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-03 02:52:06,436 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:52:08,818 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 (< v_ArrVal_277 8) (forall ((|v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_22| Int) (v_ArrVal_278 Int)) (or (< v_ArrVal_278 8) (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 02:52:09,563 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 998 treesize of output 980 [2022-11-03 02:52:12,220 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 02:52:12,220 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1194487499] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:52:12,221 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [501115234] [2022-11-03 02:52:12,223 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2022-11-03 02:52:12,223 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 02:52:12,224 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 02:52:12,224 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 02:52:12,224 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 02:52:12,244 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:52:12,246 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:52:12,247 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2022-11-03 02:52:12,274 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:52:12,275 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 02:52:12,285 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 02:52:12,293 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 02:52:12,316 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:52:12,317 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 02:52:12,331 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:52:12,332 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2022-11-03 02:52:12,342 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:52:12,344 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2022-11-03 02:52:12,369 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:52:12,370 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:52:12,372 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:52:12,374 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:52:12,375 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:52:12,377 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 02:52:12,420 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:52:12,421 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 02:52:12,435 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:52:12,436 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:52:12,438 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:52:12,439 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 02:52:12,457 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:52:12,459 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 02:52:12,492 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:52:12,494 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:52:12,495 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 02:52:12,508 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:52:12,509 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:52:12,510 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 02:52:12,526 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:52:12,528 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:52:12,530 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:52:12,531 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 02:52:12,571 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:52:12,573 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:52:12,576 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:52:12,578 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:52:12,580 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:52:12,581 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:52:12,583 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:52:12,585 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:52:12,588 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:52:12,589 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 02:52:12,705 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:52:12,707 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:52:12,750 INFO L356 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2022-11-03 02:52:12,750 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 02:52:12,781 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:52:12,783 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:52:12,785 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:52:12,789 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:52:12,791 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:52:12,792 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:52:12,821 INFO L356 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2022-11-03 02:52:12,821 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 02:52:12,847 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:52:12,848 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:52:12,888 INFO L356 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2022-11-03 02:52:12,889 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 02:52:13,052 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:52:13,054 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:52:13,055 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:52:13,093 INFO L356 Elim1Store]: treesize reduction 87, result has 11.2 percent of original size [2022-11-03 02:52:13,094 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 02:52:13,120 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:52:13,123 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:52:13,125 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:52:13,126 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:52:13,129 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:52:13,141 INFO L356 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-11-03 02:52:13,142 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 02:52:13,172 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:52:13,173 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:52:13,175 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:52:13,176 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:52:13,226 INFO L356 Elim1Store]: treesize reduction 64, result has 29.7 percent of original size [2022-11-03 02:52:13,227 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 02:52:13,400 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:52:13,534 INFO L356 Elim1Store]: treesize reduction 156, result has 13.8 percent of original size [2022-11-03 02:52:13,534 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 02:52:13,732 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 02:52:13,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, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 02:52:13,754 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-03 02:52:13,780 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2022-11-03 02:52:13,790 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 02:52:13,801 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:52:13,802 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 02:52:13,875 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-03 02:52:13,875 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-03 02:52:13,889 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 02:52:13,936 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-03 02:52:13,947 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 02:52:13,956 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 02:52:13,984 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:52:13,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 80 treesize of output 56 [2022-11-03 02:52:14,017 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 02:52:14,033 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2022-11-03 02:52:14,119 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-03 02:52:14,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 02:52:14,151 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-03 02:52:14,151 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-03 02:52:14,173 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 02:52:15,411 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1176#(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 02:52:15,411 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-03 02:52:15,411 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 02:52:15,411 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 9] total 18 [2022-11-03 02:52:15,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65328070] [2022-11-03 02:52:15,412 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 02:52:15,412 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-11-03 02:52:15,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:52:15,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-03 02:52:15,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=547, Unknown=1, NotChecked=50, Total=756 [2022-11-03 02:52:15,413 INFO L87 Difference]: Start difference. First operand 57 states and 61 transitions. Second operand has 20 states, 19 states have (on average 3.0526315789473686) 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 02:52:15,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:52:15,680 INFO L93 Difference]: Finished difference Result 78 states and 84 transitions. [2022-11-03 02:52:15,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-03 02:52:15,681 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 3.0526315789473686) 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 22 [2022-11-03 02:52:15,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:52:15,681 INFO L225 Difference]: With dead ends: 78 [2022-11-03 02:52:15,682 INFO L226 Difference]: Without dead ends: 78 [2022-11-03 02:52:15,682 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 47 SyntacticMatches, 5 SemanticMatches, 30 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 371 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=233, Invalid=700, Unknown=1, NotChecked=58, Total=992 [2022-11-03 02:52:15,683 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 254 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 58 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 02:52:15,683 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [254 Valid, 70 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 46 Invalid, 0 Unknown, 58 Unchecked, 0.1s Time] [2022-11-03 02:52:15,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-11-03 02:52:15,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 56. [2022-11-03 02:52:15,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 42 states have (on average 1.4285714285714286) 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 02:52:15,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 60 transitions. [2022-11-03 02:52:15,689 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 60 transitions. Word has length 22 [2022-11-03 02:52:15,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:52:15,689 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 60 transitions. [2022-11-03 02:52:15,689 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 3.0526315789473686) 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 02:52:15,690 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 60 transitions. [2022-11-03 02:52:15,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-03 02:52:15,690 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:52:15,691 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:52:15,733 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0afaf1dc-a57a-4f92-a996-a03ff1c427d9/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-03 02:52:15,915 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0afaf1dc-a57a-4f92-a996-a03ff1c427d9/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:52:15,915 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-11-03 02:52:15,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:52:15,916 INFO L85 PathProgramCache]: Analyzing trace with hash 908748822, now seen corresponding path program 1 times [2022-11-03 02:52:15,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:52:15,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289268903] [2022-11-03 02:52:15,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:52:15,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:52:15,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:52:16,092 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 02:52:16,092 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:52:16,092 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289268903] [2022-11-03 02:52:16,093 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1289268903] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:52:16,093 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:52:16,093 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-03 02:52:16,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527191397] [2022-11-03 02:52:16,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:52:16,094 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-03 02:52:16,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:52:16,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-03 02:52:16,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-03 02:52:16,096 INFO L87 Difference]: Start difference. First operand 56 states and 60 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 02:52:16,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:52:16,212 INFO L93 Difference]: Finished difference Result 81 states and 87 transitions. [2022-11-03 02:52:16,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-03 02:52:16,212 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 02:52:16,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:52:16,213 INFO L225 Difference]: With dead ends: 81 [2022-11-03 02:52:16,213 INFO L226 Difference]: Without dead ends: 81 [2022-11-03 02:52:16,214 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 02:52:16,215 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 105 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 02:52:16,215 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 57 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 02:52:16,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-11-03 02:52:16,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 57. [2022-11-03 02:52:16,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 43 states have (on average 1.441860465116279) internal successors, (62), 56 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 02:52:16,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 62 transitions. [2022-11-03 02:52:16,221 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 62 transitions. Word has length 23 [2022-11-03 02:52:16,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:52:16,222 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 62 transitions. [2022-11-03 02:52:16,222 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 02:52:16,222 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 62 transitions. [2022-11-03 02:52:16,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-03 02:52:16,223 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:52:16,223 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:52:16,223 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-03 02:52:16,224 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-11-03 02:52:16,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:52:16,225 INFO L85 PathProgramCache]: Analyzing trace with hash 908748823, now seen corresponding path program 1 times [2022-11-03 02:52:16,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:52:16,225 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495436931] [2022-11-03 02:52:16,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:52:16,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:52:16,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:52:16,531 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 02:52:16,532 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:52:16,532 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495436931] [2022-11-03 02:52:16,532 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1495436931] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:52:16,532 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:52:16,532 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-03 02:52:16,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602706422] [2022-11-03 02:52:16,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:52:16,533 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-03 02:52:16,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:52:16,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-03 02:52:16,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-03 02:52:16,533 INFO L87 Difference]: Start difference. First operand 57 states and 62 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 02:52:16,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:52:16,642 INFO L93 Difference]: Finished difference Result 62 states and 66 transitions. [2022-11-03 02:52:16,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-03 02:52:16,642 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 02:52:16,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:52:16,643 INFO L225 Difference]: With dead ends: 62 [2022-11-03 02:52:16,643 INFO L226 Difference]: Without dead ends: 62 [2022-11-03 02:52:16,643 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 02:52:16,644 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 95 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 02:52:16,644 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 46 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 02:52:16,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-11-03 02:52:16,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 60. [2022-11-03 02:52:16,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 46 states have (on average 1.4130434782608696) internal successors, (65), 59 states have internal predecessors, (65), 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 02:52:16,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 65 transitions. [2022-11-03 02:52:16,648 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 65 transitions. Word has length 23 [2022-11-03 02:52:16,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:52:16,649 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 65 transitions. [2022-11-03 02:52:16,649 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 02:52:16,649 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 65 transitions. [2022-11-03 02:52:16,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-03 02:52:16,649 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:52:16,650 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:52:16,650 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-03 02:52:16,650 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-11-03 02:52:16,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:52:16,650 INFO L85 PathProgramCache]: Analyzing trace with hash 1429257941, now seen corresponding path program 1 times [2022-11-03 02:52:16,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:52:16,651 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357919830] [2022-11-03 02:52:16,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:52:16,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:52:16,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:52:17,499 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 02:52:17,500 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:52:17,500 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357919830] [2022-11-03 02:52:17,500 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [357919830] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:52:17,500 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [737220002] [2022-11-03 02:52:17,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:52:17,501 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:52:17,501 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0afaf1dc-a57a-4f92-a996-a03ff1c427d9/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:52:17,502 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0afaf1dc-a57a-4f92-a996-a03ff1c427d9/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:52:17,525 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0afaf1dc-a57a-4f92-a996-a03ff1c427d9/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-03 02:52:17,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:52:17,669 INFO L263 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 33 conjunts are in the unsatisfiable core [2022-11-03 02:52:17,672 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:52:17,841 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 02:52:17,897 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:52:17,898 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 02:52:17,936 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-11-03 02:52:17,958 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 02:52:17,959 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:52:19,241 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 02:52:19,395 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 02:52:19,396 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [737220002] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:52:19,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2018966644] [2022-11-03 02:52:19,398 INFO L159 IcfgInterpreter]: Started Sifa with 13 locations of interest [2022-11-03 02:52:19,399 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 02:52:19,399 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 02:52:19,399 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 02:52:19,399 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 02:52:19,416 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:52:19,418 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:52:19,419 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2022-11-03 02:52:19,445 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:52:19,447 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 02:52:19,456 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 02:52:19,467 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 02:52:19,488 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:52:19,490 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 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 02:52:19,502 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:52:19,504 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2022-11-03 02:52:19,517 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:52:19,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, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2022-11-03 02:52:19,550 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:52:19,552 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:52:19,554 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:52:19,556 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:52:19,557 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:52:19,559 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 02:52:19,596 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:52:19,598 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:52:19,600 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:52:19,601 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 02:52:19,616 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:52:19,617 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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 02:52:19,635 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:52:19,636 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 02:52:19,677 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:52:19,679 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:52:19,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, 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 02:52:19,699 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:52:19,700 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:52:19,702 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:52:19,704 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 02:52:19,724 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:52:19,732 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:52:19,734 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 02:52:19,902 INFO L356 Elim1Store]: treesize reduction 92, result has 21.4 percent of original size [2022-11-03 02:52:19,903 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 02:52:20,138 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:52:20,139 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:52:20,161 INFO L356 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2022-11-03 02:52:20,161 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 02:52:20,189 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:52:20,220 INFO L356 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2022-11-03 02:52:20,221 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 02:52:20,257 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:52:20,292 INFO L356 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2022-11-03 02:52:20,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 332 treesize of output 330 [2022-11-03 02:52:20,428 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:52:20,430 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:52:20,431 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:52:20,441 INFO L356 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-11-03 02:52:20,441 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 02:52:20,463 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:52:20,464 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:52:20,466 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:52:20,467 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:52:20,501 INFO L356 Elim1Store]: treesize reduction 58, result has 26.6 percent of original size [2022-11-03 02:52:20,501 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 02:52:20,526 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:52:20,528 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:52:20,530 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:52:20,539 INFO L356 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2022-11-03 02:52:20,540 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 02:52:20,633 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-03 02:52:20,639 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-03 02:52:20,658 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 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 02:52:20,665 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 02:52:20,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 02:52:20,692 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:52:20,693 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 02:52:20,701 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 02:52:20,710 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 02:52:20,730 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-03 02:52:20,740 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-03 02:52:20,758 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 02:52:20,767 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 02:52:20,775 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 02:52:20,810 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 02:52:20,822 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 02:52:20,832 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-03 02:52:20,870 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 02:52:22,408 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1772#(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 02:52:22,408 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-03 02:52:22,408 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 02:52:22,408 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 17 [2022-11-03 02:52:22,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511854547] [2022-11-03 02:52:22,409 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 02:52:22,409 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-11-03 02:52:22,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:52:22,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-11-03 02:52:22,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=542, Unknown=1, NotChecked=48, Total=702 [2022-11-03 02:52:22,410 INFO L87 Difference]: Start difference. First operand 60 states and 65 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 02:52:23,129 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 02:52:25,168 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 02:52:25,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:52:25,337 INFO L93 Difference]: Finished difference Result 60 states and 64 transitions. [2022-11-03 02:52:25,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-03 02:52:25,337 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 02:52:25,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:52:25,338 INFO L225 Difference]: With dead ends: 60 [2022-11-03 02:52:25,338 INFO L226 Difference]: Without dead ends: 60 [2022-11-03 02:52:25,339 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 02:52:25,340 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 12 mSDsluCounter, 375 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 389 SdHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 17 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 02:52:25,340 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 389 Invalid, 259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 231 Invalid, 0 Unknown, 17 Unchecked, 0.2s Time] [2022-11-03 02:52:25,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-11-03 02:52:25,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2022-11-03 02:52:25,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 46 states have (on average 1.391304347826087) internal successors, (64), 59 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 02:52:25,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 64 transitions. [2022-11-03 02:52:25,343 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 64 transitions. Word has length 25 [2022-11-03 02:52:25,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:52:25,344 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 64 transitions. [2022-11-03 02:52:25,344 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 02:52:25,344 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 64 transitions. [2022-11-03 02:52:25,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-03 02:52:25,345 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:52:25,345 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:52:25,382 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0afaf1dc-a57a-4f92-a996-a03ff1c427d9/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-03 02:52:25,565 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0afaf1dc-a57a-4f92-a996-a03ff1c427d9/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:52:25,565 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-11-03 02:52:25,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:52:25,566 INFO L85 PathProgramCache]: Analyzing trace with hash -1282284476, now seen corresponding path program 1 times [2022-11-03 02:52:25,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:52:25,566 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784763818] [2022-11-03 02:52:25,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:52:25,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:52:25,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:52:26,824 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 02:52:26,825 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:52:26,825 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784763818] [2022-11-03 02:52:26,825 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [784763818] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:52:26,825 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [526585014] [2022-11-03 02:52:26,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:52:26,825 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:52:26,826 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0afaf1dc-a57a-4f92-a996-a03ff1c427d9/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:52:26,828 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0afaf1dc-a57a-4f92-a996-a03ff1c427d9/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:52:26,857 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0afaf1dc-a57a-4f92-a996-a03ff1c427d9/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-03 02:52:26,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:52:27,001 INFO L263 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 60 conjunts are in the unsatisfiable core [2022-11-03 02:52:27,018 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:52:27,043 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-03 02:52:27,084 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-03 02:52:27,084 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 02:52:27,159 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 02:52:27,177 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 02:52:27,224 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:52:27,225 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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 02:52:27,236 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:52:27,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, 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 02:52:27,313 INFO L356 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-03 02:52:27,313 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 02:52:27,327 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-03 02:52:27,328 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 02:52:27,539 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:52:27,543 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-03 02:52:27,543 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 02:52:27,552 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:52:27,555 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-03 02:52:27,556 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 02:52:27,594 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:52:27,594 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 02:52:27,605 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:52:27,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 35 treesize of output 31 [2022-11-03 02:52:27,661 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 02:52:27,662 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:52:29,775 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 02:52:31,817 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 02:52:32,100 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 02:52:32,100 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [526585014] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:52:32,100 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1960060846] [2022-11-03 02:52:32,103 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2022-11-03 02:52:32,103 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 02:52:32,103 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 02:52:32,103 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 02:52:32,104 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 02:52:32,124 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:52:32,126 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:52:32,127 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2022-11-03 02:52:32,161 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 02:52:32,170 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 02:52:32,180 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:52:32,181 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 02:52:32,203 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:52:32,204 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 02:52:32,220 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:52:32,221 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2022-11-03 02:52:32,233 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:52:32,234 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2022-11-03 02:52:32,262 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:52:32,264 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:52:32,265 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:52:32,267 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:52:32,268 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:52:32,269 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 02:52:32,308 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:52:32,309 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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 02:52:32,323 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:52:32,325 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 02:52:32,342 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:52:32,344 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:52:32,345 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:52:32,347 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 02:52:32,381 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:52:32,383 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:52:32,384 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 02:52:32,402 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:52:32,404 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:52:32,405 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 02:52:32,420 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:52:32,421 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:52:32,423 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:52:32,424 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 02:52:32,601 INFO L356 Elim1Store]: treesize reduction 92, result has 21.4 percent of original size [2022-11-03 02:52:32,602 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 02:52:32,795 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:52:32,796 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:52:32,832 INFO L356 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2022-11-03 02:52:32,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, 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 02:52:32,881 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:52:32,882 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:52:32,920 INFO L356 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2022-11-03 02:52:32,920 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 02:52:32,946 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:52:32,947 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:52:32,949 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:52:32,950 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:52:32,951 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:52:32,974 INFO L356 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2022-11-03 02:52:32,974 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 02:52:33,064 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:52:33,066 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:52:33,067 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:52:33,068 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:52:33,069 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:52:33,078 INFO L356 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-11-03 02:52:33,078 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 02:52:33,100 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:52:33,101 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:52:33,102 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:52:33,103 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:52:33,143 INFO L356 Elim1Store]: treesize reduction 64, result has 29.7 percent of original size [2022-11-03 02:52:33,144 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 02:52:33,165 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:52:33,167 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:52:33,168 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:52:33,196 INFO L356 Elim1Store]: treesize reduction 87, result has 11.2 percent of original size [2022-11-03 02:52:33,197 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 02:52:33,279 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-03 02:52:33,287 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-03 02:52:33,302 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 02:52:33,310 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 02:52:33,317 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 02:52:33,333 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 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 02:52:33,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 13 treesize of output 9 [2022-11-03 02:52:33,351 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:52:33,352 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 02:52:33,372 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-03 02:52:33,378 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-03 02:52:33,397 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 02:52:33,405 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 02:52:33,413 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 02:52:33,442 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-03 02:52:33,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, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 02:52:33,468 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 02:52:33,523 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 13 [2022-11-03 02:52:33,537 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:52:33,538 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 02:52:33,569 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:52:33,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, 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 02:52:33,674 INFO L356 Elim1Store]: treesize reduction 39, result has 18.8 percent of original size [2022-11-03 02:52:33,674 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 02:52:33,695 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:52:33,756 INFO L356 Elim1Store]: treesize reduction 48, result has 47.3 percent of original size [2022-11-03 02:52:33,756 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 02:52:33,785 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:52:33,834 INFO L356 Elim1Store]: treesize reduction 56, result has 38.5 percent of original size [2022-11-03 02:52:33,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 2 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 41 [2022-11-03 02:52:33,843 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2022-11-03 02:52:33,853 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2022-11-03 02:52:34,120 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2022-11-03 02:52:34,128 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2022-11-03 02:52:34,135 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 13 [2022-11-03 02:52:34,243 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2022-11-03 02:52:34,252 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 13 [2022-11-03 02:52:34,261 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2022-11-03 02:52:34,266 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 02:52:35,556 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2103#(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 02:52:35,556 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-03 02:52:35,556 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 02:52:35,556 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 22 [2022-11-03 02:52:35,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191468603] [2022-11-03 02:52:35,557 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 02:52:35,557 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-11-03 02:52:35,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:52:35,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-11-03 02:52:35,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=867, Unknown=2, NotChecked=122, Total=1122 [2022-11-03 02:52:35,559 INFO L87 Difference]: Start difference. First operand 60 states and 64 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 02:53:17,550 WARN L234 SmtUtils]: Spent 21.60s 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 02:53:19,553 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 02:53:19,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:53:19,866 INFO L93 Difference]: Finished difference Result 95 states and 103 transitions. [2022-11-03 02:53:19,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-03 02:53:19,867 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 02:53:19,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:53:19,868 INFO L225 Difference]: With dead ends: 95 [2022-11-03 02:53:19,868 INFO L226 Difference]: Without dead ends: 95 [2022-11-03 02:53:19,869 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 360 ImplicationChecksByTransitivity, 49.8s TimeCoverageRelationStatistics Valid=196, Invalid=1209, Unknown=13, NotChecked=222, Total=1640 [2022-11-03 02:53:19,870 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 88 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 339 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 579 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 214 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-03 02:53:19,870 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 138 Invalid, 579 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 339 Invalid, 0 Unknown, 214 Unchecked, 0.3s Time] [2022-11-03 02:53:19,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2022-11-03 02:53:19,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 68. [2022-11-03 02:53:19,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 54 states have (on average 1.462962962962963) internal successors, (79), 67 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 02:53:19,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 79 transitions. [2022-11-03 02:53:19,875 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 79 transitions. Word has length 28 [2022-11-03 02:53:19,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:53:19,876 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 79 transitions. [2022-11-03 02:53:19,876 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 02:53:19,876 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 79 transitions. [2022-11-03 02:53:19,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-03 02:53:19,877 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:53:19,877 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:53:19,926 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0afaf1dc-a57a-4f92-a996-a03ff1c427d9/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-03 02:53:20,093 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0afaf1dc-a57a-4f92-a996-a03ff1c427d9/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-11-03 02:53:20,093 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-11-03 02:53:20,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:53:20,094 INFO L85 PathProgramCache]: Analyzing trace with hash -1282284475, now seen corresponding path program 1 times [2022-11-03 02:53:20,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:53:20,094 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568609720] [2022-11-03 02:53:20,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:53:20,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:53:20,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:53:21,448 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 02:53:21,449 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:53:21,449 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568609720] [2022-11-03 02:53:21,449 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [568609720] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:53:21,449 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1837664310] [2022-11-03 02:53:21,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:53:21,449 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:53:21,449 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0afaf1dc-a57a-4f92-a996-a03ff1c427d9/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:53:21,450 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0afaf1dc-a57a-4f92-a996-a03ff1c427d9/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:53:21,451 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0afaf1dc-a57a-4f92-a996-a03ff1c427d9/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-03 02:53:21,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:53:21,625 INFO L263 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 58 conjunts are in the unsatisfiable core [2022-11-03 02:53:21,629 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:53:21,800 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-03 02:53:21,801 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 02:53:21,873 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 02:53:21,881 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 02:53:21,955 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:53:21,956 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 02:53:21,963 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:53:21,969 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 02:53:22,055 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:53:22,070 INFO L356 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-03 02:53:22,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, 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 02:53:22,079 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:53:22,090 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-03 02:53:22,090 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 02:53:22,518 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:53:22,569 INFO L356 Elim1Store]: treesize reduction 64, result has 32.6 percent of original size [2022-11-03 02:53:22,569 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 02:53:22,581 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:53:22,636 INFO L356 Elim1Store]: treesize reduction 64, result has 32.6 percent of original size [2022-11-03 02:53:22,636 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 02:53:22,952 INFO L356 Elim1Store]: treesize reduction 12, result has 63.6 percent of original size [2022-11-03 02:53:22,953 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 02:53:22,998 INFO L356 Elim1Store]: treesize reduction 12, result has 63.6 percent of original size [2022-11-03 02:53:22,998 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 02:53:23,218 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 02:53:23,218 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:53:25,449 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$.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|) (<= 0 (+ .cse0 4))))) (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (or (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (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|)) (<= 0 (+ (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)))) (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (let ((.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|))) (or (<= (+ .cse1 8) (select |c_#length| (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|))) (= .cse1 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)))) (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (let ((.cse2 (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 (<= (+ (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|) 8) (select |c_#length| .cse2)) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse2))))) is different from false [2022-11-03 02:53:27,573 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|)) (.cse5 (select |c_#memory_$Pointer$.offset| |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_940 Int) (v_ArrVal_939 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (let ((.cse0 (select (select (let ((.cse4 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store .cse5 .cse3 v_ArrVal_939)))) (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|))) (or (<= (+ .cse0 8) (select |c_#length| (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_940)))) (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|))) (= .cse0 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)))) (forall ((v_ArrVal_940 Int) (v_ArrVal_939 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (let ((.cse7 (select (select (let ((.cse8 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store .cse2 .cse3 v_ArrVal_940)))) (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 (let ((.cse6 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store .cse5 .cse3 v_ArrVal_939)))) (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|) 8) (select |c_#length| .cse7)) (= .cse7 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|)))) (forall ((v_ArrVal_939 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 .cse5 .cse3 v_ArrVal_939)))) (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 (= .cse9 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) (<= 0 (+ .cse9 4))))) (forall ((v_ArrVal_940 Int) (v_ArrVal_939 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (or (= (select (select (let ((.cse11 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store .cse2 .cse3 v_ArrVal_940)))) (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.base|))) |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.base|) (<= 0 (+ (select (select (let ((.cse12 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store .cse5 .cse3 v_ArrVal_939)))) (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.offset|))) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) 4)))))) is different from false [2022-11-03 02:53:29,930 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 02:53:29,962 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 02:53:29,962 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1837664310] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:53:29,963 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [452240376] [2022-11-03 02:53:29,965 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2022-11-03 02:53:29,965 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 02:53:29,966 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 02:53:29,966 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 02:53:29,966 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 02:53:29,998 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:53:29,999 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:53:30,000 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2022-11-03 02:53:30,028 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:53:30,029 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 02:53:30,041 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 02:53:30,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, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 02:53:30,074 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:53:30,075 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2022-11-03 02:53:30,090 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:53:30,091 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 02:53:30,104 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:53:30,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 02:53:30,129 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:53:30,131 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:53:30,132 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:53:30,134 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:53:30,136 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:53:30,137 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 02:53:30,178 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:53:30,180 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:53:30,181 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:53:30,183 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 02:53:30,198 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:53:30,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, 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 02:53:30,218 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:53:30,219 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 02:53:30,247 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:53:30,249 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:53:30,250 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 02:53:30,264 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:53:30,265 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:53:30,266 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 02:53:30,284 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:53:30,286 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:53:30,287 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:53:30,289 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 02:53:30,458 INFO L356 Elim1Store]: treesize reduction 92, result has 21.4 percent of original size [2022-11-03 02:53:30,459 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 02:53:30,686 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:53:30,687 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:53:30,714 INFO L356 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2022-11-03 02:53:30,714 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 02:53:30,738 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:53:30,782 INFO L356 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2022-11-03 02:53:30,783 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 02:53:30,804 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:53:30,845 INFO L356 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2022-11-03 02:53:30,845 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 02:53:30,967 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:53:30,969 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:53:30,969 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:53:30,971 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:53:31,015 INFO L356 Elim1Store]: treesize reduction 58, result has 26.6 percent of original size [2022-11-03 02:53:31,016 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 02:53:31,042 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:53:31,045 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:53:31,046 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:53:31,057 INFO L356 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2022-11-03 02:53:31,058 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 02:53:31,080 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:53:31,082 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:53:31,083 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:53:31,093 INFO L356 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-11-03 02:53:31,094 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 02:53:31,189 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-03 02:53:31,197 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-03 02:53:31,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 02:53:31,222 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 02:53:31,232 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 02:53:31,253 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 02:53:31,262 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 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 02:53:31,275 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:53:31,276 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 02:53:31,319 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-03 02:53:31,327 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-03 02:53:31,348 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 02:53:31,357 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 02:53:31,366 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 02:53:31,401 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 02:53:31,413 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-03 02:53:31,424 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 02:53:31,478 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 13 [2022-11-03 02:53:31,505 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:53:31,506 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 02:53:31,527 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:53:31,528 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 02:53:31,614 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:53:31,684 INFO L356 Elim1Store]: treesize reduction 48, result has 47.3 percent of original size [2022-11-03 02:53:31,684 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 02:53:31,729 INFO L356 Elim1Store]: treesize reduction 39, result has 18.8 percent of original size [2022-11-03 02:53:31,730 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 30 [2022-11-03 02:53:31,765 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:53:31,824 INFO L356 Elim1Store]: treesize reduction 56, result has 38.5 percent of original size [2022-11-03 02:53:31,825 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 02:53:31,841 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2022-11-03 02:53:31,847 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2022-11-03 02:53:32,086 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 13 [2022-11-03 02:53:32,095 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2022-11-03 02:53:32,108 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2022-11-03 02:53:32,202 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 13 [2022-11-03 02:53:32,210 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2022-11-03 02:53:32,219 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2022-11-03 02:53:32,227 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 02:53:33,884 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2480#(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 02:53:33,884 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-03 02:53:33,884 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 02:53:33,884 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 26 [2022-11-03 02:53:33,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20736820] [2022-11-03 02:53:33,885 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 02:53:33,885 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-11-03 02:53:33,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:53:33,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-11-03 02:53:33,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=1113, Unknown=2, NotChecked=138, Total=1406 [2022-11-03 02:53:33,887 INFO L87 Difference]: Start difference. First operand 68 states and 79 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 02:53:36,322 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|))) (let ((.cse16 (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|)) (.cse20 (select |c_#length| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|)) (.cse5 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|)) (.cse23 (select .cse2 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (let ((.cse6 (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|)) (.cse9 (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| .cse23)) (.cse8 (select |c_#length| .cse23)) (.cse3 (+ 4 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) (.cse17 (<= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0)) (.cse15 (select .cse5 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) (.cse7 (= .cse20 8)) (.cse18 (not .cse16)) (.cse19 (< |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| (+ |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 1)))) (and (forall ((v_ArrVal_940 Int) (v_ArrVal_939 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (let ((.cse0 (select (select (let ((.cse4 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store .cse5 .cse3 v_ArrVal_939)))) (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|))) (or (<= (+ .cse0 8) (select |c_#length| (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_940)))) (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|))) (= .cse0 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)))) (or .cse6 .cse7) (or (<= 8 .cse8) .cse9) (forall ((v_ArrVal_940 Int) (v_ArrVal_939 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (let ((.cse11 (select (select (let ((.cse12 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store .cse2 .cse3 v_ArrVal_940)))) (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|))) |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 (let ((.cse10 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store .cse5 .cse3 v_ArrVal_939)))) (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|) 8) (select |c_#length| .cse11)) (= .cse11 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|)))) (forall ((v_ArrVal_939 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (let ((.cse13 (select (select (let ((.cse14 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store .cse5 .cse3 v_ArrVal_939)))) (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.offset|))) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (or (= .cse13 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) (<= 0 (+ .cse13 4))))) (or (= .cse15 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) .cse16) .cse17 (<= 0 |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset|) (or .cse18 .cse19) (or (<= (+ |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 8) .cse20) .cse6) (or .cse9 .cse16 (= .cse8 8)) (forall ((v_ArrVal_940 Int) (v_ArrVal_939 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (or (= (select (select (let ((.cse21 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store .cse2 .cse3 v_ArrVal_940)))) (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| |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|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) (<= 0 (+ (select (select (let ((.cse22 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store .cse5 .cse3 v_ArrVal_939)))) (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| |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)))) (or .cse18 .cse17) (= .cse15 0) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) .cse7 (= |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 .cse18 (and .cse19 (<= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (= (select |c_#length| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) 8))))) is different from false [2022-11-03 02:53:38,356 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 ((.cse2 (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse7)) (.cse3 (select |c_#length| .cse7)) (.cse5 (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|)) (.cse4 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (and (forall ((|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|) (<= 0 (+ .cse0 4))))) (<= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (<= 0 |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset|) (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (or (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (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|)) (<= 0 (+ (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)))) (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (let ((.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|))) (or (<= (+ .cse1 8) (select |c_#length| (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|))) (= .cse1 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)))) (or .cse2 (<= 8 .cse3)) (= .cse4 0) (or .cse2 (= .cse3 8) .cse5) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (= (select |c_#length| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 8) (or (and (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) .cse5) (and (not .cse5) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| .cse4))) (forall ((|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 (<= (+ (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|) 8) (select |c_#length| .cse6)) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse6))))))) is different from false [2022-11-03 02:53:40,367 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 ((.cse2 (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse7)) (.cse3 (select |c_#length| .cse7)) (.cse5 (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|)) (.cse4 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (and (forall ((|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|) (<= 0 (+ .cse0 4))))) (<= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (<= 0 |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset|) (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (or (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (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|)) (<= 0 (+ (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)))) (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (let ((.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|))) (or (<= (+ .cse1 8) (select |c_#length| (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|))) (= .cse1 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)))) (or .cse2 (<= 8 .cse3)) (= .cse4 0) (or .cse2 (= .cse3 8) .cse5) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (or (and (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) .cse5) (and (not .cse5) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| .cse4))) (forall ((|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 (<= (+ (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|) 8) (select |c_#length| .cse6)) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse6))))))) is different from false [2022-11-03 02:53:40,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:53:40,892 INFO L93 Difference]: Finished difference Result 88 states and 93 transitions. [2022-11-03 02:53:40,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-03 02:53:40,893 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 02:53:40,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:53:40,894 INFO L225 Difference]: With dead ends: 88 [2022-11-03 02:53:40,894 INFO L226 Difference]: Without dead ends: 88 [2022-11-03 02:53:40,896 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 53 SyntacticMatches, 5 SemanticMatches, 45 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 466 ImplicationChecksByTransitivity, 15.1s TimeCoverageRelationStatistics Valid=207, Invalid=1530, Unknown=5, NotChecked=420, Total=2162 [2022-11-03 02:53:40,896 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 74 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 499 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 679 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 499 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 164 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-03 02:53:40,897 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 181 Invalid, 679 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 499 Invalid, 0 Unknown, 164 Unchecked, 0.5s Time] [2022-11-03 02:53:40,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2022-11-03 02:53:40,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 71. [2022-11-03 02:53:40,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 57 states have (on average 1.4210526315789473) internal successors, (81), 70 states have internal predecessors, (81), 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 02:53:40,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 81 transitions. [2022-11-03 02:53:40,902 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 81 transitions. Word has length 28 [2022-11-03 02:53:40,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:53:40,903 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 81 transitions. [2022-11-03 02:53:40,903 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 02:53:40,903 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 81 transitions. [2022-11-03 02:53:40,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-03 02:53:40,904 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:53:40,904 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 02:53:40,955 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0afaf1dc-a57a-4f92-a996-a03ff1c427d9/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-03 02:53:41,125 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0afaf1dc-a57a-4f92-a996-a03ff1c427d9/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-11-03 02:53:41,125 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-11-03 02:53:41,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:53:41,126 INFO L85 PathProgramCache]: Analyzing trace with hash -1096114215, now seen corresponding path program 1 times [2022-11-03 02:53:41,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:53:41,126 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283161455] [2022-11-03 02:53:41,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:53:41,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:53:41,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:53:41,302 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 02:53:41,303 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:53:41,303 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283161455] [2022-11-03 02:53:41,303 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1283161455] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:53:41,303 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:53:41,304 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-03 02:53:41,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670317368] [2022-11-03 02:53:41,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:53:41,305 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-03 02:53:41,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:53:41,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-03 02:53:41,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-03 02:53:41,306 INFO L87 Difference]: Start difference. First operand 71 states and 81 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 02:53:41,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:53:41,523 INFO L93 Difference]: Finished difference Result 115 states and 128 transitions. [2022-11-03 02:53:41,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-03 02:53:41,524 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 02:53:41,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:53:41,525 INFO L225 Difference]: With dead ends: 115 [2022-11-03 02:53:41,525 INFO L226 Difference]: Without dead ends: 115 [2022-11-03 02:53:41,525 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-11-03 02:53:41,526 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 218 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 02:53:41,526 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [218 Valid, 70 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 02:53:41,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2022-11-03 02:53:41,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 77. [2022-11-03 02:53:41,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 63 states have (on average 1.4285714285714286) internal successors, (90), 76 states have internal predecessors, (90), 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 02:53:41,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 90 transitions. [2022-11-03 02:53:41,530 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 90 transitions. Word has length 29 [2022-11-03 02:53:41,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:53:41,530 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 90 transitions. [2022-11-03 02:53:41,531 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 02:53:41,531 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 90 transitions. [2022-11-03 02:53:41,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-03 02:53:41,531 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:53:41,531 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 02:53:41,532 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-03 02:53:41,532 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-11-03 02:53:41,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:53:41,532 INFO L85 PathProgramCache]: Analyzing trace with hash -1096114214, now seen corresponding path program 1 times [2022-11-03 02:53:41,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:53:41,533 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342801097] [2022-11-03 02:53:41,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:53:41,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:53:41,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:53:41,864 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 02:53:41,865 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:53:41,865 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342801097] [2022-11-03 02:53:41,865 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342801097] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:53:41,865 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:53:41,865 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-03 02:53:41,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947942625] [2022-11-03 02:53:41,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:53:41,866 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-03 02:53:41,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:53:41,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-03 02:53:41,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-11-03 02:53:41,867 INFO L87 Difference]: Start difference. First operand 77 states and 90 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 02:53:42,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:53:42,180 INFO L93 Difference]: Finished difference Result 101 states and 112 transitions. [2022-11-03 02:53:42,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-03 02:53:42,181 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 02:53:42,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:53:42,181 INFO L225 Difference]: With dead ends: 101 [2022-11-03 02:53:42,181 INFO L226 Difference]: Without dead ends: 101 [2022-11-03 02:53:42,182 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2022-11-03 02:53:42,182 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 196 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 02:53:42,182 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 58 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 02:53:42,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2022-11-03 02:53:42,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 83. [2022-11-03 02:53:42,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 69 states have (on average 1.4492753623188406) internal successors, (100), 82 states have internal predecessors, (100), 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 02:53:42,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 100 transitions. [2022-11-03 02:53:42,186 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 100 transitions. Word has length 29 [2022-11-03 02:53:42,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:53:42,186 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 100 transitions. [2022-11-03 02:53:42,186 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 02:53:42,186 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 100 transitions. [2022-11-03 02:53:42,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-03 02:53:42,187 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:53:42,187 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 02:53:42,187 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-03 02:53:42,187 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-11-03 02:53:42,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:53:42,188 INFO L85 PathProgramCache]: Analyzing trace with hash 380233603, now seen corresponding path program 1 times [2022-11-03 02:53:42,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:53:42,188 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486051648] [2022-11-03 02:53:42,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:53:42,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:53:42,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:53:44,408 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-03 02:53:44,409 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:53:44,409 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486051648] [2022-11-03 02:53:44,409 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [486051648] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:53:44,409 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1648760522] [2022-11-03 02:53:44,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:53:44,410 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:53:44,410 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0afaf1dc-a57a-4f92-a996-a03ff1c427d9/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:53:44,411 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0afaf1dc-a57a-4f92-a996-a03ff1c427d9/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:53:44,437 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0afaf1dc-a57a-4f92-a996-a03ff1c427d9/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-03 02:53:44,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:53:44,639 INFO L263 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 73 conjunts are in the unsatisfiable core [2022-11-03 02:53:44,643 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:53:44,827 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 02:53:44,955 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 02:53:44,964 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 02:53:44,984 INFO L356 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-11-03 02:53:44,985 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 02:53:44,991 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 02:53:45,065 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:53:45,066 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 02:53:45,099 INFO L356 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-11-03 02:53:45,100 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 02:53:45,116 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:53:45,117 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 02:53:45,228 INFO L356 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-03 02:53:45,228 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 02:53:45,246 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-03 02:53:45,248 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 02:53:45,254 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 02:53:45,486 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:53:45,491 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-03 02:53:45,491 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 02:53:45,498 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:53:45,502 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-03 02:53:45,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, 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 02:53:45,530 INFO L356 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-11-03 02:53:45,530 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 02:53:45,536 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 02:53:45,622 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-03 02:53:45,622 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 02:53:45,643 INFO L356 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2022-11-03 02:53:45,643 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 02:53:45,760 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 02:53:45,798 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 02:53:45,799 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:53:46,103 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1294 Int) (v_ArrVal_1298 (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 (= (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_1294)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| v_ArrVal_1298) (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|) (= .cse0 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)))) (forall ((v_ArrVal_1294 Int) (v_ArrVal_1298 (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_1294)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| v_ArrVal_1298) .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 02:53:46,195 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|)) (.cse3 (select |c_#memory_$Pointer$.base| |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_1294 Int) (v_ArrVal_1286 Int) (v_ArrVal_1285 Int) (v_ArrVal_1288 (Array Int Int)) (v_ArrVal_1298 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (let ((.cse0 (select (select (let ((.cse5 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store .cse6 .cse4 v_ArrVal_1286)))) (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|))) (or (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| .cse0) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1288))) (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| v_ArrVal_1294))) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1298) (select (select (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store .cse3 .cse4 v_ArrVal_1285)))) (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.base|))) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) (+ 4 .cse0)))))) (forall ((v_ArrVal_1294 Int) (v_ArrVal_1286 Int) (v_ArrVal_1285 Int) (v_ArrVal_1288 (Array Int Int)) (v_ArrVal_1298 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (let ((.cse8 (select (select (let ((.cse10 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store .cse3 .cse4 v_ArrVal_1285)))) (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.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_main_~data_init~0#1| (select (select (store (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1288))) (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_1294))) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1298) .cse8) (+ 4 (select (select (let ((.cse9 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store .cse6 .cse4 v_ArrVal_1286)))) (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| |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.base| .cse8)))))) is different from false [2022-11-03 02:53:47,227 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 4)) (.cse4 (+ 4 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (let ((.cse0 (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_1294 Int) (v_ArrVal_1288 (Array Int Int)) (v_ArrVal_1298 (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_1288))) (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_1294))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1298) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse45 .cse3)) (= (select .cse45 .cse4) |c_ULTIMATE.start_main_~data_init~0#1|)))))) (= |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 ((|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_1294 Int) (v_ArrVal_1288 (Array Int Int)) (v_ArrVal_1298 (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_1288))) (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_1294))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1298) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select v_ArrVal_1298 .cse3) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse43 .cse3)) (= (select .cse43 .cse4) |c_ULTIMATE.start_main_~data_init~0#1|)))))) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|)))) (.cse6 (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) (.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 ((|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_1294 Int) (v_ArrVal_1288 (Array Int Int)) (v_ArrVal_1298 (Array Int Int))) (= |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_1288))) (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_1294))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1298) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse3))))))))) (and .cse0 .cse1 (or (forall ((v_ArrVal_1294 Int) (v_ArrVal_1288 (Array Int Int)) (v_ArrVal_1298 (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 ((.cse2 (select (store (let ((.cse5 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1288))) (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_1294))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1298) |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 .cse2 .cse3)) (= (select .cse2 .cse4) |c_ULTIMATE.start_main_~data_init~0#1|)))) .cse6) (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_1294 Int) (v_ArrVal_1288 (Array Int Int)) (v_ArrVal_1298 (Array Int Int))) (let ((.cse7 (select (store (let ((.cse8 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1288))) (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_1294))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1298) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select v_ArrVal_1298 .cse3) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse7 .cse3)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_ArrVal_1298 .cse4)) (= (select .cse7 .cse4) |c_ULTIMATE.start_main_~data_init~0#1|)))))) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (and .cse0 .cse1 (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (forall ((v_ArrVal_1294 Int) (v_ArrVal_1288 (Array Int Int)) (v_ArrVal_1298 (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_1288))) (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_1294))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1298) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse9 .cse3)) (= (select .cse9 .cse4) |c_ULTIMATE.start_main_~data_init~0#1|)))) (= |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 (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (forall ((v_ArrVal_1294 Int) (v_ArrVal_1288 (Array Int Int)) (v_ArrVal_1298 (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 ((.cse11 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1288))) (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_1294))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1298) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .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 ((v_ArrVal_1294 Int) (v_ArrVal_1288 (Array Int Int)) (v_ArrVal_1298 (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_1288))) (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_1294))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1298) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select v_ArrVal_1298 .cse3) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse12 .cse3)) (= (select .cse12 .cse4) |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 ((v_ArrVal_1294 Int) (v_ArrVal_1288 (Array Int Int)) (v_ArrVal_1298 (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_1288))) (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_1294))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1298) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select v_ArrVal_1298 .cse3) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse14 .cse3)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_ArrVal_1298 .cse4)) (= (select .cse14 .cse4) |c_ULTIMATE.start_main_~data_init~0#1|)))))) .cse16) .cse6) (or (let ((.cse17 (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_1294 Int) (v_ArrVal_1288 (Array Int Int)) (v_ArrVal_1298 (Array Int Int))) (let ((.cse37 (select (store (let ((.cse38 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1288))) (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_1294))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1298) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select v_ArrVal_1298 .cse3) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse37 .cse3)) (= (select .cse37 .cse4) |c_ULTIMATE.start_main_~data_init~0#1|))))))) (.cse20 (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_1294 Int) (v_ArrVal_1288 (Array Int Int)) (v_ArrVal_1298 (Array Int Int))) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (let ((.cse36 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1288))) (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_1294))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1298) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse3)))))) (.cse28 (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_1294 Int) (v_ArrVal_1288 (Array Int Int)) (v_ArrVal_1298 (Array Int Int))) (let ((.cse34 (select (store (let ((.cse35 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1288))) (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_1294))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1298) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse34 .cse3)) (= (select .cse34 .cse4) |c_ULTIMATE.start_main_~data_init~0#1|)))))))) (and .cse17 (or (forall ((v_ArrVal_1294 Int) (v_ArrVal_1288 (Array Int Int)) (v_ArrVal_1298 (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_1288))) (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_1294))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1298) |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 .cse18 .cse3)) (= (select .cse18 .cse4) |c_ULTIMATE.start_main_~data_init~0#1|)))) .cse6) .cse20 (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_1294 Int) (v_ArrVal_1288 (Array Int Int)) (v_ArrVal_1298 (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_1288))) (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_1294))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1298) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select v_ArrVal_1298 .cse3) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse21 .cse3)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_ArrVal_1298 .cse4)) (= (select .cse21 .cse4) |c_ULTIMATE.start_main_~data_init~0#1|)))))) (or (and (forall ((v_ArrVal_1294 Int) (v_ArrVal_1288 (Array Int Int)) (v_ArrVal_1298 (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 ((.cse23 (select (store (let ((.cse24 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1288))) (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_1294))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1298) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select v_ArrVal_1298 .cse3) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse23 .cse3)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_ArrVal_1298 .cse4)) (= (select .cse23 .cse4) |c_ULTIMATE.start_main_~data_init~0#1|)))) .cse17 .cse20 (forall ((v_ArrVal_1294 Int) (v_ArrVal_1288 (Array Int Int)) (v_ArrVal_1298 (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 ((.cse25 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1288))) (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_1294))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1298) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse3))) (forall ((v_ArrVal_1294 Int) (v_ArrVal_1288 (Array Int Int)) (v_ArrVal_1298 (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 ((.cse26 (select (store (let ((.cse27 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1288))) (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_1294))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1298) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse26 .cse3)) (= (select .cse26 .cse4) |c_ULTIMATE.start_main_~data_init~0#1|)))) .cse28 (forall ((v_ArrVal_1294 Int) (v_ArrVal_1288 (Array Int Int)) (v_ArrVal_1298 (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 ((.cse29 (select (store (let ((.cse30 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1288))) (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_1294))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1298) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select v_ArrVal_1298 .cse3) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse29 .cse3)) (= (select .cse29 .cse4) |c_ULTIMATE.start_main_~data_init~0#1|))))) .cse6) .cse28 (or (forall ((v_ArrVal_1294 Int) (v_ArrVal_1288 (Array Int Int)) (v_ArrVal_1298 (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|) (= |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_1288))) (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_1294))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1298) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse3)))) .cse6) (or (forall ((v_ArrVal_1294 Int) (v_ArrVal_1288 (Array Int Int)) (v_ArrVal_1298 (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_1288))) (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_1294))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1298) |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_1298 .cse3) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse32 .cse3)) (= (select .cse32 .cse4) |c_ULTIMATE.start_main_~data_init~0#1|)))) .cse6))) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) (or (forall ((v_ArrVal_1294 Int) (v_ArrVal_1288 (Array Int Int)) (v_ArrVal_1298 (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 ((.cse39 (select (store (let ((.cse40 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1288))) (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_1294))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1298) |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_1298 .cse3) |c_ULTIMATE.start_main_~data_init~0#1|) (= |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 .cse39 .cse3)) (= (select .cse39 .cse4) |c_ULTIMATE.start_main_~data_init~0#1|)))) .cse6) (or (forall ((v_ArrVal_1294 Int) (v_ArrVal_1288 (Array Int Int)) (v_ArrVal_1298 (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|) (= |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_1288))) (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_1294))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1298) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse3)))) .cse6) .cse16))) is different from false [2022-11-03 02:53:48,751 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 4))) (let ((.cse4 (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_1294 Int) (v_ArrVal_1288 (Array Int Int)) (v_ArrVal_1298 (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_1288))) (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_1294))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1298) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse44 4)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse44 .cse2)))))))))) (.cse0 (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0)) (.cse10 (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_1294 Int) (v_ArrVal_1288 (Array Int Int)) (v_ArrVal_1298 (Array Int Int))) (let ((.cse42 (select (store (let ((.cse43 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1288))) (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_1294))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1298) |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_1298 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse42 .cse2)))))))))) (.cse13 (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_1294 Int) (v_ArrVal_1288 (Array Int Int)) (v_ArrVal_1298 (Array Int 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_1288))) (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_1294))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1298) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse2))))))))) (and (or .cse0 (forall ((v_ArrVal_1294 Int) (v_ArrVal_1288 (Array Int Int)) (v_ArrVal_1298 (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 ((.cse1 (select (store (let ((.cse3 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1288))) (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_1294))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1298) |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 .cse1 4)) (= |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 .cse1 .cse2)))))) .cse4 (or .cse0 (and .cse4 (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_1294 Int) (v_ArrVal_1288 (Array Int Int)) (v_ArrVal_1298 (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 ((.cse5 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1288))) (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_1294))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1298) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .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 ((v_ArrVal_1294 Int) (v_ArrVal_1288 (Array Int Int)) (v_ArrVal_1298 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (let ((.cse6 (select (store (let ((.cse7 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1288))) (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_1294))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1298) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse6 4)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse6 .cse2))))))) (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (forall ((v_ArrVal_1294 Int) (v_ArrVal_1288 (Array Int Int)) (v_ArrVal_1298 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (let ((.cse8 (select (store (let ((.cse9 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1288))) (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_1294))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1298) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select v_ArrVal_1298 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse8 4)) (= (select v_ArrVal_1298 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse8 .cse2))))) (= |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 (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (forall ((v_ArrVal_1294 Int) (v_ArrVal_1288 (Array Int Int)) (v_ArrVal_1298 (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_1288))) (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_1294))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1298) |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_1298 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse11 .cse2))))))) .cse13)) (or (let ((.cse16 (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_1294 Int) (v_ArrVal_1288 (Array Int Int)) (v_ArrVal_1298 (Array Int Int))) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (let ((.cse35 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1288))) (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_1294))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1298) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse2)))))) (.cse21 (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_1294 Int) (v_ArrVal_1288 (Array Int Int)) (v_ArrVal_1298 (Array Int Int))) (let ((.cse33 (select (store (let ((.cse34 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1288))) (store .cse34 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse34 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_1294))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1298) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse33 4)) (= (select v_ArrVal_1298 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse33 .cse2)))))))) (.cse30 (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_1294 Int) (v_ArrVal_1288 (Array Int Int)) (v_ArrVal_1298 (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_1288))) (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_1294))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1298) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse31 4)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse31 .cse2))))))))) (and (or (forall ((v_ArrVal_1294 Int) (v_ArrVal_1288 (Array Int Int)) (v_ArrVal_1298 (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 ((.cse14 (select (store (let ((.cse15 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1288))) (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_1294))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1298) |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 .cse14 4)) (= (select v_ArrVal_1298 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse14 .cse2))))) .cse0) .cse16 (or .cse0 (forall ((v_ArrVal_1294 Int) (v_ArrVal_1288 (Array Int Int)) (v_ArrVal_1298 (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_1288))) (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_1294))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1298) |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 .cse17 4)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse17 .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_1294 Int) (v_ArrVal_1288 (Array Int Int)) (v_ArrVal_1298 (Array Int Int))) (let ((.cse19 (select (store (let ((.cse20 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1288))) (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_1294))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1298) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select v_ArrVal_1298 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse19 4)) (= (select v_ArrVal_1298 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse19 .cse2))))) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|))) .cse21 (or (forall ((v_ArrVal_1294 Int) (v_ArrVal_1288 (Array Int Int)) (v_ArrVal_1298 (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|) (= |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_1288))) (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_1294))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1298) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse2)))) .cse0) (or .cse0 (and .cse16 (forall ((v_ArrVal_1294 Int) (v_ArrVal_1288 (Array Int Int)) (v_ArrVal_1298 (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 ((.cse23 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1288))) (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_1294))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1298) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse2))) (forall ((v_ArrVal_1294 Int) (v_ArrVal_1288 (Array Int Int)) (v_ArrVal_1298 (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_1288))) (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_1294))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1298) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse24 4)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse24 .cse2))))) (forall ((v_ArrVal_1294 Int) (v_ArrVal_1288 (Array Int Int)) (v_ArrVal_1298 (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 ((.cse26 (select (store (let ((.cse27 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1288))) (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_1294))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1298) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select v_ArrVal_1298 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse26 4)) (= (select v_ArrVal_1298 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse26 .cse2))))) .cse21 (forall ((v_ArrVal_1294 Int) (v_ArrVal_1288 (Array Int Int)) (v_ArrVal_1298 (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_1288))) (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_1294))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1298) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse28 4)) (= (select v_ArrVal_1298 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse28 .cse2))))) .cse30)) .cse30)) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0)) (or .cse0 (forall ((v_ArrVal_1294 Int) (v_ArrVal_1288 (Array Int Int)) (v_ArrVal_1298 (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_1288))) (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_1294))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1298) |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 .cse36 4)) (= (select v_ArrVal_1298 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|) (= |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 .cse36 .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_1294 Int) (v_ArrVal_1288 (Array Int Int)) (v_ArrVal_1298 (Array Int Int))) (let ((.cse38 (select (store (let ((.cse39 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1288))) (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_1294))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1298) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select v_ArrVal_1298 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse38 4)) (= (select v_ArrVal_1298 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse38 .cse2))))) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|))))) (or .cse0 (forall ((v_ArrVal_1294 Int) (v_ArrVal_1288 (Array Int Int)) (v_ArrVal_1298 (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|) (= |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_1288))) (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_1294))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1298) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse2))))) .cse10 .cse13))) is different from false [2022-11-03 02:53:49,052 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:53:49,053 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 37 [2022-11-03 02:53:49,056 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:53:49,065 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:53:49,065 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 80 treesize of output 80 [2022-11-03 02:53:49,081 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 45 treesize of output 41 [2022-11-03 02:53:49,148 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 41 treesize of output 29 [2022-11-03 02:53:49,167 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-03 02:53:49,167 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 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 02:53:49,178 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-03 02:53:49,178 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 02:53:49,188 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-03 02:53:49,189 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 02:53:49,204 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-03 02:53:49,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 1 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 1 [2022-11-03 02:53:49,214 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-03 02:53:49,215 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 02:53:49,224 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-03 02:53:49,225 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 02:53:49,237 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:53:49,238 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 02:53:49,242 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:53:49,243 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:53:49,256 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:53:49,256 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 02:53:49,330 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:53:49,330 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 89 treesize of output 77 [2022-11-03 02:53:49,364 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-03 02:53:49,374 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-03 02:53:49,375 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 02:53:49,388 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-03 02:53:49,388 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 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 02:53:49,404 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:53:49,404 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 91 treesize of output 61 [2022-11-03 02:53:49,408 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:53:49,422 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-03 02:53:49,423 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 549 treesize of output 526 [2022-11-03 02:53:49,437 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:53:49,441 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:53:49,443 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 130 treesize of output 124 [2022-11-03 02:53:49,454 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:53:49,456 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 107 treesize of output 95 [2022-11-03 02:53:49,464 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:53:49,465 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 47 [2022-11-03 02:53:49,474 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:53:49,474 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 41 [2022-11-03 02:53:49,500 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:53:49,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 1 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 61 [2022-11-03 02:53:49,505 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:53:49,517 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-03 02:53:49,518 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 269 treesize of output 258 [2022-11-03 02:53:49,526 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:53:49,527 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:53:49,530 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:53:49,531 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 235 treesize of output 223 [2022-11-03 02:53:49,541 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:53:49,542 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 230 treesize of output 202 [2022-11-03 02:53:49,554 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:53:49,555 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 99 [2022-11-03 02:53:49,570 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:53:49,571 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 99 treesize of output 93 [2022-11-03 02:53:49,609 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-03 02:53:49,610 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 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 02:53:49,623 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-03 02:53:49,623 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 02:53:49,637 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-03 02:53:49,637 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 02:53:49,647 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-03 02:53:49,648 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 02:53:49,858 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 02:53:49,858 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1648760522] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:53:49,858 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [607046983] [2022-11-03 02:53:49,861 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2022-11-03 02:53:49,861 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 02:53:49,861 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 02:53:49,861 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 02:53:49,861 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 02:53:49,881 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:53:49,883 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:53:49,884 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2022-11-03 02:53:49,915 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 02:53:49,926 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:53:49,927 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 02:53:49,938 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 02:53:49,975 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:53:49,976 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 02:53:49,990 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:53:49,991 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2022-11-03 02:53:50,003 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:53:50,004 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2022-11-03 02:53:50,033 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:53:50,035 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:53:50,037 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:53:50,038 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:53:50,040 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:53:50,042 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 02:53:50,073 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:53:50,074 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 02:53:50,090 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:53:50,092 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:53:50,094 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:53:50,095 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 02:53:50,112 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:53:50,113 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 02:53:50,143 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:53:50,145 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:53:50,146 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 02:53:50,166 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:53:50,168 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:53:50,170 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:53:50,171 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 02:53:50,189 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:53:50,191 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:53:50,192 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 02:53:50,372 INFO L356 Elim1Store]: treesize reduction 92, result has 21.4 percent of original size [2022-11-03 02:53:50,373 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 02:53:50,594 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:53:50,595 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:53:50,649 INFO L356 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2022-11-03 02:53:50,650 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 348 treesize of output 346 [2022-11-03 02:53:50,672 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:53:50,673 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:53:50,733 INFO L356 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2022-11-03 02:53:50,734 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 348 treesize of output 346 [2022-11-03 02:53:50,762 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:53:50,765 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:53:50,767 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:53:50,769 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:53:50,770 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:53:50,799 INFO L356 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2022-11-03 02:53:50,799 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 352 treesize of output 335 [2022-11-03 02:53:50,912 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:53:50,914 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:53:50,915 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:53:50,946 INFO L356 Elim1Store]: treesize reduction 87, result has 11.2 percent of original size [2022-11-03 02:53:50,946 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 440 treesize of output 401 [2022-11-03 02:53:50,969 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:53:50,970 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:53:50,971 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:53:50,972 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:53:51,022 INFO L356 Elim1Store]: treesize reduction 64, result has 29.7 percent of original size [2022-11-03 02:53:51,023 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 420 treesize of output 414 [2022-11-03 02:53:51,040 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:53:51,042 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:53:51,043 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:53:51,044 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:53:51,045 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:53:51,054 INFO L356 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-11-03 02:53:51,054 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 426 treesize of output 375 [2022-11-03 02:53:51,127 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-03 02:53:51,134 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-03 02:53:51,149 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 02:53:51,156 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 02:53:51,166 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 02:53:51,182 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 02:53:51,190 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:53:51,191 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 02:53:51,200 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 02:53:51,223 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-03 02:53:51,231 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-03 02:53:51,251 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 02:53:51,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, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 02:53:51,267 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 02:53:51,302 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 02:53:51,315 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-03 02:53:51,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, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 02:53:51,390 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:53:51,391 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 02:53:51,406 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:53:51,406 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 02:53:51,418 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 13 [2022-11-03 02:53:51,510 INFO L356 Elim1Store]: treesize reduction 39, result has 18.8 percent of original size [2022-11-03 02:53:51,511 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 02:53:51,539 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:53:51,600 INFO L356 Elim1Store]: treesize reduction 48, result has 47.3 percent of original size [2022-11-03 02:53:51,600 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 02:53:51,636 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:53:51,686 INFO L356 Elim1Store]: treesize reduction 56, result has 38.5 percent of original size [2022-11-03 02:53:51,687 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 02:53:51,695 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2022-11-03 02:53:51,703 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2022-11-03 02:53:51,942 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 13 [2022-11-03 02:53:51,953 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2022-11-03 02:53:51,963 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2022-11-03 02:53:52,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, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2022-11-03 02:53:52,089 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2022-11-03 02:53:52,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 0 case distinctions, treesize of input 23 treesize of output 13 [2022-11-03 02:53:52,103 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 02:53:54,242 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '3290#(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) (<= |#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 02:53:54,242 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-03 02:53:54,242 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 02:53:54,243 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 11, 12] total 36 [2022-11-03 02:53:54,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91809891] [2022-11-03 02:53:54,243 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 02:53:54,243 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-11-03 02:53:54,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:53:54,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-11-03 02:53:54,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=198, Invalid=1793, Unknown=5, NotChecked=356, Total=2352 [2022-11-03 02:53:54,245 INFO L87 Difference]: Start difference. First operand 83 states and 100 transitions. Second operand has 37 states, 37 states have (on average 2.135135135135135) internal successors, (79), 36 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 02:53:54,809 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|)) (.cse2 (+ |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 4))) (let ((.cse9 (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_1294 Int) (v_ArrVal_1288 (Array Int Int)) (v_ArrVal_1298 (Array Int Int))) (let ((.cse52 (select (store (let ((.cse53 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1288))) (store .cse53 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse53 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_1294))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1298) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse52 4)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse52 .cse2)))))))))) (.cse6 (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0)) (.cse41 (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0)) (.cse5 (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|)) (.cse0 (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|))) (.cse4 (= (select .cse1 (+ |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 4)) |c_ULTIMATE.start_main_~data_init~0#1|)) (.cse46 (= |c_ULTIMATE.start_main_~data_init~0#1| 1)) (.cse15 (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_1294 Int) (v_ArrVal_1288 (Array Int Int)) (v_ArrVal_1298 (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_1288))) (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_1294))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1298) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse50 4)) (= (select v_ArrVal_1298 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse50 .cse2)))))))))) (.cse18 (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_1294 Int) (v_ArrVal_1288 (Array Int Int)) (v_ArrVal_1298 (Array Int Int))) (= |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_1288))) (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_1294))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1298) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse2))))))))) (and .cse0 (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse1 .cse2)) (let ((.cse3 (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| .cse3) (= (select (select |c_#memory_int| .cse3) 4) |c_ULTIMATE.start_main_~data_init~0#1|))) .cse4 (not .cse5) (or .cse6 (forall ((v_ArrVal_1294 Int) (v_ArrVal_1288 (Array Int Int)) (v_ArrVal_1298 (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 ((.cse8 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1288))) (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_1294))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1298) |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 .cse7 4)) (= |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 .cse7 .cse2)))))) .cse9 (or .cse6 (and .cse9 (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_1294 Int) (v_ArrVal_1288 (Array Int Int)) (v_ArrVal_1298 (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_1288))) (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_1294))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1298) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .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 ((v_ArrVal_1294 Int) (v_ArrVal_1288 (Array Int Int)) (v_ArrVal_1298 (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_1288))) (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_1294))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1298) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse11 4)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse11 .cse2))))))) (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (forall ((v_ArrVal_1294 Int) (v_ArrVal_1288 (Array Int Int)) (v_ArrVal_1298 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~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_1288))) (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_1294))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1298) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select v_ArrVal_1298 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse13 4)) (= (select v_ArrVal_1298 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse13 .cse2))))) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) .cse15 (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_1294 Int) (v_ArrVal_1288 (Array Int Int)) (v_ArrVal_1298 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~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_1288))) (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_1294))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1298) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse16 4)) (= (select v_ArrVal_1298 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse16 .cse2))))))) .cse18)) (= |c_ULTIMATE.start_sll_circular_create_~data#1| |c_ULTIMATE.start_main_~data_init~0#1|) (or (let ((.cse21 (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_1294 Int) (v_ArrVal_1288 (Array Int Int)) (v_ArrVal_1298 (Array Int Int))) (= |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_1288))) (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_1294))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1298) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse2)))))) (.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_1294 Int) (v_ArrVal_1288 (Array Int Int)) (v_ArrVal_1298 (Array Int Int))) (let ((.cse38 (select (store (let ((.cse39 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1288))) (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_1294))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1298) |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_1298 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse38 .cse2)))))))) (.cse35 (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_1294 Int) (v_ArrVal_1288 (Array Int Int)) (v_ArrVal_1298 (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_1288))) (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_1294))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1298) |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 .cse2))))))))) (and (or (forall ((v_ArrVal_1294 Int) (v_ArrVal_1288 (Array Int Int)) (v_ArrVal_1298 (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_1288))) (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_1294))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1298) |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 .cse19 4)) (= (select v_ArrVal_1298 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse19 .cse2))))) .cse6) .cse21 (or .cse6 (forall ((v_ArrVal_1294 Int) (v_ArrVal_1288 (Array Int Int)) (v_ArrVal_1298 (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_1288))) (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_1294))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1298) |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 .cse22 4)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse22 .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_1294 Int) (v_ArrVal_1288 (Array Int Int)) (v_ArrVal_1298 (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_1288))) (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_1294))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1298) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select v_ArrVal_1298 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse24 4)) (= (select v_ArrVal_1298 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse24 .cse2))))) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|))) .cse26 (or (forall ((v_ArrVal_1294 Int) (v_ArrVal_1288 (Array Int Int)) (v_ArrVal_1298 (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|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (let ((.cse27 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1288))) (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_1294))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1298) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse2)))) .cse6) (or .cse6 (and .cse21 (forall ((v_ArrVal_1294 Int) (v_ArrVal_1288 (Array Int Int)) (v_ArrVal_1298 (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 ((.cse28 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1288))) (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_1294))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1298) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse2))) (forall ((v_ArrVal_1294 Int) (v_ArrVal_1288 (Array Int Int)) (v_ArrVal_1298 (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 ((.cse29 (select (store (let ((.cse30 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1288))) (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_1294))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1298) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse29 4)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse29 .cse2))))) (forall ((v_ArrVal_1294 Int) (v_ArrVal_1288 (Array Int Int)) (v_ArrVal_1298 (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 ((.cse31 (select (store (let ((.cse32 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1288))) (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_1294))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1298) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select v_ArrVal_1298 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse31 4)) (= (select v_ArrVal_1298 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse31 .cse2))))) .cse26 (forall ((v_ArrVal_1294 Int) (v_ArrVal_1288 (Array Int Int)) (v_ArrVal_1298 (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 ((.cse33 (select (store (let ((.cse34 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1288))) (store .cse34 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse34 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_1294))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1298) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse33 4)) (= (select v_ArrVal_1298 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse33 .cse2))))) .cse35)) .cse35)) .cse41) (or .cse6 (forall ((v_ArrVal_1294 Int) (v_ArrVal_1288 (Array Int Int)) (v_ArrVal_1298 (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_1288))) (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_1294))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1298) |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 .cse42 4)) (= (select v_ArrVal_1298 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|) (= |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 .cse42 .cse2)))))) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) 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_1294 Int) (v_ArrVal_1288 (Array Int Int)) (v_ArrVal_1298 (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_1288))) (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_1294))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1298) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select v_ArrVal_1298 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse44 4)) (= (select v_ArrVal_1298 .cse2) |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| |ULTIMATE.start_sll_circular_create_~last~0#1.base|))))) (= (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) .cse46 .cse6 (or .cse6 (forall ((v_ArrVal_1294 Int) (v_ArrVal_1288 (Array Int Int)) (v_ArrVal_1298 (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|) (= |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_1288))) (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_1294))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1298) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse2))))) (let ((.cse48 (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| .cse48) (= (select (select |c_#memory_int| .cse48) 4) |c_ULTIMATE.start_main_~data_init~0#1|))) .cse41 (= |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 .cse5 (and (or (and .cse0 .cse4) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|)) .cse46)) .cse15 (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) .cse18))) is different from false [2022-11-03 02:53:54,856 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 4)) (.cse6 (+ 4 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (let ((.cse0 (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_1294 Int) (v_ArrVal_1288 (Array Int Int)) (v_ArrVal_1298 (Array Int Int))) (let ((.cse49 (select (store (let ((.cse50 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1288))) (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_1294))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1298) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse49 .cse2)) (= (select .cse49 .cse6) |c_ULTIMATE.start_main_~data_init~0#1|)))))) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|)))) (.cse4 (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_1294 Int) (v_ArrVal_1288 (Array Int Int)) (v_ArrVal_1298 (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_1288))) (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_1294))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1298) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select v_ArrVal_1298 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse47 .cse2)) (= (select .cse47 .cse6) |c_ULTIMATE.start_main_~data_init~0#1|)))))) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|)))) (.cse41 (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) (.cse3 (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|)) (.cse1 (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|)) (.cse44 (= |c_ULTIMATE.start_main_~data_init~0#1| 1)) (.cse8 (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) (.cse18 (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_1294 Int) (v_ArrVal_1288 (Array Int Int)) (v_ArrVal_1298 (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_1288))) (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_1294))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1298) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse2))))))))) (and .cse0 (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse1 .cse2)) (not .cse3) .cse4 (or (forall ((v_ArrVal_1294 Int) (v_ArrVal_1288 (Array Int Int)) (v_ArrVal_1298 (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 ((.cse5 (select (store (let ((.cse7 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1288))) (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_1294))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1298) |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 .cse5 .cse2)) (= (select .cse5 .cse6) |c_ULTIMATE.start_main_~data_init~0#1|)))) .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 (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (forall ((v_ArrVal_1294 Int) (v_ArrVal_1288 (Array Int Int)) (v_ArrVal_1298 (Array Int Int))) (let ((.cse9 (select (store (let ((.cse10 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1288))) (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_1294))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1298) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select v_ArrVal_1298 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse9 .cse2)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_ArrVal_1298 .cse6)) (= (select .cse9 .cse6) |c_ULTIMATE.start_main_~data_init~0#1|)))))) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (and .cse0 .cse4 (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (forall ((v_ArrVal_1294 Int) (v_ArrVal_1288 (Array Int Int)) (v_ArrVal_1298 (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_1288))) (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_1294))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1298) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse11 .cse2)) (= (select .cse11 .cse6) |c_ULTIMATE.start_main_~data_init~0#1|)))) (= |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 (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (forall ((v_ArrVal_1294 Int) (v_ArrVal_1288 (Array Int Int)) (v_ArrVal_1298 (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 ((.cse13 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1288))) (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_1294))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1298) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .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 ((v_ArrVal_1294 Int) (v_ArrVal_1288 (Array Int Int)) (v_ArrVal_1298 (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_1288))) (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_1294))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1298) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select v_ArrVal_1298 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse14 .cse2)) (= (select .cse14 .cse6) |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 ((v_ArrVal_1294 Int) (v_ArrVal_1288 (Array Int Int)) (v_ArrVal_1298 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~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_1288))) (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_1294))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1298) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select v_ArrVal_1298 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse16 .cse2)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_ArrVal_1298 .cse6)) (= (select .cse16 .cse6) |c_ULTIMATE.start_main_~data_init~0#1|)))))) .cse18) .cse8) (= |c_ULTIMATE.start_sll_circular_create_~data#1| |c_ULTIMATE.start_main_~data_init~0#1|) (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_1294 Int) (v_ArrVal_1288 (Array Int Int)) (v_ArrVal_1298 (Array Int Int))) (let ((.cse39 (select (store (let ((.cse40 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1288))) (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_1294))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1298) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select v_ArrVal_1298 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse39 .cse2)) (= (select .cse39 .cse6) |c_ULTIMATE.start_main_~data_init~0#1|))))))) (.cse22 (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_1294 Int) (v_ArrVal_1288 (Array Int Int)) (v_ArrVal_1298 (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_1288))) (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_1294))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1298) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse2)))))) (.cse30 (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_1294 Int) (v_ArrVal_1288 (Array Int Int)) (v_ArrVal_1298 (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_1288))) (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_1294))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1298) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse36 .cse2)) (= (select .cse36 .cse6) |c_ULTIMATE.start_main_~data_init~0#1|)))))))) (and .cse19 (or (forall ((v_ArrVal_1294 Int) (v_ArrVal_1288 (Array Int Int)) (v_ArrVal_1298 (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 ((.cse20 (select (store (let ((.cse21 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1288))) (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_1294))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1298) |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 .cse20 .cse2)) (= (select .cse20 .cse6) |c_ULTIMATE.start_main_~data_init~0#1|)))) .cse8) .cse22 (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_1294 Int) (v_ArrVal_1288 (Array Int Int)) (v_ArrVal_1298 (Array Int Int))) (let ((.cse23 (select (store (let ((.cse24 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1288))) (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_1294))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1298) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select v_ArrVal_1298 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse23 .cse2)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_ArrVal_1298 .cse6)) (= (select .cse23 .cse6) |c_ULTIMATE.start_main_~data_init~0#1|)))))) (or (and (forall ((v_ArrVal_1294 Int) (v_ArrVal_1288 (Array Int Int)) (v_ArrVal_1298 (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 ((.cse25 (select (store (let ((.cse26 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1288))) (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_1294))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1298) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select v_ArrVal_1298 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse25 .cse2)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_ArrVal_1298 .cse6)) (= (select .cse25 .cse6) |c_ULTIMATE.start_main_~data_init~0#1|)))) .cse19 .cse22 (forall ((v_ArrVal_1294 Int) (v_ArrVal_1288 (Array Int Int)) (v_ArrVal_1298 (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 ((.cse27 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1288))) (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_1294))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1298) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse2))) (forall ((v_ArrVal_1294 Int) (v_ArrVal_1288 (Array Int Int)) (v_ArrVal_1298 (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_1288))) (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_1294))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1298) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse28 .cse2)) (= (select .cse28 .cse6) |c_ULTIMATE.start_main_~data_init~0#1|)))) .cse30 (forall ((v_ArrVal_1294 Int) (v_ArrVal_1288 (Array Int Int)) (v_ArrVal_1298 (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 ((.cse31 (select (store (let ((.cse32 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1288))) (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_1294))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1298) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select v_ArrVal_1298 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse31 .cse2)) (= (select .cse31 .cse6) |c_ULTIMATE.start_main_~data_init~0#1|))))) .cse8) .cse30 (or (forall ((v_ArrVal_1294 Int) (v_ArrVal_1288 (Array Int Int)) (v_ArrVal_1298 (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|) (= |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_1288))) (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_1294))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1298) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse2)))) .cse8) (or (forall ((v_ArrVal_1294 Int) (v_ArrVal_1288 (Array Int Int)) (v_ArrVal_1298 (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_1288))) (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_1294))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1298) |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_1298 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse34 .cse2)) (= (select .cse34 .cse6) |c_ULTIMATE.start_main_~data_init~0#1|)))) .cse8))) .cse41) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1) (or (forall ((v_ArrVal_1294 Int) (v_ArrVal_1288 (Array Int Int)) (v_ArrVal_1298 (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_1288))) (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_1294))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1298) |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_1298 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|) (= |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 .cse42 .cse2)) (= (select .cse42 .cse6) |c_ULTIMATE.start_main_~data_init~0#1|)))) .cse8) .cse44 (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (or (forall ((v_ArrVal_1294 Int) (v_ArrVal_1288 (Array Int Int)) (v_ArrVal_1298 (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|) (= |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_1288))) (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_1294))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1298) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse2)))) .cse8) .cse41 (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| 0) (or .cse3 (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 .cse1 (+ |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|)) .cse44)) .cse8 .cse18))) is different from false [2022-11-03 02:53:54,909 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (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 .cse3 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (let ((.cse8 (select |c_#memory_int| .cse10)) (.cse7 (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| .cse10)) (.cse9 (= |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)) (.cse4 (+ 4 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (and (forall ((v_ArrVal_1294 Int) (v_ArrVal_1286 Int) (v_ArrVal_1285 Int) (v_ArrVal_1288 (Array Int Int)) (v_ArrVal_1298 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (let ((.cse0 (select (select (let ((.cse5 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store .cse6 .cse4 v_ArrVal_1286)))) (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|))) (or (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| .cse0) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1288))) (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| v_ArrVal_1294))) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1298) (select (select (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store .cse3 .cse4 v_ArrVal_1285)))) (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.base|))) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) (+ 4 .cse0)))))) (or .cse7 (= (select .cse8 4) |c_ULTIMATE.start_main_~data_init~0#1|)) (not .cse9) (or (and (or (and (= (select .cse8 (+ |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))) .cse7) .cse11) .cse9) (= |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 (forall ((v_ArrVal_1294 Int) (v_ArrVal_1286 Int) (v_ArrVal_1285 Int) (v_ArrVal_1288 (Array Int Int)) (v_ArrVal_1298 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (let ((.cse14 (select (select (let ((.cse16 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store .cse3 .cse4 v_ArrVal_1285)))) (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.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_main_~data_init~0#1| (select (select (store (let ((.cse13 (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1288))) (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_1294))) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1298) .cse14) (+ 4 (select (select (let ((.cse15 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store .cse6 .cse4 v_ArrVal_1286)))) (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| |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.base| .cse14)))) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| 0) (= |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 02:53:54,947 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse49 (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 ((.cse7 (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_1294 Int) (v_ArrVal_1288 (Array Int Int)) (v_ArrVal_1298 (Array Int Int))) (let ((.cse54 (select (store (let ((.cse55 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1288))) (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_1294))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1298) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse54 4)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse54 .cse5)))))))))) (.cse1 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (.cse3 (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0)) (.cse45 (= |c_ULTIMATE.start_main_~data_init~0#1| 1)) (.cse47 (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse49)) (.cse48 (select |c_#memory_int| .cse49)) (.cse2 (+ |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 4)) (.cse0 (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|)) (.cse40 (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0)) (.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 ((|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_1294 Int) (v_ArrVal_1288 (Array Int Int)) (v_ArrVal_1298 (Array Int Int))) (let ((.cse52 (select (store (let ((.cse53 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1288))) (store .cse53 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse53 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_1294))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1298) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse52 4)) (= (select v_ArrVal_1298 .cse5) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse52 .cse5)))))))))) (.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 ((|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_1294 Int) (v_ArrVal_1288 (Array Int Int)) (v_ArrVal_1298 (Array Int Int))) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (let ((.cse51 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1288))) (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_1294))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1298) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse5))))))))) (and (not .cse0) (or (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| .cse1) .cse0) (= (select (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse2) |c_ULTIMATE.start_main_~data_init~0#1|) (or .cse3 (forall ((v_ArrVal_1294 Int) (v_ArrVal_1288 (Array Int Int)) (v_ArrVal_1298 (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 ((.cse4 (select (store (let ((.cse6 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1288))) (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_1294))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1298) |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 .cse4 4)) (= |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 .cse4 .cse5)))))) .cse7 (forall ((v_ArrVal_1294 Int) (v_ArrVal_1298 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (let ((.cse8 (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 (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_1294)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| v_ArrVal_1298) (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|)) (+ .cse8 4)) |c_ULTIMATE.start_main_~data_init~0#1|) (= .cse8 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)))) (or .cse3 (and .cse7 (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_1294 Int) (v_ArrVal_1288 (Array Int Int)) (v_ArrVal_1298 (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_1288))) (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_1294))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1298) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .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 ((v_ArrVal_1294 Int) (v_ArrVal_1288 (Array Int Int)) (v_ArrVal_1298 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (let ((.cse10 (select (store (let ((.cse11 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1288))) (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_1294))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1298) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse10 4)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse10 .cse5))))))) (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (forall ((v_ArrVal_1294 Int) (v_ArrVal_1288 (Array Int Int)) (v_ArrVal_1298 (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_1288))) (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_1294))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1298) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select v_ArrVal_1298 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse12 4)) (= (select v_ArrVal_1298 .cse5) |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|))) .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_1294 Int) (v_ArrVal_1288 (Array Int Int)) (v_ArrVal_1298 (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_1288))) (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_1294))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1298) |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_1298 .cse5) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse15 .cse5))))))) .cse17)) (= |c_ULTIMATE.start_sll_circular_create_~data#1| |c_ULTIMATE.start_main_~data_init~0#1|) (or (let ((.cse20 (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_1294 Int) (v_ArrVal_1288 (Array Int Int)) (v_ArrVal_1298 (Array Int Int))) (= |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_1288))) (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_1294))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1298) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse5)))))) (.cse25 (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_1294 Int) (v_ArrVal_1288 (Array Int Int)) (v_ArrVal_1298 (Array Int Int))) (let ((.cse37 (select (store (let ((.cse38 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1288))) (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_1294))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1298) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse37 4)) (= (select v_ArrVal_1298 .cse5) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse37 .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_1294 Int) (v_ArrVal_1288 (Array Int Int)) (v_ArrVal_1298 (Array Int Int))) (let ((.cse35 (select (store (let ((.cse36 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1288))) (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_1294))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1298) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse35 4)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse35 .cse5))))))))) (and (or (forall ((v_ArrVal_1294 Int) (v_ArrVal_1288 (Array Int Int)) (v_ArrVal_1298 (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_1288))) (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_1294))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1298) |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 .cse18 4)) (= (select v_ArrVal_1298 .cse5) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse18 .cse5))))) .cse3) .cse20 (or .cse3 (forall ((v_ArrVal_1294 Int) (v_ArrVal_1288 (Array Int Int)) (v_ArrVal_1298 (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_1288))) (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_1294))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1298) |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 .cse21 4)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse21 .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_1294 Int) (v_ArrVal_1288 (Array Int Int)) (v_ArrVal_1298 (Array Int Int))) (let ((.cse23 (select (store (let ((.cse24 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1288))) (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_1294))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1298) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select v_ArrVal_1298 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse23 4)) (= (select v_ArrVal_1298 .cse5) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse23 .cse5))))) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|))) .cse25 (or (forall ((v_ArrVal_1294 Int) (v_ArrVal_1288 (Array Int Int)) (v_ArrVal_1298 (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|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (let ((.cse26 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1288))) (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_1294))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1298) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse5)))) .cse3) (or .cse3 (and .cse20 (forall ((v_ArrVal_1294 Int) (v_ArrVal_1288 (Array Int Int)) (v_ArrVal_1298 (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 ((.cse27 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1288))) (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_1294))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1298) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse5))) (forall ((v_ArrVal_1294 Int) (v_ArrVal_1288 (Array Int Int)) (v_ArrVal_1298 (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_1288))) (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_1294))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1298) |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 .cse5))))) (forall ((v_ArrVal_1294 Int) (v_ArrVal_1288 (Array Int Int)) (v_ArrVal_1298 (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_1288))) (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_1294))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1298) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select v_ArrVal_1298 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse30 4)) (= (select v_ArrVal_1298 .cse5) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse30 .cse5))))) .cse25 (forall ((v_ArrVal_1294 Int) (v_ArrVal_1288 (Array Int Int)) (v_ArrVal_1298 (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_1288))) (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_1294))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1298) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse32 4)) (= (select v_ArrVal_1298 .cse5) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse32 .cse5))))) .cse34)) .cse34)) .cse40) (or .cse3 (forall ((v_ArrVal_1294 Int) (v_ArrVal_1288 (Array Int Int)) (v_ArrVal_1298 (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_1288))) (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_1294))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1298) |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 .cse41 4)) (= (select v_ArrVal_1298 .cse5) |c_ULTIMATE.start_main_~data_init~0#1|) (= |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 .cse41 .cse5)))))) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) 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_1294 Int) (v_ArrVal_1288 (Array Int Int)) (v_ArrVal_1298 (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_1288))) (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_1294))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1298) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select v_ArrVal_1298 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse43 4)) (= (select v_ArrVal_1298 .cse5) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse43 .cse5))))) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|))))) (= .cse1 0) .cse45 .cse3 (or .cse3 (forall ((v_ArrVal_1294 Int) (v_ArrVal_1288 (Array Int Int)) (v_ArrVal_1298 (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|) (= |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_1288))) (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_1294))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1298) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse5))))) (or .cse47 (= (select .cse48 4) |c_ULTIMATE.start_main_~data_init~0#1|)) (or (and .cse45 (or .cse47 (and (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse48 .cse2)) (not (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| .cse49))))) .cse0) .cse40 (forall ((v_ArrVal_1294 Int) (v_ArrVal_1298 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (let ((.cse50 (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| .cse50) (= (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_1294)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| v_ArrVal_1298) .cse50) (+ (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|)))) .cse14 .cse17))) is different from false [2022-11-03 02:53:55,017 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse6 (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| .cse6)) (.cse5 (select |c_#memory_int| .cse6)) (.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_1294 Int) (v_ArrVal_1298 (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 (= (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_1294)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| v_ArrVal_1298) (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|) (= .cse2 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)))) (= .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|)) (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| .cse6))))) .cse1) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (forall ((v_ArrVal_1294 Int) (v_ArrVal_1298 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (let ((.cse7 (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| .cse7) (= (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_1294)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| v_ArrVal_1298) .cse7) (+ (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 02:53:55,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:53:55,937 INFO L93 Difference]: Finished difference Result 99 states and 114 transitions. [2022-11-03 02:53:55,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-03 02:53:55,938 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 2.135135135135135) internal successors, (79), 36 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 02:53:55,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:53:55,939 INFO L225 Difference]: With dead ends: 99 [2022-11-03 02:53:55,939 INFO L226 Difference]: Without dead ends: 99 [2022-11-03 02:53:55,940 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 58 SyntacticMatches, 2 SemanticMatches, 60 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 683 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=297, Invalid=2485, Unknown=10, NotChecked=990, Total=3782 [2022-11-03 02:53:55,941 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 56 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 632 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 892 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 632 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 237 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-03 02:53:55,941 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 331 Invalid, 892 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 632 Invalid, 0 Unknown, 237 Unchecked, 0.7s Time] [2022-11-03 02:53:55,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2022-11-03 02:53:55,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 83. [2022-11-03 02:53:55,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 69 states have (on average 1.434782608695652) internal successors, (99), 82 states have internal predecessors, (99), 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 02:53:55,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 99 transitions. [2022-11-03 02:53:55,944 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 99 transitions. Word has length 30 [2022-11-03 02:53:55,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:53:55,945 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 99 transitions. [2022-11-03 02:53:55,945 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 2.135135135135135) internal successors, (79), 36 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 02:53:55,945 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 99 transitions. [2022-11-03 02:53:55,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-03 02:53:55,946 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:53:55,946 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 02:53:55,991 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0afaf1dc-a57a-4f92-a996-a03ff1c427d9/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-03 02:53:56,146 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0afaf1dc-a57a-4f92-a996-a03ff1c427d9/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:53:56,147 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-11-03 02:53:56,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:53:56,147 INFO L85 PathProgramCache]: Analyzing trace with hash -1098771140, now seen corresponding path program 1 times [2022-11-03 02:53:56,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:53:56,148 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395666898] [2022-11-03 02:53:56,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:53:56,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:53:56,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:53:56,907 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 1 proven. 26 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 02:53:56,908 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:53:56,908 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395666898] [2022-11-03 02:53:56,908 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1395666898] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:53:56,908 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [778420763] [2022-11-03 02:53:56,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:53:56,908 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:53:56,909 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0afaf1dc-a57a-4f92-a996-a03ff1c427d9/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:53:56,910 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0afaf1dc-a57a-4f92-a996-a03ff1c427d9/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:53:56,933 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0afaf1dc-a57a-4f92-a996-a03ff1c427d9/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-03 02:53:57,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:53:57,117 INFO L263 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 49 conjunts are in the unsatisfiable core [2022-11-03 02:53:57,121 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:53:57,124 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-03 02:53:57,156 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-03 02:53:57,157 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-03 02:53:57,181 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-03 02:53:57,182 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2022-11-03 02:53:57,211 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-03 02:53:57,212 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2022-11-03 02:53:57,297 INFO L356 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-03 02:53:57,297 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 02:53:57,320 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 02:53:57,336 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:53:57,337 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 02:53:57,363 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2022-11-03 02:53:57,432 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:53:57,433 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 02:53:57,451 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:53:57,451 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 02:53:57,480 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 02:53:57,480 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:53:57,502 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1473 (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_1473) |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 02:53:57,515 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1472 Int) (v_ArrVal_1473 (Array Int 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_1472)) |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1473) |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 02:53:57,528 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:53:57,528 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 02:53:57,532 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 02:53:57,536 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 02:53:57,722 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 02:53:57,723 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [778420763] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:53:57,723 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1109162335] [2022-11-03 02:53:57,725 INFO L159 IcfgInterpreter]: Started Sifa with 19 locations of interest [2022-11-03 02:53:57,725 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 02:53:57,726 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 02:53:57,726 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 02:53:57,726 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 02:53:57,747 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:53:57,749 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:53:57,750 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2022-11-03 02:53:57,795 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 02:53:57,808 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:53:57,809 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 02:53:57,821 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 02:53:57,849 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:53:57,850 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2022-11-03 02:53:57,864 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:53:57,866 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2022-11-03 02:53:57,880 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:53:57,881 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 02:53:57,921 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:53:57,923 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:53:57,925 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:53:57,927 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:53:57,929 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:53:57,930 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 02:53:57,975 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:53:57,976 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:53:57,978 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:53:57,980 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 02:53:58,004 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:53:58,004 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 02:53:58,025 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:53:58,026 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 02:53:58,071 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:53:58,073 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:53:58,074 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 02:53:58,092 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:53:58,094 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:53:58,096 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 02:53:58,114 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:53:58,116 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:53:58,118 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:53:58,119 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 02:53:58,295 INFO L356 Elim1Store]: treesize reduction 92, result has 21.4 percent of original size [2022-11-03 02:53:58,295 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 02:53:58,494 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:53:58,496 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:53:58,498 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:53:58,499 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:53:58,500 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:53:58,524 INFO L356 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2022-11-03 02:53:58,525 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 352 treesize of output 335 [2022-11-03 02:53:58,540 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:53:58,541 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:53:58,580 INFO L356 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2022-11-03 02:53:58,581 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 348 treesize of output 346 [2022-11-03 02:53:58,602 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:53:58,603 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:53:58,642 INFO L356 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2022-11-03 02:53:58,642 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 348 treesize of output 346 [2022-11-03 02:53:58,744 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:53:58,746 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:53:58,747 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:53:58,780 INFO L356 Elim1Store]: treesize reduction 87, result has 11.2 percent of original size [2022-11-03 02:53:58,781 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 440 treesize of output 401 [2022-11-03 02:53:58,801 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:53:58,803 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:53:58,804 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:53:58,805 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:53:58,806 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:53:58,815 INFO L356 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-11-03 02:53:58,815 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 426 treesize of output 375 [2022-11-03 02:53:58,832 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:53:58,833 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:53:58,834 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:53:58,835 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:53:58,875 INFO L356 Elim1Store]: treesize reduction 64, result has 29.7 percent of original size [2022-11-03 02:53:58,875 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 420 treesize of output 414 [2022-11-03 02:53:58,954 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-03 02:53:58,963 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-03 02:53:58,981 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 02:53:58,989 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 02:53:58,998 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 02:53:59,015 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 02:53:59,029 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:53:59,029 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 02:53:59,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, 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 02:53:59,069 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-03 02:53:59,079 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-03 02:53:59,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 02:53:59,101 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 02:53:59,111 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 02:53:59,136 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 02:53:59,145 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 02:53:59,160 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-03 02:53:59,210 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:53:59,211 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 02:53:59,225 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:53:59,226 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 02:53:59,243 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 13 [2022-11-03 02:53:59,305 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 02:54:02,750 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '3713#(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 02:54:02,750 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-03 02:54:02,751 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 02:54:02,751 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9, 9] total 22 [2022-11-03 02:54:02,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582326529] [2022-11-03 02:54:02,751 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 02:54:02,751 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-11-03 02:54:02,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:54:02,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-11-03 02:54:02,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=959, Unknown=2, NotChecked=130, Total=1260 [2022-11-03 02:54:02,753 INFO L87 Difference]: Start difference. First operand 83 states and 99 transitions. Second operand has 23 states, 23 states have (on average 2.782608695652174) internal successors, (64), 22 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 02:54:03,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:54:03,372 INFO L93 Difference]: Finished difference Result 92 states and 102 transitions. [2022-11-03 02:54:03,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-03 02:54:03,372 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.782608695652174) internal successors, (64), 22 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 31 [2022-11-03 02:54:03,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:54:03,373 INFO L225 Difference]: With dead ends: 92 [2022-11-03 02:54:03,373 INFO L226 Difference]: Without dead ends: 92 [2022-11-03 02:54:03,373 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 68 SyntacticMatches, 6 SemanticMatches, 42 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 507 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=284, Invalid=1444, Unknown=2, NotChecked=162, Total=1892 [2022-11-03 02:54:03,374 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 98 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 296 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 422 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 105 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-03 02:54:03,374 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 285 Invalid, 422 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 296 Invalid, 0 Unknown, 105 Unchecked, 0.3s Time] [2022-11-03 02:54:03,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-11-03 02:54:03,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 71. [2022-11-03 02:54:03,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 57 states have (on average 1.3859649122807018) internal successors, (79), 70 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 02:54:03,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 79 transitions. [2022-11-03 02:54:03,378 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 79 transitions. Word has length 31 [2022-11-03 02:54:03,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:54:03,378 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 79 transitions. [2022-11-03 02:54:03,378 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.782608695652174) internal successors, (64), 22 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 02:54:03,378 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 79 transitions. [2022-11-03 02:54:03,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-11-03 02:54:03,379 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:54:03,380 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:54:03,409 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0afaf1dc-a57a-4f92-a996-a03ff1c427d9/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-03 02:54:03,585 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0afaf1dc-a57a-4f92-a996-a03ff1c427d9/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-11-03 02:54:03,585 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-11-03 02:54:03,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:54:03,586 INFO L85 PathProgramCache]: Analyzing trace with hash 1710675158, now seen corresponding path program 2 times [2022-11-03 02:54:03,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:54:03,586 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825198635] [2022-11-03 02:54:03,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:54:03,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:54:03,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:54:05,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 02:54:05,493 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:54:05,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825198635] [2022-11-03 02:54:05,493 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1825198635] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:54:05,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1823683658] [2022-11-03 02:54:05,493 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 02:54:05,493 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:54:05,493 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0afaf1dc-a57a-4f92-a996-a03ff1c427d9/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:54:05,494 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0afaf1dc-a57a-4f92-a996-a03ff1c427d9/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:54:05,496 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0afaf1dc-a57a-4f92-a996-a03ff1c427d9/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-03 02:54:06,195 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-11-03 02:54:06,196 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 02:54:06,200 INFO L263 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 76 conjunts are in the unsatisfiable core [2022-11-03 02:54:06,205 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:54:06,318 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-03 02:54:06,319 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-03 02:54:06,377 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 02:54:06,443 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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 02:54:06,529 INFO L356 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-11-03 02:54:06,530 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 16 treesize of output 26 [2022-11-03 02:54:06,633 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:54:06,646 INFO L356 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-03 02:54:06,646 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 37 treesize of output 32 [2022-11-03 02:54:06,653 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 02:54:06,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 88 treesize of output 75 [2022-11-03 02:54:06,814 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:54:06,815 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:54:06,819 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-03 02:54:06,820 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 74 treesize of output 55 [2022-11-03 02:54:07,064 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:54:07,065 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:54:07,122 INFO L356 Elim1Store]: treesize reduction 28, result has 55.6 percent of original size [2022-11-03 02:54:07,122 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 72 treesize of output 69 [2022-11-03 02:54:07,132 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:54:07,149 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-03 02:54:07,150 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 02:54:07,740 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:54:07,741 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:54:07,745 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-03 02:54:07,745 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 135 treesize of output 113 [2022-11-03 02:54:07,753 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:54:07,754 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:54:07,760 INFO L356 Elim1Store]: treesize reduction 48, result has 2.0 percent of original size [2022-11-03 02:54:07,760 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 12 case distinctions, treesize of input 121 treesize of output 100 [2022-11-03 02:54:07,913 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:54:07,920 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:54:07,921 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 129 treesize of output 101 [2022-11-03 02:54:08,550 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:54:08,552 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:54:08,552 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:54:08,553 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:54:08,557 INFO L356 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-11-03 02:54:08,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, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 75 treesize of output 54 [2022-11-03 02:54:08,662 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:54:08,663 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:54:08,684 INFO L356 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2022-11-03 02:54:08,684 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 66 treesize of output 40 [2022-11-03 02:54:08,723 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 19 proven. 12 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-03 02:54:08,723 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:54:12,258 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 4))) (and (forall ((v_ArrVal_1673 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (let ((.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|))) (or (= (select |c_#valid| (select (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|))) (select (store .cse0 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (store .cse1 .cse2 v_ArrVal_1673)) (select .cse1 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)))) .cse3)) 1) (= .cse3 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)))) (forall ((v_ArrVal_1673 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (let ((.cse5 (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 ((.cse6 (select .cse5 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (let ((.cse4 (select .cse6 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (or (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse4) (= (select |c_#valid| (select (select (store .cse5 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (store .cse6 .cse2 v_ArrVal_1673)) .cse4) (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)))))))) is different from false [2022-11-03 02:54:14,318 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|)) (.cse5 (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_1662 Int) (v_ArrVal_1673 Int) (v_ArrVal_1664 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (let ((.cse0 (select (select (let ((.cse6 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store .cse7 .cse3 v_ArrVal_1664)))) (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 (= .cse0 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) (= (select |c_#valid| (select (let ((.cse1 (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store .cse5 .cse3 v_ArrVal_1662)))) (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.base|))))) (let ((.cse2 (select .cse1 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (select (store .cse1 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store .cse2 .cse3 v_ArrVal_1673)) (select .cse2 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)))) .cse0)) 1)))) (forall ((v_ArrVal_1662 Int) (v_ArrVal_1673 Int) (v_ArrVal_1664 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (let ((.cse9 (let ((.cse12 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store .cse5 .cse3 v_ArrVal_1662)))) (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 ((.cse10 (select .cse9 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (let ((.cse8 (select .cse10 |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 |c_#valid| (select (select (store .cse9 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store .cse10 .cse3 v_ArrVal_1673)) .cse8) (select (select (let ((.cse11 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store .cse7 .cse3 v_ArrVal_1664)))) (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)))))))) is different from false [2022-11-03 02:54:32,213 WARN L234 SmtUtils]: Spent 13.67s 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 02:54:34,261 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset_58| Int) (|v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_50| Int) (v_ArrVal_1662 Int) (v_ArrVal_1673 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (or (not (<= 0 |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset_58|)) (= |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_50| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (= (select (store |c_#valid| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_50| 1) (select (let ((.cse2 (+ |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset_58| 4))) (let ((.cse0 (let ((.cse3 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_50| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_50|) |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset_58| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse2 v_ArrVal_1662)))) (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_50|))))) (let ((.cse1 (select .cse0 |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_50|))) (select (store .cse0 |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_50| (store .cse1 .cse2 v_ArrVal_1673)) (select .cse1 |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset_58|))))) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) 1) (not (<= |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset_58| 0)))) is different from false [2022-11-03 02:54:36,295 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset_58| Int) (|v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_50| Int) (v_ArrVal_1662 Int) (v_ArrVal_1673 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_1656 Int)) (or (not (<= 0 |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset_58|)) (= (select (store |c_#valid| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_50| 1) (select (let ((.cse2 (+ |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset_58| 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_1656)))) (store .cse4 |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_50| (store (store (select .cse4 |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_50|) |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset_58| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse2 v_ArrVal_1662))))) (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_50|))))) (let ((.cse1 (select .cse0 |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_50|))) (select (store .cse0 |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_50| (store .cse1 .cse2 v_ArrVal_1673)) (select .cse1 |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset_58|))))) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) 1) (= |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_50| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (not (<= |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset_58| 0)))) is different from false [2022-11-03 02:54:36,312 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:54:36,313 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:54:51,316 WARN L234 SmtUtils]: Spent 6.11s on a formula simplification. DAG size of input: 53 DAG size of output: 28 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-03 02:54:51,403 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 18 proven. 9 refuted. 0 times theorem prover too weak. 4 trivial. 4 not checked. [2022-11-03 02:54:51,403 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1823683658] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:54:51,403 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1476264476] [2022-11-03 02:54:51,405 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2022-11-03 02:54:51,405 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 02:54:51,406 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 02:54:51,406 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 02:54:51,406 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 02:54:51,420 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:54:51,421 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:54:51,422 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2022-11-03 02:54:51,442 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 02:54:51,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 02:54:51,460 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:54:51,460 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 02:54:51,481 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:54:51,481 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2022-11-03 02:54:51,490 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:54:51,491 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2022-11-03 02:54:51,501 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:54:51,501 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 02:54:51,530 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:54:51,532 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:54:51,533 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:54:51,535 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:54:51,537 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:54:51,538 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 02:54:51,575 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:54:51,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, 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 02:54:51,587 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:54:51,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, 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 02:54:51,601 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:54:51,603 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:54:51,604 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:54:51,605 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 02:54:51,629 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:54:51,631 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:54:51,631 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 02:54:51,647 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:54:51,648 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:54:51,650 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:54:51,651 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 02:54:51,670 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:54:51,672 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:54:51,673 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 02:54:51,799 INFO L356 Elim1Store]: treesize reduction 92, result has 21.4 percent of original size [2022-11-03 02:54:51,799 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 02:54:51,959 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:54:51,999 INFO L356 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2022-11-03 02:54:51,999 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 02:54:52,026 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:54:52,068 INFO L356 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2022-11-03 02:54:52,069 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 02:54:52,096 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:54:52,098 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:54:52,123 INFO L356 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2022-11-03 02:54:52,124 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 02:54:52,248 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:54:52,250 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:54:52,251 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:54:52,252 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:54:52,301 INFO L356 Elim1Store]: treesize reduction 58, result has 26.6 percent of original size [2022-11-03 02:54:52,301 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 02:54:52,323 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:54:52,325 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:54:52,326 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:54:52,336 INFO L356 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-11-03 02:54:52,336 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 02:54:52,354 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:54:52,356 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:54:52,357 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:54:52,366 INFO L356 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2022-11-03 02:54:52,366 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 02:54:52,448 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-03 02:54:52,455 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-03 02:54:52,472 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 02:54:52,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 02:54:52,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 02:54:52,505 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 02:54:52,514 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:54:52,515 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 02:54:52,523 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 02:54:52,545 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-03 02:54:52,551 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-03 02:54:52,568 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 02:54:52,575 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 02:54:52,583 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 02:54:52,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 15 treesize of output 1 [2022-11-03 02:54:52,621 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 02:54:52,651 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 02:54:52,700 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:54:52,700 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 02:54:52,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 02:54:52,723 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:54:52,724 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 02:54:52,783 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:54:52,843 INFO L356 Elim1Store]: treesize reduction 48, result has 47.3 percent of original size [2022-11-03 02:54:52,844 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 02:54:52,868 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:54:52,917 INFO L356 Elim1Store]: treesize reduction 56, result has 38.5 percent of original size [2022-11-03 02:54:52,917 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 02:54:52,959 INFO L356 Elim1Store]: treesize reduction 39, result has 18.8 percent of original size [2022-11-03 02:54:52,959 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 02:54:52,966 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2022-11-03 02:54:52,974 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2022-11-03 02:54:53,176 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2022-11-03 02:54:53,185 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 13 [2022-11-03 02:54:53,195 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2022-11-03 02:54:53,290 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 13 [2022-11-03 02:54:53,299 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2022-11-03 02:54:53,311 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2022-11-03 02:54:53,316 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 02:54:55,378 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '4137#(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) (<= 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) (<= |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 02:54:55,379 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-03 02:54:55,379 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 02:54:55,379 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12, 13] total 38 [2022-11-03 02:54:55,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213373273] [2022-11-03 02:54:55,379 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 02:54:55,380 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-11-03 02:54:55,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:54:55,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-11-03 02:54:55,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=1980, Unknown=4, NotChecked=372, Total=2550 [2022-11-03 02:54:55,381 INFO L87 Difference]: Start difference. First operand 71 states and 79 transitions. Second operand has 39 states, 38 states have (on average 2.3421052631578947) internal successors, (89), 39 states have internal predecessors, (89), 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 02:55:44,163 WARN L234 SmtUtils]: Spent 12.16s on a formula simplification. DAG size of input: 63 DAG size of output: 59 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-03 02:57:35,661 WARN L234 SmtUtils]: Spent 34.96s on a formula simplification. DAG size of input: 145 DAG size of output: 100 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-03 02:59:43,422 WARN L234 SmtUtils]: Spent 56.69s on a formula simplification. DAG size of input: 157 DAG size of output: 110 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-03 03:01:41,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:01:41,465 INFO L93 Difference]: Finished difference Result 91 states and 99 transitions. [2022-11-03 03:01:41,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-03 03:01:41,466 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 38 states have (on average 2.3421052631578947) internal successors, (89), 39 states have internal predecessors, (89), 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 33 [2022-11-03 03:01:41,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:01:41,467 INFO L225 Difference]: With dead ends: 91 [2022-11-03 03:01:41,467 INFO L226 Difference]: Without dead ends: 91 [2022-11-03 03:01:41,469 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 66 SyntacticMatches, 3 SemanticMatches, 65 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 895 ImplicationChecksByTransitivity, 442.4s TimeCoverageRelationStatistics Valid=419, Invalid=3361, Unknown=142, NotChecked=500, Total=4422 [2022-11-03 03:01:41,469 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 95 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 483 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 867 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 483 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 356 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-03 03:01:41,469 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 230 Invalid, 867 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 483 Invalid, 0 Unknown, 356 Unchecked, 0.5s Time] [2022-11-03 03:01:41,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-11-03 03:01:41,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 73. [2022-11-03 03:01:41,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 59 states have (on average 1.4067796610169492) internal successors, (83), 72 states have internal predecessors, (83), 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 03:01:41,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 83 transitions. [2022-11-03 03:01:41,472 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 83 transitions. Word has length 33 [2022-11-03 03:01:41,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:01:41,472 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 83 transitions. [2022-11-03 03:01:41,473 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 38 states have (on average 2.3421052631578947) internal successors, (89), 39 states have internal predecessors, (89), 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 03:01:41,473 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 83 transitions. [2022-11-03 03:01:41,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-11-03 03:01:41,473 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:01:41,473 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:01:41,500 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0afaf1dc-a57a-4f92-a996-a03ff1c427d9/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-11-03 03:01:41,677 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0afaf1dc-a57a-4f92-a996-a03ff1c427d9/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-11-03 03:01:41,677 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-11-03 03:01:41,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:01:41,678 INFO L85 PathProgramCache]: Analyzing trace with hash 1710675159, now seen corresponding path program 2 times [2022-11-03 03:01:41,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:01:41,678 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402814878] [2022-11-03 03:01:41,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:01:41,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:01:41,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:01:44,049 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 17 proven. 17 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 03:01:44,050 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:01:44,050 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402814878] [2022-11-03 03:01:44,050 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [402814878] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:01:44,050 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1771072291] [2022-11-03 03:01:44,050 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 03:01:44,050 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:01:44,050 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0afaf1dc-a57a-4f92-a996-a03ff1c427d9/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:01:44,051 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0afaf1dc-a57a-4f92-a996-a03ff1c427d9/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:01:44,052 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0afaf1dc-a57a-4f92-a996-a03ff1c427d9/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-03 03:01:45,272 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-11-03 03:01:45,272 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 03:01:45,276 INFO L263 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 95 conjunts are in the unsatisfiable core [2022-11-03 03:01:45,281 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:01:45,358 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-03 03:01:45,358 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 03:01:45,394 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-03 03:01:45,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, 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 03:01:45,476 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 03:01:45,480 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 03:01:45,553 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 37 [2022-11-03 03:01:45,558 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 38 treesize of output 33 [2022-11-03 03:01:45,646 INFO L356 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-11-03 03:01:45,647 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 22 treesize of output 32 [2022-11-03 03:01:45,667 INFO L356 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-11-03 03:01:45,668 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2022-11-03 03:01:45,790 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 03:01:45,802 INFO L356 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-03 03:01:45,802 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 43 treesize of output 38 [2022-11-03 03:01:45,810 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 03:01:45,823 INFO L356 Elim1Store]: treesize reduction 21, result has 47.5 percent of original size [2022-11-03 03:01:45,823 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 39 [2022-11-03 03:01:46,098 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:01:46,099 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 03:01:46,103 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-03 03:01:46,103 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 117 treesize of output 82 [2022-11-03 03:01:46,123 INFO L356 Elim1Store]: treesize reduction 57, result has 16.2 percent of original size [2022-11-03 03:01:46,124 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 131 treesize of output 104 [2022-11-03 03:01:46,328 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 03:01:46,329 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 03:01:46,364 INFO L356 Elim1Store]: treesize reduction 28, result has 55.6 percent of original size [2022-11-03 03:01:46,365 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 115 treesize of output 96 [2022-11-03 03:01:46,375 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 03:01:46,412 INFO L356 Elim1Store]: treesize reduction 40, result has 40.3 percent of original size [2022-11-03 03:01:46,412 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 92 treesize of output 89 [2022-11-03 03:01:47,191 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:01:47,192 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:01:47,193 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 03:01:47,193 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 03:01:47,201 INFO L356 Elim1Store]: treesize reduction 43, result has 2.3 percent of original size [2022-11-03 03:01:47,201 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 154 treesize of output 117 [2022-11-03 03:01:47,209 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:01:47,210 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 03:01:47,234 INFO L356 Elim1Store]: treesize reduction 121, result has 2.4 percent of original size [2022-11-03 03:01:47,234 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 168 treesize of output 139 [2022-11-03 03:01:47,919 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 03:01:47,966 INFO L356 Elim1Store]: treesize reduction 128, result has 14.7 percent of original size [2022-11-03 03:01:47,966 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 175 treesize of output 142 [2022-11-03 03:01:47,991 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:01:47,992 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 03:01:47,993 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 03:01:48,000 INFO L356 Elim1Store]: treesize reduction 43, result has 2.3 percent of original size [2022-11-03 03:01:48,000 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 153 treesize of output 112 [2022-11-03 03:01:48,209 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 03:01:48,210 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 03:01:48,238 INFO L356 Elim1Store]: treesize reduction 24, result has 45.5 percent of original size [2022-11-03 03:01:48,238 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 5 new quantified variables, introduced 6 case distinctions, treesize of input 186 treesize of output 116 [2022-11-03 03:01:48,247 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 03:01:48,274 INFO L356 Elim1Store]: treesize reduction 17, result has 54.1 percent of original size [2022-11-03 03:01:48,274 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 101 treesize of output 87 [2022-11-03 03:01:48,911 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 18 proven. 13 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-03 03:01:48,911 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:02:45,662 WARN L234 SmtUtils]: Spent 42.73s on a formula simplification. DAG size of input: 63 DAG size of output: 61 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-03 03:03:59,787 WARN L234 SmtUtils]: Spent 18.25s on a formula simplification that was a NOOP. DAG size: 69 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-03 03:04:02,074 WARN L855 $PredicateComparison]: unable to prove that (or (not (<= 0 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) (let ((.cse8 (store (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| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (.cse10 (store (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| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|)) (.cse2 (+ 4 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (and (forall ((v_ArrVal_1870 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_1877 Int) (v_ArrVal_1867 Int) (v_ArrVal_1878 Int)) (let ((.cse5 (let ((.cse9 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store .cse10 .cse2 v_ArrVal_1867)))) (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| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|)))) (.cse0 (let ((.cse7 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store .cse8 .cse2 v_ArrVal_1870)))) (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| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|)) (.cse6 (select .cse5 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (let ((.cse3 (select .cse6 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) (.cse4 (select .cse1 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (or (<= 0 (+ (select (select (store .cse0 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store .cse1 .cse2 v_ArrVal_1877)) .cse3) .cse4) 4)) (= .cse4 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) (not (<= (+ .cse4 8) (select |c_#length| .cse3))) (not (<= 0 .cse4)) (= (select (select (store .cse5 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store .cse6 .cse2 v_ArrVal_1878)) .cse3) .cse4) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|)))))) (forall ((v_ArrVal_1870 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_1877 Int) (v_ArrVal_1867 Int) (v_ArrVal_1878 Int)) (let ((.cse13 (let ((.cse19 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store .cse10 .cse2 v_ArrVal_1867)))) (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| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|)))) (.cse16 (let ((.cse18 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store .cse8 .cse2 v_ArrVal_1870)))) (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| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))))) (let ((.cse17 (select .cse16 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|)) (.cse14 (select .cse13 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (let ((.cse11 (select .cse14 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) (.cse15 (select .cse17 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (let ((.cse12 (select (select (store .cse16 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store .cse17 .cse2 v_ArrVal_1877)) .cse11) .cse15))) (or (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| .cse11) (<= (+ .cse12 8) (select |c_#length| (select (select (store .cse13 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store .cse14 .cse2 v_ArrVal_1878)) .cse11) .cse15))) (not (<= (+ .cse15 8) (select |c_#length| .cse11))) (not (<= 0 .cse15)) (= .cse12 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))))))) (forall ((v_ArrVal_1870 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_1877 Int) (v_ArrVal_1867 Int)) (let ((.cse20 (let ((.cse25 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store .cse8 .cse2 v_ArrVal_1870)))) (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| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))))) (let ((.cse21 (select .cse20 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (let ((.cse22 (select (select (let ((.cse24 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store .cse10 .cse2 v_ArrVal_1867)))) (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| |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|)) (.cse23 (select .cse21 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (or (<= 0 (+ (select (select (store .cse20 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store .cse21 .cse2 v_ArrVal_1877)) .cse22) .cse23) 4)) (= .cse23 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) (not (<= (+ .cse23 8) (select |c_#length| .cse22))) (not (<= 0 .cse23))))))) (forall ((v_ArrVal_1870 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_1877 Int) (v_ArrVal_1867 Int)) (let ((.cse27 (let ((.cse31 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store .cse8 .cse2 v_ArrVal_1870)))) (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| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))))) (let ((.cse28 (select .cse27 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (let ((.cse26 (select (select (let ((.cse30 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store .cse10 .cse2 v_ArrVal_1867)))) (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| |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|)) (.cse29 (select .cse28 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (or (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| .cse26) (<= 0 (+ (select (select (store .cse27 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store .cse28 .cse2 v_ArrVal_1877)) .cse26) .cse29) 4)) (not (<= (+ .cse29 8) (select |c_#length| .cse26))) (not (<= 0 .cse29))))))) (forall ((v_ArrVal_1870 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_1877 Int) (v_ArrVal_1867 Int) (v_ArrVal_1878 Int)) (let ((.cse37 (let ((.cse40 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store .cse10 .cse2 v_ArrVal_1867)))) (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| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|)))) (.cse33 (let ((.cse39 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store .cse8 .cse2 v_ArrVal_1870)))) (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| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))))) (let ((.cse34 (select .cse33 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|)) (.cse38 (select .cse37 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (let ((.cse32 (select .cse38 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) (.cse35 (select .cse34 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (let ((.cse36 (select (select (store .cse37 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store .cse38 .cse2 v_ArrVal_1878)) .cse32) .cse35))) (or (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| .cse32) (<= (+ (select (select (store .cse33 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store .cse34 .cse2 v_ArrVal_1877)) .cse32) .cse35) 8) (select |c_#length| .cse36)) (not (<= (+ .cse35 8) (select |c_#length| .cse32))) (not (<= 0 .cse35)) (= .cse36 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))))))) (forall ((v_ArrVal_1870 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_1877 Int) (v_ArrVal_1867 Int) (v_ArrVal_1878 Int)) (let ((.cse46 (let ((.cse49 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store .cse10 .cse2 v_ArrVal_1867)))) (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| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|)))) (.cse42 (let ((.cse48 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store .cse8 .cse2 v_ArrVal_1870)))) (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| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))))) (let ((.cse43 (select .cse42 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|)) (.cse47 (select .cse46 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (let ((.cse44 (select .cse47 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) (.cse41 (select .cse43 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (let ((.cse45 (select (select (store .cse46 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store .cse47 .cse2 v_ArrVal_1878)) .cse44) .cse41))) (or (= .cse41 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) (<= (+ (select (select (store .cse42 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store .cse43 .cse2 v_ArrVal_1877)) .cse44) .cse41) 8) (select |c_#length| .cse45)) (not (<= (+ .cse41 8) (select |c_#length| .cse44))) (not (<= 0 .cse41)) (= .cse45 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))))))) (forall ((v_ArrVal_1870 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_1877 Int) (v_ArrVal_1867 Int) (v_ArrVal_1878 Int)) (let ((.cse52 (let ((.cse58 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store .cse10 .cse2 v_ArrVal_1867)))) (store .cse58 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse58 |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|)))) (.cse55 (let ((.cse57 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store .cse8 .cse2 v_ArrVal_1870)))) (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| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))))) (let ((.cse56 (select .cse55 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|)) (.cse53 (select .cse52 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (let ((.cse54 (select .cse53 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) (.cse50 (select .cse56 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (let ((.cse51 (select (select (store .cse55 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store .cse56 .cse2 v_ArrVal_1877)) .cse54) .cse50))) (or (= .cse50 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) (<= (+ .cse51 8) (select |c_#length| (select (select (store .cse52 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store .cse53 .cse2 v_ArrVal_1878)) .cse54) .cse50))) (not (<= (+ .cse50 8) (select |c_#length| .cse54))) (not (<= 0 .cse50)) (= .cse51 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)))))))))) is different from true [2022-11-03 03:04:05,912 WARN L855 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1862 Int)) (or (not (<= v_ArrVal_1862 8)) (forall ((|v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_53| Int)) (or (forall ((|v_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset_63| Int)) (or (forall ((v_ArrVal_1870 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_1877 Int) (v_ArrVal_1867 Int)) (let ((.cse4 (+ |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset_63| 4))) (let ((.cse2 (let ((.cse6 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_53| (store (store (select |c_#memory_$Pointer$.offset| |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.offset|) .cse4 v_ArrVal_1870)))) (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_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset_63|))))) (let ((.cse3 (select .cse2 |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_53|))) (let ((.cse1 (select (select (let ((.cse5 (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|) .cse4 v_ArrVal_1867)))) (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_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_53|))) |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_53|) |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset_63|)) (.cse0 (select .cse3 |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset_63|))) (or (not (<= 0 .cse0)) (not (<= (+ .cse0 8) (select (store |c_#length| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_53| v_ArrVal_1862) .cse1))) (<= 0 (+ (select (select (store .cse2 |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_53| (store .cse3 .cse4 v_ArrVal_1877)) .cse1) .cse0) 4)))))))) (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)))) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_53|))))))) (forall ((v_ArrVal_1862 Int)) (or (not (<= v_ArrVal_1862 8)) (forall ((|v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_53| Int)) (or (forall ((|v_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset_63| Int)) (or (forall ((v_ArrVal_1870 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_1877 Int) (v_ArrVal_1867 Int) (v_ArrVal_1878 Int)) (let ((.cse11 (+ |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset_63| 4))) (let ((.cse9 (let ((.cse15 (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|) .cse11 v_ArrVal_1867)))) (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_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_53|)))) (.cse12 (let ((.cse14 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_53| (store (store (select |c_#memory_$Pointer$.offset| |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.offset|) .cse11 v_ArrVal_1870)))) (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_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset_63|))))) (let ((.cse13 (select .cse12 |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_53|)) (.cse10 (select .cse9 |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_53|))) (let ((.cse8 (select .cse10 |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset_63|)) (.cse7 (select .cse13 |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset_63|))) (or (= .cse7 |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset_63|) (not (<= 0 .cse7)) (not (<= (+ .cse7 8) (select (store |c_#length| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_53| v_ArrVal_1862) .cse8))) (= (select (select (store .cse9 |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_53| (store .cse10 .cse11 v_ArrVal_1878)) .cse8) .cse7) |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_53|) (<= 0 (+ (select (select (store .cse12 |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_53| (store .cse13 .cse11 v_ArrVal_1877)) .cse8) .cse7) 4)))))))) (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)))) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_53|))))))) (forall ((v_ArrVal_1862 Int)) (or (not (<= v_ArrVal_1862 8)) (forall ((|v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_53| Int)) (or (forall ((|v_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset_63| Int)) (or (not (<= 0 |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset_63|)) (forall ((v_ArrVal_1870 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_1877 Int) (v_ArrVal_1867 Int) (v_ArrVal_1878 Int)) (let ((.cse21 (+ |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset_63| 4))) (let ((.cse23 (let ((.cse26 (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|) .cse21 v_ArrVal_1867)))) (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_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_53|)))) (.cse19 (let ((.cse25 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_53| (store (store (select |c_#memory_$Pointer$.offset| |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.offset|) .cse21 v_ArrVal_1870)))) (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_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset_63|))))) (let ((.cse20 (select .cse19 |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_53|)) (.cse24 (select .cse23 |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_53|))) (let ((.cse18 (select .cse24 |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset_63|)) (.cse16 (select .cse20 |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset_63|))) (let ((.cse17 (store |c_#length| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_53| v_ArrVal_1862)) (.cse22 (select (select (store .cse23 |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_53| (store .cse24 .cse21 v_ArrVal_1878)) .cse18) .cse16))) (or (not (<= 0 .cse16)) (not (<= (+ .cse16 8) (select .cse17 .cse18))) (<= (+ (select (select (store .cse19 |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_53| (store .cse20 .cse21 v_ArrVal_1877)) .cse18) .cse16) 8) (select .cse17 .cse22)) (= .cse22 |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_53|)))))))) (not (<= |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset_63| 0)))) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_53|))))))) (forall ((v_ArrVal_1862 Int)) (or (not (<= v_ArrVal_1862 8)) (forall ((|v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_53| Int)) (or (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_53|))) (forall ((|v_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset_63| Int)) (or (forall ((v_ArrVal_1870 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_1877 Int) (v_ArrVal_1867 Int) (v_ArrVal_1878 Int)) (let ((.cse33 (+ |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset_63| 4))) (let ((.cse31 (let ((.cse37 (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|) .cse33 v_ArrVal_1867)))) (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_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_53|)))) (.cse34 (let ((.cse36 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_53| (store (store (select |c_#memory_$Pointer$.offset| |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.offset|) .cse33 v_ArrVal_1870)))) (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_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset_63|))))) (let ((.cse35 (select .cse34 |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_53|)) (.cse32 (select .cse31 |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_53|))) (let ((.cse30 (select .cse32 |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset_63|)) (.cse27 (select .cse35 |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset_63|))) (let ((.cse28 (select (select (store .cse34 |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_53| (store .cse35 .cse33 v_ArrVal_1877)) .cse30) .cse27)) (.cse29 (store |c_#length| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_53| v_ArrVal_1862))) (or (not (<= 0 .cse27)) (= .cse28 |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset_63|) (not (<= (+ .cse27 8) (select .cse29 .cse30))) (<= (+ .cse28 8) (select .cse29 (select (select (store .cse31 |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_53| (store .cse32 .cse33 v_ArrVal_1878)) .cse30) .cse27)))))))))) (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)))))))) (forall ((v_ArrVal_1862 Int)) (or (not (<= v_ArrVal_1862 8)) (forall ((|v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_53| Int)) (or (forall ((|v_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset_63| Int)) (or (forall ((v_ArrVal_1870 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_1877 Int) (v_ArrVal_1867 Int) (v_ArrVal_1878 Int)) (let ((.cse44 (+ |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset_63| 4))) (let ((.cse42 (let ((.cse48 (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|) .cse44 v_ArrVal_1867)))) (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_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_53|)))) (.cse45 (let ((.cse47 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_53| (store (store (select |c_#memory_$Pointer$.offset| |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.offset|) .cse44 v_ArrVal_1870)))) (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_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset_63|))))) (let ((.cse46 (select .cse45 |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_53|)) (.cse43 (select .cse42 |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_53|))) (let ((.cse41 (select .cse43 |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset_63|)) (.cse38 (select .cse46 |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset_63|))) (let ((.cse39 (select (select (store .cse45 |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_53| (store .cse46 .cse44 v_ArrVal_1877)) .cse41) .cse38)) (.cse40 (store |c_#length| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_53| v_ArrVal_1862))) (or (= .cse38 |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset_63|) (not (<= 0 .cse38)) (= .cse39 |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset_63|) (not (<= (+ .cse38 8) (select .cse40 .cse41))) (<= (+ .cse39 8) (select .cse40 (select (select (store .cse42 |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_53| (store .cse43 .cse44 v_ArrVal_1878)) .cse41) .cse38)))))))))) (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)))) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_53|))))))) (forall ((v_ArrVal_1862 Int)) (or (forall ((|v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_53| Int)) (or (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_53|))) (forall ((|v_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset_63| Int)) (or (forall ((v_ArrVal_1870 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_1877 Int) (v_ArrVal_1867 Int)) (let ((.cse53 (+ |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset_63| 4))) (let ((.cse51 (let ((.cse55 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_53| (store (store (select |c_#memory_$Pointer$.offset| |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.offset|) .cse53 v_ArrVal_1870)))) (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_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset_63|))))) (let ((.cse52 (select .cse51 |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_53|))) (let ((.cse50 (select (select (let ((.cse54 (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|) .cse53 v_ArrVal_1867)))) (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_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_53|))) |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_53|) |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset_63|)) (.cse49 (select .cse52 |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset_63|))) (or (= .cse49 |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset_63|) (not (<= 0 .cse49)) (not (<= (+ .cse49 8) (select (store |c_#length| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_53| v_ArrVal_1862) .cse50))) (<= 0 (+ (select (select (store .cse51 |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_53| (store .cse52 .cse53 v_ArrVal_1877)) .cse50) .cse49) 4)))))))) (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)))))) (not (<= v_ArrVal_1862 8)))) (forall ((v_ArrVal_1862 Int)) (or (not (<= v_ArrVal_1862 8)) (forall ((|v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_53| Int)) (or (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_53|))) (forall ((|v_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset_63| Int)) (or (not (<= 0 |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset_63|)) (forall ((v_ArrVal_1870 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_1877 Int) (v_ArrVal_1867 Int) (v_ArrVal_1878 Int)) (let ((.cse61 (+ |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset_63| 4))) (let ((.cse63 (let ((.cse66 (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|) .cse61 v_ArrVal_1867)))) (store .cse66 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse66 |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|)))) (.cse59 (let ((.cse65 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_53| (store (store (select |c_#memory_$Pointer$.offset| |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.offset|) .cse61 v_ArrVal_1870)))) (store .cse65 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse65 |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.offset_63|))))) (let ((.cse60 (select .cse59 |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_53|)) (.cse64 (select .cse63 |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_53|))) (let ((.cse58 (select .cse64 |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset_63|)) (.cse56 (select .cse60 |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset_63|))) (let ((.cse57 (store |c_#length| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_53| v_ArrVal_1862)) (.cse62 (select (select (store .cse63 |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_53| (store .cse64 .cse61 v_ArrVal_1878)) .cse58) .cse56))) (or (= .cse56 |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset_63|) (not (<= 0 .cse56)) (not (<= (+ .cse56 8) (select .cse57 .cse58))) (<= (+ (select (select (store .cse59 |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_53| (store .cse60 .cse61 v_ArrVal_1877)) .cse58) .cse56) 8) (select .cse57 .cse62)) (= .cse62 |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_53|)))))))) (not (<= |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset_63| 0))))))))) is different from true [2022-11-03 03:04:09,478 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse9 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|)) (.cse13 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|)) (.cse10 (+ 4 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (and (forall ((v_ArrVal_1859 Int) (v_ArrVal_1858 Int) (v_ArrVal_1862 Int)) (or (forall ((|v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_53| Int)) (or (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_53|))) (forall ((|v_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset_63| Int)) (or (forall ((v_ArrVal_1870 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_1877 Int) (v_ArrVal_1867 Int) (v_ArrVal_1878 Int)) (let ((.cse2 (+ |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset_63| 4))) (let ((.cse0 (let ((.cse11 (let ((.cse12 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store .cse13 .cse10 v_ArrVal_1858)))) (store .cse12 |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_53| (store (store (select .cse12 |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_1867))))) (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_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_53|)))) (.cse5 (let ((.cse7 (let ((.cse8 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store .cse9 .cse10 v_ArrVal_1859)))) (store .cse8 |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_53| (store (store (select .cse8 |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.offset|) .cse2 v_ArrVal_1870))))) (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_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset_63|))))) (let ((.cse6 (select .cse5 |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_53|)) (.cse1 (select .cse0 |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_53|))) (let ((.cse3 (select .cse1 |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset_63|)) (.cse4 (select .cse6 |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset_63|))) (or (= |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_53| (select (select (store .cse0 |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_53| (store .cse1 .cse2 v_ArrVal_1878)) .cse3) .cse4)) (<= 0 (+ (select (select (store .cse5 |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_53| (store .cse6 .cse2 v_ArrVal_1877)) .cse3) .cse4) 4)) (not (<= (+ .cse4 8) (select (store |c_#length| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_53| v_ArrVal_1862) .cse3))) (= .cse4 |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset_63|) (not (<= 0 .cse4)))))))) (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)))))) (not (<= v_ArrVal_1862 8)))) (forall ((v_ArrVal_1859 Int) (v_ArrVal_1858 Int) (v_ArrVal_1862 Int)) (or (forall ((|v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_53| Int)) (or (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_53|))) (forall ((|v_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset_63| Int)) (or (forall ((v_ArrVal_1870 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_1877 Int) (v_ArrVal_1867 Int) (v_ArrVal_1878 Int)) (let ((.cse18 (+ |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset_63| 4))) (let ((.cse16 (let ((.cse25 (let ((.cse26 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store .cse13 .cse10 v_ArrVal_1858)))) (store .cse26 |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_53| (store (store (select .cse26 |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|) .cse18 v_ArrVal_1867))))) (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_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_53|)))) (.cse21 (let ((.cse23 (let ((.cse24 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store .cse9 .cse10 v_ArrVal_1859)))) (store .cse24 |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_53| (store (store (select .cse24 |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.offset|) .cse18 v_ArrVal_1870))))) (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_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset_63|))))) (let ((.cse22 (select .cse21 |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_53|)) (.cse17 (select .cse16 |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_53|))) (let ((.cse19 (select .cse17 |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset_63|)) (.cse20 (select .cse22 |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset_63|))) (let ((.cse14 (select (select (store .cse21 |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_53| (store .cse22 .cse18 v_ArrVal_1877)) .cse19) .cse20)) (.cse15 (store |c_#length| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_53| v_ArrVal_1862))) (or (<= (+ .cse14 8) (select .cse15 (select (select (store .cse16 |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_53| (store .cse17 .cse18 v_ArrVal_1878)) .cse19) .cse20))) (= .cse14 |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset_63|) (not (<= (+ .cse20 8) (select .cse15 .cse19))) (= .cse20 |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset_63|) (not (<= 0 .cse20))))))))) (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)))))) (not (<= v_ArrVal_1862 8)))) (forall ((v_ArrVal_1859 Int) (v_ArrVal_1858 Int) (v_ArrVal_1862 Int)) (or (forall ((|v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_53| Int)) (or (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_53|))) (forall ((|v_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset_63| Int)) (or (not (<= 0 |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset_63|)) (forall ((v_ArrVal_1870 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_1877 Int) (v_ArrVal_1867 Int) (v_ArrVal_1878 Int)) (let ((.cse29 (+ |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset_63| 4))) (let ((.cse34 (let ((.cse38 (let ((.cse39 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store .cse13 .cse10 v_ArrVal_1858)))) (store .cse39 |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_53| (store (store (select .cse39 |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|) .cse29 v_ArrVal_1867))))) (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_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_53|)))) (.cse27 (let ((.cse36 (let ((.cse37 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store .cse9 .cse10 v_ArrVal_1859)))) (store .cse37 |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_53| (store (store (select .cse37 |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.offset|) .cse29 v_ArrVal_1870))))) (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_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset_63|))))) (let ((.cse28 (select .cse27 |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_53|)) (.cse35 (select .cse34 |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_53|))) (let ((.cse30 (select .cse35 |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset_63|)) (.cse31 (select .cse28 |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset_63|))) (let ((.cse33 (select (select (store .cse34 |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_53| (store .cse35 .cse29 v_ArrVal_1878)) .cse30) .cse31)) (.cse32 (store |c_#length| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_53| v_ArrVal_1862))) (or (<= (+ (select (select (store .cse27 |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_53| (store .cse28 .cse29 v_ArrVal_1877)) .cse30) .cse31) 8) (select .cse32 .cse33)) (= |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_53| .cse33) (not (<= (+ .cse31 8) (select .cse32 .cse30))) (not (<= 0 .cse31))))))))) (not (<= |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset_63| 0)))))) (not (<= v_ArrVal_1862 8)))) (forall ((v_ArrVal_1859 Int) (v_ArrVal_1858 Int) (v_ArrVal_1862 Int)) (or (forall ((|v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_53| Int)) (or (forall ((|v_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset_63| Int)) (or (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)) (forall ((v_ArrVal_1870 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_1877 Int) (v_ArrVal_1867 Int)) (let ((.cse42 (+ |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset_63| 4))) (let ((.cse40 (let ((.cse47 (let ((.cse48 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store .cse9 .cse10 v_ArrVal_1859)))) (store .cse48 |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_53| (store (store (select .cse48 |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.offset|) .cse42 v_ArrVal_1870))))) (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_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset_63|))))) (let ((.cse41 (select .cse40 |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_53|))) (let ((.cse43 (select (select (let ((.cse45 (let ((.cse46 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store .cse13 .cse10 v_ArrVal_1858)))) (store .cse46 |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_53| (store (store (select .cse46 |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|) .cse42 v_ArrVal_1867))))) (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_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_53|))) |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_53|) |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset_63|)) (.cse44 (select .cse41 |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset_63|))) (or (<= 0 (+ (select (select (store .cse40 |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_53| (store .cse41 .cse42 v_ArrVal_1877)) .cse43) .cse44) 4)) (not (<= (+ .cse44 8) (select (store |c_#length| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_53| v_ArrVal_1862) .cse43))) (not (<= 0 .cse44)))))))))) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_53|))))) (not (<= v_ArrVal_1862 8)))) (forall ((v_ArrVal_1859 Int) (v_ArrVal_1858 Int) (v_ArrVal_1862 Int)) (or (not (<= v_ArrVal_1862 8)) (forall ((|v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_53| Int)) (or (forall ((|v_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset_63| Int)) (or (forall ((v_ArrVal_1870 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_1877 Int) (v_ArrVal_1867 Int)) (let ((.cse51 (+ |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset_63| 4))) (let ((.cse49 (let ((.cse56 (let ((.cse57 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store .cse9 .cse10 v_ArrVal_1859)))) (store .cse57 |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_53| (store (store (select .cse57 |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.offset|) .cse51 v_ArrVal_1870))))) (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_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset_63|))))) (let ((.cse50 (select .cse49 |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_53|))) (let ((.cse52 (select (select (let ((.cse54 (let ((.cse55 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store .cse13 .cse10 v_ArrVal_1858)))) (store .cse55 |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_53| (store (store (select .cse55 |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|) .cse51 v_ArrVal_1867))))) (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_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_53|))) |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_53|) |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset_63|)) (.cse53 (select .cse50 |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset_63|))) (or (<= 0 (+ (select (select (store .cse49 |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_53| (store .cse50 .cse51 v_ArrVal_1877)) .cse52) .cse53) 4)) (not (<= (+ .cse53 8) (select (store |c_#length| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_53| v_ArrVal_1862) .cse52))) (= .cse53 |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset_63|) (not (<= 0 .cse53)))))))) (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)))) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_53|))))))) (forall ((v_ArrVal_1859 Int) (v_ArrVal_1858 Int) (v_ArrVal_1862 Int)) (or (not (<= v_ArrVal_1862 8)) (forall ((|v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_53| Int)) (or (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_53|))) (forall ((|v_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset_63| Int)) (or (forall ((v_ArrVal_1870 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_1877 Int) (v_ArrVal_1867 Int) (v_ArrVal_1878 Int)) (let ((.cse60 (+ |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset_63| 4))) (let ((.cse65 (let ((.cse69 (let ((.cse70 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store .cse13 .cse10 v_ArrVal_1858)))) (store .cse70 |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_53| (store (store (select .cse70 |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|) .cse60 v_ArrVal_1867))))) (store .cse69 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse69 |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|)))) (.cse58 (let ((.cse67 (let ((.cse68 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store .cse9 .cse10 v_ArrVal_1859)))) (store .cse68 |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_53| (store (store (select .cse68 |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.offset|) .cse60 v_ArrVal_1870))))) (store .cse67 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse67 |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.offset_63|))))) (let ((.cse59 (select .cse58 |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_53|)) (.cse66 (select .cse65 |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_53|))) (let ((.cse61 (select .cse66 |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset_63|)) (.cse62 (select .cse59 |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset_63|))) (let ((.cse64 (select (select (store .cse65 |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_53| (store .cse66 .cse60 v_ArrVal_1878)) .cse61) .cse62)) (.cse63 (store |c_#length| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_53| v_ArrVal_1862))) (or (<= (+ (select (select (store .cse58 |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_53| (store .cse59 .cse60 v_ArrVal_1877)) .cse61) .cse62) 8) (select .cse63 .cse64)) (= |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_53| .cse64) (not (<= (+ .cse62 8) (select .cse63 .cse61))) (= .cse62 |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset_63|) (not (<= 0 .cse62))))))))) (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)))))))) (forall ((v_ArrVal_1859 Int) (v_ArrVal_1858 Int) (v_ArrVal_1862 Int)) (or (forall ((|v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_53| Int)) (or (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_53|))) (forall ((|v_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset_63| Int)) (or (forall ((v_ArrVal_1870 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_1877 Int) (v_ArrVal_1867 Int) (v_ArrVal_1878 Int)) (let ((.cse75 (+ |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset_63| 4))) (let ((.cse73 (let ((.cse82 (let ((.cse83 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store .cse13 .cse10 v_ArrVal_1858)))) (store .cse83 |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_53| (store (store (select .cse83 |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|) .cse75 v_ArrVal_1867))))) (store .cse82 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse82 |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|)))) (.cse78 (let ((.cse80 (let ((.cse81 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store .cse9 .cse10 v_ArrVal_1859)))) (store .cse81 |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_53| (store (store (select .cse81 |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.offset|) .cse75 v_ArrVal_1870))))) (store .cse80 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse80 |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.offset_63|))))) (let ((.cse79 (select .cse78 |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_53|)) (.cse74 (select .cse73 |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_53|))) (let ((.cse76 (select .cse74 |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset_63|)) (.cse77 (select .cse79 |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset_63|))) (let ((.cse71 (select (select (store .cse78 |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_53| (store .cse79 .cse75 v_ArrVal_1877)) .cse76) .cse77)) (.cse72 (store |c_#length| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_53| v_ArrVal_1862))) (or (<= (+ .cse71 8) (select .cse72 (select (select (store .cse73 |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_53| (store .cse74 .cse75 v_ArrVal_1878)) .cse76) .cse77))) (= .cse71 |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset_63|) (not (<= (+ .cse77 8) (select .cse72 .cse76))) (not (<= 0 .cse77))))))))) (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)))))) (not (<= v_ArrVal_1862 8)))))) is different from true [2022-11-03 03:04:09,683 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 03:04:09,693 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 03:04:09,731 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 03:04:09,762 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 03:04:10,215 INFO L356 Elim1Store]: treesize reduction 2075, result has 3.2 percent of original size [2022-11-03 03:04:10,216 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 1999127 treesize of output 1987077 [2022-11-03 03:04:11,041 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 03:04:11,095 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 03:04:11,386 INFO L356 Elim1Store]: treesize reduction 331, result has 23.7 percent of original size [2022-11-03 03:04:11,389 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 2 new quantified variables, introduced 6 case distinctions, treesize of input 12236524 treesize of output 12203646