./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-ext3-properties/dll_nondet_free_order-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_75cc489c-bbc7-4882-8b9a-1f5e065ba06a/bin/utaipan-7li7fVZpFI/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75cc489c-bbc7-4882-8b9a-1f5e065ba06a/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_75cc489c-bbc7-4882-8b9a-1f5e065ba06a/bin/utaipan-7li7fVZpFI/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75cc489c-bbc7-4882-8b9a-1f5e065ba06a/bin/utaipan-7li7fVZpFI/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-ext3-properties/dll_nondet_free_order-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75cc489c-bbc7-4882-8b9a-1f5e065ba06a/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_75cc489c-bbc7-4882-8b9a-1f5e065ba06a/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 f6eaec015dd6fdb220ef146938a83a65106037c982563310cbbb34d0417543f1 --- 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 04:07:51,298 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-03 04:07:51,301 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-03 04:07:51,357 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-03 04:07:51,357 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-03 04:07:51,362 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-03 04:07:51,365 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-03 04:07:51,371 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-03 04:07:51,373 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-03 04:07:51,379 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-03 04:07:51,381 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-03 04:07:51,382 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-03 04:07:51,383 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-03 04:07:51,386 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-03 04:07:51,388 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-03 04:07:51,389 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-03 04:07:51,391 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-03 04:07:51,392 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-03 04:07:51,394 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-03 04:07:51,402 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-03 04:07:51,404 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-03 04:07:51,406 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-03 04:07:51,410 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-03 04:07:51,411 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-03 04:07:51,421 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-03 04:07:51,421 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-03 04:07:51,422 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-03 04:07:51,424 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-03 04:07:51,425 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-03 04:07:51,426 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-03 04:07:51,426 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-03 04:07:51,428 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-03 04:07:51,430 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-03 04:07:51,431 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-03 04:07:51,433 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-03 04:07:51,433 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-03 04:07:51,434 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-03 04:07:51,434 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-03 04:07:51,435 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-03 04:07:51,436 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-03 04:07:51,437 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-03 04:07:51,439 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75cc489c-bbc7-4882-8b9a-1f5e065ba06a/bin/utaipan-7li7fVZpFI/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2022-11-03 04:07:51,483 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-03 04:07:51,484 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-03 04:07:51,484 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-03 04:07:51,485 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-03 04:07:51,486 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-03 04:07:51,486 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-03 04:07:51,487 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-03 04:07:51,487 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-03 04:07:51,487 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-03 04:07:51,488 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-03 04:07:51,489 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-03 04:07:51,490 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-03 04:07:51,490 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-03 04:07:51,490 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-03 04:07:51,490 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-03 04:07:51,491 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-03 04:07:51,491 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-03 04:07:51,492 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-03 04:07:51,492 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-03 04:07:51,493 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-03 04:07:51,495 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-03 04:07:51,495 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-03 04:07:51,496 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-03 04:07:51,496 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-03 04:07:51,496 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-03 04:07:51,497 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-03 04:07:51,497 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-03 04:07:51,497 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-03 04:07:51,498 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-03 04:07:51,498 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-03 04:07:51,499 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-03 04:07:51,499 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-03 04:07:51,499 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-03 04:07:51,500 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-03 04:07:51,500 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-03 04:07:51,501 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 04:07:51,501 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-03 04:07:51,501 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-03 04:07:51,502 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-03 04:07:51,502 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-03 04:07:51,502 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-03 04:07:51,503 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-03 04:07:51,503 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_75cc489c-bbc7-4882-8b9a-1f5e065ba06a/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_75cc489c-bbc7-4882-8b9a-1f5e065ba06a/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 -> f6eaec015dd6fdb220ef146938a83a65106037c982563310cbbb34d0417543f1 [2022-11-03 04:07:51,818 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-03 04:07:51,844 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-03 04:07:51,848 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-03 04:07:51,849 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-03 04:07:51,850 INFO L275 PluginConnector]: CDTParser initialized [2022-11-03 04:07:51,852 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75cc489c-bbc7-4882-8b9a-1f5e065ba06a/bin/utaipan-7li7fVZpFI/../../sv-benchmarks/c/list-ext3-properties/dll_nondet_free_order-1.i [2022-11-03 04:07:51,921 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75cc489c-bbc7-4882-8b9a-1f5e065ba06a/bin/utaipan-7li7fVZpFI/data/014829586/eb643ae45430401eb193eeac60361642/FLAG20f29ee2d [2022-11-03 04:07:52,513 INFO L306 CDTParser]: Found 1 translation units. [2022-11-03 04:07:52,514 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75cc489c-bbc7-4882-8b9a-1f5e065ba06a/sv-benchmarks/c/list-ext3-properties/dll_nondet_free_order-1.i [2022-11-03 04:07:52,528 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75cc489c-bbc7-4882-8b9a-1f5e065ba06a/bin/utaipan-7li7fVZpFI/data/014829586/eb643ae45430401eb193eeac60361642/FLAG20f29ee2d [2022-11-03 04:07:52,794 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75cc489c-bbc7-4882-8b9a-1f5e065ba06a/bin/utaipan-7li7fVZpFI/data/014829586/eb643ae45430401eb193eeac60361642 [2022-11-03 04:07:52,797 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-03 04:07:52,799 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-03 04:07:52,804 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-03 04:07:52,805 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-03 04:07:52,809 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-03 04:07:52,810 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 04:07:52" (1/1) ... [2022-11-03 04:07:52,812 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@24415f0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:07:52, skipping insertion in model container [2022-11-03 04:07:52,812 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 04:07:52" (1/1) ... [2022-11-03 04:07:52,821 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-03 04:07:52,861 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-03 04:07:53,232 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 04:07:53,239 INFO L203 MainTranslator]: Completed pre-run [2022-11-03 04:07:53,288 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 04:07:53,314 INFO L208 MainTranslator]: Completed translation [2022-11-03 04:07:53,314 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:07:53 WrapperNode [2022-11-03 04:07:53,315 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-03 04:07:53,316 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-03 04:07:53,316 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-03 04:07:53,317 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-03 04:07:53,326 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:07:53" (1/1) ... [2022-11-03 04:07:53,341 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:07:53" (1/1) ... [2022-11-03 04:07:53,370 INFO L138 Inliner]: procedures = 116, calls = 31, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 128 [2022-11-03 04:07:53,370 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-03 04:07:53,371 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-03 04:07:53,371 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-03 04:07:53,371 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-03 04:07:53,383 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:07:53" (1/1) ... [2022-11-03 04:07:53,383 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:07:53" (1/1) ... [2022-11-03 04:07:53,387 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:07:53" (1/1) ... [2022-11-03 04:07:53,387 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:07:53" (1/1) ... [2022-11-03 04:07:53,398 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:07:53" (1/1) ... [2022-11-03 04:07:53,403 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:07:53" (1/1) ... [2022-11-03 04:07:53,405 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:07:53" (1/1) ... [2022-11-03 04:07:53,406 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:07:53" (1/1) ... [2022-11-03 04:07:53,409 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-03 04:07:53,410 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-03 04:07:53,410 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-03 04:07:53,410 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-03 04:07:53,412 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:07:53" (1/1) ... [2022-11-03 04:07:53,419 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 04:07:53,432 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75cc489c-bbc7-4882-8b9a-1f5e065ba06a/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 04:07:53,446 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75cc489c-bbc7-4882-8b9a-1f5e065ba06a/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-03 04:07:53,478 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75cc489c-bbc7-4882-8b9a-1f5e065ba06a/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-03 04:07:53,509 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2022-11-03 04:07:53,509 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2022-11-03 04:07:53,509 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-03 04:07:53,509 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-03 04:07:53,510 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-03 04:07:53,510 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-03 04:07:53,510 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-03 04:07:53,510 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-03 04:07:53,674 INFO L235 CfgBuilder]: Building ICFG [2022-11-03 04:07:53,677 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-03 04:07:53,745 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2022-11-03 04:07:54,231 INFO L276 CfgBuilder]: Performing block encoding [2022-11-03 04:07:54,306 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-03 04:07:54,307 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-03 04:07:54,314 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 04:07:54 BoogieIcfgContainer [2022-11-03 04:07:54,315 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-03 04:07:54,318 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-03 04:07:54,318 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-03 04:07:54,323 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-03 04:07:54,323 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.11 04:07:52" (1/3) ... [2022-11-03 04:07:54,324 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f8f0670 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 04:07:54, skipping insertion in model container [2022-11-03 04:07:54,324 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:07:53" (2/3) ... [2022-11-03 04:07:54,325 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f8f0670 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 04:07:54, skipping insertion in model container [2022-11-03 04:07:54,325 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 04:07:54" (3/3) ... [2022-11-03 04:07:54,327 INFO L112 eAbstractionObserver]: Analyzing ICFG dll_nondet_free_order-1.i [2022-11-03 04:07:54,358 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-03 04:07:54,358 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 62 error locations. [2022-11-03 04:07:54,426 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-03 04:07:54,435 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;@5609bd51, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-03 04:07:54,435 INFO L358 AbstractCegarLoop]: Starting to check reachability of 62 error locations. [2022-11-03 04:07:54,441 INFO L276 IsEmpty]: Start isEmpty. Operand has 131 states, 66 states have (on average 2.0606060606060606) internal successors, (136), 129 states have internal predecessors, (136), 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 04:07:54,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-03 04:07:54,451 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:07:54,452 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-03 04:07:54,452 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2022-11-03 04:07:54,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:07:54,460 INFO L85 PathProgramCache]: Analyzing trace with hash 218566, now seen corresponding path program 1 times [2022-11-03 04:07:54,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:07:54,473 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206230125] [2022-11-03 04:07:54,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:07:54,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:07:54,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:07:54,755 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 04:07:54,756 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:07:54,757 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206230125] [2022-11-03 04:07:54,757 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206230125] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 04:07:54,758 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 04:07:54,759 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-03 04:07:54,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431406742] [2022-11-03 04:07:54,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 04:07:54,768 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 04:07:54,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:07:54,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 04:07:54,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 04:07:54,814 INFO L87 Difference]: Start difference. First operand has 131 states, 66 states have (on average 2.0606060606060606) internal successors, (136), 129 states have internal predecessors, (136), 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 04:07:55,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:07:55,038 INFO L93 Difference]: Finished difference Result 128 states and 135 transitions. [2022-11-03 04:07:55,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 04:07:55,041 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 04:07:55,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:07:55,051 INFO L225 Difference]: With dead ends: 128 [2022-11-03 04:07:55,051 INFO L226 Difference]: Without dead ends: 123 [2022-11-03 04:07:55,053 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 04:07:55,057 INFO L413 NwaCegarLoop]: 107 mSDtfsCounter, 44 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 04:07:55,059 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 164 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 04:07:55,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2022-11-03 04:07:55,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2022-11-03 04:07:55,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 64 states have (on average 2.0) internal successors, (128), 122 states have internal predecessors, (128), 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 04:07:55,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 128 transitions. [2022-11-03 04:07:55,103 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 128 transitions. Word has length 3 [2022-11-03 04:07:55,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:07:55,104 INFO L495 AbstractCegarLoop]: Abstraction has 123 states and 128 transitions. [2022-11-03 04:07:55,104 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 04:07:55,104 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 128 transitions. [2022-11-03 04:07:55,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-03 04:07:55,105 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:07:55,105 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-03 04:07:55,105 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-03 04:07:55,106 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2022-11-03 04:07:55,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:07:55,107 INFO L85 PathProgramCache]: Analyzing trace with hash 218567, now seen corresponding path program 1 times [2022-11-03 04:07:55,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:07:55,108 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634311997] [2022-11-03 04:07:55,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:07:55,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:07:55,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:07:55,202 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 04:07:55,202 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:07:55,202 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634311997] [2022-11-03 04:07:55,203 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1634311997] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 04:07:55,203 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 04:07:55,203 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-03 04:07:55,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702797747] [2022-11-03 04:07:55,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 04:07:55,205 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 04:07:55,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:07:55,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 04:07:55,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 04:07:55,207 INFO L87 Difference]: Start difference. First operand 123 states and 128 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 04:07:55,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:07:55,253 INFO L93 Difference]: Finished difference Result 120 states and 125 transitions. [2022-11-03 04:07:55,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 04:07:55,254 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 04:07:55,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:07:55,255 INFO L225 Difference]: With dead ends: 120 [2022-11-03 04:07:55,255 INFO L226 Difference]: Without dead ends: 120 [2022-11-03 04:07:55,256 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 04:07:55,257 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 122 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-03 04:07:55,258 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 108 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-03 04:07:55,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2022-11-03 04:07:55,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2022-11-03 04:07:55,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 64 states have (on average 1.953125) internal successors, (125), 119 states have internal predecessors, (125), 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 04:07:55,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 125 transitions. [2022-11-03 04:07:55,268 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 125 transitions. Word has length 3 [2022-11-03 04:07:55,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:07:55,269 INFO L495 AbstractCegarLoop]: Abstraction has 120 states and 125 transitions. [2022-11-03 04:07:55,269 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 04:07:55,269 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 125 transitions. [2022-11-03 04:07:55,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-03 04:07:55,270 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:07:55,270 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:07:55,270 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-03 04:07:55,270 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2022-11-03 04:07:55,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:07:55,271 INFO L85 PathProgramCache]: Analyzing trace with hash -8181935, now seen corresponding path program 1 times [2022-11-03 04:07:55,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:07:55,314 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748165487] [2022-11-03 04:07:55,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:07:55,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:07:55,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:07:55,516 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 04:07:55,517 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:07:55,517 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748165487] [2022-11-03 04:07:55,518 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748165487] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 04:07:55,518 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 04:07:55,518 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-03 04:07:55,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521829046] [2022-11-03 04:07:55,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 04:07:55,521 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 04:07:55,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:07:55,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 04:07:55,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 04:07:55,523 INFO L87 Difference]: Start difference. First operand 120 states and 125 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 04:07:55,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:07:55,570 INFO L93 Difference]: Finished difference Result 128 states and 133 transitions. [2022-11-03 04:07:55,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 04:07:55,571 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 04:07:55,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:07:55,574 INFO L225 Difference]: With dead ends: 128 [2022-11-03 04:07:55,574 INFO L226 Difference]: Without dead ends: 128 [2022-11-03 04:07:55,574 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 04:07:55,576 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 7 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 232 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 04:07:55,576 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 232 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-03 04:07:55,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2022-11-03 04:07:55,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 121. [2022-11-03 04:07:55,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 65 states have (on average 1.9384615384615385) internal successors, (126), 120 states have internal predecessors, (126), 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 04:07:55,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 126 transitions. [2022-11-03 04:07:55,602 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 126 transitions. Word has length 7 [2022-11-03 04:07:55,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:07:55,602 INFO L495 AbstractCegarLoop]: Abstraction has 121 states and 126 transitions. [2022-11-03 04:07:55,603 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 04:07:55,604 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 126 transitions. [2022-11-03 04:07:55,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-03 04:07:55,605 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:07:55,605 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:07:55,605 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-03 04:07:55,606 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2022-11-03 04:07:55,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:07:55,608 INFO L85 PathProgramCache]: Analyzing trace with hash -8345690, now seen corresponding path program 1 times [2022-11-03 04:07:55,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:07:55,609 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263405163] [2022-11-03 04:07:55,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:07:55,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:07:55,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:07:55,719 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 04:07:55,720 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:07:55,720 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263405163] [2022-11-03 04:07:55,721 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1263405163] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 04:07:55,722 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 04:07:55,722 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-03 04:07:55,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303190370] [2022-11-03 04:07:55,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 04:07:55,725 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 04:07:55,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:07:55,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 04:07:55,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 04:07:55,726 INFO L87 Difference]: Start difference. First operand 121 states and 126 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 04:07:55,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:07:55,844 INFO L93 Difference]: Finished difference Result 120 states and 125 transitions. [2022-11-03 04:07:55,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 04:07:55,844 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 04:07:55,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:07:55,846 INFO L225 Difference]: With dead ends: 120 [2022-11-03 04:07:55,848 INFO L226 Difference]: Without dead ends: 120 [2022-11-03 04:07:55,849 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 04:07:55,850 INFO L413 NwaCegarLoop]: 103 mSDtfsCounter, 35 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 04:07:55,855 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 159 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 04:07:55,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2022-11-03 04:07:55,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2022-11-03 04:07:55,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 65 states have (on average 1.9230769230769231) internal successors, (125), 119 states have internal predecessors, (125), 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 04:07:55,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 125 transitions. [2022-11-03 04:07:55,875 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 125 transitions. Word has length 7 [2022-11-03 04:07:55,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:07:55,876 INFO L495 AbstractCegarLoop]: Abstraction has 120 states and 125 transitions. [2022-11-03 04:07:55,876 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 04:07:55,876 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 125 transitions. [2022-11-03 04:07:55,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-03 04:07:55,877 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:07:55,877 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:07:55,877 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-03 04:07:55,883 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2022-11-03 04:07:55,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:07:55,884 INFO L85 PathProgramCache]: Analyzing trace with hash -8345689, now seen corresponding path program 1 times [2022-11-03 04:07:55,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:07:55,884 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50700807] [2022-11-03 04:07:55,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:07:55,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:07:55,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:07:56,026 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 04:07:56,026 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:07:56,026 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50700807] [2022-11-03 04:07:56,027 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [50700807] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 04:07:56,027 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 04:07:56,027 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-03 04:07:56,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614914136] [2022-11-03 04:07:56,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 04:07:56,028 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 04:07:56,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:07:56,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 04:07:56,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 04:07:56,029 INFO L87 Difference]: Start difference. First operand 120 states and 125 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 04:07:56,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:07:56,061 INFO L93 Difference]: Finished difference Result 119 states and 124 transitions. [2022-11-03 04:07:56,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 04:07:56,062 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 04:07:56,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:07:56,063 INFO L225 Difference]: With dead ends: 119 [2022-11-03 04:07:56,063 INFO L226 Difference]: Without dead ends: 119 [2022-11-03 04:07:56,063 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 04:07:56,065 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 117 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-03 04:07:56,065 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 110 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-03 04:07:56,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2022-11-03 04:07:56,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2022-11-03 04:07:56,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 65 states have (on average 1.9076923076923078) internal successors, (124), 118 states have internal predecessors, (124), 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 04:07:56,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 124 transitions. [2022-11-03 04:07:56,072 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 124 transitions. Word has length 7 [2022-11-03 04:07:56,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:07:56,073 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 124 transitions. [2022-11-03 04:07:56,073 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 04:07:56,074 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 124 transitions. [2022-11-03 04:07:56,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-03 04:07:56,074 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:07:56,074 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:07:56,075 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-03 04:07:56,075 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2022-11-03 04:07:56,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:07:56,076 INFO L85 PathProgramCache]: Analyzing trace with hash -258716379, now seen corresponding path program 1 times [2022-11-03 04:07:56,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:07:56,076 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160102824] [2022-11-03 04:07:56,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:07:56,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:07:56,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:07:56,202 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 04:07:56,202 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:07:56,202 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160102824] [2022-11-03 04:07:56,203 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [160102824] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 04:07:56,203 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 04:07:56,203 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-03 04:07:56,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253897487] [2022-11-03 04:07:56,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 04:07:56,204 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-03 04:07:56,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:07:56,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-03 04:07:56,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-03 04:07:56,205 INFO L87 Difference]: Start difference. First operand 119 states and 124 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 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 04:07:56,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:07:56,396 INFO L93 Difference]: Finished difference Result 123 states and 128 transitions. [2022-11-03 04:07:56,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-03 04:07:56,396 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 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 8 [2022-11-03 04:07:56,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:07:56,397 INFO L225 Difference]: With dead ends: 123 [2022-11-03 04:07:56,397 INFO L226 Difference]: Without dead ends: 123 [2022-11-03 04:07:56,398 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-11-03 04:07:56,399 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 72 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 04:07:56,400 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 265 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 04:07:56,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2022-11-03 04:07:56,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 122. [2022-11-03 04:07:56,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 68 states have (on average 1.8823529411764706) internal successors, (128), 121 states have internal predecessors, (128), 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 04:07:56,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 128 transitions. [2022-11-03 04:07:56,407 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 128 transitions. Word has length 8 [2022-11-03 04:07:56,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:07:56,407 INFO L495 AbstractCegarLoop]: Abstraction has 122 states and 128 transitions. [2022-11-03 04:07:56,407 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 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 04:07:56,408 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 128 transitions. [2022-11-03 04:07:56,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-03 04:07:56,408 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:07:56,408 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:07:56,409 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-03 04:07:56,409 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2022-11-03 04:07:56,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:07:56,410 INFO L85 PathProgramCache]: Analyzing trace with hash -258716378, now seen corresponding path program 1 times [2022-11-03 04:07:56,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:07:56,410 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149240200] [2022-11-03 04:07:56,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:07:56,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:07:56,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:07:56,661 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 04:07:56,661 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:07:56,661 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149240200] [2022-11-03 04:07:56,661 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1149240200] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 04:07:56,661 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 04:07:56,662 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-03 04:07:56,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540804905] [2022-11-03 04:07:56,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 04:07:56,662 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-03 04:07:56,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:07:56,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-03 04:07:56,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-03 04:07:56,663 INFO L87 Difference]: Start difference. First operand 122 states and 128 transitions. Second operand has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 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 04:07:56,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:07:56,812 INFO L93 Difference]: Finished difference Result 122 states and 127 transitions. [2022-11-03 04:07:56,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-03 04:07:56,812 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 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 8 [2022-11-03 04:07:56,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:07:56,813 INFO L225 Difference]: With dead ends: 122 [2022-11-03 04:07:56,813 INFO L226 Difference]: Without dead ends: 122 [2022-11-03 04:07:56,814 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-03 04:07:56,815 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 160 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 04:07:56,815 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 249 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 04:07:56,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2022-11-03 04:07:56,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2022-11-03 04:07:56,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 68 states have (on average 1.8676470588235294) internal successors, (127), 121 states have internal predecessors, (127), 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 04:07:56,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 127 transitions. [2022-11-03 04:07:56,821 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 127 transitions. Word has length 8 [2022-11-03 04:07:56,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:07:56,822 INFO L495 AbstractCegarLoop]: Abstraction has 122 states and 127 transitions. [2022-11-03 04:07:56,822 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 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 04:07:56,822 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 127 transitions. [2022-11-03 04:07:56,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-03 04:07:56,823 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:07:56,823 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:07:56,823 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-03 04:07:56,823 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2022-11-03 04:07:56,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:07:56,824 INFO L85 PathProgramCache]: Analyzing trace with hash 2051460876, now seen corresponding path program 1 times [2022-11-03 04:07:56,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:07:56,824 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31160592] [2022-11-03 04:07:56,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:07:56,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:07:56,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:07:56,878 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:07:56,879 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:07:56,879 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31160592] [2022-11-03 04:07:56,879 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [31160592] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 04:07:56,879 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 04:07:56,879 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 04:07:56,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165709416] [2022-11-03 04:07:56,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 04:07:56,880 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 04:07:56,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:07:56,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 04:07:56,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-03 04:07:56,881 INFO L87 Difference]: Start difference. First operand 122 states and 127 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 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 04:07:56,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:07:56,986 INFO L93 Difference]: Finished difference Result 120 states and 125 transitions. [2022-11-03 04:07:56,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-03 04:07:56,987 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 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 11 [2022-11-03 04:07:56,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:07:56,988 INFO L225 Difference]: With dead ends: 120 [2022-11-03 04:07:56,988 INFO L226 Difference]: Without dead ends: 120 [2022-11-03 04:07:56,988 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-03 04:07:56,989 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 61 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 04:07:56,990 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 212 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 04:07:56,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2022-11-03 04:07:56,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2022-11-03 04:07:56,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 68 states have (on average 1.838235294117647) internal successors, (125), 119 states have internal predecessors, (125), 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 04:07:56,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 125 transitions. [2022-11-03 04:07:56,995 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 125 transitions. Word has length 11 [2022-11-03 04:07:56,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:07:56,995 INFO L495 AbstractCegarLoop]: Abstraction has 120 states and 125 transitions. [2022-11-03 04:07:56,995 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 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 04:07:56,995 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 125 transitions. [2022-11-03 04:07:56,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-03 04:07:56,996 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:07:56,996 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:07:56,996 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-03 04:07:56,996 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2022-11-03 04:07:56,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:07:56,997 INFO L85 PathProgramCache]: Analyzing trace with hash 2051460877, now seen corresponding path program 1 times [2022-11-03 04:07:56,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:07:56,997 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785485955] [2022-11-03 04:07:56,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:07:56,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:07:57,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:07:57,065 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 04:07:57,065 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:07:57,065 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785485955] [2022-11-03 04:07:57,065 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785485955] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 04:07:57,065 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1430613999] [2022-11-03 04:07:57,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:07:57,066 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:07:57,066 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75cc489c-bbc7-4882-8b9a-1f5e065ba06a/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 04:07:57,070 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75cc489c-bbc7-4882-8b9a-1f5e065ba06a/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 04:07:57,092 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75cc489c-bbc7-4882-8b9a-1f5e065ba06a/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-03 04:07:57,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:07:57,200 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-03 04:07:57,211 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:07:57,272 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 04:07:57,272 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 04:07:57,309 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 04:07:57,310 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1430613999] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 04:07:57,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1549945352] [2022-11-03 04:07:57,331 INFO L159 IcfgInterpreter]: Started Sifa with 11 locations of interest [2022-11-03 04:07:57,331 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 04:07:57,336 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 04:07:57,343 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 04:07:57,343 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 04:07:57,424 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 04:07:57,457 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 04:07:57,471 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 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 04:07:57,501 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:07:57,503 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-03 04:07:57,519 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:07:57,520 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-03 04:07:57,561 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:07:57,563 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 [2022-11-03 04:07:57,626 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:07:57,628 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:07:57,629 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 28 treesize of output 30 [2022-11-03 04:07:57,692 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:07:57,694 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:07:57,696 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 28 treesize of output 30 [2022-11-03 04:07:57,769 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:07:57,771 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:07:57,773 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 33 [2022-11-03 04:07:57,801 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:07:57,802 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:07:57,805 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 33 [2022-11-03 04:07:57,877 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:07:57,880 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:07:57,882 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:07:57,885 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 38 [2022-11-03 04:07:58,131 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:07:58,133 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:07:58,182 INFO L356 Elim1Store]: treesize reduction 66, result has 18.5 percent of original size [2022-11-03 04:07:58,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, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 322 treesize of output 302 [2022-11-03 04:07:58,221 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:07:58,222 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:07:58,271 INFO L356 Elim1Store]: treesize reduction 96, result has 17.9 percent of original size [2022-11-03 04:07:58,272 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 322 treesize of output 317 [2022-11-03 04:07:58,523 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:07:58,524 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:07:58,627 INFO L356 Elim1Store]: treesize reduction 180, result has 16.3 percent of original size [2022-11-03 04:07:58,628 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 6 new quantified variables, introduced 10 case distinctions, treesize of input 439 treesize of output 401 [2022-11-03 04:07:58,672 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:07:58,787 INFO L356 Elim1Store]: treesize reduction 212, result has 16.2 percent of original size [2022-11-03 04:07:58,788 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 10 case distinctions, treesize of input 431 treesize of output 376 [2022-11-03 04:07:59,108 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:07:59,110 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:07:59,139 INFO L356 Elim1Store]: treesize reduction 49, result has 5.8 percent of original size [2022-11-03 04:07:59,140 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 724 treesize of output 700 [2022-11-03 04:07:59,456 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:07:59,458 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:07:59,502 INFO L356 Elim1Store]: treesize reduction 66, result has 18.5 percent of original size [2022-11-03 04:07:59,503 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 5 case distinctions, treesize of input 322 treesize of output 302 [2022-11-03 04:07:59,531 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:07:59,533 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:07:59,579 INFO L356 Elim1Store]: treesize reduction 96, result has 17.9 percent of original size [2022-11-03 04:07:59,580 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 322 treesize of output 317 [2022-11-03 04:07:59,724 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:07:59,835 INFO L356 Elim1Store]: treesize reduction 212, result has 16.2 percent of original size [2022-11-03 04:07:59,836 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 10 case distinctions, treesize of input 439 treesize of output 380 [2022-11-03 04:07:59,870 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:07:59,871 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:07:59,962 INFO L356 Elim1Store]: treesize reduction 180, result has 16.3 percent of original size [2022-11-03 04:07:59,963 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 6 new quantified variables, introduced 9 case distinctions, treesize of input 419 treesize of output 381 [2022-11-03 04:08:00,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, 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 04:08:00,180 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 04:08:00,338 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:08:00,340 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:08:00,368 INFO L356 Elim1Store]: treesize reduction 49, result has 5.8 percent of original size [2022-11-03 04:08:00,371 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 724 treesize of output 700 [2022-11-03 04:08:00,551 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 04:08:02,510 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2184#(and (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset|)) (<= 1 |ULTIMATE.start_dll_circular_create_~len#1|) (<= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1) (<= |#NULL.offset| 0) (<= 3 |ULTIMATE.start_dll_circular_create_#in~len#1|) (<= (+ |ULTIMATE.start_dll_circular_create_~last~0#1.offset| 4) (select |#length| |ULTIMATE.start_dll_circular_create_~last~0#1.base|)) (< (select |#length| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 8)) (<= |ULTIMATE.start_dll_circular_create_#in~len#1| 3) (= |ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset|) |ULTIMATE.start_dll_circular_create_~head~0#1.base|) (<= |ULTIMATE.start_main_~len~0#1| 3) (<= 0 |#NULL.offset|) (<= |ULTIMATE.start_dll_circular_create_~len#1| 1) (<= 3 |ULTIMATE.start_main_~len~0#1|) (<= 0 |#StackHeapBarrier|) (<= 0 |ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (= |#NULL.base| 0))' at error location [2022-11-03 04:08:02,511 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-03 04:08:02,511 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 04:08:02,511 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 3 [2022-11-03 04:08:02,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669896715] [2022-11-03 04:08:02,512 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 04:08:02,513 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 04:08:02,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:08:02,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 04:08:02,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2022-11-03 04:08:02,515 INFO L87 Difference]: Start difference. First operand 120 states and 125 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 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 04:08:02,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:08:02,551 INFO L93 Difference]: Finished difference Result 121 states and 126 transitions. [2022-11-03 04:08:02,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-03 04:08:02,552 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 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 11 [2022-11-03 04:08:02,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:08:02,553 INFO L225 Difference]: With dead ends: 121 [2022-11-03 04:08:02,553 INFO L226 Difference]: Without dead ends: 121 [2022-11-03 04:08:02,553 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 21 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2022-11-03 04:08:02,562 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 10 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-03 04:08:02,563 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 332 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-03 04:08:02,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2022-11-03 04:08:02,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2022-11-03 04:08:02,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 69 states have (on average 1.826086956521739) internal successors, (126), 120 states have internal predecessors, (126), 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 04:08:02,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 126 transitions. [2022-11-03 04:08:02,571 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 126 transitions. Word has length 11 [2022-11-03 04:08:02,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:08:02,572 INFO L495 AbstractCegarLoop]: Abstraction has 121 states and 126 transitions. [2022-11-03 04:08:02,572 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 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 04:08:02,573 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 126 transitions. [2022-11-03 04:08:02,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-03 04:08:02,573 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:08:02,574 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-11-03 04:08:02,623 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75cc489c-bbc7-4882-8b9a-1f5e065ba06a/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-03 04:08:02,798 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75cc489c-bbc7-4882-8b9a-1f5e065ba06a/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:08:02,799 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2022-11-03 04:08:02,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:08:02,799 INFO L85 PathProgramCache]: Analyzing trace with hash -834298677, now seen corresponding path program 1 times [2022-11-03 04:08:02,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:08:02,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783940808] [2022-11-03 04:08:02,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:08:02,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:08:02,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:08:02,983 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:08:02,983 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:08:02,983 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783940808] [2022-11-03 04:08:02,983 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1783940808] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 04:08:02,983 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1144721124] [2022-11-03 04:08:02,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:08:02,984 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:08:02,984 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75cc489c-bbc7-4882-8b9a-1f5e065ba06a/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 04:08:02,985 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75cc489c-bbc7-4882-8b9a-1f5e065ba06a/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 04:08:02,992 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75cc489c-bbc7-4882-8b9a-1f5e065ba06a/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-03 04:08:03,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:08:03,078 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 15 conjunts are in the unsatisfiable core [2022-11-03 04:08:03,080 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:08:03,089 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 04:08:03,095 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 04:08:03,132 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:08:03,133 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 14 [2022-11-03 04:08:03,141 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-03 04:08:03,142 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 04:08:03,154 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:08:03,154 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 04:08:09,515 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:08:09,516 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1144721124] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 04:08:09,516 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1541648628] [2022-11-03 04:08:09,522 INFO L159 IcfgInterpreter]: Started Sifa with 9 locations of interest [2022-11-03 04:08:09,522 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 04:08:09,523 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 04:08:09,523 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 04:08:09,523 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 04:08:09,547 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 04:08:09,565 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 04:08:09,579 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 04:08:09,599 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:08:09,600 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-03 04:08:09,618 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:08:09,620 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-03 04:08:09,648 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:08:09,649 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 [2022-11-03 04:08:09,683 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:08:09,684 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:08:09,686 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 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 04:08:09,707 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:08:09,708 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:08:09,710 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2022-11-03 04:08:09,783 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:08:09,784 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:08:09,806 INFO L356 Elim1Store]: treesize reduction 48, result has 12.7 percent of original size [2022-11-03 04:08:09,807 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 78 treesize of output 61 [2022-11-03 04:08:09,824 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:08:09,826 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:08:09,828 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 33 [2022-11-03 04:08:09,876 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:08:09,878 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:08:09,879 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:08:09,880 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 38 [2022-11-03 04:08:09,967 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:08:09,968 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:08:09,969 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:08:10,008 INFO L356 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2022-11-03 04:08:10,009 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 5 case distinctions, treesize of input 351 treesize of output 295 [2022-11-03 04:08:10,032 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:08:10,033 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:08:10,034 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:08:10,077 INFO L356 Elim1Store]: treesize reduction 64, result has 24.7 percent of original size [2022-11-03 04:08:10,079 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 351 treesize of output 346 [2022-11-03 04:08:10,186 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:08:10,188 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:08:10,189 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:08:10,190 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:08:10,191 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:08:10,226 INFO L356 Elim1Store]: treesize reduction 39, result has 25.0 percent of original size [2022-11-03 04:08:10,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, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 7 case distinctions, treesize of input 444 treesize of output 370 [2022-11-03 04:08:10,254 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:08:10,376 INFO L356 Elim1Store]: treesize reduction 180, result has 14.7 percent of original size [2022-11-03 04:08:10,376 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 6 new quantified variables, introduced 9 case distinctions, treesize of input 375 treesize of output 339 [2022-11-03 04:08:10,552 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:08:10,554 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:08:10,582 INFO L356 Elim1Store]: treesize reduction 47, result has 9.6 percent of original size [2022-11-03 04:08:10,583 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 373 treesize of output 369 [2022-11-03 04:08:10,744 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:08:10,745 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:08:10,746 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:08:10,790 INFO L356 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2022-11-03 04:08:10,791 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 5 case distinctions, treesize of input 351 treesize of output 295 [2022-11-03 04:08:10,816 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:08:10,818 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:08:10,819 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:08:10,862 INFO L356 Elim1Store]: treesize reduction 64, result has 24.7 percent of original size [2022-11-03 04:08:10,863 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 351 treesize of output 346 [2022-11-03 04:08:10,972 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:08:10,974 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:08:10,976 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:08:10,977 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:08:10,978 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:08:11,016 INFO L356 Elim1Store]: treesize reduction 39, result has 25.0 percent of original size [2022-11-03 04:08:11,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, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 7 case distinctions, treesize of input 444 treesize of output 370 [2022-11-03 04:08:11,045 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:08:11,133 INFO L356 Elim1Store]: treesize reduction 180, result has 14.7 percent of original size [2022-11-03 04:08:11,134 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 6 new quantified variables, introduced 9 case distinctions, treesize of input 375 treesize of output 339 [2022-11-03 04:08:11,320 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:08:11,322 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:08:11,350 INFO L356 Elim1Store]: treesize reduction 49, result has 5.8 percent of original size [2022-11-03 04:08:11,351 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 373 treesize of output 367 [2022-11-03 04:08:11,481 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 04:08:13,316 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [1541648628] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 04:08:13,316 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-03 04:08:13,316 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [5, 4, 4] total 14 [2022-11-03 04:08:13,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149652709] [2022-11-03 04:08:13,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 04:08:13,318 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-03 04:08:13,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:08:13,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-03 04:08:13,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2022-11-03 04:08:13,319 INFO L87 Difference]: Start difference. First operand 121 states and 126 transitions. Second operand has 8 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 7 states have internal predecessors, (9), 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 04:08:13,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:08:13,950 INFO L93 Difference]: Finished difference Result 120 states and 125 transitions. [2022-11-03 04:08:13,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-03 04:08:13,951 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 7 states have internal predecessors, (9), 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 12 [2022-11-03 04:08:13,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:08:13,952 INFO L225 Difference]: With dead ends: 120 [2022-11-03 04:08:13,952 INFO L226 Difference]: Without dead ends: 120 [2022-11-03 04:08:13,952 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=59, Invalid=181, Unknown=0, NotChecked=0, Total=240 [2022-11-03 04:08:13,953 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 227 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 227 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-03 04:08:13,954 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [227 Valid, 158 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-03 04:08:13,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2022-11-03 04:08:13,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2022-11-03 04:08:13,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 69 states have (on average 1.8115942028985508) internal successors, (125), 119 states have internal predecessors, (125), 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 04:08:13,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 125 transitions. [2022-11-03 04:08:13,958 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 125 transitions. Word has length 12 [2022-11-03 04:08:13,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:08:13,958 INFO L495 AbstractCegarLoop]: Abstraction has 120 states and 125 transitions. [2022-11-03 04:08:13,958 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 7 states have internal predecessors, (9), 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 04:08:13,958 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 125 transitions. [2022-11-03 04:08:13,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-03 04:08:13,959 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:08:13,959 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:08:13,999 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75cc489c-bbc7-4882-8b9a-1f5e065ba06a/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-03 04:08:14,182 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75cc489c-bbc7-4882-8b9a-1f5e065ba06a/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-03 04:08:14,183 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2022-11-03 04:08:14,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:08:14,183 INFO L85 PathProgramCache]: Analyzing trace with hash 388637000, now seen corresponding path program 2 times [2022-11-03 04:08:14,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:08:14,184 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627782546] [2022-11-03 04:08:14,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:08:14,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:08:14,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:08:14,385 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 04:08:14,386 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:08:14,386 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627782546] [2022-11-03 04:08:14,386 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1627782546] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 04:08:14,386 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 04:08:14,386 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 04:08:14,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785827544] [2022-11-03 04:08:14,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 04:08:14,387 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 04:08:14,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:08:14,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 04:08:14,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-03 04:08:14,388 INFO L87 Difference]: Start difference. First operand 120 states and 125 transitions. Second operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 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 04:08:14,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:08:14,442 INFO L93 Difference]: Finished difference Result 119 states and 124 transitions. [2022-11-03 04:08:14,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-03 04:08:14,443 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 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 15 [2022-11-03 04:08:14,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:08:14,444 INFO L225 Difference]: With dead ends: 119 [2022-11-03 04:08:14,444 INFO L226 Difference]: Without dead ends: 119 [2022-11-03 04:08:14,444 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-03 04:08:14,445 INFO L413 NwaCegarLoop]: 107 mSDtfsCounter, 223 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-03 04:08:14,448 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [223 Valid, 109 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-03 04:08:14,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2022-11-03 04:08:14,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2022-11-03 04:08:14,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 69 states have (on average 1.7971014492753623) internal successors, (124), 118 states have internal predecessors, (124), 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 04:08:14,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 124 transitions. [2022-11-03 04:08:14,452 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 124 transitions. Word has length 15 [2022-11-03 04:08:14,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:08:14,453 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 124 transitions. [2022-11-03 04:08:14,453 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 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 04:08:14,453 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 124 transitions. [2022-11-03 04:08:14,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-03 04:08:14,454 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:08:14,455 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:08:14,455 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-03 04:08:14,455 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2022-11-03 04:08:14,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:08:14,456 INFO L85 PathProgramCache]: Analyzing trace with hash -837150459, now seen corresponding path program 1 times [2022-11-03 04:08:14,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:08:14,456 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584212101] [2022-11-03 04:08:14,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:08:14,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:08:14,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:08:14,552 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-03 04:08:14,552 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:08:14,553 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584212101] [2022-11-03 04:08:14,553 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1584212101] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 04:08:14,553 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 04:08:14,553 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-03 04:08:14,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740690206] [2022-11-03 04:08:14,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 04:08:14,554 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 04:08:14,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:08:14,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 04:08:14,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 04:08:14,555 INFO L87 Difference]: Start difference. First operand 119 states and 124 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 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 04:08:14,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:08:14,643 INFO L93 Difference]: Finished difference Result 116 states and 121 transitions. [2022-11-03 04:08:14,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 04:08:14,643 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 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 16 [2022-11-03 04:08:14,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:08:14,645 INFO L225 Difference]: With dead ends: 116 [2022-11-03 04:08:14,645 INFO L226 Difference]: Without dead ends: 116 [2022-11-03 04:08:14,645 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 04:08:14,646 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 22 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 04:08:14,646 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 149 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 04:08:14,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2022-11-03 04:08:14,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2022-11-03 04:08:14,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 69 states have (on average 1.7536231884057971) internal successors, (121), 115 states have internal predecessors, (121), 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 04:08:14,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 121 transitions. [2022-11-03 04:08:14,650 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 121 transitions. Word has length 16 [2022-11-03 04:08:14,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:08:14,651 INFO L495 AbstractCegarLoop]: Abstraction has 116 states and 121 transitions. [2022-11-03 04:08:14,651 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 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 04:08:14,651 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 121 transitions. [2022-11-03 04:08:14,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-03 04:08:14,652 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:08:14,652 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:08:14,652 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-03 04:08:14,655 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2022-11-03 04:08:14,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:08:14,656 INFO L85 PathProgramCache]: Analyzing trace with hash -837150458, now seen corresponding path program 1 times [2022-11-03 04:08:14,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:08:14,656 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449555776] [2022-11-03 04:08:14,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:08:14,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:08:14,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:08:14,900 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 04:08:14,901 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:08:14,901 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449555776] [2022-11-03 04:08:14,901 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1449555776] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 04:08:14,901 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 04:08:14,901 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-03 04:08:14,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124100877] [2022-11-03 04:08:14,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 04:08:14,902 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-03 04:08:14,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:08:14,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-03 04:08:14,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-03 04:08:14,903 INFO L87 Difference]: Start difference. First operand 116 states and 121 transitions. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 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 04:08:15,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:08:15,033 INFO L93 Difference]: Finished difference Result 109 states and 114 transitions. [2022-11-03 04:08:15,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-03 04:08:15,034 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 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 16 [2022-11-03 04:08:15,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:08:15,035 INFO L225 Difference]: With dead ends: 109 [2022-11-03 04:08:15,035 INFO L226 Difference]: Without dead ends: 109 [2022-11-03 04:08:15,035 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 04:08:15,036 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 301 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 301 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 04:08:15,036 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [301 Valid, 78 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 04:08:15,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2022-11-03 04:08:15,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2022-11-03 04:08:15,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 69 states have (on average 1.6521739130434783) internal successors, (114), 108 states have internal predecessors, (114), 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 04:08:15,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 114 transitions. [2022-11-03 04:08:15,040 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 114 transitions. Word has length 16 [2022-11-03 04:08:15,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:08:15,041 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 114 transitions. [2022-11-03 04:08:15,041 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 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 04:08:15,041 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 114 transitions. [2022-11-03 04:08:15,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-03 04:08:15,042 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:08:15,042 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:08:15,042 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-03 04:08:15,042 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2022-11-03 04:08:15,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:08:15,043 INFO L85 PathProgramCache]: Analyzing trace with hash -1714902765, now seen corresponding path program 1 times [2022-11-03 04:08:15,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:08:15,043 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083581171] [2022-11-03 04:08:15,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:08:15,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:08:15,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:08:15,170 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 04:08:15,170 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:08:15,170 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083581171] [2022-11-03 04:08:15,170 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2083581171] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 04:08:15,171 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 04:08:15,171 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-03 04:08:15,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574791539] [2022-11-03 04:08:15,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 04:08:15,172 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-03 04:08:15,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:08:15,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-03 04:08:15,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-03 04:08:15,173 INFO L87 Difference]: Start difference. First operand 109 states and 114 transitions. Second operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 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 04:08:15,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:08:15,308 INFO L93 Difference]: Finished difference Result 104 states and 109 transitions. [2022-11-03 04:08:15,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-03 04:08:15,308 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 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 20 [2022-11-03 04:08:15,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:08:15,309 INFO L225 Difference]: With dead ends: 104 [2022-11-03 04:08:15,309 INFO L226 Difference]: Without dead ends: 104 [2022-11-03 04:08:15,309 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 04:08:15,310 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 282 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 282 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 04:08:15,310 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [282 Valid, 66 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 04:08:15,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2022-11-03 04:08:15,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2022-11-03 04:08:15,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 69 states have (on average 1.5797101449275361) internal successors, (109), 103 states have internal predecessors, (109), 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 04:08:15,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 109 transitions. [2022-11-03 04:08:15,314 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 109 transitions. Word has length 20 [2022-11-03 04:08:15,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:08:15,314 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 109 transitions. [2022-11-03 04:08:15,314 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 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 04:08:15,315 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 109 transitions. [2022-11-03 04:08:15,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-03 04:08:15,315 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:08:15,315 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:08:15,315 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-03 04:08:15,315 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2022-11-03 04:08:15,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:08:15,316 INFO L85 PathProgramCache]: Analyzing trace with hash -1714863783, now seen corresponding path program 1 times [2022-11-03 04:08:15,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:08:15,316 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188075347] [2022-11-03 04:08:15,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:08:15,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:08:15,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:08:15,753 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 04:08:15,754 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:08:15,754 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188075347] [2022-11-03 04:08:15,754 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1188075347] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 04:08:15,754 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 04:08:15,755 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-03 04:08:15,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66146138] [2022-11-03 04:08:15,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 04:08:15,755 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-03 04:08:15,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:08:15,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-03 04:08:15,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-03 04:08:15,757 INFO L87 Difference]: Start difference. First operand 104 states and 109 transitions. Second operand has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 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 04:08:15,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:08:15,905 INFO L93 Difference]: Finished difference Result 99 states and 104 transitions. [2022-11-03 04:08:15,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-03 04:08:15,905 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 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 20 [2022-11-03 04:08:15,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:08:15,906 INFO L225 Difference]: With dead ends: 99 [2022-11-03 04:08:15,907 INFO L226 Difference]: Without dead ends: 99 [2022-11-03 04:08:15,907 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-11-03 04:08:15,908 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 357 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 357 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 04:08:15,908 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [357 Valid, 68 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 04:08:15,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2022-11-03 04:08:15,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2022-11-03 04:08:15,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 69 states have (on average 1.5072463768115942) internal successors, (104), 98 states have internal predecessors, (104), 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 04:08:15,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 104 transitions. [2022-11-03 04:08:15,911 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 104 transitions. Word has length 20 [2022-11-03 04:08:15,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:08:15,911 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 104 transitions. [2022-11-03 04:08:15,912 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 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 04:08:15,912 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 104 transitions. [2022-11-03 04:08:15,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-03 04:08:15,912 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:08:15,913 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:08:15,913 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-03 04:08:15,913 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2022-11-03 04:08:15,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:08:15,914 INFO L85 PathProgramCache]: Analyzing trace with hash -1714864999, now seen corresponding path program 1 times [2022-11-03 04:08:15,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:08:15,914 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510788978] [2022-11-03 04:08:15,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:08:15,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:08:15,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:08:16,406 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:08:16,406 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:08:16,406 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510788978] [2022-11-03 04:08:16,406 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1510788978] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 04:08:16,407 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [529656111] [2022-11-03 04:08:16,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:08:16,407 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:08:16,407 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75cc489c-bbc7-4882-8b9a-1f5e065ba06a/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 04:08:16,411 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75cc489c-bbc7-4882-8b9a-1f5e065ba06a/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 04:08:16,443 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75cc489c-bbc7-4882-8b9a-1f5e065ba06a/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-03 04:08:16,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:08:16,559 INFO L263 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 50 conjunts are in the unsatisfiable core [2022-11-03 04:08:16,563 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:08:16,572 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 04:08:16,631 INFO L356 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-03 04:08:16,631 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 04:08:16,662 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 04:08:16,722 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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 04:08:16,768 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-03 04:08:16,806 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 19 treesize of output 18 [2022-11-03 04:08:16,842 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 04:08:16,849 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:08:16,849 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 04:08:16,874 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_469 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_469) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) 0)) is different from false [2022-11-03 04:08:16,887 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_469 (Array Int Int)) (v_ArrVal_468 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_468) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_469) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) 0)) is different from false [2022-11-03 04:08:16,898 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:08:16,899 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 21 treesize of output 22 [2022-11-03 04:08:16,904 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 122 treesize of output 110 [2022-11-03 04:08:16,912 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 53 treesize of output 49 [2022-11-03 04:08:16,918 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 102 treesize of output 94 [2022-11-03 04:08:17,167 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-03 04:08:17,168 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 25 treesize of output 24 [2022-11-03 04:08:17,176 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-11-03 04:08:17,176 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [529656111] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 04:08:17,176 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [723290500] [2022-11-03 04:08:17,180 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2022-11-03 04:08:17,181 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 04:08:17,181 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 04:08:17,181 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 04:08:17,182 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 04:08:17,209 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 04:08:17,228 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 04:08:17,239 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 04:08:17,259 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:08:17,260 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-03 04:08:17,275 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:08:17,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 21 treesize of output 20 [2022-11-03 04:08:17,301 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:08:17,302 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 [2022-11-03 04:08:17,336 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:08:17,338 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:08:17,339 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 28 treesize of output 30 [2022-11-03 04:08:17,355 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:08:17,357 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:08:17,359 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 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 04:08:17,399 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:08:17,400 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:08:17,408 INFO L356 Elim1Store]: treesize reduction 27, result has 3.6 percent of original size [2022-11-03 04:08:17,408 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 86 treesize of output 61 [2022-11-03 04:08:17,431 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:08:17,433 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:08:17,434 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 37 [2022-11-03 04:08:17,469 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:08:17,472 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:08:17,474 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:08:17,476 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 31 [2022-11-03 04:08:17,555 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:08:17,556 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:08:17,557 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:08:17,603 INFO L356 Elim1Store]: treesize reduction 52, result has 22.4 percent of original size [2022-11-03 04:08:17,604 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 4 new quantified variables, introduced 8 case distinctions, treesize of input 324 treesize of output 328 [2022-11-03 04:08:17,639 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:08:17,640 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:08:17,642 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:08:17,689 INFO L356 Elim1Store]: treesize reduction 48, result has 23.8 percent of original size [2022-11-03 04:08:17,690 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 8 case distinctions, treesize of input 324 treesize of output 311 [2022-11-03 04:08:17,797 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:08:17,798 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:08:17,800 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:08:17,802 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:08:17,804 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:08:17,805 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:08:17,910 INFO L356 Elim1Store]: treesize reduction 70, result has 19.5 percent of original size [2022-11-03 04:08:17,911 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 12 case distinctions, treesize of input 461 treesize of output 368 [2022-11-03 04:08:17,941 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:08:17,943 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:08:17,944 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:08:17,945 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:08:18,055 INFO L356 Elim1Store]: treesize reduction 238, result has 16.2 percent of original size [2022-11-03 04:08:18,055 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 14 case distinctions, treesize of input 438 treesize of output 414 [2022-11-03 04:08:18,179 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:08:18,183 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:08:18,238 INFO L356 Elim1Store]: treesize reduction 138, result has 11.0 percent of original size [2022-11-03 04:08:18,239 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 8 case distinctions, treesize of input 408 treesize of output 397 [2022-11-03 04:08:18,401 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:08:18,402 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:08:18,404 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:08:18,446 INFO L356 Elim1Store]: treesize reduction 52, result has 22.4 percent of original size [2022-11-03 04:08:18,447 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 4 new quantified variables, introduced 8 case distinctions, treesize of input 324 treesize of output 328 [2022-11-03 04:08:18,468 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:08:18,469 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:08:18,470 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:08:18,512 INFO L356 Elim1Store]: treesize reduction 48, result has 23.8 percent of original size [2022-11-03 04:08:18,513 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 8 case distinctions, treesize of input 324 treesize of output 311 [2022-11-03 04:08:18,679 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:08:18,680 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:08:18,682 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:08:18,684 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:08:18,687 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:08:18,688 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:08:18,761 INFO L356 Elim1Store]: treesize reduction 70, result has 19.5 percent of original size [2022-11-03 04:08:18,762 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 12 case distinctions, treesize of input 461 treesize of output 368 [2022-11-03 04:08:18,790 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:08:18,791 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:08:18,923 INFO L356 Elim1Store]: treesize reduction 238, result has 16.2 percent of original size [2022-11-03 04:08:18,923 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 14 case distinctions, treesize of input 438 treesize of output 414 [2022-11-03 04:08:19,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 11 treesize of output 7 [2022-11-03 04:08:19,137 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 04:08:19,181 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:08:19,182 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 04:08:19,200 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:08:19,201 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 04:08:19,426 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:08:19,429 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:08:19,500 INFO L356 Elim1Store]: treesize reduction 148, result has 4.5 percent of original size [2022-11-03 04:08:19,501 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 8 case distinctions, treesize of input 768 treesize of output 715 [2022-11-03 04:08:19,651 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 04:08:24,182 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '4029#(and (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4)) |ULTIMATE.start_dll_circular_create_~last~0#1.offset|) (<= 1 |ULTIMATE.start_dll_circular_create_~len#1|) (<= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0) (= |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base|) (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 4))) (= |ULTIMATE.start_dll_circular_create_#res#1.offset| |ULTIMATE.start_main_~head~1#1.offset|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base|) |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|) |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base|) (= (select |#valid| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1) (not (= |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.offset| 0)) (= |ULTIMATE.start_dll_circular_create_#res#1.offset| |ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (<= |#NULL.offset| 0) (= |ULTIMATE.start__destroy_in_nondeterministic_order_#in~head#1.base| |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4)) |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (<= 3 |ULTIMATE.start_dll_circular_create_#in~len#1|) (<= (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 8) (select |#length| |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base|)) (= (select |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base|) 1) (<= (+ |ULTIMATE.start_dll_circular_create_~last~0#1.offset| 4) (select |#length| |ULTIMATE.start_dll_circular_create_~last~0#1.base|)) (= |ULTIMATE.start_dll_circular_create_#res#1.base| |ULTIMATE.start_main_~head~1#1.base|) (= |ULTIMATE.start_main_~head~1#1.offset| |ULTIMATE.start__destroy_in_nondeterministic_order_#in~head#1.offset|) (<= |ULTIMATE.start_dll_circular_create_#in~len#1| 3) (= |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| |ULTIMATE.start__destroy_in_nondeterministic_order_#in~head#1.offset|) (= |ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset|) |ULTIMATE.start_dll_circular_create_~head~0#1.base|) (<= |ULTIMATE.start_main_~len~0#1| 3) (= |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base|) |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|)) (= |ULTIMATE.start__destroy_in_nondeterministic_order_#in~head#1.base| |ULTIMATE.start_main_~head~1#1.base|) (<= 0 |#NULL.offset|) (<= |ULTIMATE.start_dll_circular_create_~len#1| 1) (<= 3 |ULTIMATE.start_main_~len~0#1|) (<= 0 |#StackHeapBarrier|) (<= 0 |ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (= |ULTIMATE.start_dll_circular_create_#res#1.base| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base|) (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 4)) |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base|) (= |#NULL.base| 0))' at error location [2022-11-03 04:08:24,182 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-03 04:08:24,182 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 04:08:24,183 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 19 [2022-11-03 04:08:24,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972850550] [2022-11-03 04:08:24,183 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 04:08:24,184 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-11-03 04:08:24,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:08:24,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-03 04:08:24,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=854, Unknown=2, NotChecked=122, Total=1122 [2022-11-03 04:08:24,185 INFO L87 Difference]: Start difference. First operand 99 states and 104 transitions. Second operand has 20 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 20 states have internal predecessors, (39), 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 04:08:24,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:08:24,790 INFO L93 Difference]: Finished difference Result 187 states and 197 transitions. [2022-11-03 04:08:24,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-03 04:08:24,791 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 20 states have internal predecessors, (39), 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 20 [2022-11-03 04:08:24,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:08:24,792 INFO L225 Difference]: With dead ends: 187 [2022-11-03 04:08:24,793 INFO L226 Difference]: Without dead ends: 187 [2022-11-03 04:08:24,793 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 37 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 319 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=168, Invalid=1028, Unknown=2, NotChecked=134, Total=1332 [2022-11-03 04:08:24,794 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 472 mSDsluCounter, 902 mSDsCounter, 0 mSdLazyCounter, 425 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 472 SdHoareTripleChecker+Valid, 951 SdHoareTripleChecker+Invalid, 939 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 425 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 497 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-03 04:08:24,794 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [472 Valid, 951 Invalid, 939 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 425 Invalid, 0 Unknown, 497 Unchecked, 0.4s Time] [2022-11-03 04:08:24,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2022-11-03 04:08:24,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 128. [2022-11-03 04:08:24,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 98 states have (on average 1.4591836734693877) internal successors, (143), 127 states have internal predecessors, (143), 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 04:08:24,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 143 transitions. [2022-11-03 04:08:24,799 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 143 transitions. Word has length 20 [2022-11-03 04:08:24,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:08:24,799 INFO L495 AbstractCegarLoop]: Abstraction has 128 states and 143 transitions. [2022-11-03 04:08:24,800 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 20 states have internal predecessors, (39), 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 04:08:24,800 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 143 transitions. [2022-11-03 04:08:24,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-03 04:08:24,800 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:08:24,801 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:08:24,848 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75cc489c-bbc7-4882-8b9a-1f5e065ba06a/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-03 04:08:25,001 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75cc489c-bbc7-4882-8b9a-1f5e065ba06a/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-11-03 04:08:25,001 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2022-11-03 04:08:25,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:08:25,002 INFO L85 PathProgramCache]: Analyzing trace with hash -1621169541, now seen corresponding path program 1 times [2022-11-03 04:08:25,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:08:25,002 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580319956] [2022-11-03 04:08:25,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:08:25,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:08:25,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:08:25,399 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 04:08:25,399 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:08:25,399 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580319956] [2022-11-03 04:08:25,399 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [580319956] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 04:08:25,400 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 04:08:25,400 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-03 04:08:25,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036064361] [2022-11-03 04:08:25,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 04:08:25,401 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-03 04:08:25,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:08:25,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-03 04:08:25,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-03 04:08:25,402 INFO L87 Difference]: Start difference. First operand 128 states and 143 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 6 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 04:08:25,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:08:25,589 INFO L93 Difference]: Finished difference Result 123 states and 136 transitions. [2022-11-03 04:08:25,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-03 04:08:25,590 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 6 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 21 [2022-11-03 04:08:25,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:08:25,590 INFO L225 Difference]: With dead ends: 123 [2022-11-03 04:08:25,591 INFO L226 Difference]: Without dead ends: 123 [2022-11-03 04:08:25,591 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-11-03 04:08:25,592 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 336 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 336 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 04:08:25,592 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [336 Valid, 37 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 04:08:25,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2022-11-03 04:08:25,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2022-11-03 04:08:25,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 98 states have (on average 1.3877551020408163) internal successors, (136), 122 states have internal predecessors, (136), 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 04:08:25,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 136 transitions. [2022-11-03 04:08:25,596 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 136 transitions. Word has length 21 [2022-11-03 04:08:25,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:08:25,596 INFO L495 AbstractCegarLoop]: Abstraction has 123 states and 136 transitions. [2022-11-03 04:08:25,597 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 6 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 04:08:25,597 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 136 transitions. [2022-11-03 04:08:25,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-03 04:08:25,597 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:08:25,598 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:08:25,598 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-03 04:08:25,601 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2022-11-03 04:08:25,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:08:25,602 INFO L85 PathProgramCache]: Analyzing trace with hash -1621207275, now seen corresponding path program 1 times [2022-11-03 04:08:25,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:08:25,602 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712784942] [2022-11-03 04:08:25,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:08:25,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:08:25,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:08:26,151 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:08:26,151 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:08:26,151 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712784942] [2022-11-03 04:08:26,151 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1712784942] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 04:08:26,152 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [826288145] [2022-11-03 04:08:26,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:08:26,152 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:08:26,152 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75cc489c-bbc7-4882-8b9a-1f5e065ba06a/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 04:08:26,155 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75cc489c-bbc7-4882-8b9a-1f5e065ba06a/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 04:08:26,157 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75cc489c-bbc7-4882-8b9a-1f5e065ba06a/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-03 04:08:26,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:08:26,309 INFO L263 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 44 conjunts are in the unsatisfiable core [2022-11-03 04:08:26,313 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:08:26,320 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 04:08:26,356 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-03 04:08:26,356 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 04:08:26,434 INFO L356 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-03 04:08:26,434 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 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 04:08:26,463 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 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 04:08:26,522 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-03 04:08:26,624 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 42 treesize of output 40 [2022-11-03 04:08:26,701 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 47 treesize of output 38 [2022-11-03 04:08:26,800 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 43 treesize of output 27 [2022-11-03 04:08:26,814 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:08:26,815 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 04:08:26,876 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_592 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_592) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) 1) |c_#StackHeapBarrier|)) is different from false [2022-11-03 04:08:26,895 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_591 (Array Int Int)) (v_ArrVal_592 (Array Int Int))) (<= (+ (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_591) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_592) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) 1) |c_#StackHeapBarrier|)) is different from false [2022-11-03 04:08:26,914 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:08:26,914 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 23 treesize of output 24 [2022-11-03 04:08:26,920 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 68 treesize of output 60 [2022-11-03 04:08:26,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 28 treesize of output 26 [2022-11-03 04:08:26,937 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 54 treesize of output 50 [2022-11-03 04:08:27,232 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-11-03 04:08:27,233 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [826288145] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 04:08:27,233 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [360859157] [2022-11-03 04:08:27,235 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2022-11-03 04:08:27,236 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 04:08:27,236 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 04:08:27,237 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 04:08:27,237 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 04:08:27,262 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 04:08:27,280 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 04:08:27,294 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 04:08:27,310 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:08:27,311 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-03 04:08:27,323 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:08:27,324 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-03 04:08:27,347 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:08:27,348 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 [2022-11-03 04:08:27,379 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:08:27,380 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:08:27,381 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 28 treesize of output 30 [2022-11-03 04:08:27,395 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:08:27,396 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:08:27,397 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 28 treesize of output 30 [2022-11-03 04:08:27,428 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:08:27,430 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:08:27,447 INFO L356 Elim1Store]: treesize reduction 48, result has 12.7 percent of original size [2022-11-03 04:08:27,447 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 78 treesize of output 61 [2022-11-03 04:08:27,462 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:08:27,464 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:08:27,464 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:08:27,466 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-03 04:08:27,524 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:08:27,526 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:08:27,527 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:08:27,528 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 36 [2022-11-03 04:08:27,607 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:08:27,608 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:08:27,610 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:08:27,674 INFO L356 Elim1Store]: treesize reduction 98, result has 15.5 percent of original size [2022-11-03 04:08:27,675 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 9 case distinctions, treesize of input 339 treesize of output 326 [2022-11-03 04:08:27,695 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:08:27,697 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:08:27,698 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:08:27,768 INFO L356 Elim1Store]: treesize reduction 126, result has 18.2 percent of original size [2022-11-03 04:08:27,768 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 4 new quantified variables, introduced 9 case distinctions, treesize of input 335 treesize of output 339 [2022-11-03 04:08:27,891 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:08:27,893 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:08:27,894 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:08:27,896 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:08:27,897 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:08:27,898 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:08:27,978 INFO L356 Elim1Store]: treesize reduction 120, result has 12.4 percent of original size [2022-11-03 04:08:27,978 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 12 case distinctions, treesize of input 464 treesize of output 401 [2022-11-03 04:08:28,010 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:08:28,011 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:08:28,012 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:08:28,013 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:08:28,099 INFO L356 Elim1Store]: treesize reduction 154, result has 18.5 percent of original size [2022-11-03 04:08:28,099 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 9 case distinctions, treesize of input 441 treesize of output 398 [2022-11-03 04:08:28,347 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:08:28,349 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:08:28,387 INFO L356 Elim1Store]: treesize reduction 47, result has 9.6 percent of original size [2022-11-03 04:08:28,388 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 758 treesize of output 728 [2022-11-03 04:08:28,652 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:08:28,653 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:08:28,654 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:08:28,720 INFO L356 Elim1Store]: treesize reduction 98, result has 15.5 percent of original size [2022-11-03 04:08:28,721 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 9 case distinctions, treesize of input 339 treesize of output 326 [2022-11-03 04:08:28,750 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:08:28,751 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:08:28,753 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:08:28,821 INFO L356 Elim1Store]: treesize reduction 126, result has 18.2 percent of original size [2022-11-03 04:08:28,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, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 335 treesize of output 339 [2022-11-03 04:08:28,932 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:08:28,933 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:08:28,934 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:08:28,936 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:08:28,937 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:08:28,938 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:08:28,999 INFO L356 Elim1Store]: treesize reduction 120, result has 12.4 percent of original size [2022-11-03 04:08:28,999 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 12 case distinctions, treesize of input 464 treesize of output 401 [2022-11-03 04:08:29,040 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:08:29,041 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:08:29,137 INFO L356 Elim1Store]: treesize reduction 154, result has 18.5 percent of original size [2022-11-03 04:08:29,137 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 9 case distinctions, treesize of input 441 treesize of output 398 [2022-11-03 04:08:29,248 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 04:08:29,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 11 treesize of output 7 [2022-11-03 04:08:29,289 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:08:29,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, 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 04:08:29,311 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:08:29,312 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 04:08:29,537 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:08:29,539 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:08:29,570 INFO L356 Elim1Store]: treesize reduction 49, result has 5.8 percent of original size [2022-11-03 04:08:29,571 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 403 treesize of output 391 [2022-11-03 04:08:29,673 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 04:08:34,743 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '4769#(and (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4)) |ULTIMATE.start_dll_circular_create_~last~0#1.offset|) (<= 1 |ULTIMATE.start_dll_circular_create_~len#1|) (<= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0) (= |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base|) (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 4))) (= |ULTIMATE.start_dll_circular_create_#res#1.offset| |ULTIMATE.start_main_~head~1#1.offset|) (= |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.offset| 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base|) |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|) |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base|) (= (select |#valid| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1) (= |ULTIMATE.start_dll_circular_create_#res#1.offset| |ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (<= |#NULL.offset| 0) (= |ULTIMATE.start__destroy_in_nondeterministic_order_#in~head#1.base| |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4)) |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (<= 3 |ULTIMATE.start_dll_circular_create_#in~len#1|) (<= (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 8) (select |#length| |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base|)) (= (select |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base|) 1) (<= (+ |ULTIMATE.start_dll_circular_create_~last~0#1.offset| 4) (select |#length| |ULTIMATE.start_dll_circular_create_~last~0#1.base|)) (= |ULTIMATE.start_dll_circular_create_#res#1.base| |ULTIMATE.start_main_~head~1#1.base|) (= |ULTIMATE.start_main_~head~1#1.offset| |ULTIMATE.start__destroy_in_nondeterministic_order_#in~head#1.offset|) (<= |ULTIMATE.start_dll_circular_create_#in~len#1| 3) (not (< |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base| |#StackHeapBarrier|)) (= |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| |ULTIMATE.start__destroy_in_nondeterministic_order_#in~head#1.offset|) (= |ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset|) |ULTIMATE.start_dll_circular_create_~head~0#1.base|) (<= |ULTIMATE.start_main_~len~0#1| 3) (= |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base|) |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|)) (= |ULTIMATE.start__destroy_in_nondeterministic_order_#in~head#1.base| |ULTIMATE.start_main_~head~1#1.base|) (<= 0 |#NULL.offset|) (<= |ULTIMATE.start_dll_circular_create_~len#1| 1) (<= 3 |ULTIMATE.start_main_~len~0#1|) (<= 0 |#StackHeapBarrier|) (<= 0 |ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (= |ULTIMATE.start_dll_circular_create_#res#1.base| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base|) (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 4)) |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base|) (= |#NULL.base| 0))' at error location [2022-11-03 04:08:34,743 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-03 04:08:34,743 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 04:08:34,743 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 23 [2022-11-03 04:08:34,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395808728] [2022-11-03 04:08:34,744 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 04:08:34,744 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-11-03 04:08:34,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:08:34,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-11-03 04:08:34,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=1154, Unknown=2, NotChecked=142, Total=1482 [2022-11-03 04:08:34,746 INFO L87 Difference]: Start difference. First operand 123 states and 136 transitions. Second operand has 24 states, 23 states have (on average 2.1739130434782608) internal successors, (50), 24 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:08:36,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:08:36,122 INFO L93 Difference]: Finished difference Result 118 states and 131 transitions. [2022-11-03 04:08:36,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-03 04:08:36,123 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 2.1739130434782608) internal successors, (50), 24 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-11-03 04:08:36,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:08:36,124 INFO L225 Difference]: With dead ends: 118 [2022-11-03 04:08:36,124 INFO L226 Difference]: Without dead ends: 118 [2022-11-03 04:08:36,125 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 33 SyntacticMatches, 4 SemanticMatches, 48 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 619 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=332, Invalid=1930, Unknown=2, NotChecked=186, Total=2450 [2022-11-03 04:08:36,126 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 414 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 475 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 414 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 753 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 475 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 242 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-03 04:08:36,126 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [414 Valid, 223 Invalid, 753 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 475 Invalid, 0 Unknown, 242 Unchecked, 0.6s Time] [2022-11-03 04:08:36,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2022-11-03 04:08:36,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2022-11-03 04:08:36,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 98 states have (on average 1.336734693877551) internal successors, (131), 117 states have internal predecessors, (131), 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 04:08:36,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 131 transitions. [2022-11-03 04:08:36,130 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 131 transitions. Word has length 21 [2022-11-03 04:08:36,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:08:36,131 INFO L495 AbstractCegarLoop]: Abstraction has 118 states and 131 transitions. [2022-11-03 04:08:36,131 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 2.1739130434782608) internal successors, (50), 24 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:08:36,131 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 131 transitions. [2022-11-03 04:08:36,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-03 04:08:36,132 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:08:36,132 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:08:36,181 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75cc489c-bbc7-4882-8b9a-1f5e065ba06a/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-03 04:08:36,342 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75cc489c-bbc7-4882-8b9a-1f5e065ba06a/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-11-03 04:08:36,343 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2022-11-03 04:08:36,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:08:36,343 INFO L85 PathProgramCache]: Analyzing trace with hash 1283351963, now seen corresponding path program 1 times [2022-11-03 04:08:36,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:08:36,343 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060507705] [2022-11-03 04:08:36,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:08:36,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:08:36,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:08:36,690 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 04:08:36,690 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:08:36,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060507705] [2022-11-03 04:08:36,690 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2060507705] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 04:08:36,691 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 04:08:36,691 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-03 04:08:36,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66161386] [2022-11-03 04:08:36,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 04:08:36,692 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-03 04:08:36,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:08:36,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-03 04:08:36,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-11-03 04:08:36,694 INFO L87 Difference]: Start difference. First operand 118 states and 131 transitions. Second operand has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 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 04:08:36,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:08:36,919 INFO L93 Difference]: Finished difference Result 117 states and 129 transitions. [2022-11-03 04:08:36,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-03 04:08:36,920 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 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 04:08:36,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:08:36,921 INFO L225 Difference]: With dead ends: 117 [2022-11-03 04:08:36,921 INFO L226 Difference]: Without dead ends: 117 [2022-11-03 04:08:36,921 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2022-11-03 04:08:36,922 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 195 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 04:08:36,922 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 161 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 04:08:36,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2022-11-03 04:08:36,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2022-11-03 04:08:36,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 98 states have (on average 1.316326530612245) internal successors, (129), 116 states have internal predecessors, (129), 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 04:08:36,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 129 transitions. [2022-11-03 04:08:36,928 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 129 transitions. Word has length 22 [2022-11-03 04:08:36,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:08:36,928 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 129 transitions. [2022-11-03 04:08:36,928 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 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 04:08:36,929 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 129 transitions. [2022-11-03 04:08:36,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-03 04:08:36,933 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:08:36,933 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:08:36,934 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-03 04:08:36,934 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2022-11-03 04:08:36,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:08:36,935 INFO L85 PathProgramCache]: Analyzing trace with hash 1282182171, now seen corresponding path program 1 times [2022-11-03 04:08:36,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:08:36,935 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449095958] [2022-11-03 04:08:36,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:08:36,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:08:36,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:08:37,351 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:08:37,351 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:08:37,351 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449095958] [2022-11-03 04:08:37,352 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [449095958] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 04:08:37,352 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [986279905] [2022-11-03 04:08:37,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:08:37,352 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:08:37,352 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75cc489c-bbc7-4882-8b9a-1f5e065ba06a/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 04:08:37,358 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75cc489c-bbc7-4882-8b9a-1f5e065ba06a/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 04:08:37,359 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75cc489c-bbc7-4882-8b9a-1f5e065ba06a/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-03 04:08:37,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:08:37,501 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 53 conjunts are in the unsatisfiable core [2022-11-03 04:08:37,505 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:08:37,509 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 04:08:37,539 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-03 04:08:37,540 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 04:08:37,588 INFO L356 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-03 04:08:37,589 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 04:08:37,620 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 04:08:37,652 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-03 04:08:37,652 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2022-11-03 04:08:37,713 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 24 treesize of output 24 [2022-11-03 04:08:37,769 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 29 treesize of output 24 [2022-11-03 04:08:37,836 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:08:37,836 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 42 treesize of output 22 [2022-11-03 04:08:37,866 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:08:37,867 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 04:08:37,964 INFO L356 Elim1Store]: treesize reduction 18, result has 60.0 percent of original size [2022-11-03 04:08:37,965 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 28 treesize of output 38 [2022-11-03 04:08:37,975 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_714 (Array Int Int)) (v_ArrVal_716 (Array Int Int))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_714) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_716) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (or (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse0) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse0)))) is different from false [2022-11-03 04:08:37,986 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:08:37,986 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 43 treesize of output 35 [2022-11-03 04:08:37,994 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 235 treesize of output 215 [2022-11-03 04:08:38,013 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 195 treesize of output 179 [2022-11-03 04:08:38,019 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 179 treesize of output 171 [2022-11-03 04:08:38,223 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-11-03 04:08:38,224 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [986279905] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 04:08:38,224 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [260296172] [2022-11-03 04:08:38,227 INFO L159 IcfgInterpreter]: Started Sifa with 18 locations of interest [2022-11-03 04:08:38,227 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 04:08:38,227 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 04:08:38,228 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 04:08:38,228 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 04:08:38,242 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 04:08:38,258 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 04:08:38,266 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 04:08:38,285 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:08:38,286 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-03 04:08:38,296 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:08:38,297 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-03 04:08:38,320 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:08:38,321 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 [2022-11-03 04:08:38,353 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:08:38,355 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:08:38,356 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 28 treesize of output 30 [2022-11-03 04:08:38,369 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:08:38,371 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:08:38,372 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 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 04:08:38,407 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:08:38,408 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:08:38,410 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:08:38,417 INFO L356 Elim1Store]: treesize reduction 27, result has 3.6 percent of original size [2022-11-03 04:08:38,417 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 98 treesize of output 73 [2022-11-03 04:08:38,433 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:08:38,435 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:08:38,451 INFO L356 Elim1Store]: treesize reduction 48, result has 12.7 percent of original size [2022-11-03 04:08:38,451 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 74 treesize of output 57 [2022-11-03 04:08:38,492 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:08:38,494 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:08:38,495 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:08:38,498 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 32 [2022-11-03 04:08:38,582 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:08:38,583 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:08:38,584 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:08:38,624 INFO L356 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2022-11-03 04:08:38,624 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 311 treesize of output 306 [2022-11-03 04:08:38,645 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:08:38,647 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:08:38,649 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:08:38,690 INFO L356 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2022-11-03 04:08:38,691 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 311 treesize of output 306 [2022-11-03 04:08:38,804 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:08:38,806 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:08:38,808 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:08:38,811 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:08:38,812 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:08:38,850 INFO L356 Elim1Store]: treesize reduction 39, result has 25.0 percent of original size [2022-11-03 04:08:38,854 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 433 treesize of output 374 [2022-11-03 04:08:38,879 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:08:38,880 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:08:38,962 INFO L356 Elim1Store]: treesize reduction 180, result has 16.3 percent of original size [2022-11-03 04:08:38,963 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 6 new quantified variables, introduced 9 case distinctions, treesize of input 418 treesize of output 382 [2022-11-03 04:08:39,148 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:08:39,150 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:08:39,183 INFO L356 Elim1Store]: treesize reduction 49, result has 5.8 percent of original size [2022-11-03 04:08:39,185 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 712 treesize of output 688 [2022-11-03 04:08:39,398 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:08:39,399 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:08:39,400 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:08:39,435 INFO L356 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2022-11-03 04:08:39,436 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 311 treesize of output 306 [2022-11-03 04:08:39,475 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:08:39,476 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:08:39,477 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:08:39,521 INFO L356 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2022-11-03 04:08:39,521 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 311 treesize of output 306 [2022-11-03 04:08:39,654 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:08:39,655 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:08:39,657 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:08:39,659 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:08:39,660 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:08:39,695 INFO L356 Elim1Store]: treesize reduction 39, result has 25.0 percent of original size [2022-11-03 04:08:39,696 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 433 treesize of output 374 [2022-11-03 04:08:39,722 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:08:39,811 INFO L356 Elim1Store]: treesize reduction 180, result has 16.3 percent of original size [2022-11-03 04:08:39,811 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 6 new quantified variables, introduced 9 case distinctions, treesize of input 418 treesize of output 382 [2022-11-03 04:08:39,937 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 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 04:08:39,945 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 04:08:39,978 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:08:39,979 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 04:08:39,992 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:08:39,993 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 04:08:40,171 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:08:40,173 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:08:40,208 INFO L356 Elim1Store]: treesize reduction 49, result has 5.8 percent of original size [2022-11-03 04:08:40,209 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 380 treesize of output 372 [2022-11-03 04:08:40,276 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 04:08:45,698 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '5442#(and (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4)) |ULTIMATE.start_dll_circular_create_~last~0#1.offset|) (<= 1 |ULTIMATE.start_dll_circular_create_~len#1|) (<= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0) (= |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base|) (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 4))) (= |ULTIMATE.start_dll_circular_create_#res#1.offset| |ULTIMATE.start_main_~head~1#1.offset|) (= |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.offset| 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base|) |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|) |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base|) (= (select |#valid| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1) (= |ULTIMATE.start_dll_circular_create_#res#1.offset| |ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (<= |#NULL.offset| 0) (= |ULTIMATE.start__destroy_in_nondeterministic_order_#in~head#1.base| |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4)) |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (<= 3 |ULTIMATE.start_dll_circular_create_#in~len#1|) (<= (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 8) (select |#length| |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base|)) (= (select |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base|) 1) (<= (+ |ULTIMATE.start_dll_circular_create_~last~0#1.offset| 4) (select |#length| |ULTIMATE.start_dll_circular_create_~last~0#1.base|)) (= |ULTIMATE.start_dll_circular_create_#res#1.base| |ULTIMATE.start_main_~head~1#1.base|) (= |ULTIMATE.start_main_~head~1#1.offset| |ULTIMATE.start__destroy_in_nondeterministic_order_#in~head#1.offset|) (< |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base| |#StackHeapBarrier|) (<= |ULTIMATE.start_dll_circular_create_#in~len#1| 3) (= |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| |ULTIMATE.start__destroy_in_nondeterministic_order_#in~head#1.offset|) (= |ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (not (= |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base| 0)) (not (= (select |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base|) 1)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset|) |ULTIMATE.start_dll_circular_create_~head~0#1.base|) (<= |ULTIMATE.start_main_~len~0#1| 3) (= |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base|) |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|)) (= |ULTIMATE.start__destroy_in_nondeterministic_order_#in~head#1.base| |ULTIMATE.start_main_~head~1#1.base|) (<= 0 |#NULL.offset|) (<= |ULTIMATE.start_dll_circular_create_~len#1| 1) (<= 3 |ULTIMATE.start_main_~len~0#1|) (<= 0 |#StackHeapBarrier|) (<= 0 |ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (= |ULTIMATE.start_dll_circular_create_#res#1.base| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base|) (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 4)) |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base|) (= |#NULL.base| 0))' at error location [2022-11-03 04:08:45,698 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-03 04:08:45,698 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 04:08:45,699 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 21 [2022-11-03 04:08:45,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656749014] [2022-11-03 04:08:45,699 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 04:08:45,699 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-11-03 04:08:45,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:08:45,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-11-03 04:08:45,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=1125, Unknown=1, NotChecked=70, Total=1406 [2022-11-03 04:08:45,701 INFO L87 Difference]: Start difference. First operand 117 states and 129 transitions. Second operand has 22 states, 21 states have (on average 2.380952380952381) internal successors, (50), 22 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:08:46,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:08:46,377 INFO L93 Difference]: Finished difference Result 116 states and 128 transitions. [2022-11-03 04:08:46,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-03 04:08:46,377 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 2.380952380952381) internal successors, (50), 22 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-11-03 04:08:46,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:08:46,378 INFO L225 Difference]: With dead ends: 116 [2022-11-03 04:08:46,378 INFO L226 Difference]: Without dead ends: 116 [2022-11-03 04:08:46,379 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 524 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=326, Invalid=1657, Unknown=1, NotChecked=86, Total=2070 [2022-11-03 04:08:46,380 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 137 mSDsluCounter, 528 mSDsCounter, 0 mSdLazyCounter, 372 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 586 SdHoareTripleChecker+Invalid, 513 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 372 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 103 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-03 04:08:46,380 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 586 Invalid, 513 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 372 Invalid, 0 Unknown, 103 Unchecked, 0.3s Time] [2022-11-03 04:08:46,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2022-11-03 04:08:46,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2022-11-03 04:08:46,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 98 states have (on average 1.3061224489795917) internal successors, (128), 115 states have internal predecessors, (128), 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 04:08:46,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 128 transitions. [2022-11-03 04:08:46,385 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 128 transitions. Word has length 22 [2022-11-03 04:08:46,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:08:46,385 INFO L495 AbstractCegarLoop]: Abstraction has 116 states and 128 transitions. [2022-11-03 04:08:46,385 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.380952380952381) internal successors, (50), 22 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:08:46,385 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 128 transitions. [2022-11-03 04:08:46,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-03 04:08:46,386 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:08:46,386 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:08:46,430 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75cc489c-bbc7-4882-8b9a-1f5e065ba06a/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-03 04:08:46,604 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75cc489c-bbc7-4882-8b9a-1f5e065ba06a/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:08:46,605 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2022-11-03 04:08:46,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:08:46,605 INFO L85 PathProgramCache]: Analyzing trace with hash -1620099906, now seen corresponding path program 2 times [2022-11-03 04:08:46,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:08:46,606 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200842283] [2022-11-03 04:08:46,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:08:46,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:08:46,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:08:46,711 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:08:46,712 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:08:46,712 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200842283] [2022-11-03 04:08:46,712 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1200842283] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 04:08:46,712 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 04:08:46,713 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-03 04:08:46,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837684403] [2022-11-03 04:08:46,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 04:08:46,713 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-03 04:08:46,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:08:46,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-03 04:08:46,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-03 04:08:46,715 INFO L87 Difference]: Start difference. First operand 116 states and 128 transitions. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 4 states have internal predecessors, (24), 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 04:08:46,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:08:46,741 INFO L93 Difference]: Finished difference Result 82 states and 86 transitions. [2022-11-03 04:08:46,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-03 04:08:46,742 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 4 states have internal predecessors, (24), 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 24 [2022-11-03 04:08:46,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:08:46,743 INFO L225 Difference]: With dead ends: 82 [2022-11-03 04:08:46,743 INFO L226 Difference]: Without dead ends: 82 [2022-11-03 04:08:46,743 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-03 04:08:46,744 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 74 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-03 04:08:46,744 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 86 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-03 04:08:46,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-11-03 04:08:46,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2022-11-03 04:08:46,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 69 states have (on average 1.2463768115942029) internal successors, (86), 81 states have internal predecessors, (86), 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 04:08:46,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 86 transitions. [2022-11-03 04:08:46,748 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 86 transitions. Word has length 24 [2022-11-03 04:08:46,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:08:46,748 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 86 transitions. [2022-11-03 04:08:46,748 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 4 states have internal predecessors, (24), 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 04:08:46,749 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 86 transitions. [2022-11-03 04:08:46,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-03 04:08:46,749 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:08:46,749 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:08:46,750 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-11-03 04:08:46,750 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2022-11-03 04:08:46,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:08:46,750 INFO L85 PathProgramCache]: Analyzing trace with hash -863443528, now seen corresponding path program 1 times [2022-11-03 04:08:46,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:08:46,751 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449411239] [2022-11-03 04:08:46,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:08:46,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:08:46,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:08:47,201 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:08:47,202 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:08:47,202 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449411239] [2022-11-03 04:08:47,202 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [449411239] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 04:08:47,202 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [639212164] [2022-11-03 04:08:47,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:08:47,202 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:08:47,203 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75cc489c-bbc7-4882-8b9a-1f5e065ba06a/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 04:08:47,204 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75cc489c-bbc7-4882-8b9a-1f5e065ba06a/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 04:08:47,230 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75cc489c-bbc7-4882-8b9a-1f5e065ba06a/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-03 04:08:47,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:08:47,374 INFO L263 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 34 conjunts are in the unsatisfiable core [2022-11-03 04:08:47,380 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:08:47,424 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-03 04:08:47,424 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 04:08:47,533 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 04:08:47,571 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:08:47,571 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 27 treesize of output 21 [2022-11-03 04:08:47,756 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-03 04:08:47,757 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 16 treesize of output 18 [2022-11-03 04:08:47,768 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:08:47,769 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 04:08:47,914 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 13 treesize of output 11 [2022-11-03 04:08:47,917 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 20 treesize of output 18 [2022-11-03 04:08:47,925 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2022-11-03 04:08:47,928 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:08:47,937 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 04:08:47,990 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-03 04:08:47,990 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 13 treesize of output 12 [2022-11-03 04:08:47,999 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:08:48,000 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [639212164] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 04:08:48,000 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [169904294] [2022-11-03 04:08:48,002 INFO L159 IcfgInterpreter]: Started Sifa with 21 locations of interest [2022-11-03 04:08:48,002 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 04:08:48,002 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 04:08:48,002 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 04:08:48,003 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 04:08:48,020 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 04:08:48,038 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 04:08:48,049 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 04:08:48,066 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:08:48,067 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-03 04:08:48,078 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:08:48,079 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-03 04:08:48,103 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:08:48,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, 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 19 [2022-11-03 04:08:48,131 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:08:48,132 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:08:48,134 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 28 treesize of output 30 [2022-11-03 04:08:48,149 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:08:48,150 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:08:48,151 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 28 treesize of output 30 [2022-11-03 04:08:48,182 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:08:48,184 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:08:48,201 INFO L356 Elim1Store]: treesize reduction 48, result has 12.7 percent of original size [2022-11-03 04:08:48,202 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 78 treesize of output 61 [2022-11-03 04:08:48,215 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:08:48,217 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:08:48,218 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 33 [2022-11-03 04:08:48,251 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:08:48,253 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:08:48,254 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:08:48,256 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 44 [2022-11-03 04:08:48,325 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:08:48,326 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:08:48,378 INFO L356 Elim1Store]: treesize reduction 96, result has 17.9 percent of original size [2022-11-03 04:08:48,379 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 5 case distinctions, treesize of input 376 treesize of output 320 [2022-11-03 04:08:48,396 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:08:48,397 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:08:48,446 INFO L356 Elim1Store]: treesize reduction 96, result has 17.9 percent of original size [2022-11-03 04:08:48,447 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 5 case distinctions, treesize of input 376 treesize of output 356 [2022-11-03 04:08:48,546 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:08:48,685 INFO L356 Elim1Store]: treesize reduction 220, result has 15.7 percent of original size [2022-11-03 04:08:48,686 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 6 new quantified variables, introduced 10 case distinctions, treesize of input 457 treesize of output 383 [2022-11-03 04:08:48,714 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:08:48,806 INFO L356 Elim1Store]: treesize reduction 180, result has 14.7 percent of original size [2022-11-03 04:08:48,807 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 6 new quantified variables, introduced 9 case distinctions, treesize of input 383 treesize of output 345 [2022-11-03 04:08:49,012 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:08:49,013 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:08:49,119 INFO L356 Elim1Store]: treesize reduction 132, result has 6.4 percent of original size [2022-11-03 04:08:49,120 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 8 case distinctions, treesize of input 742 treesize of output 721 [2022-11-03 04:08:49,351 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:08:49,352 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:08:49,400 INFO L356 Elim1Store]: treesize reduction 96, result has 17.9 percent of original size [2022-11-03 04:08:49,400 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 5 case distinctions, treesize of input 376 treesize of output 320 [2022-11-03 04:08:49,418 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:08:49,419 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:08:49,465 INFO L356 Elim1Store]: treesize reduction 96, result has 17.9 percent of original size [2022-11-03 04:08:49,466 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 5 case distinctions, treesize of input 376 treesize of output 356 [2022-11-03 04:08:49,576 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:08:49,577 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:08:49,703 INFO L356 Elim1Store]: treesize reduction 220, result has 15.7 percent of original size [2022-11-03 04:08:49,704 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 6 new quantified variables, introduced 10 case distinctions, treesize of input 457 treesize of output 383 [2022-11-03 04:08:49,732 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:08:49,733 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:08:49,842 INFO L356 Elim1Store]: treesize reduction 180, result has 14.7 percent of original size [2022-11-03 04:08:49,842 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 6 new quantified variables, introduced 9 case distinctions, treesize of input 383 treesize of output 345 [2022-11-03 04:08:49,996 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 04:08:50,009 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 04:08:50,046 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:08:50,048 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 04:08:50,063 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:08:50,064 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 04:08:50,210 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:08:50,236 INFO L356 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-11-03 04:08:50,236 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 22 treesize of output 21 [2022-11-03 04:08:50,427 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:08:50,429 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:08:50,515 INFO L356 Elim1Store]: treesize reduction 132, result has 6.4 percent of original size [2022-11-03 04:08:50,516 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 8 case distinctions, treesize of input 742 treesize of output 721 [2022-11-03 04:08:50,648 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 04:08:56,776 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '6040#(and (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset|)) (<= 1 |ULTIMATE.start_dll_circular_create_~len#1|) (= |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base|) (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 4))) (= |ULTIMATE.start_dll_circular_create_#res#1.offset| |ULTIMATE.start_main_~head~1#1.offset|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base|) |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|) |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base|) (= |ULTIMATE.start_dll_circular_create_#res#1.offset| |ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (< |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base| |#StackHeapBarrier|) (= |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 0) (<= |#NULL.offset| 0) (= |ULTIMATE.start__destroy_in_nondeterministic_order_#in~head#1.base| |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4)) |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (<= 3 |ULTIMATE.start_dll_circular_create_#in~len#1|) (= |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.offset| 0) (<= (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 8) (select |#length| |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base|)) (not (= |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base| 0)) (= |ULTIMATE.start_dll_circular_create_#res#1.base| |ULTIMATE.start_main_~head~1#1.base|) (= |ULTIMATE.start_main_~head~1#1.offset| |ULTIMATE.start__destroy_in_nondeterministic_order_#in~head#1.offset|) (<= |ULTIMATE.start_dll_circular_create_#in~len#1| 3) (= |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| |ULTIMATE.start__destroy_in_nondeterministic_order_#in~head#1.offset|) (= |ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset|) |ULTIMATE.start_dll_circular_create_~head~0#1.base|) (<= |ULTIMATE.start_main_~len~0#1| 3) (= |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base|) |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|)) (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= |ULTIMATE.start__destroy_in_nondeterministic_order_#in~head#1.base| |ULTIMATE.start_main_~head~1#1.base|) (<= 0 |#NULL.offset|) (<= |ULTIMATE.start_dll_circular_create_~len#1| 1) (<= 3 |ULTIMATE.start_main_~len~0#1|) (<= 0 |#StackHeapBarrier|) (= |ULTIMATE.start_dll_circular_create_#res#1.base| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base|) (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 4)) |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base|) (= |#NULL.base| 0))' at error location [2022-11-03 04:08:56,777 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-03 04:08:56,777 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 04:08:56,777 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11, 11] total 20 [2022-11-03 04:08:56,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484278734] [2022-11-03 04:08:56,777 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 04:08:56,778 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-11-03 04:08:56,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:08:56,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-11-03 04:08:56,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=205, Invalid=1201, Unknown=0, NotChecked=0, Total=1406 [2022-11-03 04:08:56,779 INFO L87 Difference]: Start difference. First operand 82 states and 86 transitions. Second operand has 21 states, 20 states have (on average 2.5) internal successors, (50), 21 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:08:57,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:08:57,403 INFO L93 Difference]: Finished difference Result 81 states and 85 transitions. [2022-11-03 04:08:57,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-03 04:08:57,407 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 2.5) internal successors, (50), 21 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-11-03 04:08:57,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:08:57,408 INFO L225 Difference]: With dead ends: 81 [2022-11-03 04:08:57,408 INFO L226 Difference]: Without dead ends: 81 [2022-11-03 04:08:57,409 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 42 SyntacticMatches, 5 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 695 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=315, Invalid=1755, Unknown=0, NotChecked=0, Total=2070 [2022-11-03 04:08:57,409 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 341 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 284 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 341 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 4 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-03 04:08:57,410 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [341 Valid, 225 Invalid, 325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 284 Invalid, 0 Unknown, 4 Unchecked, 0.3s Time] [2022-11-03 04:08:57,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-11-03 04:08:57,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2022-11-03 04:08:57,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 69 states have (on average 1.2318840579710144) internal successors, (85), 80 states have internal predecessors, (85), 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 04:08:57,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 85 transitions. [2022-11-03 04:08:57,412 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 85 transitions. Word has length 25 [2022-11-03 04:08:57,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:08:57,413 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 85 transitions. [2022-11-03 04:08:57,413 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 2.5) internal successors, (50), 21 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:08:57,413 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 85 transitions. [2022-11-03 04:08:57,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-03 04:08:57,413 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:08:57,413 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:08:57,459 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75cc489c-bbc7-4882-8b9a-1f5e065ba06a/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-03 04:08:57,614 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75cc489c-bbc7-4882-8b9a-1f5e065ba06a/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-11-03 04:08:57,614 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2022-11-03 04:08:57,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:08:57,615 INFO L85 PathProgramCache]: Analyzing trace with hash -863874504, now seen corresponding path program 1 times [2022-11-03 04:08:57,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:08:57,615 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795541214] [2022-11-03 04:08:57,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:08:57,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:08:57,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:08:58,119 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:08:58,119 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:08:58,119 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795541214] [2022-11-03 04:08:58,119 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1795541214] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 04:08:58,119 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [264062697] [2022-11-03 04:08:58,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:08:58,120 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:08:58,120 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75cc489c-bbc7-4882-8b9a-1f5e065ba06a/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 04:08:58,122 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75cc489c-bbc7-4882-8b9a-1f5e065ba06a/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 04:08:58,152 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75cc489c-bbc7-4882-8b9a-1f5e065ba06a/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-03 04:08:58,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:08:58,292 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 42 conjunts are in the unsatisfiable core [2022-11-03 04:08:58,297 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:08:58,303 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 04:08:58,338 INFO L356 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-03 04:08:58,338 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 04:08:58,361 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 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 04:08:58,388 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-03 04:08:58,388 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2022-11-03 04:08:58,445 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 24 treesize of output 24 [2022-11-03 04:08:58,489 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:08:58,490 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 04:08:58,537 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:08:58,537 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 25 treesize of output 21 [2022-11-03 04:08:58,650 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 14 [2022-11-03 04:08:58,660 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:08:58,661 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 04:08:58,899 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (and (forall ((v_ArrVal_932 (Array Int Int)) (v_ArrVal_934 Int)) (= (select |c_#valid| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_932) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse0 v_ArrVal_934) 0)) 1)) (forall ((v_ArrVal_932 (Array Int Int)) (v_ArrVal_934 Int)) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_932) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse0 v_ArrVal_934) 0)))))) is different from false [2022-11-03 04:08:58,937 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:08:58,937 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 47 treesize of output 51 [2022-11-03 04:08:59,027 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_56| Int)) (or (not (<= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_56|)) (forall ((v_ArrVal_931 (Array Int Int)) (v_ArrVal_932 (Array Int Int)) (v_ArrVal_934 Int)) (= (select (store (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_931) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_932) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_56| 4) v_ArrVal_934) 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)))) (forall ((|v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_56| Int)) (or (forall ((v_ArrVal_931 (Array Int Int)) (v_prenex_4 Int) (v_prenex_3 (Array Int Int))) (not (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (select (store (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_931) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_3) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_56| 4) v_prenex_4) 0)))) (not (<= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_56|))))) is different from false [2022-11-03 04:08:59,045 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:08:59,046 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 27 treesize of output 28 [2022-11-03 04:08:59,050 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 171 treesize of output 165 [2022-11-03 04:08:59,079 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:08:59,079 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 191 treesize of output 193 [2022-11-03 04:08:59,089 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 206 treesize of output 202 [2022-11-03 04:08:59,097 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 254 treesize of output 246 [2022-11-03 04:08:59,161 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-03 04:08:59,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, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 1 [2022-11-03 04:08:59,277 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-03 04:08:59,278 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 25 treesize of output 24 [2022-11-03 04:08:59,288 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-11-03 04:08:59,288 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [264062697] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 04:08:59,289 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1685631746] [2022-11-03 04:08:59,292 INFO L159 IcfgInterpreter]: Started Sifa with 21 locations of interest [2022-11-03 04:08:59,292 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 04:08:59,293 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 04:08:59,293 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 04:08:59,293 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 04:08:59,313 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 04:08:59,328 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 04:08:59,336 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 04:08:59,352 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:08:59,354 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-03 04:08:59,366 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:08:59,367 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-03 04:08:59,389 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:08:59,390 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 [2022-11-03 04:08:59,421 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:08:59,422 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:08:59,423 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 28 treesize of output 30 [2022-11-03 04:08:59,436 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:08:59,438 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:08:59,439 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 28 treesize of output 30 [2022-11-03 04:08:59,468 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:08:59,469 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:08:59,470 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:08:59,477 INFO L356 Elim1Store]: treesize reduction 27, result has 3.6 percent of original size [2022-11-03 04:08:59,478 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 98 treesize of output 73 [2022-11-03 04:08:59,491 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:08:59,493 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:08:59,509 INFO L356 Elim1Store]: treesize reduction 48, result has 12.7 percent of original size [2022-11-03 04:08:59,510 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 74 treesize of output 57 [2022-11-03 04:08:59,549 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:08:59,551 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:08:59,552 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:08:59,553 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 31 [2022-11-03 04:08:59,612 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:08:59,614 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:08:59,616 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:08:59,685 INFO L356 Elim1Store]: treesize reduction 126, result has 18.2 percent of original size [2022-11-03 04:08:59,686 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 4 new quantified variables, introduced 9 case distinctions, treesize of input 321 treesize of output 325 [2022-11-03 04:08:59,704 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:08:59,704 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:08:59,705 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:08:59,766 INFO L356 Elim1Store]: treesize reduction 98, result has 15.5 percent of original size [2022-11-03 04:08:59,767 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 9 case distinctions, treesize of input 321 treesize of output 308 [2022-11-03 04:08:59,872 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:08:59,873 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:08:59,875 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:08:59,877 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:08:59,878 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:08:59,879 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:08:59,957 INFO L356 Elim1Store]: treesize reduction 122, result has 10.9 percent of original size [2022-11-03 04:08:59,958 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 12 case distinctions, treesize of input 446 treesize of output 381 [2022-11-03 04:08:59,979 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:08:59,980 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:09:00,082 INFO L356 Elim1Store]: treesize reduction 154, result has 18.5 percent of original size [2022-11-03 04:09:00,083 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 10 case distinctions, treesize of input 448 treesize of output 397 [2022-11-03 04:09:00,201 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:09:00,202 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:09:00,236 INFO L356 Elim1Store]: treesize reduction 47, result has 9.6 percent of original size [2022-11-03 04:09:00,236 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 393 treesize of output 389 [2022-11-03 04:09:00,395 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:09:00,397 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:09:00,398 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:09:00,473 INFO L356 Elim1Store]: treesize reduction 126, result has 18.2 percent of original size [2022-11-03 04:09:00,474 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 4 new quantified variables, introduced 9 case distinctions, treesize of input 321 treesize of output 325 [2022-11-03 04:09:00,501 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:09:00,502 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:09:00,503 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:09:00,565 INFO L356 Elim1Store]: treesize reduction 94, result has 19.0 percent of original size [2022-11-03 04:09:00,566 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 9 case distinctions, treesize of input 321 treesize of output 312 [2022-11-03 04:09:00,664 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:09:00,666 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:09:00,667 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:09:00,669 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:09:00,670 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:09:00,671 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:09:00,739 INFO L356 Elim1Store]: treesize reduction 120, result has 12.4 percent of original size [2022-11-03 04:09:00,740 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 12 case distinctions, treesize of input 454 treesize of output 387 [2022-11-03 04:09:00,765 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:09:00,766 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:09:00,886 INFO L356 Elim1Store]: treesize reduction 238, result has 13.1 percent of original size [2022-11-03 04:09:00,887 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 14 case distinctions, treesize of input 431 treesize of output 386 [2022-11-03 04:09:01,046 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 04:09:01,055 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 04:09:01,082 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:09:01,083 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 04:09:01,105 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:09:01,106 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 04:09:01,237 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:09:01,258 INFO L356 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-11-03 04:09:01,258 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 22 treesize of output 21 [2022-11-03 04:09:01,500 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:09:01,502 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:09:01,539 INFO L356 Elim1Store]: treesize reduction 47, result has 9.6 percent of original size [2022-11-03 04:09:01,539 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 754 treesize of output 736 [2022-11-03 04:09:01,673 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 04:09:08,354 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '6401#(and (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4)) |ULTIMATE.start_dll_circular_create_~last~0#1.offset|) (< |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base| |#StackHeapBarrier|) (<= 1 |ULTIMATE.start_dll_circular_create_~len#1|) (= |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base|) (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 4))) (= |ULTIMATE.start_dll_circular_create_#res#1.offset| |ULTIMATE.start_main_~head~1#1.offset|) (= |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.offset| 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base|) |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|) |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base|) (= |ULTIMATE.start_dll_circular_create_#res#1.offset| |ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (= |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 0) (<= |#NULL.offset| 0) (= |ULTIMATE.start__destroy_in_nondeterministic_order_#in~head#1.base| |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4)) |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (<= 3 |ULTIMATE.start_dll_circular_create_#in~len#1|) (<= (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 8) (select |#length| |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base|)) (<= (+ |ULTIMATE.start_dll_circular_create_~last~0#1.offset| 4) (select |#length| |ULTIMATE.start_dll_circular_create_~last~0#1.base|)) (or (= (select |#valid| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1) (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|)) (= |ULTIMATE.start_dll_circular_create_#res#1.base| |ULTIMATE.start_main_~head~1#1.base|) (= |ULTIMATE.start_main_~head~1#1.offset| |ULTIMATE.start__destroy_in_nondeterministic_order_#in~head#1.offset|) (< |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base| |#StackHeapBarrier|) (<= |ULTIMATE.start_dll_circular_create_#in~len#1| 3) (= |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| |ULTIMATE.start__destroy_in_nondeterministic_order_#in~head#1.offset|) (= |ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) (not (= |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base| 0)) (not (= (select |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base|) 1)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset|) |ULTIMATE.start_dll_circular_create_~head~0#1.base|) (<= |ULTIMATE.start_main_~len~0#1| 3) (= |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base|) |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|)) (= |ULTIMATE.start__destroy_in_nondeterministic_order_#in~head#1.base| |ULTIMATE.start_main_~head~1#1.base|) (<= 0 |#NULL.offset|) (<= |ULTIMATE.start_dll_circular_create_~len#1| 1) (<= 3 |ULTIMATE.start_main_~len~0#1|) (<= 0 |#StackHeapBarrier|) (= |ULTIMATE.start_dll_circular_create_#res#1.base| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base|) (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 4)) |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base|) (= |#NULL.base| 0))' at error location [2022-11-03 04:09:08,355 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-03 04:09:08,355 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 04:09:08,355 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 12] total 21 [2022-11-03 04:09:08,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208626747] [2022-11-03 04:09:08,355 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 04:09:08,356 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-11-03 04:09:08,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:09:08,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-11-03 04:09:08,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=1249, Unknown=2, NotChecked=146, Total=1560 [2022-11-03 04:09:08,357 INFO L87 Difference]: Start difference. First operand 81 states and 85 transitions. Second operand has 22 states, 21 states have (on average 2.3333333333333335) internal successors, (49), 22 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 04:09:10,022 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (let ((.cse0 (select .cse4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (.cse2 (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1)) (.cse3 (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)) (.cse1 (select .cse4 0))) (and (forall ((|v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_56| Int)) (or (not (<= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_56|)) (forall ((v_ArrVal_931 (Array Int Int)) (v_ArrVal_932 (Array Int Int)) (v_ArrVal_934 Int)) (= (select (store (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_931) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_932) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_56| 4) v_ArrVal_934) 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)))) (not (= .cse0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (forall ((|v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_56| Int)) (or (forall ((v_ArrVal_931 (Array Int Int)) (v_prenex_4 Int) (v_prenex_3 (Array Int Int))) (not (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (select (store (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_931) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_3) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_56| 4) v_prenex_4) 0)))) (not (<= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_56|)))) (not (= .cse1 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (= (select |c_#valid| .cse0) 1) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (<= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) .cse2 (or (and (not (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0)) (not (= .cse3 0))) (not .cse2)) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) (= .cse3 1) (= (select |c_#valid| .cse1) 1) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))))) is different from false [2022-11-03 04:09:10,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:09:10,599 INFO L93 Difference]: Finished difference Result 80 states and 84 transitions. [2022-11-03 04:09:10,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-03 04:09:10,599 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 2.3333333333333335) internal successors, (49), 22 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) Word has length 25 [2022-11-03 04:09:10,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:09:10,600 INFO L225 Difference]: With dead ends: 80 [2022-11-03 04:09:10,600 INFO L226 Difference]: Without dead ends: 80 [2022-11-03 04:09:10,602 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 45 SyntacticMatches, 3 SemanticMatches, 48 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 525 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=257, Invalid=1914, Unknown=3, NotChecked=276, Total=2450 [2022-11-03 04:09:10,602 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 108 mSDsluCounter, 524 mSDsCounter, 0 mSdLazyCounter, 503 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 575 SdHoareTripleChecker+Invalid, 653 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 503 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 128 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-03 04:09:10,603 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 575 Invalid, 653 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 503 Invalid, 0 Unknown, 128 Unchecked, 0.4s Time] [2022-11-03 04:09:10,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-11-03 04:09:10,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2022-11-03 04:09:10,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 69 states have (on average 1.2173913043478262) internal successors, (84), 79 states have internal predecessors, (84), 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 04:09:10,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 84 transitions. [2022-11-03 04:09:10,606 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 84 transitions. Word has length 25 [2022-11-03 04:09:10,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:09:10,606 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 84 transitions. [2022-11-03 04:09:10,606 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.3333333333333335) internal successors, (49), 22 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 04:09:10,607 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 84 transitions. [2022-11-03 04:09:10,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-03 04:09:10,607 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:09:10,607 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:09:10,644 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75cc489c-bbc7-4882-8b9a-1f5e065ba06a/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-03 04:09:10,821 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75cc489c-bbc7-4882-8b9a-1f5e065ba06a/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-11-03 04:09:10,822 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2022-11-03 04:09:10,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:09:10,822 INFO L85 PathProgramCache]: Analyzing trace with hash 1974051295, now seen corresponding path program 1 times [2022-11-03 04:09:10,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:09:10,822 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866279584] [2022-11-03 04:09:10,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:09:10,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:09:10,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:09:11,726 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:09:11,727 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:09:11,727 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866279584] [2022-11-03 04:09:11,727 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [866279584] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 04:09:11,727 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [535165984] [2022-11-03 04:09:11,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:09:11,728 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:09:11,728 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75cc489c-bbc7-4882-8b9a-1f5e065ba06a/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 04:09:11,729 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75cc489c-bbc7-4882-8b9a-1f5e065ba06a/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 04:09:11,732 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75cc489c-bbc7-4882-8b9a-1f5e065ba06a/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-03 04:09:11,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:09:11,912 INFO L263 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 58 conjunts are in the unsatisfiable core [2022-11-03 04:09:11,921 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:09:11,924 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 04:09:12,012 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-03 04:09:12,013 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 04:09:12,122 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-11-03 04:09:12,123 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-11-03 04:09:12,171 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 04:09:12,236 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-03 04:09:12,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 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2022-11-03 04:09:12,303 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 32 treesize of output 30 [2022-11-03 04:09:12,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, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 28 [2022-11-03 04:09:12,442 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:09:12,443 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 52 treesize of output 24 [2022-11-03 04:09:12,474 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 14 [2022-11-03 04:09:12,485 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:09:12,485 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 04:09:12,649 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1020 (Array Int Int))) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1020) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)))) (forall ((v_ArrVal_1020 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1020) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) 1))) is different from false [2022-11-03 04:09:12,670 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:09:12,671 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 37 treesize of output 41 [2022-11-03 04:09:12,699 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1019 (Array Int Int)) (v_ArrVal_1020 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1019) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1020) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (forall ((v_prenex_5 (Array Int Int)) (v_prenex_6 (Array Int Int))) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_5) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_6) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))))) is different from false [2022-11-03 04:09:12,709 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:09:12,709 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 22 [2022-11-03 04:09:12,713 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 122 treesize of output 110 [2022-11-03 04:09:12,719 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 90 treesize of output 82 [2022-11-03 04:09:12,723 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 82 treesize of output 78 [2022-11-03 04:09:12,761 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:09:12,762 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-11-03 04:09:12,764 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:09:12,765 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:09:12,767 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-11-03 04:09:13,137 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-11-03 04:09:13,137 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [535165984] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 04:09:13,137 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [423251343] [2022-11-03 04:09:13,139 INFO L159 IcfgInterpreter]: Started Sifa with 22 locations of interest [2022-11-03 04:09:13,140 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 04:09:13,140 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 04:09:13,140 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 04:09:13,140 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 04:09:13,158 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 04:09:13,175 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 04:09:13,186 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 04:09:13,204 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:09:13,205 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-03 04:09:13,215 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:09:13,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, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-03 04:09:13,241 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:09:13,242 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 [2022-11-03 04:09:13,272 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:09:13,273 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:09:13,274 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 28 treesize of output 30 [2022-11-03 04:09:13,288 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:09:13,289 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:09:13,291 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 28 treesize of output 30 [2022-11-03 04:09:13,324 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:09:13,325 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:09:13,343 INFO L356 Elim1Store]: treesize reduction 48, result has 12.7 percent of original size [2022-11-03 04:09:13,343 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 78 treesize of output 61 [2022-11-03 04:09:13,356 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:09:13,358 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:09:13,359 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 33 [2022-11-03 04:09:13,388 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:09:13,390 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:09:13,391 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:09:13,392 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2022-11-03 04:09:13,474 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:09:13,475 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:09:13,476 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:09:13,514 INFO L356 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2022-11-03 04:09:13,515 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 311 treesize of output 306 [2022-11-03 04:09:13,532 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:09:13,534 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:09:13,535 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:09:13,576 INFO L356 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2022-11-03 04:09:13,577 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 311 treesize of output 306 [2022-11-03 04:09:13,669 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:09:13,671 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:09:13,673 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:09:13,674 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:09:13,675 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:09:13,676 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:09:13,716 INFO L356 Elim1Store]: treesize reduction 39, result has 25.0 percent of original size [2022-11-03 04:09:13,716 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 428 treesize of output 369 [2022-11-03 04:09:13,742 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:09:13,744 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:09:13,745 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:09:13,747 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:09:13,824 INFO L356 Elim1Store]: treesize reduction 154, result has 18.5 percent of original size [2022-11-03 04:09:13,825 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 9 case distinctions, treesize of input 413 treesize of output 386 [2022-11-03 04:09:14,007 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:09:14,008 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:09:14,038 INFO L356 Elim1Store]: treesize reduction 49, result has 5.8 percent of original size [2022-11-03 04:09:14,039 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 702 treesize of output 674 [2022-11-03 04:09:14,279 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:09:14,281 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:09:14,282 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:09:14,327 INFO L356 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2022-11-03 04:09:14,328 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 311 treesize of output 306 [2022-11-03 04:09:14,346 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:09:14,348 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:09:14,349 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:09:14,388 INFO L356 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2022-11-03 04:09:14,389 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 311 treesize of output 306 [2022-11-03 04:09:14,494 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:09:14,495 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:09:14,497 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:09:14,498 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:09:14,500 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:09:14,501 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:09:14,541 INFO L356 Elim1Store]: treesize reduction 39, result has 25.0 percent of original size [2022-11-03 04:09:14,542 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 428 treesize of output 369 [2022-11-03 04:09:14,567 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:09:14,569 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:09:14,570 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:09:14,571 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:09:14,664 INFO L356 Elim1Store]: treesize reduction 154, result has 18.5 percent of original size [2022-11-03 04:09:14,664 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 9 case distinctions, treesize of input 413 treesize of output 386 [2022-11-03 04:09:14,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 11 treesize of output 7 [2022-11-03 04:09:14,839 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 04:09:14,872 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:09:14,872 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 04:09:14,887 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:09:14,888 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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 04:09:15,014 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:09:15,016 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:09:15,035 INFO L356 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-11-03 04:09:15,035 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 31 treesize of output 28 [2022-11-03 04:09:15,226 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:09:15,227 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:09:15,258 INFO L356 Elim1Store]: treesize reduction 47, result has 9.6 percent of original size [2022-11-03 04:09:15,259 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 702 treesize of output 676 [2022-11-03 04:09:15,397 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 04:09:22,794 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '6786#(and (or (= (select |#valid| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|)) (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset|)) (<= 1 |ULTIMATE.start_dll_circular_create_~len#1|) (<= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0) (= |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base|) (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 4))) (= |ULTIMATE.start_dll_circular_create_#res#1.offset| |ULTIMATE.start_main_~head~1#1.offset|) (= |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.offset| 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base|) |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|) |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base|) (= |ULTIMATE.start_dll_circular_create_#res#1.offset| |ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (< |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base| |#StackHeapBarrier|) (<= |#NULL.offset| 0) (= |ULTIMATE.start__destroy_in_nondeterministic_order_#in~head#1.base| |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4)) |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (<= 3 |ULTIMATE.start_dll_circular_create_#in~len#1|) (= |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.offset| 0) (<= (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 8) (select |#length| |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base|)) (<= (+ |ULTIMATE.start_dll_circular_create_~last~0#1.offset| 4) (select |#length| |ULTIMATE.start_dll_circular_create_~last~0#1.base|)) (= |ULTIMATE.start_dll_circular_create_#res#1.base| |ULTIMATE.start_main_~head~1#1.base|) (= |ULTIMATE.start_main_~head~1#1.offset| |ULTIMATE.start__destroy_in_nondeterministic_order_#in~head#1.offset|) (< |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base| |#StackHeapBarrier|) (<= |ULTIMATE.start_dll_circular_create_#in~len#1| 3) (= |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| |ULTIMATE.start__destroy_in_nondeterministic_order_#in~head#1.offset|) (= |ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (not (= |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base| 0)) (not (= (select |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base|) 1)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset|) |ULTIMATE.start_dll_circular_create_~head~0#1.base|) (<= |ULTIMATE.start_main_~len~0#1| 3) (= |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base|) |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|)) (= |ULTIMATE.start__destroy_in_nondeterministic_order_#in~head#1.base| |ULTIMATE.start_main_~head~1#1.base|) (= 0 (select |#valid| |ULTIMATE.start_dll_circular_create_~last~0#1.base|)) (<= 0 |#NULL.offset|) (<= |ULTIMATE.start_dll_circular_create_~len#1| 1) (<= 3 |ULTIMATE.start_main_~len~0#1|) (<= 0 |#StackHeapBarrier|) (<= 0 |ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (= |ULTIMATE.start_dll_circular_create_#res#1.base| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base|) (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 4)) |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base|) (= |#NULL.base| 0))' at error location [2022-11-03 04:09:22,795 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-03 04:09:22,795 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 04:09:22,795 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11, 12] total 33 [2022-11-03 04:09:22,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220988615] [2022-11-03 04:09:22,795 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 04:09:22,796 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-11-03 04:09:22,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:09:22,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-11-03 04:09:22,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=292, Invalid=2366, Unknown=2, NotChecked=202, Total=2862 [2022-11-03 04:09:22,798 INFO L87 Difference]: Start difference. First operand 80 states and 84 transitions. Second operand has 35 states, 34 states have (on average 1.7647058823529411) internal successors, (60), 34 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 04:09:23,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:09:23,887 INFO L93 Difference]: Finished difference Result 79 states and 83 transitions. [2022-11-03 04:09:23,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-03 04:09:23,888 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 1.7647058823529411) internal successors, (60), 34 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) Word has length 26 [2022-11-03 04:09:23,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:09:23,889 INFO L225 Difference]: With dead ends: 79 [2022-11-03 04:09:23,889 INFO L226 Difference]: Without dead ends: 79 [2022-11-03 04:09:23,891 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 36 SyntacticMatches, 2 SemanticMatches, 63 ConstructedPredicates, 2 IntricatePredicates, 1 DeprecatedPredicates, 1352 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=435, Invalid=3477, Unknown=2, NotChecked=246, Total=4160 [2022-11-03 04:09:23,892 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 199 mSDsluCounter, 380 mSDsCounter, 0 mSdLazyCounter, 511 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 826 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 511 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 282 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-03 04:09:23,892 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 426 Invalid, 826 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 511 Invalid, 0 Unknown, 282 Unchecked, 0.4s Time] [2022-11-03 04:09:23,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-11-03 04:09:23,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2022-11-03 04:09:23,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 69 states have (on average 1.2028985507246377) internal successors, (83), 78 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 04:09:23,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 83 transitions. [2022-11-03 04:09:23,895 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 83 transitions. Word has length 26 [2022-11-03 04:09:23,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:09:23,896 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 83 transitions. [2022-11-03 04:09:23,896 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 1.7647058823529411) internal successors, (60), 34 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 04:09:23,896 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 83 transitions. [2022-11-03 04:09:23,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-03 04:09:23,897 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:09:23,897 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:09:23,924 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75cc489c-bbc7-4882-8b9a-1f5e065ba06a/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-03 04:09:24,102 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75cc489c-bbc7-4882-8b9a-1f5e065ba06a/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2022-11-03 04:09:24,103 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2022-11-03 04:09:24,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:09:24,103 INFO L85 PathProgramCache]: Analyzing trace with hash 1973620319, now seen corresponding path program 1 times [2022-11-03 04:09:24,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:09:24,103 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108405639] [2022-11-03 04:09:24,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:09:24,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:09:24,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:09:24,578 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:09:24,578 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:09:24,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108405639] [2022-11-03 04:09:24,579 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [108405639] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 04:09:24,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [969550460] [2022-11-03 04:09:24,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:09:24,579 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:09:24,580 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75cc489c-bbc7-4882-8b9a-1f5e065ba06a/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 04:09:24,581 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75cc489c-bbc7-4882-8b9a-1f5e065ba06a/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 04:09:24,587 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75cc489c-bbc7-4882-8b9a-1f5e065ba06a/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-03 04:09:24,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:09:24,763 INFO L263 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 32 conjunts are in the unsatisfiable core [2022-11-03 04:09:24,767 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:09:24,811 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-03 04:09:24,811 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 04:09:24,872 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 04:09:24,901 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:09:24,901 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 18 treesize of output 16 [2022-11-03 04:09:25,035 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-03 04:09:25,037 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 04:09:25,083 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:09:25,083 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 04:09:25,232 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 36 treesize of output 32 [2022-11-03 04:09:25,268 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 13 treesize of output 11 [2022-11-03 04:09:25,271 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 20 treesize of output 18 [2022-11-03 04:09:25,322 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-03 04:09:25,323 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 13 treesize of output 12 [2022-11-03 04:09:25,332 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:09:25,333 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [969550460] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 04:09:25,333 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1658226645] [2022-11-03 04:09:25,335 INFO L159 IcfgInterpreter]: Started Sifa with 22 locations of interest [2022-11-03 04:09:25,335 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 04:09:25,335 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 04:09:25,336 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 04:09:25,336 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 04:09:25,349 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 04:09:25,374 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 04:09:25,381 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 04:09:25,397 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:09:25,398 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-03 04:09:25,408 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:09:25,409 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-03 04:09:25,434 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:09:25,435 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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 19 [2022-11-03 04:09:25,462 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:09:25,463 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:09:25,464 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 28 treesize of output 30 [2022-11-03 04:09:25,476 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:09:25,477 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:09:25,478 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 28 treesize of output 30 [2022-11-03 04:09:25,525 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:09:25,526 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:09:25,527 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:09:25,528 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:09:25,535 INFO L356 Elim1Store]: treesize reduction 27, result has 3.6 percent of original size [2022-11-03 04:09:25,535 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 98 treesize of output 73 [2022-11-03 04:09:25,548 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:09:25,555 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:09:25,574 INFO L356 Elim1Store]: treesize reduction 48, result has 12.7 percent of original size [2022-11-03 04:09:25,575 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 74 treesize of output 57 [2022-11-03 04:09:25,612 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:09:25,613 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:09:25,615 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:09:25,616 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 41 [2022-11-03 04:09:25,693 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:09:25,695 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:09:25,696 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:09:25,769 INFO L356 Elim1Store]: treesize reduction 98, result has 15.5 percent of original size [2022-11-03 04:09:25,770 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 9 case distinctions, treesize of input 339 treesize of output 326 [2022-11-03 04:09:25,790 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:09:25,792 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:09:25,793 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:09:25,850 INFO L356 Elim1Store]: treesize reduction 136, result has 11.7 percent of original size [2022-11-03 04:09:25,851 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 4 new quantified variables, introduced 9 case distinctions, treesize of input 335 treesize of output 329 [2022-11-03 04:09:25,929 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:09:25,930 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:09:25,931 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:09:25,932 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:09:25,933 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:09:25,963 INFO L356 Elim1Store]: treesize reduction 39, result has 25.0 percent of original size [2022-11-03 04:09:25,964 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 476 treesize of output 409 [2022-11-03 04:09:25,984 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:09:25,985 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:09:26,076 INFO L356 Elim1Store]: treesize reduction 180, result has 16.3 percent of original size [2022-11-03 04:09:26,077 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 6 new quantified variables, introduced 9 case distinctions, treesize of input 461 treesize of output 401 [2022-11-03 04:09:26,243 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:09:26,245 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:09:26,283 INFO L356 Elim1Store]: treesize reduction 47, result has 9.6 percent of original size [2022-11-03 04:09:26,283 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 798 treesize of output 768 [2022-11-03 04:09:26,534 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:09:26,536 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:09:26,537 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:09:26,602 INFO L356 Elim1Store]: treesize reduction 136, result has 11.7 percent of original size [2022-11-03 04:09:26,602 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 4 new quantified variables, introduced 9 case distinctions, treesize of input 339 treesize of output 333 [2022-11-03 04:09:26,623 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:09:26,625 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:09:26,626 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:09:26,681 INFO L356 Elim1Store]: treesize reduction 94, result has 19.0 percent of original size [2022-11-03 04:09:26,681 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 9 case distinctions, treesize of input 335 treesize of output 330 [2022-11-03 04:09:26,770 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:09:26,886 INFO L356 Elim1Store]: treesize reduction 262, result has 12.7 percent of original size [2022-11-03 04:09:26,886 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 8 new quantified variables, introduced 15 case distinctions, treesize of input 493 treesize of output 429 [2022-11-03 04:09:26,902 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:09:26,904 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:09:26,906 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:09:26,907 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:09:26,907 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:09:26,937 INFO L356 Elim1Store]: treesize reduction 39, result has 25.0 percent of original size [2022-11-03 04:09:26,938 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 468 treesize of output 405 [2022-11-03 04:09:27,078 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 04:09:27,091 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 04:09:27,126 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:09:27,127 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 04:09:27,143 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:09:27,145 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 04:09:27,275 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:09:27,276 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:09:27,295 INFO L356 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-11-03 04:09:27,296 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 31 treesize of output 28 [2022-11-03 04:09:27,513 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:09:27,514 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:09:27,547 INFO L356 Elim1Store]: treesize reduction 47, result has 9.6 percent of original size [2022-11-03 04:09:27,547 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 798 treesize of output 768 [2022-11-03 04:09:27,671 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 04:09:33,878 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '7157#(and (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset|)) (<= 1 |ULTIMATE.start_dll_circular_create_~len#1|) (= |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base|) (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 4))) (= |ULTIMATE.start_dll_circular_create_#res#1.offset| |ULTIMATE.start_main_~head~1#1.offset|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base|) |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|) |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base|) (= |ULTIMATE.start_dll_circular_create_#res#1.offset| |ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (< |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base| |#StackHeapBarrier|) (= |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 0) (<= |#NULL.offset| 0) (= |ULTIMATE.start__destroy_in_nondeterministic_order_#in~head#1.base| |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4)) |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (<= 3 |ULTIMATE.start_dll_circular_create_#in~len#1|) (= |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.offset| 0) (<= (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 8) (select |#length| |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base|)) (= |ULTIMATE.start_dll_circular_create_#res#1.base| |ULTIMATE.start_main_~head~1#1.base|) (= |ULTIMATE.start_main_~head~1#1.offset| |ULTIMATE.start__destroy_in_nondeterministic_order_#in~head#1.offset|) (<= |ULTIMATE.start_dll_circular_create_#in~len#1| 3) (= |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| |ULTIMATE.start__destroy_in_nondeterministic_order_#in~head#1.offset|) (= |ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset|) |ULTIMATE.start_dll_circular_create_~head~0#1.base|) (<= |ULTIMATE.start_main_~len~0#1| 3) (= |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base|) |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|)) (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= |ULTIMATE.start__destroy_in_nondeterministic_order_#in~head#1.base| |ULTIMATE.start_main_~head~1#1.base|) (= 0 (select |#valid| |ULTIMATE.start_dll_circular_create_~last~0#1.base|)) (<= 0 |#NULL.offset|) (not (= |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base| 0)) (<= |ULTIMATE.start_dll_circular_create_~len#1| 1) (<= 3 |ULTIMATE.start_main_~len~0#1|) (<= 0 |#StackHeapBarrier|) (= |ULTIMATE.start_dll_circular_create_#res#1.base| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base|) (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 4)) |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base|) (= |#NULL.base| 0))' at error location [2022-11-03 04:09:33,878 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-03 04:09:33,878 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 04:09:33,878 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 10] total 21 [2022-11-03 04:09:33,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647711982] [2022-11-03 04:09:33,879 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 04:09:33,879 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-11-03 04:09:33,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:09:33,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-11-03 04:09:33,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=1324, Unknown=0, NotChecked=0, Total=1560 [2022-11-03 04:09:33,880 INFO L87 Difference]: Start difference. First operand 79 states and 83 transitions. Second operand has 22 states, 21 states have (on average 2.9047619047619047) internal successors, (61), 22 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 04:09:34,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:09:34,404 INFO L93 Difference]: Finished difference Result 78 states and 82 transitions. [2022-11-03 04:09:34,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-03 04:09:34,407 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 2.9047619047619047) internal successors, (61), 22 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) Word has length 26 [2022-11-03 04:09:34,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:09:34,407 INFO L225 Difference]: With dead ends: 78 [2022-11-03 04:09:34,408 INFO L226 Difference]: Without dead ends: 78 [2022-11-03 04:09:34,408 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 44 SyntacticMatches, 3 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 740 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=328, Invalid=1834, Unknown=0, NotChecked=0, Total=2162 [2022-11-03 04:09:34,409 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 323 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 311 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 323 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 394 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 311 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 48 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-03 04:09:34,409 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [323 Valid, 260 Invalid, 394 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 311 Invalid, 0 Unknown, 48 Unchecked, 0.3s Time] [2022-11-03 04:09:34,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-11-03 04:09:34,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2022-11-03 04:09:34,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 69 states have (on average 1.1884057971014492) internal successors, (82), 77 states have internal predecessors, (82), 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 04:09:34,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 82 transitions. [2022-11-03 04:09:34,412 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 82 transitions. Word has length 26 [2022-11-03 04:09:34,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:09:34,413 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 82 transitions. [2022-11-03 04:09:34,413 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.9047619047619047) internal successors, (61), 22 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 04:09:34,413 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 82 transitions. [2022-11-03 04:09:34,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-03 04:09:34,413 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:09:34,414 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:09:34,440 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75cc489c-bbc7-4882-8b9a-1f5e065ba06a/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-03 04:09:34,618 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75cc489c-bbc7-4882-8b9a-1f5e065ba06a/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-11-03 04:09:34,619 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2022-11-03 04:09:34,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:09:34,619 INFO L85 PathProgramCache]: Analyzing trace with hash -317804833, now seen corresponding path program 1 times [2022-11-03 04:09:34,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:09:34,620 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325891133] [2022-11-03 04:09:34,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:09:34,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:09:34,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:09:35,398 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:09:35,398 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:09:35,398 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325891133] [2022-11-03 04:09:35,398 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1325891133] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 04:09:35,398 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1021189514] [2022-11-03 04:09:35,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:09:35,399 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:09:35,399 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75cc489c-bbc7-4882-8b9a-1f5e065ba06a/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 04:09:35,400 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75cc489c-bbc7-4882-8b9a-1f5e065ba06a/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 04:09:35,429 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75cc489c-bbc7-4882-8b9a-1f5e065ba06a/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-03 04:09:35,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:09:35,598 INFO L263 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 54 conjunts are in the unsatisfiable core [2022-11-03 04:09:35,601 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:09:35,604 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 04:09:35,650 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-03 04:09:35,651 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 04:09:35,748 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-11-03 04:09:35,748 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-11-03 04:09:35,792 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 04:09:35,855 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-03 04:09:35,856 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28 [2022-11-03 04:09:35,911 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 23 [2022-11-03 04:09:35,973 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 28 treesize of output 23 [2022-11-03 04:09:36,083 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:09:36,084 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 52 treesize of output 24 [2022-11-03 04:09:36,112 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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 14 [2022-11-03 04:09:36,122 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:09:36,122 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 04:09:36,216 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 04:09:36,218 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1189 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1189) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) is different from false [2022-11-03 04:09:36,227 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1189 (Array Int Int)) (v_ArrVal_1188 (Array Int Int))) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1188) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1189) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)))) is different from false [2022-11-03 04:09:36,234 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:09:36,234 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-11-03 04:09:36,237 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 65 treesize of output 57 [2022-11-03 04:09:36,246 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 04:09:36,253 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 04:09:36,256 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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 04:09:36,529 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-11-03 04:09:36,529 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1021189514] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 04:09:36,529 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2006705325] [2022-11-03 04:09:36,531 INFO L159 IcfgInterpreter]: Started Sifa with 22 locations of interest [2022-11-03 04:09:36,531 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 04:09:36,532 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 04:09:36,533 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 04:09:36,533 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 04:09:36,553 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 04:09:36,567 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 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 04:09:36,574 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 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 04:09:36,597 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:09:36,598 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-03 04:09:36,609 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:09:36,610 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-03 04:09:36,635 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:09:36,635 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 [2022-11-03 04:09:36,661 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:09:36,662 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:09:36,663 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 28 treesize of output 30 [2022-11-03 04:09:36,676 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:09:36,678 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:09:36,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 28 treesize of output 30 [2022-11-03 04:09:36,711 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:09:36,712 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:09:36,719 INFO L356 Elim1Store]: treesize reduction 27, result has 3.6 percent of original size [2022-11-03 04:09:36,720 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 86 treesize of output 61 [2022-11-03 04:09:36,748 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:09:36,750 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:09:36,751 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 37 [2022-11-03 04:09:36,785 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:09:36,786 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:09:36,788 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:09:36,789 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 31 [2022-11-03 04:09:36,875 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:09:36,876 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:09:36,877 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:09:36,919 INFO L356 Elim1Store]: treesize reduction 52, result has 22.4 percent of original size [2022-11-03 04:09:36,920 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 331 treesize of output 335 [2022-11-03 04:09:36,938 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:09:36,939 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:09:36,940 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:09:36,981 INFO L356 Elim1Store]: treesize reduction 48, result has 23.8 percent of original size [2022-11-03 04:09:36,982 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 8 case distinctions, treesize of input 331 treesize of output 318 [2022-11-03 04:09:37,059 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:09:37,060 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:09:37,061 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:09:37,063 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:09:37,064 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:09:37,064 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:09:37,117 INFO L356 Elim1Store]: treesize reduction 70, result has 19.5 percent of original size [2022-11-03 04:09:37,117 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 12 case distinctions, treesize of input 468 treesize of output 375 [2022-11-03 04:09:37,147 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:09:37,148 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:09:37,257 INFO L356 Elim1Store]: treesize reduction 246, result has 13.4 percent of original size [2022-11-03 04:09:37,257 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 14 case distinctions, treesize of input 445 treesize of output 413 [2022-11-03 04:09:37,418 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:09:37,422 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:09:37,494 INFO L356 Elim1Store]: treesize reduction 146, result has 5.8 percent of original size [2022-11-03 04:09:37,494 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 8 case distinctions, treesize of input 750 treesize of output 695 [2022-11-03 04:09:37,710 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:09:37,712 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:09:37,713 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:09:37,759 INFO L356 Elim1Store]: treesize reduction 48, result has 23.8 percent of original size [2022-11-03 04:09:37,760 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 8 case distinctions, treesize of input 331 treesize of output 318 [2022-11-03 04:09:37,781 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:09:37,782 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:09:37,784 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:09:37,827 INFO L356 Elim1Store]: treesize reduction 52, result has 22.4 percent of original size [2022-11-03 04:09:37,828 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 4 new quantified variables, introduced 8 case distinctions, treesize of input 331 treesize of output 335 [2022-11-03 04:09:37,918 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:09:37,919 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:09:38,061 INFO L356 Elim1Store]: treesize reduction 238, result has 16.2 percent of original size [2022-11-03 04:09:38,061 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 473 treesize of output 449 [2022-11-03 04:09:38,079 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:09:38,080 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:09:38,081 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:09:38,083 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:09:38,084 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:09:38,084 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:09:38,133 INFO L356 Elim1Store]: treesize reduction 70, result has 19.5 percent of original size [2022-11-03 04:09:38,133 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 12 case distinctions, treesize of input 468 treesize of output 371 [2022-11-03 04:09:38,258 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 04:09:38,269 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 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 04:09:38,301 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:09:38,301 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 04:09:38,317 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:09:38,317 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 04:09:38,460 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:09:38,518 INFO L356 Elim1Store]: treesize reduction 28, result has 55.6 percent of original size [2022-11-03 04:09:38,518 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 8 case distinctions, treesize of input 31 treesize of output 53 [2022-11-03 04:09:38,659 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:09:38,662 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:09:38,720 INFO L356 Elim1Store]: treesize reduction 138, result has 11.0 percent of original size [2022-11-03 04:09:38,721 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 8 case distinctions, treesize of input 813 treesize of output 766 [2022-11-03 04:09:38,834 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 04:09:46,384 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '7527#(and (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset|)) (= (select |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base|) 0) (<= 1 |ULTIMATE.start_dll_circular_create_~len#1|) (<= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0) (= |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base|) (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 4))) (= |ULTIMATE.start_dll_circular_create_#res#1.offset| |ULTIMATE.start_main_~head~1#1.offset|) (= |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.offset| 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base|) |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|) |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base|) (= |ULTIMATE.start_dll_circular_create_#res#1.offset| |ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (<= |#NULL.offset| 0) (= |ULTIMATE.start__destroy_in_nondeterministic_order_#in~head#1.base| |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4)) |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (<= 3 |ULTIMATE.start_dll_circular_create_#in~len#1|) (= |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.offset| 0) (<= (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 8) (select |#length| |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base|)) (<= (+ |ULTIMATE.start_dll_circular_create_~last~0#1.offset| 4) (select |#length| |ULTIMATE.start_dll_circular_create_~last~0#1.base|)) (not (= |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base| 0)) (= |ULTIMATE.start_dll_circular_create_#res#1.base| |ULTIMATE.start_main_~head~1#1.base|) (= |ULTIMATE.start_main_~head~1#1.offset| |ULTIMATE.start__destroy_in_nondeterministic_order_#in~head#1.offset|) (< |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base| |#StackHeapBarrier|) (<= |ULTIMATE.start_dll_circular_create_#in~len#1| 3) (= |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| |ULTIMATE.start__destroy_in_nondeterministic_order_#in~head#1.offset|) (= |ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (= |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset|) |ULTIMATE.start_dll_circular_create_~head~0#1.base|) (<= |ULTIMATE.start_main_~len~0#1| 3) (= |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base|) |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|)) (= |ULTIMATE.start__destroy_in_nondeterministic_order_#in~head#1.base| |ULTIMATE.start_main_~head~1#1.base|) (<= 0 |#NULL.offset|) (<= |ULTIMATE.start_dll_circular_create_~len#1| 1) (<= 3 |ULTIMATE.start_main_~len~0#1|) (<= 0 |#StackHeapBarrier|) (or (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base|) (= (select |#valid| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1)) (<= 0 |ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (= |ULTIMATE.start_dll_circular_create_#res#1.base| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base|) (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 4)) |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base|) (= |#NULL.base| 0))' at error location [2022-11-03 04:09:46,384 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-03 04:09:46,384 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 04:09:46,384 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11, 11] total 30 [2022-11-03 04:09:46,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063037136] [2022-11-03 04:09:46,384 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 04:09:46,385 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-11-03 04:09:46,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:09:46,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-11-03 04:09:46,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=274, Invalid=2084, Unknown=2, NotChecked=190, Total=2550 [2022-11-03 04:09:46,387 INFO L87 Difference]: Start difference. First operand 78 states and 82 transitions. Second operand has 32 states, 31 states have (on average 1.8709677419354838) internal successors, (58), 31 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 04:09:47,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:09:47,256 INFO L93 Difference]: Finished difference Result 75 states and 79 transitions. [2022-11-03 04:09:47,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-03 04:09:47,257 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 1.8709677419354838) internal successors, (58), 31 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 26 [2022-11-03 04:09:47,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:09:47,257 INFO L225 Difference]: With dead ends: 75 [2022-11-03 04:09:47,257 INFO L226 Difference]: Without dead ends: 75 [2022-11-03 04:09:47,258 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 41 SyntacticMatches, 2 SemanticMatches, 58 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 971 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=427, Invalid=2885, Unknown=2, NotChecked=226, Total=3540 [2022-11-03 04:09:47,259 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 273 mSDsluCounter, 385 mSDsCounter, 0 mSdLazyCounter, 538 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 273 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 818 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 538 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 225 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-03 04:09:47,259 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [273 Valid, 415 Invalid, 818 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 538 Invalid, 0 Unknown, 225 Unchecked, 0.4s Time] [2022-11-03 04:09:47,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-11-03 04:09:47,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2022-11-03 04:09:47,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 69 states have (on average 1.144927536231884) internal successors, (79), 74 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 04:09:47,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 79 transitions. [2022-11-03 04:09:47,262 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 79 transitions. Word has length 26 [2022-11-03 04:09:47,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:09:47,262 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 79 transitions. [2022-11-03 04:09:47,262 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 1.8709677419354838) internal successors, (58), 31 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 04:09:47,262 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 79 transitions. [2022-11-03 04:09:47,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-03 04:09:47,263 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:09:47,263 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:09:47,299 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75cc489c-bbc7-4882-8b9a-1f5e065ba06a/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-03 04:09:47,478 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75cc489c-bbc7-4882-8b9a-1f5e065ba06a/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-11-03 04:09:47,479 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2022-11-03 04:09:47,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:09:47,479 INFO L85 PathProgramCache]: Analyzing trace with hash -318235809, now seen corresponding path program 1 times [2022-11-03 04:09:47,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:09:47,479 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952235587] [2022-11-03 04:09:47,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:09:47,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:09:47,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:09:47,925 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:09:47,925 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:09:47,926 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952235587] [2022-11-03 04:09:47,926 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [952235587] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 04:09:47,926 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [697552654] [2022-11-03 04:09:47,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:09:47,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:09:47,926 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75cc489c-bbc7-4882-8b9a-1f5e065ba06a/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 04:09:47,927 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75cc489c-bbc7-4882-8b9a-1f5e065ba06a/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 04:09:47,954 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75cc489c-bbc7-4882-8b9a-1f5e065ba06a/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-03 04:09:48,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:09:48,114 INFO L263 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 42 conjunts are in the unsatisfiable core [2022-11-03 04:09:48,119 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:09:48,121 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 04:09:48,151 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-03 04:09:48,151 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 04:09:48,199 INFO L356 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-03 04:09:48,199 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 04:09:48,218 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 04:09:48,251 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-03 04:09:48,251 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 22 [2022-11-03 04:09:48,281 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2022-11-03 04:09:48,302 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-11-03 04:09:48,302 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 27 [2022-11-03 04:09:48,368 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:09:48,368 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 16 [2022-11-03 04:09:48,460 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-03 04:09:48,461 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 04:09:48,507 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:09:48,507 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 04:09:48,662 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 04:09:49,091 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_dll_circular_create_~head~0#1.offset| Int)) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0)))) is different from false [2022-11-03 04:09:49,097 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_dll_circular_create_~head~0#1.offset| Int) (v_ArrVal_1277 (Array Int Int))) (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1277) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) is different from false [2022-11-03 04:09:49,113 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_dll_circular_create_~head~0#1.offset| Int) (v_ArrVal_1277 (Array Int Int)) (v_ArrVal_1276 (Array Int Int))) (not (= (select (store (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1276) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1277) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) is different from false [2022-11-03 04:09:49,120 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:09:49,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 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28 [2022-11-03 04:09:49,123 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 85 treesize of output 81 [2022-11-03 04:09:49,130 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:09:49,130 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 94 treesize of output 98 [2022-11-03 04:09:49,134 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 107 [2022-11-03 04:09:49,138 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 120 treesize of output 118 [2022-11-03 04:09:49,277 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-11-03 04:09:49,278 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [697552654] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 04:09:49,278 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [180208498] [2022-11-03 04:09:49,281 INFO L159 IcfgInterpreter]: Started Sifa with 22 locations of interest [2022-11-03 04:09:49,281 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 04:09:49,282 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 04:09:49,282 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 04:09:49,282 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 04:09:49,299 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 04:09:49,312 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 04:09:49,319 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 04:09:49,334 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:09:49,335 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-03 04:09:49,344 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:09:49,345 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-03 04:09:49,365 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:09:49,366 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 [2022-11-03 04:09:49,388 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:09:49,389 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:09:49,389 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 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 04:09:49,401 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:09:49,402 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:09:49,403 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 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 04:09:49,430 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:09:49,435 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:09:49,453 INFO L356 Elim1Store]: treesize reduction 48, result has 12.7 percent of original size [2022-11-03 04:09:49,454 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 78 treesize of output 61 [2022-11-03 04:09:49,469 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:09:49,470 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:09:49,472 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:09:49,473 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:09:49,474 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-03 04:09:49,501 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:09:49,502 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:09:49,504 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:09:49,504 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 36 [2022-11-03 04:09:49,550 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:09:49,551 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:09:49,551 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:09:49,599 INFO L356 Elim1Store]: treesize reduction 136, result has 11.7 percent of original size [2022-11-03 04:09:49,600 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 4 new quantified variables, introduced 9 case distinctions, treesize of input 328 treesize of output 322 [2022-11-03 04:09:49,612 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:09:49,613 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:09:49,614 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:09:49,661 INFO L356 Elim1Store]: treesize reduction 94, result has 19.0 percent of original size [2022-11-03 04:09:49,662 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 9 case distinctions, treesize of input 324 treesize of output 319 [2022-11-03 04:09:49,744 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:09:49,746 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:09:49,747 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:09:49,748 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:09:49,749 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:09:49,749 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:09:49,779 INFO L356 Elim1Store]: treesize reduction 39, result has 25.0 percent of original size [2022-11-03 04:09:49,779 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 453 treesize of output 382 [2022-11-03 04:09:49,797 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:09:49,798 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:09:49,895 INFO L356 Elim1Store]: treesize reduction 236, result has 13.9 percent of original size [2022-11-03 04:09:49,896 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 14 case distinctions, treesize of input 438 treesize of output 395 [2022-11-03 04:09:49,976 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:09:49,977 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:09:49,998 INFO L356 Elim1Store]: treesize reduction 47, result has 9.6 percent of original size [2022-11-03 04:09:49,999 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 392 treesize of output 386 [2022-11-03 04:09:50,090 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:09:50,091 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:09:50,092 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:09:50,137 INFO L356 Elim1Store]: treesize reduction 94, result has 19.0 percent of original size [2022-11-03 04:09:50,137 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 9 case distinctions, treesize of input 328 treesize of output 319 [2022-11-03 04:09:50,151 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:09:50,152 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:09:50,152 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:09:50,204 INFO L356 Elim1Store]: treesize reduction 126, result has 18.2 percent of original size [2022-11-03 04:09:50,204 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 4 new quantified variables, introduced 9 case distinctions, treesize of input 328 treesize of output 332 [2022-11-03 04:09:50,282 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:09:50,282 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:09:50,378 INFO L356 Elim1Store]: treesize reduction 236, result has 13.9 percent of original size [2022-11-03 04:09:50,379 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 15 case distinctions, treesize of input 466 treesize of output 415 [2022-11-03 04:09:50,395 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:09:50,396 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:09:50,397 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:09:50,398 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:09:50,399 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:09:50,400 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:09:50,447 INFO L356 Elim1Store]: treesize reduction 122, result has 10.9 percent of original size [2022-11-03 04:09:50,447 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 12 case distinctions, treesize of input 445 treesize of output 384 [2022-11-03 04:09:50,519 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 04:09:50,525 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 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 04:09:50,546 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:09:50,547 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 04:09:50,564 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:09:50,564 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-03 04:09:50,661 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:09:50,719 INFO L356 Elim1Store]: treesize reduction 28, result has 55.6 percent of original size [2022-11-03 04:09:50,720 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 8 case distinctions, treesize of input 31 treesize of output 53 [2022-11-03 04:09:50,835 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:09:50,836 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:09:50,859 INFO L356 Elim1Store]: treesize reduction 47, result has 9.6 percent of original size [2022-11-03 04:09:50,859 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 400 treesize of output 394 [2022-11-03 04:09:50,924 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 04:09:56,897 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '7894#(and (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4)) |ULTIMATE.start_dll_circular_create_~last~0#1.offset|) (= (select |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base|) 0) (<= 1 |ULTIMATE.start_dll_circular_create_~len#1|) (= |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base|) (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 4))) (= |ULTIMATE.start_dll_circular_create_#res#1.offset| |ULTIMATE.start_main_~head~1#1.offset|) (= |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.offset| 0) (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base|) |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|) |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base|) (= |ULTIMATE.start_dll_circular_create_#res#1.offset| |ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (= |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 0) (<= |#NULL.offset| 0) (= |ULTIMATE.start__destroy_in_nondeterministic_order_#in~head#1.base| |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4)) |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (<= 3 |ULTIMATE.start_dll_circular_create_#in~len#1|) (<= (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 8) (select |#length| |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base|)) (<= (+ |ULTIMATE.start_dll_circular_create_~last~0#1.offset| 4) (select |#length| |ULTIMATE.start_dll_circular_create_~last~0#1.base|)) (= |ULTIMATE.start_dll_circular_create_#res#1.base| |ULTIMATE.start_main_~head~1#1.base|) (= |ULTIMATE.start_main_~head~1#1.offset| |ULTIMATE.start__destroy_in_nondeterministic_order_#in~head#1.offset|) (< |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base| |#StackHeapBarrier|) (<= |ULTIMATE.start_dll_circular_create_#in~len#1| 3) (= |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| |ULTIMATE.start__destroy_in_nondeterministic_order_#in~head#1.offset|) (or (= (select |#valid| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1) (= |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|)) (= |ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset|) |ULTIMATE.start_dll_circular_create_~head~0#1.base|) (<= |ULTIMATE.start_main_~len~0#1| 3) (= |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base|) |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|)) (= |ULTIMATE.start__destroy_in_nondeterministic_order_#in~head#1.base| |ULTIMATE.start_main_~head~1#1.base|) (<= 0 |#NULL.offset|) (not (= |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base| 0)) (<= |ULTIMATE.start_dll_circular_create_~len#1| 1) (<= 3 |ULTIMATE.start_main_~len~0#1|) (<= 0 |#StackHeapBarrier|) (= |ULTIMATE.start_dll_circular_create_#res#1.base| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base|) (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 4)) |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base|) (= |#NULL.base| 0))' at error location [2022-11-03 04:09:56,898 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-03 04:09:56,898 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 04:09:56,898 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 12] total 27 [2022-11-03 04:09:56,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021819925] [2022-11-03 04:09:56,898 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 04:09:56,898 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-11-03 04:09:56,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:09:56,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-11-03 04:09:56,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=249, Invalid=1652, Unknown=3, NotChecked=258, Total=2162 [2022-11-03 04:09:56,899 INFO L87 Difference]: Start difference. First operand 75 states and 79 transitions. Second operand has 28 states, 27 states have (on average 2.5925925925925926) internal successors, (70), 28 states have internal predecessors, (70), 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 04:09:57,554 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (and (not (= (select .cse0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (forall ((|ULTIMATE.start_dll_circular_create_~head~0#1.offset| Int) (v_ArrVal_1277 (Array Int Int))) (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1277) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (not (= (select .cse0 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1))) is different from false [2022-11-03 04:09:58,122 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (and (not (= (select .cse0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (forall ((|ULTIMATE.start_dll_circular_create_~head~0#1.offset| Int) (v_ArrVal_1277 (Array Int Int))) (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1277) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (not (= (select .cse0 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1))) is different from false [2022-11-03 04:09:58,529 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (and (not (= (select .cse0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (not (= (select .cse0 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (forall ((|ULTIMATE.start_dll_circular_create_~head~0#1.offset| Int)) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (store .cse0 (+ |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0)))))) is different from false [2022-11-03 04:09:58,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:09:58,819 INFO L93 Difference]: Finished difference Result 74 states and 78 transitions. [2022-11-03 04:09:58,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-03 04:09:58,820 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 2.5925925925925926) internal successors, (70), 28 states have internal predecessors, (70), 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 26 [2022-11-03 04:09:58,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:09:58,820 INFO L225 Difference]: With dead ends: 74 [2022-11-03 04:09:58,820 INFO L226 Difference]: Without dead ends: 74 [2022-11-03 04:09:58,821 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 42 SyntacticMatches, 2 SemanticMatches, 55 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 736 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=331, Invalid=2237, Unknown=6, NotChecked=618, Total=3192 [2022-11-03 04:09:58,822 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 125 mSDsluCounter, 472 mSDsCounter, 0 mSdLazyCounter, 484 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 514 SdHoareTripleChecker+Invalid, 790 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 484 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 288 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-03 04:09:58,822 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 514 Invalid, 790 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 484 Invalid, 0 Unknown, 288 Unchecked, 0.3s Time] [2022-11-03 04:09:58,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2022-11-03 04:09:58,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2022-11-03 04:09:58,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 69 states have (on average 1.1304347826086956) internal successors, (78), 73 states have internal predecessors, (78), 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 04:09:58,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 78 transitions. [2022-11-03 04:09:58,825 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 78 transitions. Word has length 26 [2022-11-03 04:09:58,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:09:58,825 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 78 transitions. [2022-11-03 04:09:58,825 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 2.5925925925925926) internal successors, (70), 28 states have internal predecessors, (70), 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 04:09:58,825 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 78 transitions. [2022-11-03 04:09:58,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-03 04:09:58,826 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:09:58,826 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:09:58,862 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75cc489c-bbc7-4882-8b9a-1f5e065ba06a/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-03 04:09:59,030 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75cc489c-bbc7-4882-8b9a-1f5e065ba06a/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:09:59,030 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2022-11-03 04:09:59,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:09:59,031 INFO L85 PathProgramCache]: Analyzing trace with hash -286879734, now seen corresponding path program 1 times [2022-11-03 04:09:59,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:09:59,031 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246839063] [2022-11-03 04:09:59,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:09:59,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:09:59,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:09:59,736 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:09:59,736 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:09:59,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246839063] [2022-11-03 04:09:59,736 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1246839063] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 04:09:59,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [965498338] [2022-11-03 04:09:59,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:09:59,737 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:09:59,737 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75cc489c-bbc7-4882-8b9a-1f5e065ba06a/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 04:09:59,738 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75cc489c-bbc7-4882-8b9a-1f5e065ba06a/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 04:09:59,739 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75cc489c-bbc7-4882-8b9a-1f5e065ba06a/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-03 04:09:59,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:09:59,884 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 51 conjunts are in the unsatisfiable core [2022-11-03 04:09:59,887 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:09:59,892 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 04:09:59,931 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-03 04:09:59,931 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 04:09:59,998 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-11-03 04:09:59,998 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-11-03 04:10:00,032 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 04:10:00,085 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-03 04:10:00,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, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2022-11-03 04:10:00,134 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 32 treesize of output 30 [2022-11-03 04:10:00,175 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 37 treesize of output 28 [2022-11-03 04:10:00,258 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:10:00,272 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:10:00,272 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 63 treesize of output 53 [2022-11-03 04:10:00,706 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2022-11-03 04:10:00,766 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 0 case distinctions, treesize of input 17 treesize of output 17 [2022-11-03 04:10:00,774 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:10:00,774 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 04:10:02,207 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ 4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (and (forall ((|ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| Int)) (or (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select .cse0 |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|))) (not (<= 0 |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|)) (not (<= |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 0)))) (forall ((|ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| Int)) (or (not (= (select .cse0 (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 4)) (select .cse0 |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|))) (not (<= 0 |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|)) (not (<= |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 0)))) (forall ((|ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| Int)) (or (= (select |c_#valid| (select .cse0 |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|)) 1) (not (<= 0 |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|)) (not (<= |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 0)))))) is different from false [2022-11-03 04:10:04,163 INFO L356 Elim1Store]: treesize reduction 8, result has 85.5 percent of original size [2022-11-03 04:10:04,163 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 116 treesize of output 141 [2022-11-03 04:10:04,286 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4))) (and (or (forall ((v_prenex_12 Int) (v_prenex_10 (Array Int Int)) (v_prenex_11 (Array Int Int))) (or (not (let ((.cse0 (store (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_11) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_10) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (= (select .cse0 v_prenex_12) (select .cse0 (+ v_prenex_12 4))))) (not (<= v_prenex_12 0)) (not (<= 0 v_prenex_12)))) (forall ((v_prenex_8 (Array Int Int)) (v_prenex_7 (Array Int Int)) (v_prenex_9 Int)) (let ((.cse2 (select (store (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_8) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_7) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) v_prenex_9))) (or (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse2) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse2))))) (forall ((v_ArrVal_1367 (Array Int Int)) (v_ArrVal_1366 (Array Int Int)) (|ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| Int)) (or (not (<= 0 |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|)) (not (<= |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 0)) (not (= (select (store (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1366) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1367) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))) (forall ((v_prenex_8 (Array Int Int)) (v_prenex_7 (Array Int Int)) (v_prenex_9 Int)) (let ((.cse3 (select (store (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_8) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_7) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) v_prenex_9))) (or (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse3) (not (<= v_prenex_9 0)) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse3) (not (<= 0 v_prenex_9))))) (forall ((v_prenex_10 (Array Int Int)) (v_prenex_12 Int) (v_prenex_11 (Array Int Int))) (or (not (let ((.cse4 (store (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_11) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_10) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (= (select .cse4 v_prenex_12) (select .cse4 (+ v_prenex_12 4))))) (not (<= v_prenex_12 0)) (not (<= 0 v_prenex_12)))))) is different from false [2022-11-03 04:10:04,312 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:10:04,313 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 27 treesize of output 28 [2022-11-03 04:10:04,317 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 171 treesize of output 165 [2022-11-03 04:10:04,323 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 184 treesize of output 180 [2022-11-03 04:10:04,330 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 232 treesize of output 224 [2022-11-03 04:10:04,340 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:10:04,340 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 257 treesize of output 259 [2022-11-03 04:10:04,428 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:10:04,429 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 105 treesize of output 81 [2022-11-03 04:10:04,433 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:10:04,435 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 125 treesize of output 115 [2022-11-03 04:10:04,445 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:10:04,478 INFO L356 Elim1Store]: treesize reduction 8, result has 77.1 percent of original size [2022-11-03 04:10:04,479 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 144 treesize of output 152 [2022-11-03 04:10:04,495 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 103 treesize of output 91 [2022-11-03 04:10:04,508 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 49 treesize of output 45 [2022-11-03 04:10:04,684 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-03 04:10:04,684 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 1 [2022-11-03 04:10:04,691 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-03 04:10:04,691 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 1 [2022-11-03 04:10:04,898 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-11-03 04:10:04,899 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [965498338] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 04:10:04,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1627980804] [2022-11-03 04:10:04,900 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2022-11-03 04:10:04,901 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 04:10:04,901 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 04:10:04,901 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 04:10:04,901 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 04:10:04,920 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 04:10:04,933 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 04:10:04,940 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 04:10:04,952 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:10:04,955 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-03 04:10:04,964 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:10:04,964 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-03 04:10:04,983 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:10:04,983 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 [2022-11-03 04:10:05,009 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:10:05,010 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:10:05,011 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 28 treesize of output 30 [2022-11-03 04:10:05,021 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:10:05,022 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:10:05,023 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 28 treesize of output 30 [2022-11-03 04:10:05,043 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:10:05,044 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:10:05,045 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:10:05,050 INFO L356 Elim1Store]: treesize reduction 27, result has 3.6 percent of original size [2022-11-03 04:10:05,051 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 98 treesize of output 73 [2022-11-03 04:10:05,061 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:10:05,062 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:10:05,075 INFO L356 Elim1Store]: treesize reduction 48, result has 12.7 percent of original size [2022-11-03 04:10:05,075 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 90 treesize of output 69 [2022-11-03 04:10:05,102 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:10:05,104 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:10:05,105 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:10:05,105 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 31 [2022-11-03 04:10:05,164 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:10:05,165 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:10:05,166 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:10:05,199 INFO L356 Elim1Store]: treesize reduction 48, result has 23.8 percent of original size [2022-11-03 04:10:05,199 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 8 case distinctions, treesize of input 331 treesize of output 318 [2022-11-03 04:10:05,218 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:10:05,219 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:10:05,220 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:10:05,252 INFO L356 Elim1Store]: treesize reduction 52, result has 22.4 percent of original size [2022-11-03 04:10:05,253 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 4 new quantified variables, introduced 8 case distinctions, treesize of input 331 treesize of output 335 [2022-11-03 04:10:05,324 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:10:05,324 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:10:05,325 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:10:05,327 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:10:05,327 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:10:05,328 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:10:05,375 INFO L356 Elim1Store]: treesize reduction 70, result has 19.5 percent of original size [2022-11-03 04:10:05,376 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 12 case distinctions, treesize of input 468 treesize of output 375 [2022-11-03 04:10:05,392 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:10:05,393 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:10:05,394 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:10:05,394 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:10:05,482 INFO L356 Elim1Store]: treesize reduction 246, result has 13.4 percent of original size [2022-11-03 04:10:05,483 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 445 treesize of output 413 [2022-11-03 04:10:05,560 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:10:05,563 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:10:05,599 INFO L356 Elim1Store]: treesize reduction 148, result has 4.5 percent of original size [2022-11-03 04:10:05,600 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 8 case distinctions, treesize of input 448 treesize of output 425 [2022-11-03 04:10:05,708 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:10:05,709 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:10:05,709 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:10:05,739 INFO L356 Elim1Store]: treesize reduction 48, result has 23.8 percent of original size [2022-11-03 04:10:05,740 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 8 case distinctions, treesize of input 331 treesize of output 318 [2022-11-03 04:10:05,759 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:10:05,760 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:10:05,761 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:10:05,792 INFO L356 Elim1Store]: treesize reduction 52, result has 22.4 percent of original size [2022-11-03 04:10:05,792 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 4 new quantified variables, introduced 8 case distinctions, treesize of input 331 treesize of output 335 [2022-11-03 04:10:05,854 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:10:05,855 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:10:05,856 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:10:05,858 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:10:05,859 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:10:05,859 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:10:05,908 INFO L356 Elim1Store]: treesize reduction 70, result has 19.5 percent of original size [2022-11-03 04:10:05,909 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 12 case distinctions, treesize of input 468 treesize of output 375 [2022-11-03 04:10:05,929 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:10:05,930 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:10:06,006 INFO L356 Elim1Store]: treesize reduction 238, result has 16.2 percent of original size [2022-11-03 04:10:06,007 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 14 case distinctions, treesize of input 445 treesize of output 421 [2022-11-03 04:10:06,117 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 04:10:06,126 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 04:10:06,145 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:10:06,146 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 04:10:06,162 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:10:06,163 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 04:10:06,267 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:10:06,282 INFO L356 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-11-03 04:10:06,282 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 22 treesize of output 21 [2022-11-03 04:10:06,353 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:10:06,374 INFO L356 Elim1Store]: treesize reduction 14, result has 50.0 percent of original size [2022-11-03 04:10:06,374 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 36 [2022-11-03 04:10:06,479 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:10:06,482 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:10:06,528 INFO L356 Elim1Store]: treesize reduction 146, result has 5.8 percent of original size [2022-11-03 04:10:06,529 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 8 case distinctions, treesize of input 782 treesize of output 727 [2022-11-03 04:10:06,621 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 04:10:13,531 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '8284#(and (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset|)) (< |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base| |#StackHeapBarrier|) (<= 1 |ULTIMATE.start_dll_circular_create_~len#1|) (= |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base|) (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 4))) (= |ULTIMATE.start_dll_circular_create_#res#1.offset| |ULTIMATE.start_main_~head~1#1.offset|) (= |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.offset| 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base|) |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|) |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base|) (= |ULTIMATE.start_dll_circular_create_#res#1.offset| |ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (< |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base| |#StackHeapBarrier|) (= |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 0) (<= |#NULL.offset| 0) (= |ULTIMATE.start__destroy_in_nondeterministic_order_#in~head#1.base| |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4)) |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (<= 3 |ULTIMATE.start_dll_circular_create_#in~len#1|) (= |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.offset| 0) (<= (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 8) (select |#length| |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base|)) (<= (+ |ULTIMATE.start_dll_circular_create_~last~0#1.offset| 4) (select |#length| |ULTIMATE.start_dll_circular_create_~last~0#1.base|)) (= |ULTIMATE.start_dll_circular_create_#res#1.base| |ULTIMATE.start_main_~head~1#1.base|) (= |ULTIMATE.start_main_~head~1#1.offset| |ULTIMATE.start__destroy_in_nondeterministic_order_#in~head#1.offset|) (< |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base| |#StackHeapBarrier|) (<= |ULTIMATE.start_dll_circular_create_#in~len#1| 3) (= |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| |ULTIMATE.start__destroy_in_nondeterministic_order_#in~head#1.offset|) (= |ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) (not (= |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base| 0)) (not (= (select |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base|) 1)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset|) |ULTIMATE.start_dll_circular_create_~head~0#1.base|) (<= |ULTIMATE.start_main_~len~0#1| 3) (= |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base|) |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|)) (= |ULTIMATE.start__destroy_in_nondeterministic_order_#in~head#1.base| |ULTIMATE.start_main_~head~1#1.base|) (= 0 (select |#valid| |ULTIMATE.start_dll_circular_create_~last~0#1.base|)) (<= 0 |#NULL.offset|) (<= |ULTIMATE.start_dll_circular_create_~len#1| 1) (<= 3 |ULTIMATE.start_main_~len~0#1|) (<= 0 |#StackHeapBarrier|) (= |ULTIMATE.start_dll_circular_create_#res#1.base| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base|) (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 4)) |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base|) (= |#NULL.base| 0) (not (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|)))' at error location [2022-11-03 04:10:13,531 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-03 04:10:13,531 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 04:10:13,531 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13, 13] total 37 [2022-11-03 04:10:13,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498444296] [2022-11-03 04:10:13,532 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 04:10:13,532 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-11-03 04:10:13,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:10:13,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-11-03 04:10:13,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=293, Invalid=2905, Unknown=2, NotChecked=222, Total=3422 [2022-11-03 04:10:13,534 INFO L87 Difference]: Start difference. First operand 74 states and 78 transitions. Second operand has 39 states, 38 states have (on average 1.868421052631579) internal successors, (71), 38 states have internal predecessors, (71), 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 04:10:15,732 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4))) (and (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (or (forall ((v_prenex_12 Int) (v_prenex_10 (Array Int Int)) (v_prenex_11 (Array Int Int))) (or (not (let ((.cse0 (store (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_11) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_10) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (= (select .cse0 v_prenex_12) (select .cse0 (+ v_prenex_12 4))))) (not (<= v_prenex_12 0)) (not (<= 0 v_prenex_12)))) (forall ((v_prenex_8 (Array Int Int)) (v_prenex_7 (Array Int Int)) (v_prenex_9 Int)) (let ((.cse2 (select (store (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_8) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_7) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) v_prenex_9))) (or (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse2) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse2))))) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (forall ((v_ArrVal_1367 (Array Int Int)) (v_ArrVal_1366 (Array Int Int)) (|ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| Int)) (or (not (<= 0 |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|)) (not (<= |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 0)) (not (= (select (store (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1366) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1367) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))) (forall ((v_prenex_8 (Array Int Int)) (v_prenex_7 (Array Int Int)) (v_prenex_9 Int)) (let ((.cse3 (select (store (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_8) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_7) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) v_prenex_9))) (or (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse3) (not (<= v_prenex_9 0)) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse3) (not (<= 0 v_prenex_9))))) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1) (forall ((v_prenex_10 (Array Int Int)) (v_prenex_12 Int) (v_prenex_11 (Array Int Int))) (or (not (let ((.cse4 (store (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_11) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_10) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (= (select .cse4 v_prenex_12) (select .cse4 (+ v_prenex_12 4))))) (not (<= v_prenex_12 0)) (not (<= 0 v_prenex_12)))) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))) is different from false [2022-11-03 04:10:16,937 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (let ((.cse1 (store .cse2 (+ 4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)) (.cse0 (select .cse2 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (and (not (= .cse0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (forall ((|ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| Int)) (or (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select .cse1 |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|))) (not (<= 0 |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|)) (not (<= |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 0)))) (= (select |c_#valid| .cse0) 1) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (forall ((|ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| Int)) (or (not (= (select .cse1 (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 4)) (select .cse1 |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|))) (not (<= 0 |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|)) (not (<= |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 0)))) (forall ((|ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| Int)) (or (= (select |c_#valid| (select .cse1 |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|)) 1) (not (<= 0 |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|)) (not (<= |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 0)))) (not (= .cse0 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1)))) is different from false [2022-11-03 04:10:17,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:10:17,385 INFO L93 Difference]: Finished difference Result 72 states and 76 transitions. [2022-11-03 04:10:17,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-03 04:10:17,385 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 38 states have (on average 1.868421052631579) internal successors, (71), 38 states have internal predecessors, (71), 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 04:10:17,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:10:17,386 INFO L225 Difference]: With dead ends: 72 [2022-11-03 04:10:17,386 INFO L226 Difference]: Without dead ends: 72 [2022-11-03 04:10:17,387 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 37 SyntacticMatches, 6 SemanticMatches, 68 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 1670 ImplicationChecksByTransitivity, 14.4s TimeCoverageRelationStatistics Valid=403, Invalid=3899, Unknown=4, NotChecked=524, Total=4830 [2022-11-03 04:10:17,387 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 166 mSDsluCounter, 425 mSDsCounter, 0 mSdLazyCounter, 445 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 450 SdHoareTripleChecker+Invalid, 788 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 445 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 313 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-03 04:10:17,387 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 450 Invalid, 788 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 445 Invalid, 0 Unknown, 313 Unchecked, 0.3s Time] [2022-11-03 04:10:17,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-11-03 04:10:17,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2022-11-03 04:10:17,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 69 states have (on average 1.1014492753623188) internal successors, (76), 71 states have internal predecessors, (76), 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 04:10:17,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 76 transitions. [2022-11-03 04:10:17,389 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 76 transitions. Word has length 28 [2022-11-03 04:10:17,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:10:17,390 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 76 transitions. [2022-11-03 04:10:17,390 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 38 states have (on average 1.868421052631579) internal successors, (71), 38 states have internal predecessors, (71), 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 04:10:17,390 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 76 transitions. [2022-11-03 04:10:17,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-03 04:10:17,390 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:10:17,390 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:10:17,414 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75cc489c-bbc7-4882-8b9a-1f5e065ba06a/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-11-03 04:10:17,594 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75cc489c-bbc7-4882-8b9a-1f5e065ba06a/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-11-03 04:10:17,595 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2022-11-03 04:10:17,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:10:17,595 INFO L85 PathProgramCache]: Analyzing trace with hash -2024849166, now seen corresponding path program 1 times [2022-11-03 04:10:17,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:10:17,595 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961402599] [2022-11-03 04:10:17,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:10:17,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:10:17,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:10:18,317 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:10:18,318 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:10:18,318 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961402599] [2022-11-03 04:10:18,318 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [961402599] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 04:10:18,318 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [53410343] [2022-11-03 04:10:18,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:10:18,318 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:10:18,318 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75cc489c-bbc7-4882-8b9a-1f5e065ba06a/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 04:10:18,319 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75cc489c-bbc7-4882-8b9a-1f5e065ba06a/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 04:10:18,338 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75cc489c-bbc7-4882-8b9a-1f5e065ba06a/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-11-03 04:10:18,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:10:18,489 INFO L263 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 45 conjunts are in the unsatisfiable core [2022-11-03 04:10:18,492 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:10:18,494 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 04:10:18,526 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-03 04:10:18,526 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 04:10:18,598 INFO L356 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-03 04:10:18,599 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 04:10:18,660 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 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 04:10:18,703 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-03 04:10:18,704 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 22 [2022-11-03 04:10:18,743 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 04:10:18,754 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 20 treesize of output 19 [2022-11-03 04:10:18,814 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:10:18,830 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:10:18,831 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 39 [2022-11-03 04:10:19,049 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-03 04:10:19,049 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 04:10:19,237 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-03 04:10:19,237 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 36 treesize of output 42 [2022-11-03 04:10:19,306 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:10:19,306 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 04:10:19,489 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 176 treesize of output 170 [2022-11-03 04:10:19,611 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (and (forall ((v_ArrVal_1457 (Array Int Int))) (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1457) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse0 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (forall ((v_ArrVal_1457 (Array Int Int))) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1457) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse0 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4)))))) is different from false [2022-11-03 04:10:19,628 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4))) (and (forall ((v_ArrVal_1457 (Array Int Int)) (v_ArrVal_1456 (Array Int Int))) (not (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (select (store (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1456) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1457) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4)))) (forall ((v_ArrVal_1457 (Array Int Int)) (v_ArrVal_1456 (Array Int Int))) (not (= (select (store (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1456) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1457) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))))) is different from false [2022-11-03 04:10:19,635 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:10:19,635 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 27 treesize of output 28 [2022-11-03 04:10:19,638 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 171 treesize of output 165 [2022-11-03 04:10:19,650 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 184 treesize of output 180 [2022-11-03 04:10:19,657 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 232 treesize of output 224 [2022-11-03 04:10:19,668 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:10:19,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, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 257 treesize of output 259 [2022-11-03 04:10:19,713 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:10:19,713 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 27 treesize of output 28 [2022-11-03 04:10:19,716 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:10:19,718 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2022-11-03 04:10:19,723 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 39 [2022-11-03 04:10:19,728 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:10:19,728 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 55 treesize of output 51 [2022-11-03 04:10:19,856 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-11-03 04:10:19,857 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [53410343] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 04:10:19,857 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [457424768] [2022-11-03 04:10:19,859 INFO L159 IcfgInterpreter]: Started Sifa with 25 locations of interest [2022-11-03 04:10:19,859 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 04:10:19,859 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 04:10:19,860 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 04:10:19,860 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 04:10:19,878 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 04:10:19,890 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 04:10:19,899 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 04:10:19,915 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:10:19,916 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-03 04:10:19,927 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:10:19,928 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-03 04:10:19,946 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:10:19,947 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 [2022-11-03 04:10:19,968 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:10:19,969 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:10:19,970 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 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 04:10:19,980 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:10:19,981 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:10:19,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 28 treesize of output 30 [2022-11-03 04:10:20,004 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:10:20,005 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:10:20,006 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:10:20,011 INFO L356 Elim1Store]: treesize reduction 27, result has 3.6 percent of original size [2022-11-03 04:10:20,011 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 98 treesize of output 73 [2022-11-03 04:10:20,024 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:10:20,025 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:10:20,039 INFO L356 Elim1Store]: treesize reduction 48, result has 12.7 percent of original size [2022-11-03 04:10:20,039 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 90 treesize of output 69 [2022-11-03 04:10:20,069 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:10:20,071 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:10:20,072 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:10:20,073 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 40 [2022-11-03 04:10:20,125 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:10:20,126 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:10:20,127 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:10:20,183 INFO L356 Elim1Store]: treesize reduction 126, result has 17.1 percent of original size [2022-11-03 04:10:20,184 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 9 case distinctions, treesize of input 345 treesize of output 336 [2022-11-03 04:10:20,197 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:10:20,199 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:10:20,199 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:10:20,273 INFO L356 Elim1Store]: treesize reduction 134, result has 17.3 percent of original size [2022-11-03 04:10:20,273 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 9 case distinctions, treesize of input 345 treesize of output 332 [2022-11-03 04:10:20,343 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:10:20,344 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:10:20,346 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:10:20,347 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:10:20,347 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:10:20,414 INFO L356 Elim1Store]: treesize reduction 134, result has 10.1 percent of original size [2022-11-03 04:10:20,414 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 8 new quantified variables, introduced 12 case distinctions, treesize of input 546 treesize of output 420 [2022-11-03 04:10:20,432 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:10:20,535 INFO L356 Elim1Store]: treesize reduction 272, result has 11.7 percent of original size [2022-11-03 04:10:20,536 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 9 new quantified variables, introduced 15 case distinctions, treesize of input 560 treesize of output 461 [2022-11-03 04:10:20,664 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:10:20,667 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:10:20,721 INFO L356 Elim1Store]: treesize reduction 162, result has 11.5 percent of original size [2022-11-03 04:10:20,722 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 8 case distinctions, treesize of input 1005 treesize of output 950 [2022-11-03 04:10:20,894 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:10:20,895 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:10:20,896 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:10:20,976 INFO L356 Elim1Store]: treesize reduction 134, result has 11.8 percent of original size [2022-11-03 04:10:20,976 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 9 case distinctions, treesize of input 345 treesize of output 328 [2022-11-03 04:10:20,990 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:10:20,992 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:10:20,993 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:10:21,059 INFO L356 Elim1Store]: treesize reduction 134, result has 17.3 percent of original size [2022-11-03 04:10:21,060 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 9 case distinctions, treesize of input 337 treesize of output 328 [2022-11-03 04:10:21,144 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:10:21,145 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:10:21,147 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:10:21,148 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:10:21,148 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:10:21,201 INFO L356 Elim1Store]: treesize reduction 132, result has 11.4 percent of original size [2022-11-03 04:10:21,201 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 8 new quantified variables, introduced 12 case distinctions, treesize of input 522 treesize of output 414 [2022-11-03 04:10:21,219 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:10:21,292 INFO L356 Elim1Store]: treesize reduction 180, result has 16.3 percent of original size [2022-11-03 04:10:21,293 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 6 new quantified variables, introduced 9 case distinctions, treesize of input 483 treesize of output 411 [2022-11-03 04:10:21,410 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 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 04:10:21,416 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 04:10:21,443 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:10:21,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 21 treesize of output 20 [2022-11-03 04:10:21,456 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:10:21,456 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 04:10:21,536 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:10:21,538 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:10:21,555 INFO L356 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-11-03 04:10:21,555 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 31 treesize of output 28 [2022-11-03 04:10:21,684 INFO L356 Elim1Store]: treesize reduction 32, result has 49.2 percent of original size [2022-11-03 04:10:21,685 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 30 treesize of output 53 [2022-11-03 04:10:21,843 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:10:21,847 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:10:21,898 INFO L356 Elim1Store]: treesize reduction 174, result has 4.9 percent of original size [2022-11-03 04:10:21,898 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 8 case distinctions, treesize of input 842 treesize of output 775 [2022-11-03 04:10:21,987 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 04:10:29,917 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '8676#(and (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset|)) (= (select |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base|) 0) (<= 1 |ULTIMATE.start_dll_circular_create_~len#1|) (= |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base|) (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 4))) (= |ULTIMATE.start_dll_circular_create_#res#1.offset| |ULTIMATE.start_main_~head~1#1.offset|) (= |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.offset| 0) (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base|) |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|) |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base|) (= |ULTIMATE.start_dll_circular_create_#res#1.offset| |ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (< |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base| |#StackHeapBarrier|) (= |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 0) (<= |#NULL.offset| 0) (= |ULTIMATE.start__destroy_in_nondeterministic_order_#in~head#1.base| |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4)) |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (<= 3 |ULTIMATE.start_dll_circular_create_#in~len#1|) (= |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.offset| 0) (<= (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 8) (select |#length| |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base|)) (<= (+ |ULTIMATE.start_dll_circular_create_~last~0#1.offset| 4) (select |#length| |ULTIMATE.start_dll_circular_create_~last~0#1.base|)) (= |ULTIMATE.start_dll_circular_create_#res#1.base| |ULTIMATE.start_main_~head~1#1.base|) (= |ULTIMATE.start_main_~head~1#1.offset| |ULTIMATE.start__destroy_in_nondeterministic_order_#in~head#1.offset|) (< |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base| |#StackHeapBarrier|) (<= |ULTIMATE.start_dll_circular_create_#in~len#1| 3) (= |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| |ULTIMATE.start__destroy_in_nondeterministic_order_#in~head#1.offset|) (= |ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset|) |ULTIMATE.start_dll_circular_create_~head~0#1.base|) (<= |ULTIMATE.start_main_~len~0#1| 3) (= |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base|) |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|)) (= |ULTIMATE.start__destroy_in_nondeterministic_order_#in~head#1.base| |ULTIMATE.start_main_~head~1#1.base|) (= 0 (select |#valid| |ULTIMATE.start_dll_circular_create_~last~0#1.base|)) (<= 0 |#NULL.offset|) (not (= |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base| 0)) (<= |ULTIMATE.start_dll_circular_create_~len#1| 1) (<= 3 |ULTIMATE.start_main_~len~0#1|) (<= 0 |#StackHeapBarrier|) (not (= |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|)) (= |ULTIMATE.start_dll_circular_create_#res#1.base| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base|) (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 4)) |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base|) (= |#NULL.base| 0))' at error location [2022-11-03 04:10:29,917 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-03 04:10:29,917 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 04:10:29,917 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 13] total 34 [2022-11-03 04:10:29,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65500530] [2022-11-03 04:10:29,918 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 04:10:29,918 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-11-03 04:10:29,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:10:29,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-11-03 04:10:29,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=347, Invalid=2629, Unknown=2, NotChecked=214, Total=3192 [2022-11-03 04:10:29,920 INFO L87 Difference]: Start difference. First operand 72 states and 76 transitions. Second operand has 36 states, 35 states have (on average 2.342857142857143) internal successors, (82), 35 states have internal predecessors, (82), 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 04:10:30,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:10:30,928 INFO L93 Difference]: Finished difference Result 70 states and 74 transitions. [2022-11-03 04:10:30,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-03 04:10:30,929 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 2.342857142857143) internal successors, (82), 35 states have internal predecessors, (82), 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 04:10:30,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:10:30,929 INFO L225 Difference]: With dead ends: 70 [2022-11-03 04:10:30,929 INFO L226 Difference]: Without dead ends: 70 [2022-11-03 04:10:30,932 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 45 SyntacticMatches, 3 SemanticMatches, 69 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1697 ImplicationChecksByTransitivity, 9.4s TimeCoverageRelationStatistics Valid=596, Invalid=4102, Unknown=2, NotChecked=270, Total=4970 [2022-11-03 04:10:30,932 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 353 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 332 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 353 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 648 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 332 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 240 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-03 04:10:30,932 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [353 Valid, 283 Invalid, 648 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 332 Invalid, 0 Unknown, 240 Unchecked, 0.3s Time] [2022-11-03 04:10:30,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-11-03 04:10:30,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2022-11-03 04:10:30,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 69 states have (on average 1.0724637681159421) internal successors, (74), 69 states have internal predecessors, (74), 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 04:10:30,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 74 transitions. [2022-11-03 04:10:30,935 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 74 transitions. Word has length 29 [2022-11-03 04:10:30,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:10:30,936 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 74 transitions. [2022-11-03 04:10:30,936 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 2.342857142857143) internal successors, (82), 35 states have internal predecessors, (82), 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 04:10:30,936 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 74 transitions. [2022-11-03 04:10:30,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-03 04:10:30,937 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:10:30,937 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:10:30,967 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75cc489c-bbc7-4882-8b9a-1f5e065ba06a/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-11-03 04:10:31,146 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75cc489c-bbc7-4882-8b9a-1f5e065ba06a/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-11-03 04:10:31,147 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr61ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2022-11-03 04:10:31,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:10:31,147 INFO L85 PathProgramCache]: Analyzing trace with hash -813510611, now seen corresponding path program 1 times [2022-11-03 04:10:31,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:10:31,148 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53815315] [2022-11-03 04:10:31,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:10:31,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:10:31,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:10:32,223 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:10:32,224 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:10:32,224 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53815315] [2022-11-03 04:10:32,224 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [53815315] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 04:10:32,224 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1303278237] [2022-11-03 04:10:32,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:10:32,224 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:10:32,224 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75cc489c-bbc7-4882-8b9a-1f5e065ba06a/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 04:10:32,225 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75cc489c-bbc7-4882-8b9a-1f5e065ba06a/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 04:10:32,226 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75cc489c-bbc7-4882-8b9a-1f5e065ba06a/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-11-03 04:10:32,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:10:32,371 INFO L263 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 56 conjunts are in the unsatisfiable core [2022-11-03 04:10:32,375 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:10:32,622 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 04:10:32,708 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-03 04:10:32,709 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 53 [2022-11-03 04:10:32,803 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-03 04:10:32,804 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 50 treesize of output 48 [2022-11-03 04:10:32,821 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 46 [2022-11-03 04:10:33,022 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:10:33,041 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:10:33,042 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 81 treesize of output 67 [2022-11-03 04:10:34,191 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:10:34,192 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 04:10:36,581 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| Int)) (or (= |c_ULTIMATE.start_main_old_#valid#1| (let ((.cse0 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ 4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (store (store (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) (select .cse0 (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 4)) 0) (select .cse0 |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|) 0))) (not (<= 0 |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|)) (not (<= |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 0)))) is different from false [2022-11-03 04:10:36,595 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1550 (Array Int Int)) (|ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| Int)) (or (not (<= 0 |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|)) (= |c_ULTIMATE.start_main_old_#valid#1| (let ((.cse0 (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1550) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ 4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (store (store (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) (select .cse0 (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 4)) 0) (select .cse0 |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|) 0))) (not (<= |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 0)))) is different from false [2022-11-03 04:10:36,622 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1549 (Array Int Int)) (v_ArrVal_1550 (Array Int Int)) (|ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| Int)) (or (not (<= 0 |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|)) (not (<= |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 0)) (= (let ((.cse0 (store (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1549) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1550) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (store (store (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0) (select .cse0 (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 4)) 0) (select .cse0 |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|) 0)) |c_ULTIMATE.start_main_old_#valid#1|))) is different from false [2022-11-03 04:10:36,632 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:10:36,633 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 64 treesize of output 57 [2022-11-03 04:10:36,637 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 170 treesize of output 164 [2022-11-03 04:10:36,659 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 153 treesize of output 141 [2022-11-03 04:10:36,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 0 case distinctions, treesize of input 371 treesize of output 347 [2022-11-03 04:10:36,697 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:10:36,697 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 224 treesize of output 228 [2022-11-03 04:10:51,511 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse4 (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0)) (.cse306 (< (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 3) 0)) (.cse299 (< 0 (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 1)))) (let ((.cse24 (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (.cse302 (or .cse306 .cse299)) (.cse303 (< 0 (+ 5 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (.cse280 (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4)) (.cse304 (< |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 1)) (.cse2 (store .cse4 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0))) (let ((.cse216 (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_942 Int) (v_arrayElimCell_941 Int) (v_arrayElimCell_944 Int) (v_arrayElimCell_943 Int)) (let ((.cse311 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse311 (select (store (store .cse4 v_arrayElimCell_943 0) v_arrayElimCell_944 0) v_antiDerIndex_entry0_1)) (= .cse311 (select (store (store .cse4 v_arrayElimCell_941 0) v_arrayElimCell_942 0) v_antiDerIndex_entry0_1)) (= .cse311 (select .cse2 v_antiDerIndex_entry0_1)))))) (.cse16 (store .cse2 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0)) (.cse3 (store .cse4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0)) (.cse197 (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_942 Int) (v_arrayElimCell_941 Int) (v_arrayElimCell_944 Int) (v_arrayElimCell_943 Int)) (let ((.cse310 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse310 (select (store (store .cse4 v_arrayElimCell_943 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse310 (select (store .cse2 v_arrayElimCell_944 0) v_antiDerIndex_entry0_1)) (= .cse310 (select (store (store .cse4 v_arrayElimCell_941 0) v_arrayElimCell_942 0) v_antiDerIndex_entry0_1)) (= .cse310 (select .cse2 v_antiDerIndex_entry0_1)))))) (.cse113 (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_944 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store .cse2 v_arrayElimCell_944 0) v_antiDerIndex_entry0_1)))) (.cse58 (not (<= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0))) (.cse70 (not (<= 0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (.cse124 (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_944 Int) (v_arrayElimCell_943 Int)) (let ((.cse309 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse309 (select (store (store .cse4 v_arrayElimCell_943 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse309 (select (store .cse2 v_arrayElimCell_944 0) v_antiDerIndex_entry0_1)))))) (.cse12 (and .cse304 .cse299)) (.cse120 (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_944 Int) (v_arrayElimCell_943 Int)) (let ((.cse307 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse308 (store .cse4 v_arrayElimCell_943 0))) (or (= .cse307 (select (store .cse308 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse307 (select (store .cse308 v_arrayElimCell_944 0) v_antiDerIndex_entry0_1)))))) (.cse100 (not (<= .cse280 0))) (.cse101 (not (<= 0 .cse280))) (.cse104 (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_943 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store (store .cse4 v_arrayElimCell_943 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))) (.cse5 (and .cse306 .cse303)) (.cse110 (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_944 Int) (v_arrayElimCell_943 Int)) (let ((.cse305 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse305 (select (store .cse2 v_arrayElimCell_944 0) v_antiDerIndex_entry0_1)) (= .cse305 (select (store (store .cse4 v_arrayElimCell_943 0) v_arrayElimCell_944 0) v_antiDerIndex_entry0_1)))))) (.cse6 (and .cse304 .cse302 .cse303)) (.cse107 (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_944 Int) (v_arrayElimCell_943 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store (store .cse4 v_arrayElimCell_943 0) v_arrayElimCell_944 0) v_antiDerIndex_entry0_1)))) (.cse10 (not .cse24)) (.cse300 (or (< 3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) .cse304)) (.cse301 (< |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 5))) (let ((.cse27 (and .cse300 .cse302 .cse303 .cse301)) (.cse52 (forall ((v_arrayElimCell_945 Int) (v_antiDerIndex_entry0_1 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store (store .cse4 v_arrayElimCell_945 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))) (.cse35 (and .cse299 .cse300 .cse301)) (.cse0 (or (and (or .cse113 .cse58 .cse70) .cse124 (or .cse12 .cse120) (or .cse100 .cse101 .cse104) (or .cse5 .cse110) (or .cse6 .cse107)) .cse10)) (.cse188 (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_942 Int) (v_arrayElimCell_941 Int) (v_arrayElimCell_943 Int)) (let ((.cse298 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse298 (select (store (store .cse4 v_arrayElimCell_943 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse298 (select (store (store .cse4 v_arrayElimCell_941 0) v_arrayElimCell_942 0) v_antiDerIndex_entry0_1)) (= .cse298 (select .cse2 v_antiDerIndex_entry0_1)))))) (.cse84 (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_942 Int) (v_arrayElimCell_941 Int) (v_arrayElimCell_943 Int)) (let ((.cse296 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse297 (store .cse4 v_arrayElimCell_941 0))) (or (= .cse296 (select (store (store .cse4 v_arrayElimCell_943 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse296 (select (store .cse297 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse296 (select (store .cse297 v_arrayElimCell_942 0) v_antiDerIndex_entry0_1)))))) (.cse23 (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_942 Int) (v_arrayElimCell_941 Int) (v_arrayElimCell_944 Int) (v_arrayElimCell_943 Int)) (let ((.cse294 (store .cse4 v_arrayElimCell_943 0)) (.cse293 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse295 (store .cse4 v_arrayElimCell_941 0))) (or (= .cse293 (select (store .cse294 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse293 (select (store .cse294 v_arrayElimCell_944 0) v_antiDerIndex_entry0_1)) (= .cse293 (select (store .cse295 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse293 (select (store .cse295 v_arrayElimCell_942 0) v_antiDerIndex_entry0_1)))))) (.cse160 (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_942 Int) (v_arrayElimCell_941 Int) (v_arrayElimCell_944 Int) (v_arrayElimCell_943 Int)) (let ((.cse292 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse292 (select (store .cse2 v_arrayElimCell_942 0) v_antiDerIndex_entry0_1)) (= .cse292 (select (store (store .cse4 v_arrayElimCell_943 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse292 (select (store .cse2 v_arrayElimCell_944 0) v_antiDerIndex_entry0_1)) (= .cse292 (select (store (store .cse4 v_arrayElimCell_941 0) v_arrayElimCell_942 0) v_antiDerIndex_entry0_1)))))) (.cse93 (or .cse197 .cse10)) (.cse184 (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_942 Int) (v_arrayElimCell_941 Int) (v_arrayElimCell_944 Int) (v_arrayElimCell_943 Int)) (let ((.cse291 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse291 (select .cse3 v_antiDerIndex_entry0_1)) (= .cse291 (select (store (store .cse4 v_arrayElimCell_943 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse291 (select (store .cse2 v_arrayElimCell_944 0) v_antiDerIndex_entry0_1)) (= .cse291 (select (store (store .cse4 v_arrayElimCell_941 0) v_arrayElimCell_942 0) v_antiDerIndex_entry0_1)) (= .cse291 (select .cse2 v_antiDerIndex_entry0_1)))))) (.cse207 (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_942 Int) (v_arrayElimCell_941 Int) (v_arrayElimCell_944 Int) (v_arrayElimCell_943 Int)) (let ((.cse290 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse290 (select (store (store .cse4 v_arrayElimCell_943 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse290 (select (store .cse2 v_arrayElimCell_944 0) v_antiDerIndex_entry0_1)) (= .cse290 (select (store (store .cse4 v_arrayElimCell_941 0) v_arrayElimCell_942 0) v_antiDerIndex_entry0_1)))))) (.cse190 (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_942 Int) (v_arrayElimCell_941 Int) (v_arrayElimCell_944 Int) (v_arrayElimCell_943 Int)) (let ((.cse288 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse289 (store .cse4 v_arrayElimCell_941 0))) (or (= .cse288 (select (store (store .cse4 v_arrayElimCell_943 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse288 (select (store .cse2 v_arrayElimCell_944 0) v_antiDerIndex_entry0_1)) (= .cse288 (select (store .cse289 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse288 (select (store .cse289 v_arrayElimCell_942 0) v_antiDerIndex_entry0_1)))))) (.cse49 (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (.cse183 (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_942 Int) (v_arrayElimCell_941 Int) (v_arrayElimCell_944 Int) (v_arrayElimCell_943 Int)) (let ((.cse287 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse287 (select (store (store .cse4 v_arrayElimCell_943 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse287 (select (store .cse2 v_arrayElimCell_944 0) v_antiDerIndex_entry0_1)) (= .cse287 (select .cse16 v_antiDerIndex_entry0_1)) (= .cse287 (select (store (store .cse4 v_arrayElimCell_941 0) v_arrayElimCell_942 0) v_antiDerIndex_entry0_1)) (= .cse287 (select .cse2 v_antiDerIndex_entry0_1)))))) (.cse191 (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_942 Int) (v_arrayElimCell_941 Int) (v_arrayElimCell_944 Int) (v_arrayElimCell_943 Int)) (let ((.cse286 (store .cse4 v_arrayElimCell_943 0)) (.cse285 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse285 (select (store .cse286 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse285 (select (store .cse286 v_arrayElimCell_944 0) v_antiDerIndex_entry0_1)) (= .cse285 (select (store (store .cse4 v_arrayElimCell_941 0) v_arrayElimCell_942 0) v_antiDerIndex_entry0_1)))))) (.cse223 (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_942 Int) (v_arrayElimCell_941 Int) (v_arrayElimCell_944 Int)) (let ((.cse284 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse284 (select (store .cse2 v_arrayElimCell_942 0) v_antiDerIndex_entry0_1)) (= .cse284 (select (store .cse2 v_arrayElimCell_944 0) v_antiDerIndex_entry0_1)) (= .cse284 (select (store (store .cse4 v_arrayElimCell_941 0) v_arrayElimCell_942 0) v_antiDerIndex_entry0_1)))))) (.cse189 (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_942 Int) (v_arrayElimCell_941 Int) (v_arrayElimCell_944 Int) (v_arrayElimCell_943 Int)) (let ((.cse283 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse283 (select (store .cse2 v_arrayElimCell_942 0) v_antiDerIndex_entry0_1)) (= .cse283 (select (store .cse2 v_arrayElimCell_944 0) v_antiDerIndex_entry0_1)) (= .cse283 (select (store (store .cse4 v_arrayElimCell_943 0) v_arrayElimCell_944 0) v_antiDerIndex_entry0_1)) (= .cse283 (select (store (store .cse4 v_arrayElimCell_941 0) v_arrayElimCell_942 0) v_antiDerIndex_entry0_1)))))) (.cse126 (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_942 Int) (v_arrayElimCell_941 Int) (v_arrayElimCell_944 Int) (v_arrayElimCell_943 Int)) (let ((.cse282 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse282 (select .cse3 v_antiDerIndex_entry0_1)) (= .cse282 (select (store (store .cse4 v_arrayElimCell_943 0) v_arrayElimCell_944 0) v_antiDerIndex_entry0_1)) (= .cse282 (select (store (store .cse4 v_arrayElimCell_941 0) v_arrayElimCell_942 0) v_antiDerIndex_entry0_1)) (= .cse282 (select .cse2 v_antiDerIndex_entry0_1)))))) (.cse254 (or .cse216 .cse10)) (.cse74 (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_942 Int) (v_arrayElimCell_941 Int) (v_arrayElimCell_944 Int) (v_arrayElimCell_943 Int)) (let ((.cse281 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse281 (select .cse16 v_antiDerIndex_entry0_1)) (= .cse281 (select (store (store .cse4 v_arrayElimCell_943 0) v_arrayElimCell_944 0) v_antiDerIndex_entry0_1)) (= .cse281 (select (store (store .cse4 v_arrayElimCell_941 0) v_arrayElimCell_942 0) v_antiDerIndex_entry0_1)) (= .cse281 (select .cse2 v_antiDerIndex_entry0_1)))))) (.cse73 (< |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0)) (.cse75 (< 0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) (.cse20 (store .cse3 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0)) (.cse36 (< .cse280 0)) (.cse39 (< 0 .cse280))) (and .cse0 (or (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_942 Int) (v_arrayElimCell_941 Int) (v_arrayElimCell_944 Int) (v_arrayElimCell_943 Int)) (let ((.cse1 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse1 (select (store .cse2 v_arrayElimCell_942 0) v_antiDerIndex_entry0_1)) (= .cse1 (select .cse3 v_antiDerIndex_entry0_1)) (= .cse1 (select (store (store .cse4 v_arrayElimCell_943 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse1 (select (store .cse2 v_arrayElimCell_944 0) v_antiDerIndex_entry0_1)) (= .cse1 (select (store (store .cse4 v_arrayElimCell_941 0) v_arrayElimCell_942 0) v_antiDerIndex_entry0_1))))) .cse5) (or .cse6 (and (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_942 Int) (v_arrayElimCell_941 Int) (v_arrayElimCell_944 Int) (v_arrayElimCell_943 Int)) (let ((.cse7 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse8 (store .cse4 v_arrayElimCell_941 0))) (or (= .cse7 (select (store .cse2 v_arrayElimCell_942 0) v_antiDerIndex_entry0_1)) (= .cse7 (select .cse3 v_antiDerIndex_entry0_1)) (= .cse7 (select (store (store .cse4 v_arrayElimCell_943 0) v_arrayElimCell_944 0) v_antiDerIndex_entry0_1)) (= .cse7 (select (store .cse8 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse7 (select (store .cse8 v_arrayElimCell_942 0) v_antiDerIndex_entry0_1))))) (or (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_942 Int) (v_arrayElimCell_941 Int) (v_arrayElimCell_944 Int) (v_arrayElimCell_943 Int)) (let ((.cse9 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse9 (select (store .cse2 v_arrayElimCell_942 0) v_antiDerIndex_entry0_1)) (= .cse9 (select (store (store .cse4 v_arrayElimCell_943 0) v_arrayElimCell_944 0) v_antiDerIndex_entry0_1)) (= .cse9 (select (store (store .cse4 v_arrayElimCell_941 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) .cse10))) (or (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_942 Int) (v_arrayElimCell_941 Int) (v_arrayElimCell_944 Int) (v_arrayElimCell_943 Int)) (let ((.cse11 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse11 (select (store .cse2 v_arrayElimCell_942 0) v_antiDerIndex_entry0_1)) (= .cse11 (select (store (store .cse4 v_arrayElimCell_943 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse11 (select (store .cse2 v_arrayElimCell_944 0) v_antiDerIndex_entry0_1)) (= .cse11 (select (store (store .cse4 v_arrayElimCell_941 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) .cse12 .cse10) (or .cse6 (and (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_942 Int) (v_arrayElimCell_941 Int) (v_arrayElimCell_944 Int) (v_arrayElimCell_943 Int)) (let ((.cse13 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse14 (store .cse4 v_arrayElimCell_941 0))) (or (= .cse13 (select .cse3 v_antiDerIndex_entry0_1)) (= .cse13 (select (store (store .cse4 v_arrayElimCell_943 0) v_arrayElimCell_944 0) v_antiDerIndex_entry0_1)) (= .cse13 (select (store .cse14 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse13 (select (store .cse14 v_arrayElimCell_942 0) v_antiDerIndex_entry0_1))))) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_942 Int) (v_arrayElimCell_941 Int) (v_arrayElimCell_944 Int) (v_arrayElimCell_943 Int)) (let ((.cse15 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse15 (select .cse3 v_antiDerIndex_entry0_1)) (= .cse15 (select .cse16 v_antiDerIndex_entry0_1)) (= .cse15 (select (store (store .cse4 v_arrayElimCell_943 0) v_arrayElimCell_944 0) v_antiDerIndex_entry0_1)) (= .cse15 (select (store (store .cse4 v_arrayElimCell_941 0) v_arrayElimCell_942 0) v_antiDerIndex_entry0_1))))) (or (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_942 Int) (v_arrayElimCell_941 Int) (v_arrayElimCell_944 Int) (v_arrayElimCell_943 Int)) (let ((.cse17 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse18 (store .cse4 v_arrayElimCell_941 0))) (or (= .cse17 (select (store (store .cse4 v_arrayElimCell_943 0) v_arrayElimCell_944 0) v_antiDerIndex_entry0_1)) (= .cse17 (select (store .cse18 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse17 (select (store .cse18 v_arrayElimCell_942 0) v_antiDerIndex_entry0_1))))) .cse10) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_942 Int) (v_arrayElimCell_941 Int) (v_arrayElimCell_944 Int) (v_arrayElimCell_943 Int)) (let ((.cse19 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse19 (select .cse20 v_antiDerIndex_entry0_1)) (= .cse19 (select .cse3 v_antiDerIndex_entry0_1)) (= .cse19 (select (store (store .cse4 v_arrayElimCell_943 0) v_arrayElimCell_944 0) v_antiDerIndex_entry0_1)) (= .cse19 (select (store (store .cse4 v_arrayElimCell_941 0) v_arrayElimCell_942 0) v_antiDerIndex_entry0_1))))) (or (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_942 Int) (v_arrayElimCell_941 Int) (v_arrayElimCell_944 Int) (v_arrayElimCell_943 Int)) (let ((.cse21 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse21 (select (store (store .cse4 v_arrayElimCell_943 0) v_arrayElimCell_944 0) v_antiDerIndex_entry0_1)) (= .cse21 (select (store (store .cse4 v_arrayElimCell_941 0) v_arrayElimCell_942 0) v_antiDerIndex_entry0_1))))) .cse10) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_942 Int) (v_arrayElimCell_941 Int) (v_arrayElimCell_944 Int) (v_arrayElimCell_943 Int)) (let ((.cse22 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse22 (select .cse3 v_antiDerIndex_entry0_1)) (= .cse22 (select (store (store .cse4 v_arrayElimCell_943 0) v_arrayElimCell_944 0) v_antiDerIndex_entry0_1)) (= .cse22 (select (store (store .cse4 v_arrayElimCell_941 0) v_arrayElimCell_942 0) v_antiDerIndex_entry0_1))))))) (or .cse12 .cse23 .cse10) (or .cse24 (and (or (forall ((v_arrayElimCell_945 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_942 Int) (v_arrayElimCell_941 Int)) (let ((.cse26 (store .cse4 v_arrayElimCell_941 0)) (.cse25 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse25 (select (store .cse26 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse25 (select (store .cse26 v_arrayElimCell_942 0) v_antiDerIndex_entry0_1)) (= .cse25 (select (store (store .cse4 v_arrayElimCell_945 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1))))) .cse27) (or (forall ((v_arrayElimCell_945 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_942 Int) (v_arrayElimCell_941 Int)) (let ((.cse29 (store .cse4 v_arrayElimCell_941 0)) (.cse28 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse28 (select (store .cse2 v_arrayElimCell_942 0) v_antiDerIndex_entry0_1)) (= .cse28 (select (store .cse29 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse28 (select (store .cse29 v_arrayElimCell_942 0) v_antiDerIndex_entry0_1)) (= .cse28 (select (store (store .cse4 v_arrayElimCell_945 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1))))) .cse27) (or .cse27 (forall ((v_arrayElimCell_945 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_942 Int) (v_arrayElimCell_941 Int)) (let ((.cse30 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse31 (store .cse4 v_arrayElimCell_945 0))) (or (= .cse30 (select (store (store .cse4 v_arrayElimCell_941 0) v_arrayElimCell_942 0) v_antiDerIndex_entry0_1)) (= .cse30 (select (store .cse31 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse30 (select (store .cse31 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)))))) (or (forall ((v_arrayElimCell_945 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_942 Int) (v_arrayElimCell_941 Int)) (let ((.cse33 (store .cse4 v_arrayElimCell_941 0)) (.cse32 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse34 (store .cse4 v_arrayElimCell_945 0))) (or (= .cse32 (select (store .cse33 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse32 (select (store .cse33 v_arrayElimCell_942 0) v_antiDerIndex_entry0_1)) (= .cse32 (select (store .cse34 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse32 (select (store .cse34 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1))))) .cse35) (or .cse36 (forall ((v_arrayElimCell_945 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_942 Int) (v_arrayElimCell_941 Int)) (let ((.cse38 (store .cse4 v_arrayElimCell_941 0)) (.cse37 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse37 (select (store .cse2 v_arrayElimCell_942 0) v_antiDerIndex_entry0_1)) (= .cse37 (select (store .cse38 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse37 (select (store .cse38 v_arrayElimCell_942 0) v_antiDerIndex_entry0_1)) (= .cse37 (select (store (store .cse4 v_arrayElimCell_945 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) .cse39) (or .cse27 (forall ((v_arrayElimCell_945 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_942 Int) (v_arrayElimCell_941 Int)) (let ((.cse40 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse40 (select (store .cse2 v_arrayElimCell_942 0) v_antiDerIndex_entry0_1)) (= .cse40 (select (store (store .cse4 v_arrayElimCell_941 0) v_arrayElimCell_942 0) v_antiDerIndex_entry0_1)) (= .cse40 (select (store (store .cse4 v_arrayElimCell_945 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)))))) (or .cse36 .cse39 (and (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_941 Int)) (let ((.cse41 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_945 Int)) (= .cse41 (select (store (store .cse4 v_arrayElimCell_945 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))) (= .cse41 (select (store (store .cse4 v_arrayElimCell_941 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_941 Int)) (let ((.cse42 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse42 (select (store (store .cse4 v_arrayElimCell_941 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_945 Int)) (let ((.cse43 (store .cse4 v_arrayElimCell_945 0))) (or (= .cse42 (select (store .cse43 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse42 (select (store .cse43 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)))))))))) (or .cse27 (forall ((v_arrayElimCell_945 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_942 Int) (v_arrayElimCell_941 Int)) (let ((.cse44 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse45 (store .cse4 v_arrayElimCell_945 0))) (or (= .cse44 (select (store .cse2 v_arrayElimCell_942 0) v_antiDerIndex_entry0_1)) (= .cse44 (select (store (store .cse4 v_arrayElimCell_941 0) v_arrayElimCell_942 0) v_antiDerIndex_entry0_1)) (= .cse44 (select (store .cse45 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse44 (select (store .cse45 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)))))) (or .cse35 (forall ((v_arrayElimCell_945 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_942 Int) (v_arrayElimCell_941 Int)) (let ((.cse47 (store .cse4 v_arrayElimCell_941 0)) (.cse46 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse48 (store .cse4 v_arrayElimCell_945 0))) (or (= .cse46 (select (store .cse2 v_arrayElimCell_942 0) v_antiDerIndex_entry0_1)) (= .cse46 (select (store .cse47 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse46 (select (store .cse47 v_arrayElimCell_942 0) v_antiDerIndex_entry0_1)) (= .cse46 (select (store .cse48 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse46 (select (store .cse48 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)))))) (or .cse49 (and (or (forall ((v_arrayElimCell_945 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse50 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse51 (store .cse4 v_arrayElimCell_945 0))) (or (= .cse50 (select (store .cse51 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse50 (select (store .cse51 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1))))) .cse35) (or (forall ((v_arrayElimCell_945 Int) (v_antiDerIndex_entry0_1 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store (store .cse4 v_arrayElimCell_945 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1))) .cse27) (or .cse52 .cse36 .cse39))) (or (forall ((v_arrayElimCell_945 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_942 Int) (v_arrayElimCell_941 Int)) (let ((.cse53 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse53 (select (store (store .cse4 v_arrayElimCell_941 0) v_arrayElimCell_942 0) v_antiDerIndex_entry0_1)) (= .cse53 (select (store (store .cse4 v_arrayElimCell_945 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1))))) .cse27) (or (forall ((v_arrayElimCell_945 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_942 Int) (v_arrayElimCell_941 Int)) (let ((.cse55 (store .cse4 v_arrayElimCell_941 0)) (.cse54 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse54 (select (store .cse55 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse54 (select (store .cse55 v_arrayElimCell_942 0) v_antiDerIndex_entry0_1)) (= .cse54 (select (store (store .cse4 v_arrayElimCell_945 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) .cse36 .cse39))) (or .cse12 (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_942 Int) (v_arrayElimCell_941 Int) (v_arrayElimCell_944 Int) (v_arrayElimCell_943 Int)) (let ((.cse56 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse57 (store .cse4 v_arrayElimCell_941 0))) (or (= .cse56 (select (store .cse2 v_arrayElimCell_942 0) v_antiDerIndex_entry0_1)) (= .cse56 (select .cse3 v_antiDerIndex_entry0_1)) (= .cse56 (select (store (store .cse4 v_arrayElimCell_943 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse56 (select (store .cse2 v_arrayElimCell_944 0) v_antiDerIndex_entry0_1)) (= .cse56 (select (store .cse57 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse56 (select (store .cse57 v_arrayElimCell_942 0) v_antiDerIndex_entry0_1)))))) (or .cse58 (and (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_942 Int) (v_arrayElimCell_944 Int)) (let ((.cse59 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse59 (select (store .cse2 v_arrayElimCell_942 0) v_antiDerIndex_entry0_1)) (= .cse59 (select .cse3 v_antiDerIndex_entry0_1)) (= .cse59 (select (store .cse2 v_arrayElimCell_944 0) v_antiDerIndex_entry0_1))))) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_942 Int) (v_arrayElimCell_944 Int)) (let ((.cse60 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse60 (select (store .cse2 v_arrayElimCell_942 0) v_antiDerIndex_entry0_1)) (= .cse60 (select (store .cse2 v_arrayElimCell_944 0) v_antiDerIndex_entry0_1)) (= .cse60 (select .cse16 v_antiDerIndex_entry0_1))))) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_942 Int) (v_arrayElimCell_944 Int) (v_arrayElimCell_943 Int)) (let ((.cse61 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse61 (select (store .cse2 v_arrayElimCell_942 0) v_antiDerIndex_entry0_1)) (= .cse61 (select .cse3 v_antiDerIndex_entry0_1)) (= .cse61 (select (store (store .cse4 v_arrayElimCell_943 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse61 (select (store .cse2 v_arrayElimCell_944 0) v_antiDerIndex_entry0_1))))) (or (and (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_942 Int)) (let ((.cse62 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse62 (select (store .cse2 v_arrayElimCell_942 0) v_antiDerIndex_entry0_1)) (= .cse62 (select .cse3 v_antiDerIndex_entry0_1))))) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_942 Int)) (let ((.cse63 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse63 (select (store .cse2 v_arrayElimCell_942 0) v_antiDerIndex_entry0_1)) (= .cse63 (select .cse16 v_antiDerIndex_entry0_1)))))) .cse24) (or (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_942 Int) (v_arrayElimCell_944 Int) (v_arrayElimCell_943 Int)) (let ((.cse64 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse64 (select (store .cse2 v_arrayElimCell_942 0) v_antiDerIndex_entry0_1)) (= .cse64 (select (store .cse2 v_arrayElimCell_944 0) v_antiDerIndex_entry0_1)) (= .cse64 (select (store (store .cse4 v_arrayElimCell_943 0) v_arrayElimCell_944 0) v_antiDerIndex_entry0_1))))) .cse10) (or (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_942 Int) (v_arrayElimCell_944 Int)) (let ((.cse65 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse65 (select (store .cse2 v_arrayElimCell_942 0) v_antiDerIndex_entry0_1)) (= .cse65 (select (store .cse2 v_arrayElimCell_944 0) v_antiDerIndex_entry0_1))))) .cse10) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_942 Int) (v_arrayElimCell_944 Int) (v_arrayElimCell_943 Int)) (let ((.cse66 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse66 (select (store .cse2 v_arrayElimCell_942 0) v_antiDerIndex_entry0_1)) (= .cse66 (select (store (store .cse4 v_arrayElimCell_943 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse66 (select (store .cse2 v_arrayElimCell_944 0) v_antiDerIndex_entry0_1)) (= .cse66 (select .cse16 v_antiDerIndex_entry0_1))))) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_942 Int) (v_arrayElimCell_944 Int) (v_arrayElimCell_943 Int)) (let ((.cse67 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse67 (select (store .cse2 v_arrayElimCell_942 0) v_antiDerIndex_entry0_1)) (= .cse67 (select .cse3 v_antiDerIndex_entry0_1)) (= .cse67 (select (store .cse2 v_arrayElimCell_944 0) v_antiDerIndex_entry0_1)) (= .cse67 (select (store (store .cse4 v_arrayElimCell_943 0) v_arrayElimCell_944 0) v_antiDerIndex_entry0_1))))) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_942 Int) (v_arrayElimCell_944 Int) (v_arrayElimCell_943 Int)) (let ((.cse68 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse68 (select (store .cse2 v_arrayElimCell_942 0) v_antiDerIndex_entry0_1)) (= .cse68 (select (store .cse2 v_arrayElimCell_944 0) v_antiDerIndex_entry0_1)) (= .cse68 (select .cse16 v_antiDerIndex_entry0_1)) (= .cse68 (select (store (store .cse4 v_arrayElimCell_943 0) v_arrayElimCell_944 0) v_antiDerIndex_entry0_1))))) (or (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_942 Int) (v_arrayElimCell_944 Int) (v_arrayElimCell_943 Int)) (let ((.cse69 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse69 (select (store .cse2 v_arrayElimCell_942 0) v_antiDerIndex_entry0_1)) (= .cse69 (select (store (store .cse4 v_arrayElimCell_943 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse69 (select (store .cse2 v_arrayElimCell_944 0) v_antiDerIndex_entry0_1))))) .cse10)) .cse70) (or .cse12 (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_942 Int) (v_arrayElimCell_941 Int) (v_arrayElimCell_944 Int) (v_arrayElimCell_943 Int)) (let ((.cse72 (store .cse4 v_arrayElimCell_943 0)) (.cse71 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse71 (select (store .cse2 v_arrayElimCell_942 0) v_antiDerIndex_entry0_1)) (= .cse71 (select (store .cse72 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse71 (select (store .cse72 v_arrayElimCell_944 0) v_antiDerIndex_entry0_1)) (= .cse71 (select (store (store .cse4 v_arrayElimCell_941 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) .cse10) (or .cse73 .cse74 .cse75) (or .cse6 (and (or (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_942 Int) (v_arrayElimCell_941 Int) (v_arrayElimCell_944 Int) (v_arrayElimCell_943 Int)) (let ((.cse76 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse77 (store .cse4 v_arrayElimCell_941 0))) (or (= .cse76 (select (store .cse2 v_arrayElimCell_944 0) v_antiDerIndex_entry0_1)) (= .cse76 (select (store (store .cse4 v_arrayElimCell_943 0) v_arrayElimCell_944 0) v_antiDerIndex_entry0_1)) (= .cse76 (select (store .cse77 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse76 (select (store .cse77 v_arrayElimCell_942 0) v_antiDerIndex_entry0_1))))) .cse10) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_942 Int) (v_arrayElimCell_941 Int) (v_arrayElimCell_944 Int) (v_arrayElimCell_943 Int)) (let ((.cse78 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse79 (store .cse4 v_arrayElimCell_941 0))) (or (= .cse78 (select .cse3 v_antiDerIndex_entry0_1)) (= .cse78 (select (store .cse2 v_arrayElimCell_944 0) v_antiDerIndex_entry0_1)) (= .cse78 (select (store (store .cse4 v_arrayElimCell_943 0) v_arrayElimCell_944 0) v_antiDerIndex_entry0_1)) (= .cse78 (select (store .cse79 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse78 (select (store .cse79 v_arrayElimCell_942 0) v_antiDerIndex_entry0_1))))) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_942 Int) (v_arrayElimCell_941 Int) (v_arrayElimCell_944 Int) (v_arrayElimCell_943 Int)) (let ((.cse80 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse80 (select .cse3 v_antiDerIndex_entry0_1)) (= .cse80 (select (store .cse2 v_arrayElimCell_944 0) v_antiDerIndex_entry0_1)) (= .cse80 (select (store (store .cse4 v_arrayElimCell_943 0) v_arrayElimCell_944 0) v_antiDerIndex_entry0_1)) (= .cse80 (select (store (store .cse4 v_arrayElimCell_941 0) v_arrayElimCell_942 0) v_antiDerIndex_entry0_1))))) (or (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_942 Int) (v_arrayElimCell_941 Int) (v_arrayElimCell_944 Int) (v_arrayElimCell_943 Int)) (let ((.cse81 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse81 (select (store .cse2 v_arrayElimCell_944 0) v_antiDerIndex_entry0_1)) (= .cse81 (select (store (store .cse4 v_arrayElimCell_943 0) v_arrayElimCell_944 0) v_antiDerIndex_entry0_1)) (= .cse81 (select (store (store .cse4 v_arrayElimCell_941 0) v_arrayElimCell_942 0) v_antiDerIndex_entry0_1))))) .cse10))) (or (and (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_942 Int) (v_arrayElimCell_941 Int) (v_arrayElimCell_943 Int)) (let ((.cse82 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse83 (store .cse4 v_arrayElimCell_941 0))) (or (= .cse82 (select .cse20 v_antiDerIndex_entry0_1)) (= .cse82 (select (store (store .cse4 v_arrayElimCell_943 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse82 (select (store .cse83 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse82 (select (store .cse83 v_arrayElimCell_942 0) v_antiDerIndex_entry0_1))))) (or .cse84 .cse10) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_942 Int) (v_arrayElimCell_941 Int) (v_arrayElimCell_943 Int)) (let ((.cse85 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse86 (store .cse4 v_arrayElimCell_941 0))) (or (= .cse85 (select .cse3 v_antiDerIndex_entry0_1)) (= .cse85 (select (store (store .cse4 v_arrayElimCell_943 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse85 (select (store .cse86 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse85 (select (store .cse86 v_arrayElimCell_942 0) v_antiDerIndex_entry0_1)))))) .cse36 .cse39) (or .cse6 (and (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_942 Int) (v_arrayElimCell_941 Int) (v_arrayElimCell_944 Int) (v_arrayElimCell_943 Int)) (let ((.cse88 (store .cse4 v_arrayElimCell_943 0)) (.cse87 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse87 (select (store .cse2 v_arrayElimCell_942 0) v_antiDerIndex_entry0_1)) (= .cse87 (select .cse3 v_antiDerIndex_entry0_1)) (= .cse87 (select (store .cse88 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse87 (select (store .cse88 v_arrayElimCell_944 0) v_antiDerIndex_entry0_1)) (= .cse87 (select (store (store .cse4 v_arrayElimCell_941 0) v_arrayElimCell_942 0) v_antiDerIndex_entry0_1))))) (or (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_942 Int) (v_arrayElimCell_941 Int) (v_arrayElimCell_944 Int) (v_arrayElimCell_943 Int)) (let ((.cse90 (store .cse4 v_arrayElimCell_943 0)) (.cse89 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse89 (select (store .cse2 v_arrayElimCell_942 0) v_antiDerIndex_entry0_1)) (= .cse89 (select (store .cse90 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse89 (select (store .cse90 v_arrayElimCell_944 0) v_antiDerIndex_entry0_1)) (= .cse89 (select (store (store .cse4 v_arrayElimCell_941 0) v_arrayElimCell_942 0) v_antiDerIndex_entry0_1))))) .cse10) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_942 Int) (v_arrayElimCell_941 Int) (v_arrayElimCell_944 Int) (v_arrayElimCell_943 Int)) (let ((.cse91 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse91 (select (store .cse2 v_arrayElimCell_942 0) v_antiDerIndex_entry0_1)) (= .cse91 (select .cse3 v_antiDerIndex_entry0_1)) (= .cse91 (select (store (store .cse4 v_arrayElimCell_943 0) v_arrayElimCell_944 0) v_antiDerIndex_entry0_1)) (= .cse91 (select (store (store .cse4 v_arrayElimCell_941 0) v_arrayElimCell_942 0) v_antiDerIndex_entry0_1))))) (or (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_942 Int) (v_arrayElimCell_941 Int) (v_arrayElimCell_944 Int) (v_arrayElimCell_943 Int)) (let ((.cse92 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse92 (select (store .cse2 v_arrayElimCell_942 0) v_antiDerIndex_entry0_1)) (= .cse92 (select (store (store .cse4 v_arrayElimCell_943 0) v_arrayElimCell_944 0) v_antiDerIndex_entry0_1)) (= .cse92 (select (store (store .cse4 v_arrayElimCell_941 0) v_arrayElimCell_942 0) v_antiDerIndex_entry0_1))))) .cse10))) .cse93 (or .cse12 (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_942 Int) (v_arrayElimCell_941 Int) (v_arrayElimCell_944 Int) (v_arrayElimCell_943 Int)) (let ((.cse95 (store .cse4 v_arrayElimCell_943 0)) (.cse94 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse96 (store .cse4 v_arrayElimCell_941 0))) (or (= .cse94 (select .cse3 v_antiDerIndex_entry0_1)) (= .cse94 (select (store .cse95 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse94 (select (store .cse95 v_arrayElimCell_944 0) v_antiDerIndex_entry0_1)) (= .cse94 (select (store .cse96 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse94 (select (store .cse96 v_arrayElimCell_942 0) v_antiDerIndex_entry0_1)))))) (or (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_942 Int) (v_arrayElimCell_941 Int) (v_arrayElimCell_944 Int) (v_arrayElimCell_943 Int)) (let ((.cse97 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse97 (select (store .cse2 v_arrayElimCell_942 0) v_antiDerIndex_entry0_1)) (= .cse97 (select (store .cse2 v_arrayElimCell_944 0) v_antiDerIndex_entry0_1)) (= .cse97 (select .cse16 v_antiDerIndex_entry0_1)) (= .cse97 (select (store (store .cse4 v_arrayElimCell_943 0) v_arrayElimCell_944 0) v_antiDerIndex_entry0_1)) (= .cse97 (select (store (store .cse4 v_arrayElimCell_941 0) v_arrayElimCell_942 0) v_antiDerIndex_entry0_1))))) .cse73 .cse75) (or .cse49 (let ((.cse99 (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_944 Int) (v_arrayElimCell_943 Int)) (let ((.cse125 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse125 (select (store (store .cse4 v_arrayElimCell_943 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse125 (select (store .cse2 v_arrayElimCell_944 0) v_antiDerIndex_entry0_1)) (= .cse125 (select .cse16 v_antiDerIndex_entry0_1))))))) (and (or (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_944 Int) (v_arrayElimCell_943 Int)) (let ((.cse98 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse98 (select (store .cse2 v_arrayElimCell_944 0) v_antiDerIndex_entry0_1)) (= .cse98 (select .cse16 v_antiDerIndex_entry0_1)) (= .cse98 (select (store (store .cse4 v_arrayElimCell_943 0) v_arrayElimCell_944 0) v_antiDerIndex_entry0_1))))) .cse73 .cse75) (or .cse58 .cse70 .cse99) (or .cse100 .cse101 (and (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_943 Int)) (let ((.cse102 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse102 (select .cse3 v_antiDerIndex_entry0_1)) (= .cse102 (select (store (store .cse4 v_arrayElimCell_943 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_943 Int)) (let ((.cse103 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse103 (select .cse20 v_antiDerIndex_entry0_1)) (= .cse103 (select (store (store .cse4 v_arrayElimCell_943 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (or .cse104 .cse10))) (or .cse6 (and (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_944 Int) (v_arrayElimCell_943 Int)) (let ((.cse105 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse105 (select .cse20 v_antiDerIndex_entry0_1)) (= .cse105 (select .cse3 v_antiDerIndex_entry0_1)) (= .cse105 (select (store (store .cse4 v_arrayElimCell_943 0) v_arrayElimCell_944 0) v_antiDerIndex_entry0_1))))) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_944 Int) (v_arrayElimCell_943 Int)) (let ((.cse106 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse106 (select .cse3 v_antiDerIndex_entry0_1)) (= .cse106 (select (store (store .cse4 v_arrayElimCell_943 0) v_arrayElimCell_944 0) v_antiDerIndex_entry0_1))))) (or .cse107 .cse10) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_944 Int) (v_arrayElimCell_943 Int)) (let ((.cse108 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse108 (select .cse3 v_antiDerIndex_entry0_1)) (= .cse108 (select .cse16 v_antiDerIndex_entry0_1)) (= .cse108 (select (store (store .cse4 v_arrayElimCell_943 0) v_arrayElimCell_944 0) v_antiDerIndex_entry0_1))))))) (or .cse5 (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_944 Int) (v_arrayElimCell_943 Int)) (let ((.cse109 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse109 (select .cse3 v_antiDerIndex_entry0_1)) (= .cse109 (select (store .cse2 v_arrayElimCell_944 0) v_antiDerIndex_entry0_1)) (= .cse109 (select (store (store .cse4 v_arrayElimCell_943 0) v_arrayElimCell_944 0) v_antiDerIndex_entry0_1)))))) (or .cse73 .cse99 .cse75) (or .cse5 .cse110 .cse10) (or (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_944 Int) (v_arrayElimCell_943 Int)) (let ((.cse111 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse112 (store .cse4 v_arrayElimCell_943 0))) (or (= .cse111 (select .cse20 v_antiDerIndex_entry0_1)) (= .cse111 (select (store .cse112 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse111 (select (store .cse112 v_arrayElimCell_944 0) v_antiDerIndex_entry0_1))))) .cse36 .cse39) (or .cse58 (and (or .cse113 .cse10) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_944 Int)) (let ((.cse114 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse114 (select .cse3 v_antiDerIndex_entry0_1)) (= .cse114 (select (store .cse2 v_arrayElimCell_944 0) v_antiDerIndex_entry0_1))))) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_944 Int)) (let ((.cse115 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse115 (select (store .cse2 v_arrayElimCell_944 0) v_antiDerIndex_entry0_1)) (= .cse115 (select .cse16 v_antiDerIndex_entry0_1)))))) .cse70) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_944 Int) (v_arrayElimCell_943 Int)) (let ((.cse116 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse116 (select .cse3 v_antiDerIndex_entry0_1)) (= .cse116 (select (store (store .cse4 v_arrayElimCell_943 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse116 (select (store .cse2 v_arrayElimCell_944 0) v_antiDerIndex_entry0_1))))) (or .cse24 (let ((.cse119 (forall ((v_antiDerIndex_entry0_1 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select .cse16 v_antiDerIndex_entry0_1))))) (and (or .cse100 .cse101 (forall ((v_antiDerIndex_entry0_1 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select .cse20 v_antiDerIndex_entry0_1)))) (or (forall ((v_antiDerIndex_entry0_1 Int)) (let ((.cse117 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse117 (select .cse20 v_antiDerIndex_entry0_1)) (= .cse117 (select .cse3 v_antiDerIndex_entry0_1))))) .cse12) (forall ((v_antiDerIndex_entry0_1 Int)) (let ((.cse118 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse118 (select .cse3 v_antiDerIndex_entry0_1)) (= .cse118 (select .cse16 v_antiDerIndex_entry0_1))))) (or .cse58 .cse119 .cse70) (or .cse119 .cse73 .cse75) (or .cse6 (forall ((v_antiDerIndex_entry0_1 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select .cse3 v_antiDerIndex_entry0_1))))))) (or .cse12 .cse120 .cse10) (or .cse100 .cse101 (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_944 Int) (v_arrayElimCell_943 Int)) (let ((.cse121 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse121 (select .cse20 v_antiDerIndex_entry0_1)) (= .cse121 (select (store (store .cse4 v_arrayElimCell_943 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse121 (select (store .cse2 v_arrayElimCell_944 0) v_antiDerIndex_entry0_1)))))) (or (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_944 Int) (v_arrayElimCell_943 Int)) (let ((.cse122 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse123 (store .cse4 v_arrayElimCell_943 0))) (or (= .cse122 (select .cse3 v_antiDerIndex_entry0_1)) (= .cse122 (select (store .cse123 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse122 (select (store .cse123 v_arrayElimCell_944 0) v_antiDerIndex_entry0_1))))) .cse12) (or .cse124 .cse10)))) (or .cse126 .cse5) (or (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_942 Int) (v_arrayElimCell_941 Int) (v_arrayElimCell_944 Int) (v_arrayElimCell_943 Int)) (let ((.cse127 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse127 (select (store .cse2 v_arrayElimCell_942 0) v_antiDerIndex_entry0_1)) (= .cse127 (select (store (store .cse4 v_arrayElimCell_943 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse127 (select (store .cse2 v_arrayElimCell_944 0) v_antiDerIndex_entry0_1)) (= .cse127 (select .cse16 v_antiDerIndex_entry0_1)) (= .cse127 (select (store (store .cse4 v_arrayElimCell_941 0) v_arrayElimCell_942 0) v_antiDerIndex_entry0_1))))) .cse73 .cse75) (or .cse24 (let ((.cse129 (and (forall ((v_antiDerIndex_entry0_1 Int)) (let ((.cse131 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse131 (select .cse16 v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_942 Int) (v_arrayElimCell_941 Int)) (= .cse131 (select (store (store .cse4 v_arrayElimCell_941 0) v_arrayElimCell_942 0) v_antiDerIndex_entry0_1))) (= .cse131 (select .cse2 v_antiDerIndex_entry0_1))))) (forall ((v_antiDerIndex_entry0_1 Int)) (let ((.cse132 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse132 (select .cse16 v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_942 Int)) (or (= .cse132 (select (store .cse2 v_arrayElimCell_942 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_941 Int)) (= .cse132 (select (store (store .cse4 v_arrayElimCell_941 0) v_arrayElimCell_942 0) v_antiDerIndex_entry0_1))))) (= .cse132 (select .cse2 v_antiDerIndex_entry0_1)))))))) (and (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_942 Int) (v_arrayElimCell_941 Int)) (let ((.cse128 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse128 (select .cse3 v_antiDerIndex_entry0_1)) (= .cse128 (select (store (store .cse4 v_arrayElimCell_941 0) v_arrayElimCell_942 0) v_antiDerIndex_entry0_1)) (= .cse128 (select .cse2 v_antiDerIndex_entry0_1))))) (or .cse73 .cse129 .cse75) (or .cse58 .cse70 .cse129) (or (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_942 Int) (v_arrayElimCell_941 Int)) (let ((.cse130 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse130 (select .cse20 v_antiDerIndex_entry0_1)) (= .cse130 (select (store (store .cse4 v_arrayElimCell_941 0) v_arrayElimCell_942 0) v_antiDerIndex_entry0_1)) (= .cse130 (select .cse2 v_antiDerIndex_entry0_1))))) .cse100 .cse101)))) (or .cse24 (and (or (forall ((v_arrayElimCell_945 Int) (v_arrayElimCell_947 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_942 Int) (v_arrayElimCell_941 Int)) (let ((.cse133 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse134 (store .cse4 v_arrayElimCell_945 0))) (or (= .cse133 (select (store .cse134 v_arrayElimCell_947 0) v_antiDerIndex_entry0_1)) (= .cse133 (select (store (store .cse4 v_arrayElimCell_941 0) v_arrayElimCell_942 0) v_antiDerIndex_entry0_1)) (= .cse133 (select (store .cse134 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) .cse27) (or (forall ((v_arrayElimCell_945 Int) (v_arrayElimCell_947 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_941 Int)) (let ((.cse135 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse136 (store .cse4 v_arrayElimCell_945 0))) (or (= .cse135 (select (store .cse136 v_arrayElimCell_947 0) v_antiDerIndex_entry0_1)) (= .cse135 (select (store (store .cse4 v_arrayElimCell_941 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse135 (select (store .cse136 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) .cse36 .cse39) (or .cse27 (forall ((v_arrayElimCell_945 Int) (v_arrayElimCell_947 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_942 Int) (v_arrayElimCell_941 Int)) (let ((.cse137 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse138 (store .cse4 v_arrayElimCell_945 0))) (or (= .cse137 (select (store .cse138 v_arrayElimCell_947 0) v_antiDerIndex_entry0_1)) (= .cse137 (select (store .cse2 v_arrayElimCell_942 0) v_antiDerIndex_entry0_1)) (= .cse137 (select (store (store .cse4 v_arrayElimCell_941 0) v_arrayElimCell_942 0) v_antiDerIndex_entry0_1)) (= .cse137 (select (store .cse138 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))) (or (and (forall ((v_arrayElimCell_945 Int) (v_arrayElimCell_947 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse139 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse139 (select (store (store .cse4 v_arrayElimCell_945 0) v_arrayElimCell_947 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_942 Int) (v_arrayElimCell_941 Int)) (or (= .cse139 (select (store .cse2 v_arrayElimCell_942 0) v_antiDerIndex_entry0_1)) (= .cse139 (select (store (store .cse4 v_arrayElimCell_941 0) v_arrayElimCell_942 0) v_antiDerIndex_entry0_1))))))) (forall ((v_arrayElimCell_945 Int) (v_arrayElimCell_947 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse140 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse140 (select (store (store .cse4 v_arrayElimCell_945 0) v_arrayElimCell_947 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_942 Int) (v_arrayElimCell_941 Int)) (= .cse140 (select (store (store .cse4 v_arrayElimCell_941 0) v_arrayElimCell_942 0) v_antiDerIndex_entry0_1)))))) (forall ((v_arrayElimCell_945 Int) (v_arrayElimCell_947 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse141 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse141 (select (store (store .cse4 v_arrayElimCell_945 0) v_arrayElimCell_947 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_942 Int)) (or (= .cse141 (select (store .cse2 v_arrayElimCell_942 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_941 Int)) (let ((.cse142 (store .cse4 v_arrayElimCell_941 0))) (or (= .cse141 (select (store .cse142 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse141 (select (store .cse142 v_arrayElimCell_942 0) v_antiDerIndex_entry0_1)))))))))) (forall ((v_arrayElimCell_945 Int) (v_arrayElimCell_947 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse143 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse143 (select (store (store .cse4 v_arrayElimCell_945 0) v_arrayElimCell_947 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_942 Int) (v_arrayElimCell_941 Int)) (let ((.cse144 (store .cse4 v_arrayElimCell_941 0))) (or (= .cse143 (select (store .cse144 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse143 (select (store .cse144 v_arrayElimCell_942 0) v_antiDerIndex_entry0_1)))))))) (or (forall ((v_arrayElimCell_945 Int) (v_arrayElimCell_947 Int) (v_antiDerIndex_entry0_1 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store (store .cse4 v_arrayElimCell_945 0) v_arrayElimCell_947 0) v_antiDerIndex_entry0_1))) .cse49)) .cse27) (or (and (forall ((v_arrayElimCell_945 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse145 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_942 Int)) (or (= .cse145 (select (store .cse2 v_arrayElimCell_942 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_941 Int)) (let ((.cse146 (store .cse4 v_arrayElimCell_941 0))) (or (= .cse145 (select (store .cse146 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse145 (select (store .cse146 v_arrayElimCell_942 0) v_antiDerIndex_entry0_1))))))) (= .cse145 (select (store (store .cse4 v_arrayElimCell_945 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_945 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse147 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse147 (select (store (store .cse4 v_arrayElimCell_945 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_941 Int)) (= .cse147 (select (store (store .cse4 v_arrayElimCell_941 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))) (or .cse52 .cse49) (forall ((v_arrayElimCell_945 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse148 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse148 (select (store (store .cse4 v_arrayElimCell_945 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_942 Int) (v_arrayElimCell_941 Int)) (let ((.cse149 (store .cse4 v_arrayElimCell_941 0))) (or (= .cse148 (select (store .cse149 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse148 (select (store .cse149 v_arrayElimCell_942 0) v_antiDerIndex_entry0_1))))))))) .cse36 .cse39) (or (forall ((v_arrayElimCell_945 Int) (v_arrayElimCell_947 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse150 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse151 (store .cse4 v_arrayElimCell_945 0))) (or (= .cse150 (select (store .cse151 v_arrayElimCell_947 0) v_antiDerIndex_entry0_1)) (= .cse150 (select (store .cse151 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) .cse49 .cse35) (or (forall ((v_arrayElimCell_945 Int) (v_arrayElimCell_947 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_942 Int) (v_arrayElimCell_941 Int)) (let ((.cse154 (store .cse4 v_arrayElimCell_941 0)) (.cse152 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse153 (store .cse4 v_arrayElimCell_945 0))) (or (= .cse152 (select (store .cse153 v_arrayElimCell_947 0) v_antiDerIndex_entry0_1)) (= .cse152 (select (store .cse154 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse152 (select (store .cse154 v_arrayElimCell_942 0) v_antiDerIndex_entry0_1)) (= .cse152 (select (store .cse153 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) .cse35) (or .cse35 (forall ((v_arrayElimCell_945 Int) (v_arrayElimCell_947 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_942 Int) (v_arrayElimCell_941 Int)) (let ((.cse157 (store .cse4 v_arrayElimCell_941 0)) (.cse155 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse156 (store .cse4 v_arrayElimCell_945 0))) (or (= .cse155 (select (store .cse156 v_arrayElimCell_947 0) v_antiDerIndex_entry0_1)) (= .cse155 (select (store .cse2 v_arrayElimCell_942 0) v_antiDerIndex_entry0_1)) (= .cse155 (select (store .cse157 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse155 (select (store .cse157 v_arrayElimCell_942 0) v_antiDerIndex_entry0_1)) (= .cse155 (select (store .cse156 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))))) (or .cse12 (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_942 Int) (v_arrayElimCell_941 Int) (v_arrayElimCell_944 Int) (v_arrayElimCell_943 Int)) (let ((.cse158 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse159 (store .cse4 v_arrayElimCell_941 0))) (or (= .cse158 (select .cse3 v_antiDerIndex_entry0_1)) (= .cse158 (select (store (store .cse4 v_arrayElimCell_943 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse158 (select (store .cse2 v_arrayElimCell_944 0) v_antiDerIndex_entry0_1)) (= .cse158 (select (store .cse159 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse158 (select (store .cse159 v_arrayElimCell_942 0) v_antiDerIndex_entry0_1)))))) (or .cse160 .cse5 .cse10) (or .cse36 .cse39 (and (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_942 Int) (v_arrayElimCell_941 Int) (v_arrayElimCell_943 Int)) (let ((.cse161 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse162 (store .cse4 v_arrayElimCell_941 0))) (or (= .cse161 (select (store .cse2 v_arrayElimCell_942 0) v_antiDerIndex_entry0_1)) (= .cse161 (select .cse3 v_antiDerIndex_entry0_1)) (= .cse161 (select (store (store .cse4 v_arrayElimCell_943 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse161 (select (store .cse162 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse161 (select (store .cse162 v_arrayElimCell_942 0) v_antiDerIndex_entry0_1))))) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_942 Int) (v_arrayElimCell_941 Int) (v_arrayElimCell_943 Int)) (let ((.cse163 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse164 (store .cse4 v_arrayElimCell_941 0))) (or (= .cse163 (select (store .cse2 v_arrayElimCell_942 0) v_antiDerIndex_entry0_1)) (= .cse163 (select .cse20 v_antiDerIndex_entry0_1)) (= .cse163 (select (store (store .cse4 v_arrayElimCell_943 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse163 (select (store .cse164 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse163 (select (store .cse164 v_arrayElimCell_942 0) v_antiDerIndex_entry0_1))))) (or (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_942 Int) (v_arrayElimCell_941 Int) (v_arrayElimCell_943 Int)) (let ((.cse165 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse165 (select (store .cse2 v_arrayElimCell_942 0) v_antiDerIndex_entry0_1)) (= .cse165 (select (store (store .cse4 v_arrayElimCell_943 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse165 (select (store (store .cse4 v_arrayElimCell_941 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) .cse10))) (or (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_942 Int) (v_arrayElimCell_941 Int) (v_arrayElimCell_944 Int) (v_arrayElimCell_943 Int)) (let ((.cse167 (store .cse4 v_arrayElimCell_943 0)) (.cse166 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse168 (store .cse4 v_arrayElimCell_941 0))) (or (= .cse166 (select .cse20 v_antiDerIndex_entry0_1)) (= .cse166 (select (store .cse167 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse166 (select (store .cse167 v_arrayElimCell_944 0) v_antiDerIndex_entry0_1)) (= .cse166 (select (store .cse168 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse166 (select (store .cse168 v_arrayElimCell_942 0) v_antiDerIndex_entry0_1))))) .cse36 .cse39) (or .cse100 .cse101 (and (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_941 Int) (v_arrayElimCell_943 Int)) (let ((.cse169 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse169 (select .cse20 v_antiDerIndex_entry0_1)) (= .cse169 (select (store (store .cse4 v_arrayElimCell_943 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse169 (select (store (store .cse4 v_arrayElimCell_941 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_941 Int) (v_arrayElimCell_944 Int) (v_arrayElimCell_943 Int)) (let ((.cse170 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse170 (select .cse3 v_antiDerIndex_entry0_1)) (= .cse170 (select (store (store .cse4 v_arrayElimCell_943 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse170 (select (store .cse2 v_arrayElimCell_944 0) v_antiDerIndex_entry0_1)) (= .cse170 (select (store (store .cse4 v_arrayElimCell_941 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (or (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_941 Int) (v_arrayElimCell_943 Int)) (let ((.cse171 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse171 (select (store (store .cse4 v_arrayElimCell_943 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse171 (select (store (store .cse4 v_arrayElimCell_941 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) .cse10) (or .cse24 (and (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_941 Int)) (let ((.cse172 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse172 (select .cse3 v_antiDerIndex_entry0_1)) (= .cse172 (select (store (store .cse4 v_arrayElimCell_941 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_941 Int)) (let ((.cse173 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse173 (select .cse20 v_antiDerIndex_entry0_1)) (= .cse173 (select (store (store .cse4 v_arrayElimCell_941 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))))) (or (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_941 Int) (v_arrayElimCell_944 Int) (v_arrayElimCell_943 Int)) (let ((.cse174 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse174 (select (store (store .cse4 v_arrayElimCell_943 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse174 (select (store .cse2 v_arrayElimCell_944 0) v_antiDerIndex_entry0_1)) (= .cse174 (select (store (store .cse4 v_arrayElimCell_941 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) .cse10) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_941 Int) (v_arrayElimCell_944 Int) (v_arrayElimCell_943 Int)) (let ((.cse176 (store .cse4 v_arrayElimCell_943 0)) (.cse175 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse175 (select .cse3 v_antiDerIndex_entry0_1)) (= .cse175 (select (store .cse176 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse175 (select (store .cse176 v_arrayElimCell_944 0) v_antiDerIndex_entry0_1)) (= .cse175 (select (store (store .cse4 v_arrayElimCell_941 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_941 Int) (v_arrayElimCell_943 Int)) (let ((.cse177 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse177 (select .cse3 v_antiDerIndex_entry0_1)) (= .cse177 (select (store (store .cse4 v_arrayElimCell_943 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse177 (select (store (store .cse4 v_arrayElimCell_941 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_941 Int) (v_arrayElimCell_944 Int) (v_arrayElimCell_943 Int)) (let ((.cse179 (store .cse4 v_arrayElimCell_943 0)) (.cse178 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse178 (select .cse20 v_antiDerIndex_entry0_1)) (= .cse178 (select (store .cse179 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse178 (select (store .cse179 v_arrayElimCell_944 0) v_antiDerIndex_entry0_1)) (= .cse178 (select (store (store .cse4 v_arrayElimCell_941 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_941 Int) (v_arrayElimCell_944 Int) (v_arrayElimCell_943 Int)) (let ((.cse180 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse180 (select .cse20 v_antiDerIndex_entry0_1)) (= .cse180 (select (store (store .cse4 v_arrayElimCell_943 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse180 (select (store .cse2 v_arrayElimCell_944 0) v_antiDerIndex_entry0_1)) (= .cse180 (select (store (store .cse4 v_arrayElimCell_941 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (or (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_941 Int) (v_arrayElimCell_944 Int) (v_arrayElimCell_943 Int)) (let ((.cse182 (store .cse4 v_arrayElimCell_943 0)) (.cse181 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse181 (select (store .cse182 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse181 (select (store .cse182 v_arrayElimCell_944 0) v_antiDerIndex_entry0_1)) (= .cse181 (select (store (store .cse4 v_arrayElimCell_941 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) .cse10))) (or .cse183 .cse73 .cse75) .cse184 (or (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_942 Int) (v_arrayElimCell_941 Int) (v_arrayElimCell_944 Int) (v_arrayElimCell_943 Int)) (let ((.cse185 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse185 (select (store .cse2 v_arrayElimCell_942 0) v_antiDerIndex_entry0_1)) (= .cse185 (select .cse3 v_antiDerIndex_entry0_1)) (= .cse185 (select (store .cse2 v_arrayElimCell_944 0) v_antiDerIndex_entry0_1)) (= .cse185 (select (store (store .cse4 v_arrayElimCell_943 0) v_arrayElimCell_944 0) v_antiDerIndex_entry0_1)) (= .cse185 (select (store (store .cse4 v_arrayElimCell_941 0) v_arrayElimCell_942 0) v_antiDerIndex_entry0_1))))) .cse5) (or .cse100 .cse101 (and (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_942 Int) (v_arrayElimCell_941 Int) (v_arrayElimCell_943 Int)) (let ((.cse186 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse186 (select .cse3 v_antiDerIndex_entry0_1)) (= .cse186 (select (store (store .cse4 v_arrayElimCell_943 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse186 (select (store (store .cse4 v_arrayElimCell_941 0) v_arrayElimCell_942 0) v_antiDerIndex_entry0_1)) (= .cse186 (select .cse2 v_antiDerIndex_entry0_1))))) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_942 Int) (v_arrayElimCell_941 Int) (v_arrayElimCell_943 Int)) (let ((.cse187 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse187 (select .cse20 v_antiDerIndex_entry0_1)) (= .cse187 (select (store (store .cse4 v_arrayElimCell_943 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse187 (select (store (store .cse4 v_arrayElimCell_941 0) v_arrayElimCell_942 0) v_antiDerIndex_entry0_1)) (= .cse187 (select .cse2 v_antiDerIndex_entry0_1))))) (or .cse188 .cse10))) (or (not .cse49) (and .cse0 (or .cse189 .cse5) (or .cse12 .cse190) (or .cse6 .cse191) (or .cse6 (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_942 Int) (v_arrayElimCell_941 Int) (v_arrayElimCell_944 Int) (v_arrayElimCell_943 Int)) (let ((.cse192 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse193 (store .cse4 v_arrayElimCell_941 0))) (or (= .cse192 (select (store .cse2 v_arrayElimCell_942 0) v_antiDerIndex_entry0_1)) (= .cse192 (select (store .cse2 v_arrayElimCell_944 0) v_antiDerIndex_entry0_1)) (= .cse192 (select (store (store .cse4 v_arrayElimCell_943 0) v_arrayElimCell_944 0) v_antiDerIndex_entry0_1)) (= .cse192 (select (store .cse193 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse192 (select (store .cse193 v_arrayElimCell_942 0) v_antiDerIndex_entry0_1)))))) (or .cse12 (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_942 Int) (v_arrayElimCell_941 Int)) (let ((.cse194 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse195 (store .cse4 v_arrayElimCell_941 0))) (or (= .cse194 (select (store .cse2 v_arrayElimCell_942 0) v_antiDerIndex_entry0_1)) (= .cse194 (select (store .cse195 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse194 (select (store .cse195 v_arrayElimCell_942 0) v_antiDerIndex_entry0_1))))) .cse24) (or .cse24 (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_942 Int) (v_arrayElimCell_941 Int)) (let ((.cse196 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse196 (select (store (store .cse4 v_arrayElimCell_941 0) v_arrayElimCell_942 0) v_antiDerIndex_entry0_1)) (= .cse196 (select .cse2 v_antiDerIndex_entry0_1)))))) .cse197 (or .cse100 .cse188 .cse101) (or .cse6 (and (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_942 Int) (v_arrayElimCell_941 Int)) (let ((.cse198 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse198 (select (store .cse2 v_arrayElimCell_942 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_944 Int) (v_arrayElimCell_943 Int)) (let ((.cse199 (store .cse4 v_arrayElimCell_943 0))) (or (= .cse198 (select (store .cse199 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse198 (select (store .cse199 v_arrayElimCell_944 0) v_antiDerIndex_entry0_1))))) (= .cse198 (select (store (store .cse4 v_arrayElimCell_941 0) v_arrayElimCell_942 0) v_antiDerIndex_entry0_1))))) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_942 Int) (v_arrayElimCell_941 Int)) (let ((.cse200 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse200 (select (store .cse2 v_arrayElimCell_942 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_944 Int) (v_arrayElimCell_943 Int)) (= .cse200 (select (store (store .cse4 v_arrayElimCell_943 0) v_arrayElimCell_944 0) v_antiDerIndex_entry0_1))) (= .cse200 (select (store (store .cse4 v_arrayElimCell_941 0) v_arrayElimCell_942 0) v_antiDerIndex_entry0_1))))))) (or .cse6 (and (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_944 Int) (v_arrayElimCell_943 Int)) (let ((.cse201 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse201 (select (store (store .cse4 v_arrayElimCell_943 0) v_arrayElimCell_944 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_942 Int) (v_arrayElimCell_941 Int)) (let ((.cse202 (store .cse4 v_arrayElimCell_941 0))) (or (= .cse201 (select (store .cse202 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse201 (select (store .cse202 v_arrayElimCell_942 0) v_antiDerIndex_entry0_1)))))))) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_944 Int) (v_arrayElimCell_943 Int)) (let ((.cse203 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse203 (select (store (store .cse4 v_arrayElimCell_943 0) v_arrayElimCell_944 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_942 Int) (v_arrayElimCell_941 Int)) (= .cse203 (select (store (store .cse4 v_arrayElimCell_941 0) v_arrayElimCell_942 0) v_antiDerIndex_entry0_1)))))))) (or .cse58 (and (or .cse24 (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_942 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store .cse2 v_arrayElimCell_942 0) v_antiDerIndex_entry0_1)))) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_942 Int)) (let ((.cse204 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse204 (select (store .cse2 v_arrayElimCell_942 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_944 Int) (v_arrayElimCell_943 Int)) (or (= .cse204 (select (store .cse2 v_arrayElimCell_944 0) v_antiDerIndex_entry0_1)) (= .cse204 (select (store (store .cse4 v_arrayElimCell_943 0) v_arrayElimCell_944 0) v_antiDerIndex_entry0_1))))))) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_942 Int)) (let ((.cse205 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse205 (select (store .cse2 v_arrayElimCell_942 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_943 Int)) (= .cse205 (select (store (store .cse4 v_arrayElimCell_943 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))) (forall ((v_arrayElimCell_944 Int)) (= .cse205 (select (store .cse2 v_arrayElimCell_944 0) v_antiDerIndex_entry0_1)))))) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_942 Int)) (let ((.cse206 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse206 (select (store .cse2 v_arrayElimCell_942 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_944 Int)) (= .cse206 (select (store .cse2 v_arrayElimCell_944 0) v_antiDerIndex_entry0_1))))))) .cse70) (or .cse207 .cse6) (or (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_942 Int) (v_arrayElimCell_941 Int)) (let ((.cse208 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse208 (select (store .cse2 v_arrayElimCell_942 0) v_antiDerIndex_entry0_1)) (= .cse208 (select (store (store .cse4 v_arrayElimCell_941 0) v_arrayElimCell_942 0) v_antiDerIndex_entry0_1))))) .cse24 .cse5) (or .cse12 (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_942 Int) (v_arrayElimCell_941 Int) (v_arrayElimCell_944 Int) (v_arrayElimCell_943 Int)) (let ((.cse209 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse210 (store .cse4 v_arrayElimCell_941 0))) (or (= .cse209 (select (store .cse2 v_arrayElimCell_942 0) v_antiDerIndex_entry0_1)) (= .cse209 (select (store (store .cse4 v_arrayElimCell_943 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse209 (select (store .cse2 v_arrayElimCell_944 0) v_antiDerIndex_entry0_1)) (= .cse209 (select (store .cse210 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse209 (select (store .cse210 v_arrayElimCell_942 0) v_antiDerIndex_entry0_1)))))) (or .cse6 (and (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_944 Int) (v_arrayElimCell_943 Int)) (let ((.cse211 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse211 (select (store .cse2 v_arrayElimCell_944 0) v_antiDerIndex_entry0_1)) (= .cse211 (select (store (store .cse4 v_arrayElimCell_943 0) v_arrayElimCell_944 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_942 Int) (v_arrayElimCell_941 Int)) (let ((.cse212 (store .cse4 v_arrayElimCell_941 0))) (or (= .cse211 (select (store .cse212 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse211 (select (store .cse212 v_arrayElimCell_942 0) v_antiDerIndex_entry0_1)))))))) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_944 Int) (v_arrayElimCell_943 Int)) (let ((.cse213 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse213 (select (store .cse2 v_arrayElimCell_944 0) v_antiDerIndex_entry0_1)) (= .cse213 (select (store (store .cse4 v_arrayElimCell_943 0) v_arrayElimCell_944 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_942 Int) (v_arrayElimCell_941 Int)) (= .cse213 (select (store (store .cse4 v_arrayElimCell_941 0) v_arrayElimCell_942 0) v_antiDerIndex_entry0_1)))))))) (or (and (or .cse12 (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_942 Int) (v_arrayElimCell_941 Int)) (let ((.cse214 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse215 (store .cse4 v_arrayElimCell_941 0))) (or (= .cse214 (select (store .cse215 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse214 (select (store .cse215 v_arrayElimCell_942 0) v_antiDerIndex_entry0_1)))))) (or .cse6 (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_942 Int) (v_arrayElimCell_941 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store (store .cse4 v_arrayElimCell_941 0) v_arrayElimCell_942 0) v_antiDerIndex_entry0_1))))) .cse24) (or .cse84 .cse36 .cse39) (or .cse216 .cse73 .cse75) (or .cse100 (and (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_941 Int)) (let ((.cse217 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_943 Int)) (= .cse217 (select (store (store .cse4 v_arrayElimCell_943 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))) (= .cse217 (select (store (store .cse4 v_arrayElimCell_941 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_944 Int)) (= .cse217 (select (store .cse2 v_arrayElimCell_944 0) v_antiDerIndex_entry0_1)))))) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_941 Int)) (let ((.cse218 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_943 Int)) (= .cse218 (select (store (store .cse4 v_arrayElimCell_943 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))) (= .cse218 (select (store (store .cse4 v_arrayElimCell_941 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_941 Int)) (let ((.cse219 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_944 Int) (v_arrayElimCell_943 Int)) (let ((.cse220 (store .cse4 v_arrayElimCell_943 0))) (or (= .cse219 (select (store .cse220 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse219 (select (store .cse220 v_arrayElimCell_944 0) v_antiDerIndex_entry0_1))))) (= .cse219 (select (store (store .cse4 v_arrayElimCell_941 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (or .cse24 (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_941 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store (store .cse4 v_arrayElimCell_941 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) .cse101) (or .cse58 .cse70 (and (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_944 Int)) (let ((.cse221 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse221 (select (store .cse2 v_arrayElimCell_944 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_942 Int) (v_arrayElimCell_941 Int)) (= .cse221 (select (store (store .cse4 v_arrayElimCell_941 0) v_arrayElimCell_942 0) v_antiDerIndex_entry0_1))) (= .cse221 (select .cse2 v_antiDerIndex_entry0_1))))) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_944 Int)) (let ((.cse222 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse222 (select (store .cse2 v_arrayElimCell_944 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_942 Int)) (or (= .cse222 (select (store .cse2 v_arrayElimCell_942 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_941 Int)) (= .cse222 (select (store (store .cse4 v_arrayElimCell_941 0) v_arrayElimCell_942 0) v_antiDerIndex_entry0_1))))) (= .cse222 (select .cse2 v_antiDerIndex_entry0_1))))))) (or .cse73 .cse223 .cse75) (or .cse216 .cse12) (or .cse12 .cse23) (or .cse6 (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_942 Int) (v_arrayElimCell_941 Int) (v_arrayElimCell_944 Int) (v_arrayElimCell_943 Int)) (let ((.cse224 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse225 (store .cse4 v_arrayElimCell_941 0))) (or (= .cse224 (select (store .cse2 v_arrayElimCell_942 0) v_antiDerIndex_entry0_1)) (= .cse224 (select (store (store .cse4 v_arrayElimCell_943 0) v_arrayElimCell_944 0) v_antiDerIndex_entry0_1)) (= .cse224 (select (store .cse225 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse224 (select (store .cse225 v_arrayElimCell_942 0) v_antiDerIndex_entry0_1)))))) (or .cse216 .cse5) (or .cse36 (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_942 Int) (v_arrayElimCell_941 Int) (v_arrayElimCell_943 Int)) (let ((.cse226 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse227 (store .cse4 v_arrayElimCell_941 0))) (or (= .cse226 (select (store .cse2 v_arrayElimCell_942 0) v_antiDerIndex_entry0_1)) (= .cse226 (select (store (store .cse4 v_arrayElimCell_943 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse226 (select (store .cse227 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse226 (select (store .cse227 v_arrayElimCell_942 0) v_antiDerIndex_entry0_1))))) .cse39) (or (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_942 Int) (v_arrayElimCell_941 Int) (v_arrayElimCell_944 Int) (v_arrayElimCell_943 Int)) (let ((.cse229 (store .cse4 v_arrayElimCell_943 0)) (.cse228 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse230 (store .cse4 v_arrayElimCell_941 0))) (or (= .cse228 (select (store .cse2 v_arrayElimCell_942 0) v_antiDerIndex_entry0_1)) (= .cse228 (select (store .cse229 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse228 (select (store .cse229 v_arrayElimCell_944 0) v_antiDerIndex_entry0_1)) (= .cse228 (select (store .cse230 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse228 (select (store .cse230 v_arrayElimCell_942 0) v_antiDerIndex_entry0_1))))) .cse12) (or .cse160 .cse5))) (or .cse12 .cse126) (or .cse12 (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_942 Int) (v_arrayElimCell_941 Int) (v_arrayElimCell_944 Int) (v_arrayElimCell_943 Int)) (let ((.cse232 (store .cse4 v_arrayElimCell_943 0)) (.cse231 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse233 (store .cse4 v_arrayElimCell_941 0))) (or (= .cse231 (select (store .cse2 v_arrayElimCell_942 0) v_antiDerIndex_entry0_1)) (= .cse231 (select .cse3 v_antiDerIndex_entry0_1)) (= .cse231 (select (store .cse232 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse231 (select (store .cse232 v_arrayElimCell_944 0) v_antiDerIndex_entry0_1)) (= .cse231 (select (store .cse233 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse231 (select (store .cse233 v_arrayElimCell_942 0) v_antiDerIndex_entry0_1)))))) (or .cse58 .cse70 (and .cse93 .cse183 .cse184)) (or .cse6 (and (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_942 Int) (v_arrayElimCell_941 Int) (v_arrayElimCell_944 Int) (v_arrayElimCell_943 Int)) (let ((.cse234 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse234 (select .cse3 v_antiDerIndex_entry0_1)) (= .cse234 (select (store (store .cse4 v_arrayElimCell_943 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse234 (select (store .cse2 v_arrayElimCell_944 0) v_antiDerIndex_entry0_1)) (= .cse234 (select (store (store .cse4 v_arrayElimCell_941 0) v_arrayElimCell_942 0) v_antiDerIndex_entry0_1))))) (or .cse207 .cse10))) (or .cse12 .cse190 .cse10) (or (and (or (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_942 Int) (v_arrayElimCell_941 Int)) (let ((.cse235 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse235 (select (store .cse2 v_arrayElimCell_942 0) v_antiDerIndex_entry0_1)) (= .cse235 (select .cse16 v_antiDerIndex_entry0_1)) (= .cse235 (select (store (store .cse4 v_arrayElimCell_941 0) v_arrayElimCell_942 0) v_antiDerIndex_entry0_1))))) .cse73 .cse75) (or .cse5 (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_942 Int) (v_arrayElimCell_941 Int)) (let ((.cse236 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse236 (select (store .cse2 v_arrayElimCell_942 0) v_antiDerIndex_entry0_1)) (= .cse236 (select .cse3 v_antiDerIndex_entry0_1)) (= .cse236 (select (store (store .cse4 v_arrayElimCell_941 0) v_arrayElimCell_942 0) v_antiDerIndex_entry0_1))))))) .cse24) (or (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_942 Int) (v_arrayElimCell_941 Int) (v_arrayElimCell_944 Int) (v_arrayElimCell_943 Int)) (let ((.cse237 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse238 (store .cse4 v_arrayElimCell_941 0))) (or (= .cse237 (select .cse20 v_antiDerIndex_entry0_1)) (= .cse237 (select (store (store .cse4 v_arrayElimCell_943 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse237 (select (store .cse2 v_arrayElimCell_944 0) v_antiDerIndex_entry0_1)) (= .cse237 (select (store .cse238 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse237 (select (store .cse238 v_arrayElimCell_942 0) v_antiDerIndex_entry0_1))))) .cse36 .cse39) (or (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_942 Int) (v_arrayElimCell_941 Int) (v_arrayElimCell_944 Int) (v_arrayElimCell_943 Int)) (let ((.cse240 (store .cse4 v_arrayElimCell_943 0)) (.cse239 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse241 (store .cse4 v_arrayElimCell_941 0))) (or (= .cse239 (select (store .cse2 v_arrayElimCell_942 0) v_antiDerIndex_entry0_1)) (= .cse239 (select .cse20 v_antiDerIndex_entry0_1)) (= .cse239 (select (store .cse240 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse239 (select (store .cse240 v_arrayElimCell_944 0) v_antiDerIndex_entry0_1)) (= .cse239 (select (store .cse241 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse239 (select (store .cse241 v_arrayElimCell_942 0) v_antiDerIndex_entry0_1))))) .cse36 .cse39) (or (and (forall ((v_arrayElimCell_947 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse242 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse242 (select (store .cse3 v_arrayElimCell_947 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_942 Int) (v_arrayElimCell_941 Int)) (let ((.cse243 (store .cse4 v_arrayElimCell_941 0))) (or (= .cse242 (select (store .cse243 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse242 (select (store .cse243 v_arrayElimCell_942 0) v_antiDerIndex_entry0_1)))))))) (or (forall ((v_arrayElimCell_947 Int) (v_antiDerIndex_entry0_1 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store .cse3 v_arrayElimCell_947 0) v_antiDerIndex_entry0_1))) .cse49) (forall ((v_arrayElimCell_947 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse244 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse244 (select (store .cse3 v_arrayElimCell_947 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_942 Int) (v_arrayElimCell_941 Int)) (= .cse244 (select (store (store .cse4 v_arrayElimCell_941 0) v_arrayElimCell_942 0) v_antiDerIndex_entry0_1)))))) (forall ((v_arrayElimCell_947 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse245 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_942 Int)) (or (= .cse245 (select (store .cse2 v_arrayElimCell_942 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_941 Int)) (let ((.cse246 (store .cse4 v_arrayElimCell_941 0))) (or (= .cse245 (select (store .cse246 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse245 (select (store .cse246 v_arrayElimCell_942 0) v_antiDerIndex_entry0_1))))))) (= .cse245 (select (store .cse3 v_arrayElimCell_947 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_947 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse247 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_942 Int) (v_arrayElimCell_941 Int)) (or (= .cse247 (select (store .cse2 v_arrayElimCell_942 0) v_antiDerIndex_entry0_1)) (= .cse247 (select (store (store .cse4 v_arrayElimCell_941 0) v_arrayElimCell_942 0) v_antiDerIndex_entry0_1)))) (= .cse247 (select (store .cse3 v_arrayElimCell_947 0) v_antiDerIndex_entry0_1)))))) .cse6 .cse24) (or .cse58 .cse183 .cse70) (or (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_942 Int) (v_arrayElimCell_941 Int) (v_arrayElimCell_944 Int) (v_arrayElimCell_943 Int)) (let ((.cse248 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse248 (select .cse20 v_antiDerIndex_entry0_1)) (= .cse248 (select (store (store .cse4 v_arrayElimCell_943 0) v_arrayElimCell_944 0) v_antiDerIndex_entry0_1)) (= .cse248 (select (store (store .cse4 v_arrayElimCell_941 0) v_arrayElimCell_942 0) v_antiDerIndex_entry0_1)) (= .cse248 (select .cse2 v_antiDerIndex_entry0_1))))) .cse36 .cse39) (or .cse216 .cse12 .cse10) (or .cse6 (and (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_942 Int) (v_arrayElimCell_941 Int) (v_arrayElimCell_944 Int) (v_arrayElimCell_943 Int)) (let ((.cse250 (store .cse4 v_arrayElimCell_943 0)) (.cse249 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse249 (select .cse3 v_antiDerIndex_entry0_1)) (= .cse249 (select (store .cse250 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse249 (select (store .cse250 v_arrayElimCell_944 0) v_antiDerIndex_entry0_1)) (= .cse249 (select (store (store .cse4 v_arrayElimCell_941 0) v_arrayElimCell_942 0) v_antiDerIndex_entry0_1))))) (or .cse191 .cse10))) (or .cse6 (and (or (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_942 Int) (v_arrayElimCell_941 Int) (v_arrayElimCell_944 Int) (v_arrayElimCell_943 Int)) (let ((.cse251 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse251 (select (store .cse2 v_arrayElimCell_942 0) v_antiDerIndex_entry0_1)) (= .cse251 (select (store .cse2 v_arrayElimCell_944 0) v_antiDerIndex_entry0_1)) (= .cse251 (select (store (store .cse4 v_arrayElimCell_943 0) v_arrayElimCell_944 0) v_antiDerIndex_entry0_1)) (= .cse251 (select (store (store .cse4 v_arrayElimCell_941 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) .cse10) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_942 Int) (v_arrayElimCell_941 Int) (v_arrayElimCell_944 Int) (v_arrayElimCell_943 Int)) (let ((.cse252 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse253 (store .cse4 v_arrayElimCell_941 0))) (or (= .cse252 (select (store .cse2 v_arrayElimCell_942 0) v_antiDerIndex_entry0_1)) (= .cse252 (select .cse3 v_antiDerIndex_entry0_1)) (= .cse252 (select (store .cse2 v_arrayElimCell_944 0) v_antiDerIndex_entry0_1)) (= .cse252 (select (store (store .cse4 v_arrayElimCell_943 0) v_arrayElimCell_944 0) v_antiDerIndex_entry0_1)) (= .cse252 (select (store .cse253 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse252 (select (store .cse253 v_arrayElimCell_942 0) v_antiDerIndex_entry0_1))))))) (or .cse6 (and .cse126 .cse254)) (or .cse24 (and (or (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_942 Int) (v_arrayElimCell_941 Int)) (let ((.cse255 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse256 (store .cse4 v_arrayElimCell_941 0))) (or (= .cse255 (select (store .cse2 v_arrayElimCell_942 0) v_antiDerIndex_entry0_1)) (= .cse255 (select .cse20 v_antiDerIndex_entry0_1)) (= .cse255 (select (store .cse256 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse255 (select (store .cse256 v_arrayElimCell_942 0) v_antiDerIndex_entry0_1))))) .cse36 .cse39) (or .cse12 (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_942 Int) (v_arrayElimCell_941 Int)) (let ((.cse257 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse258 (store .cse4 v_arrayElimCell_941 0))) (or (= .cse257 (select (store .cse2 v_arrayElimCell_942 0) v_antiDerIndex_entry0_1)) (= .cse257 (select .cse3 v_antiDerIndex_entry0_1)) (= .cse257 (select (store .cse258 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse257 (select (store .cse258 v_arrayElimCell_942 0) v_antiDerIndex_entry0_1)))))) (or .cse6 (and (forall ((v_antiDerIndex_entry0_1 Int)) (let ((.cse259 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse259 (select .cse3 v_antiDerIndex_entry0_1)) (= .cse259 (select .cse16 v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_942 Int)) (or (= .cse259 (select (store .cse2 v_arrayElimCell_942 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_941 Int)) (let ((.cse260 (store .cse4 v_arrayElimCell_941 0))) (or (= .cse259 (select (store .cse260 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse259 (select (store .cse260 v_arrayElimCell_942 0) v_antiDerIndex_entry0_1)))))))))) (forall ((v_antiDerIndex_entry0_1 Int)) (let ((.cse261 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse261 (select .cse3 v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_942 Int)) (or (= .cse261 (select (store .cse2 v_arrayElimCell_942 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_941 Int)) (let ((.cse262 (store .cse4 v_arrayElimCell_941 0))) (or (= .cse261 (select (store .cse262 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse261 (select (store .cse262 v_arrayElimCell_942 0) v_antiDerIndex_entry0_1)))))))))))))) (or (and (or .cse223 .cse10) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_942 Int) (v_arrayElimCell_941 Int) (v_arrayElimCell_944 Int)) (let ((.cse263 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse263 (select (store .cse2 v_arrayElimCell_942 0) v_antiDerIndex_entry0_1)) (= .cse263 (select .cse3 v_antiDerIndex_entry0_1)) (= .cse263 (select (store .cse2 v_arrayElimCell_944 0) v_antiDerIndex_entry0_1)) (= .cse263 (select (store (store .cse4 v_arrayElimCell_941 0) v_arrayElimCell_942 0) v_antiDerIndex_entry0_1))))) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_942 Int) (v_arrayElimCell_941 Int) (v_arrayElimCell_944 Int)) (let ((.cse264 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse264 (select (store .cse2 v_arrayElimCell_942 0) v_antiDerIndex_entry0_1)) (= .cse264 (select (store .cse2 v_arrayElimCell_944 0) v_antiDerIndex_entry0_1)) (= .cse264 (select .cse16 v_antiDerIndex_entry0_1)) (= .cse264 (select (store (store .cse4 v_arrayElimCell_941 0) v_arrayElimCell_942 0) v_antiDerIndex_entry0_1)))))) .cse73 .cse75) (or .cse216 .cse5 .cse10) (or .cse100 (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_942 Int) (v_arrayElimCell_941 Int) (v_arrayElimCell_944 Int) (v_arrayElimCell_943 Int)) (let ((.cse265 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse265 (select .cse20 v_antiDerIndex_entry0_1)) (= .cse265 (select (store (store .cse4 v_arrayElimCell_943 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse265 (select (store .cse2 v_arrayElimCell_944 0) v_antiDerIndex_entry0_1)) (= .cse265 (select (store (store .cse4 v_arrayElimCell_941 0) v_arrayElimCell_942 0) v_antiDerIndex_entry0_1)) (= .cse265 (select .cse2 v_antiDerIndex_entry0_1))))) .cse101) (or .cse189 .cse5 .cse10) (or .cse58 (and (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_942 Int) (v_arrayElimCell_941 Int) (v_arrayElimCell_944 Int)) (let ((.cse266 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse266 (select .cse3 v_antiDerIndex_entry0_1)) (= .cse266 (select (store .cse2 v_arrayElimCell_944 0) v_antiDerIndex_entry0_1)) (= .cse266 (select (store (store .cse4 v_arrayElimCell_941 0) v_arrayElimCell_942 0) v_antiDerIndex_entry0_1)) (= .cse266 (select .cse2 v_antiDerIndex_entry0_1))))) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_942 Int) (v_arrayElimCell_941 Int) (v_arrayElimCell_944 Int)) (let ((.cse267 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse267 (select (store .cse2 v_arrayElimCell_944 0) v_antiDerIndex_entry0_1)) (= .cse267 (select .cse16 v_antiDerIndex_entry0_1)) (= .cse267 (select (store (store .cse4 v_arrayElimCell_941 0) v_arrayElimCell_942 0) v_antiDerIndex_entry0_1)) (= .cse267 (select .cse2 v_antiDerIndex_entry0_1))))) (or (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_942 Int) (v_arrayElimCell_941 Int) (v_arrayElimCell_944 Int)) (let ((.cse268 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse268 (select (store .cse2 v_arrayElimCell_944 0) v_antiDerIndex_entry0_1)) (= .cse268 (select (store (store .cse4 v_arrayElimCell_941 0) v_arrayElimCell_942 0) v_antiDerIndex_entry0_1)) (= .cse268 (select .cse2 v_antiDerIndex_entry0_1))))) .cse10)) .cse70) (or .cse24 (let ((.cse273 (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_942 Int) (v_arrayElimCell_941 Int)) (let ((.cse276 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse277 (store .cse4 v_arrayElimCell_941 0))) (or (= .cse276 (select .cse3 v_antiDerIndex_entry0_1)) (= .cse276 (select (store .cse277 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse276 (select (store .cse277 v_arrayElimCell_942 0) v_antiDerIndex_entry0_1)))))) (.cse269 (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_942 Int) (v_arrayElimCell_941 Int)) (let ((.cse275 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse275 (select .cse3 v_antiDerIndex_entry0_1)) (= .cse275 (select .cse16 v_antiDerIndex_entry0_1)) (= .cse275 (select (store (store .cse4 v_arrayElimCell_941 0) v_arrayElimCell_942 0) v_antiDerIndex_entry0_1))))))) (and (or .cse6 (and .cse269 (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_942 Int) (v_arrayElimCell_941 Int)) (let ((.cse270 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse270 (select .cse20 v_antiDerIndex_entry0_1)) (= .cse270 (select .cse3 v_antiDerIndex_entry0_1)) (= .cse270 (select (store (store .cse4 v_arrayElimCell_941 0) v_arrayElimCell_942 0) v_antiDerIndex_entry0_1))))))) (or (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_942 Int) (v_arrayElimCell_941 Int)) (let ((.cse271 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse272 (store .cse4 v_arrayElimCell_941 0))) (or (= .cse271 (select .cse20 v_antiDerIndex_entry0_1)) (= .cse271 (select (store .cse272 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse271 (select (store .cse272 v_arrayElimCell_942 0) v_antiDerIndex_entry0_1))))) .cse36 .cse39) (or .cse273 .cse12) (or .cse6 (and .cse273 .cse269 (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_942 Int) (v_arrayElimCell_941 Int)) (let ((.cse274 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse274 (select .cse3 v_antiDerIndex_entry0_1)) (= .cse274 (select (store (store .cse4 v_arrayElimCell_941 0) v_arrayElimCell_942 0) v_antiDerIndex_entry0_1)))))))))) (or (and .cse126 .cse254 .cse74) .cse73 .cse75) (or (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_942 Int) (v_arrayElimCell_941 Int) (v_arrayElimCell_944 Int) (v_arrayElimCell_943 Int)) (let ((.cse278 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse279 (store .cse4 v_arrayElimCell_941 0))) (or (= .cse278 (select (store .cse2 v_arrayElimCell_942 0) v_antiDerIndex_entry0_1)) (= .cse278 (select .cse20 v_antiDerIndex_entry0_1)) (= .cse278 (select (store (store .cse4 v_arrayElimCell_943 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse278 (select (store .cse2 v_arrayElimCell_944 0) v_antiDerIndex_entry0_1)) (= .cse278 (select (store .cse279 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse278 (select (store .cse279 v_arrayElimCell_942 0) v_antiDerIndex_entry0_1))))) .cse36 .cse39)))))) is different from false [2022-11-03 04:12:25,808 WARN L234 SmtUtils]: Spent 52.56s on a formula simplification. DAG size of input: 310 DAG size of output: 66 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-03 04:12:44,269 WARN L234 SmtUtils]: Spent 16.10s on a formula simplification that was a NOOP. DAG size: 66 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-03 04:12:47,598 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2022-11-03 04:12:47,598 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1303278237] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 04:12:47,598 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [681815247] [2022-11-03 04:12:47,600 INFO L159 IcfgInterpreter]: Started Sifa with 26 locations of interest [2022-11-03 04:12:47,600 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 04:12:47,600 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 04:12:47,600 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 04:12:47,601 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 04:12:47,616 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 04:12:47,633 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 04:12:47,640 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 04:12:47,654 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:12:47,655 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-03 04:12:47,662 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:12:47,663 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-03 04:12:47,680 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:12:47,681 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 [2022-11-03 04:12:47,704 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:12:47,705 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:12:47,706 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 28 treesize of output 30 [2022-11-03 04:12:47,717 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:12:47,718 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:12:47,719 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 28 treesize of output 30 [2022-11-03 04:12:47,740 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:12:47,741 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:12:47,746 INFO L356 Elim1Store]: treesize reduction 27, result has 3.6 percent of original size [2022-11-03 04:12:47,746 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 86 treesize of output 61 [2022-11-03 04:12:47,757 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:12:47,758 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:12:47,759 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 33 [2022-11-03 04:12:47,784 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:12:47,785 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:12:47,787 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:12:47,787 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2022-11-03 04:12:47,831 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:12:47,832 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:12:47,833 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:12:47,862 INFO L356 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2022-11-03 04:12:47,863 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 297 treesize of output 292 [2022-11-03 04:12:47,874 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:12:47,876 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:12:47,876 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:12:47,904 INFO L356 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2022-11-03 04:12:47,904 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 297 treesize of output 292 [2022-11-03 04:12:47,963 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:12:47,964 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:12:47,965 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:12:47,966 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:12:47,967 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:12:47,967 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:12:47,997 INFO L356 Elim1Store]: treesize reduction 39, result has 25.0 percent of original size [2022-11-03 04:12:47,997 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 414 treesize of output 355 [2022-11-03 04:12:48,014 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:12:48,015 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:12:48,015 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:12:48,016 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:12:48,088 INFO L356 Elim1Store]: treesize reduction 154, result has 18.5 percent of original size [2022-11-03 04:12:48,088 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 9 case distinctions, treesize of input 399 treesize of output 372 [2022-11-03 04:12:48,158 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:12:48,159 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:12:48,180 INFO L356 Elim1Store]: treesize reduction 47, result has 9.6 percent of original size [2022-11-03 04:12:48,181 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 361 treesize of output 357 [2022-11-03 04:12:48,266 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:12:48,267 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:12:48,268 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:12:48,295 INFO L356 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2022-11-03 04:12:48,295 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 297 treesize of output 292 [2022-11-03 04:12:48,307 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:12:48,308 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:12:48,309 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:12:48,336 INFO L356 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2022-11-03 04:12:48,337 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 297 treesize of output 292 [2022-11-03 04:12:48,397 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:12:48,398 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:12:48,399 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:12:48,400 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:12:48,401 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:12:48,402 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:12:48,430 INFO L356 Elim1Store]: treesize reduction 39, result has 25.0 percent of original size [2022-11-03 04:12:48,430 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 414 treesize of output 355 [2022-11-03 04:12:48,446 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:12:48,447 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:12:48,448 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:12:48,448 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:12:48,509 INFO L356 Elim1Store]: treesize reduction 154, result has 18.5 percent of original size [2022-11-03 04:12:48,510 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 9 case distinctions, treesize of input 399 treesize of output 372 [2022-11-03 04:12:48,608 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 04:12:48,614 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 04:12:48,637 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:12:48,638 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 04:12:48,649 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:12:48,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, 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 04:12:48,736 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:12:48,751 INFO L356 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-11-03 04:12:48,751 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 22 treesize of output 21 [2022-11-03 04:12:48,813 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:12:48,835 INFO L356 Elim1Store]: treesize reduction 14, result has 50.0 percent of original size [2022-11-03 04:12:48,835 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 36 [2022-11-03 04:12:48,945 INFO L356 Elim1Store]: treesize reduction 36, result has 42.9 percent of original size [2022-11-03 04:12:48,945 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 26 treesize of output 45 [2022-11-03 04:12:49,041 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:12:49,042 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:12:49,065 INFO L356 Elim1Store]: treesize reduction 49, result has 5.8 percent of original size [2022-11-03 04:12:49,066 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 674 treesize of output 654 [2022-11-03 04:12:49,155 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 04:12:58,442 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '9087#(and (= |ULTIMATE.start__destroy_in_nondeterministic_order_#in~head#1.base| |ULTIMATE.start_dll_circular_create_#res#1.base|) (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset|)) (< |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base| |#StackHeapBarrier|) (= (select |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base|) 0) (<= 1 |ULTIMATE.start_dll_circular_create_~len#1|) (= |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base|) (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 4))) (= |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.offset| 0) (= |ULTIMATE.start_dll_circular_create_#res#1.offset| |ULTIMATE.start__destroy_in_nondeterministic_order_#in~head#1.offset|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base|) |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|) |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base|) (not (= |ULTIMATE.start_main_old_#valid#1| |#valid|)) (= |ULTIMATE.start_dll_circular_create_#res#1.offset| |ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (< |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base| |#StackHeapBarrier|) (= |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 0) (<= |#NULL.offset| 0) (= |ULTIMATE.start__destroy_in_nondeterministic_order_#in~head#1.base| |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4)) |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (<= 3 |ULTIMATE.start_dll_circular_create_#in~len#1|) (= |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.offset| 0) (<= (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 8) (select |#length| |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base|)) (or (= |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base| 0) (and (not (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base|)) (not (= |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|)))) (<= (+ |ULTIMATE.start_dll_circular_create_~last~0#1.offset| 4) (select |#length| |ULTIMATE.start_dll_circular_create_~last~0#1.base|)) (< |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base| |#StackHeapBarrier|) (<= |ULTIMATE.start_dll_circular_create_#in~len#1| 3) (= |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| |ULTIMATE.start__destroy_in_nondeterministic_order_#in~head#1.offset|) (= |ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset|) |ULTIMATE.start_dll_circular_create_~head~0#1.base|) (<= |ULTIMATE.start_main_~len~0#1| 3) (= |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base|) |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|)) (= 0 (select |#valid| |ULTIMATE.start_dll_circular_create_~last~0#1.base|)) (<= 0 |#NULL.offset|) (<= |ULTIMATE.start_dll_circular_create_~len#1| 1) (<= 3 |ULTIMATE.start_main_~len~0#1|) (= |ULTIMATE.start_main_~head~1#1.offset| 0) (<= 0 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~head~1#1.base| 0) (= |ULTIMATE.start_dll_circular_create_#res#1.base| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base|) (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 4)) |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base|) (= |ULTIMATE.start_main_#res#1| 0) (= |#NULL.base| 0))' at error location [2022-11-03 04:12:58,442 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-03 04:12:58,442 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 04:12:58,442 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 13, 14] total 42 [2022-11-03 04:12:58,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202376337] [2022-11-03 04:12:58,442 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 04:12:58,443 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2022-11-03 04:12:58,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:12:58,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2022-11-03 04:12:58,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=235, Invalid=3541, Unknown=22, NotChecked=492, Total=4290 [2022-11-03 04:12:58,445 INFO L87 Difference]: Start difference. First operand 70 states and 74 transitions. Second operand has 44 states, 43 states have (on average 1.9767441860465116) internal successors, (85), 43 states have internal predecessors, (85), 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 04:18:37,334 WARN L234 SmtUtils]: Spent 5.63m on a formula simplification. DAG size of input: 709 DAG size of output: 85 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)