./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-simple/sll2c_prepend_equal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01bfce65-57b1-4fc4-8549-4cb4a09416c4/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01bfce65-57b1-4fc4-8549-4cb4a09416c4/bin/uautomizer-uyxdKDjOR8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01bfce65-57b1-4fc4-8549-4cb4a09416c4/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01bfce65-57b1-4fc4-8549-4cb4a09416c4/bin/uautomizer-uyxdKDjOR8/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/sll2c_prepend_equal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01bfce65-57b1-4fc4-8549-4cb4a09416c4/bin/uautomizer-uyxdKDjOR8/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01bfce65-57b1-4fc4-8549-4cb4a09416c4/bin/uautomizer-uyxdKDjOR8 --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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f682d6a9f9df80cf11b356f08ea6be5ab5adaf1b414fc8a476877af8610cc552 --- 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-2329fc7 [2022-12-13 18:35:48,340 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 18:35:48,341 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 18:35:48,355 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 18:35:48,356 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 18:35:48,356 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 18:35:48,357 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 18:35:48,358 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 18:35:48,360 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 18:35:48,360 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 18:35:48,361 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 18:35:48,362 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 18:35:48,362 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 18:35:48,363 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 18:35:48,364 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 18:35:48,364 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 18:35:48,365 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 18:35:48,365 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 18:35:48,367 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 18:35:48,368 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 18:35:48,369 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 18:35:48,370 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 18:35:48,372 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 18:35:48,372 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 18:35:48,376 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 18:35:48,377 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 18:35:48,377 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 18:35:48,378 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 18:35:48,378 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 18:35:48,379 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 18:35:48,380 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 18:35:48,380 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 18:35:48,381 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 18:35:48,382 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 18:35:48,383 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 18:35:48,383 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 18:35:48,384 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 18:35:48,384 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 18:35:48,384 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 18:35:48,385 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 18:35:48,386 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 18:35:48,387 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01bfce65-57b1-4fc4-8549-4cb4a09416c4/bin/uautomizer-uyxdKDjOR8/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-12-13 18:35:48,409 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 18:35:48,410 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 18:35:48,410 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 18:35:48,410 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 18:35:48,411 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 18:35:48,411 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 18:35:48,411 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 18:35:48,412 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 18:35:48,412 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 18:35:48,412 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 18:35:48,412 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 18:35:48,413 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-12-13 18:35:48,413 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 18:35:48,413 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 18:35:48,413 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 18:35:48,413 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-12-13 18:35:48,413 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-12-13 18:35:48,414 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-12-13 18:35:48,414 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 18:35:48,414 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-12-13 18:35:48,414 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 18:35:48,414 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 18:35:48,415 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 18:35:48,415 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 18:35:48,415 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 18:35:48,415 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 18:35:48,415 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 18:35:48,416 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 18:35:48,416 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 18:35:48,416 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 18:35:48,416 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 18:35:48,416 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 18:35:48,416 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 18:35:48,417 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 18:35:48,417 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_01bfce65-57b1-4fc4-8549-4cb4a09416c4/bin/uautomizer-uyxdKDjOR8/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_01bfce65-57b1-4fc4-8549-4cb4a09416c4/bin/uautomizer-uyxdKDjOR8 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 -> Automizer 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 -> f682d6a9f9df80cf11b356f08ea6be5ab5adaf1b414fc8a476877af8610cc552 [2022-12-13 18:35:48,579 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 18:35:48,597 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 18:35:48,599 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 18:35:48,600 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 18:35:48,600 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 18:35:48,601 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01bfce65-57b1-4fc4-8549-4cb4a09416c4/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/list-simple/sll2c_prepend_equal.i [2022-12-13 18:35:51,216 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 18:35:51,363 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 18:35:51,364 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01bfce65-57b1-4fc4-8549-4cb4a09416c4/sv-benchmarks/c/list-simple/sll2c_prepend_equal.i [2022-12-13 18:35:51,372 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01bfce65-57b1-4fc4-8549-4cb4a09416c4/bin/uautomizer-uyxdKDjOR8/data/cf487c2ba/b9dbc65e41754693b8d37cb5a87ed5bd/FLAG60c5806f5 [2022-12-13 18:35:51,382 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01bfce65-57b1-4fc4-8549-4cb4a09416c4/bin/uautomizer-uyxdKDjOR8/data/cf487c2ba/b9dbc65e41754693b8d37cb5a87ed5bd [2022-12-13 18:35:51,384 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 18:35:51,385 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 18:35:51,386 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 18:35:51,386 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 18:35:51,389 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 18:35:51,389 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 06:35:51" (1/1) ... [2022-12-13 18:35:51,390 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50cfb8b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:35:51, skipping insertion in model container [2022-12-13 18:35:51,390 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 06:35:51" (1/1) ... [2022-12-13 18:35:51,395 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 18:35:51,415 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 18:35:51,602 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01bfce65-57b1-4fc4-8549-4cb4a09416c4/sv-benchmarks/c/list-simple/sll2c_prepend_equal.i[24458,24471] [2022-12-13 18:35:51,604 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 18:35:51,611 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 18:35:51,640 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01bfce65-57b1-4fc4-8549-4cb4a09416c4/sv-benchmarks/c/list-simple/sll2c_prepend_equal.i[24458,24471] [2022-12-13 18:35:51,640 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 18:35:51,659 INFO L208 MainTranslator]: Completed translation [2022-12-13 18:35:51,659 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:35:51 WrapperNode [2022-12-13 18:35:51,659 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 18:35:51,660 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 18:35:51,660 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 18:35:51,660 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 18:35:51,666 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:35:51" (1/1) ... [2022-12-13 18:35:51,675 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:35:51" (1/1) ... [2022-12-13 18:35:51,691 INFO L138 Inliner]: procedures = 127, calls = 43, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 143 [2022-12-13 18:35:51,691 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 18:35:51,692 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 18:35:51,692 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 18:35:51,692 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 18:35:51,699 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:35:51" (1/1) ... [2022-12-13 18:35:51,700 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:35:51" (1/1) ... [2022-12-13 18:35:51,702 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:35:51" (1/1) ... [2022-12-13 18:35:51,702 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:35:51" (1/1) ... [2022-12-13 18:35:51,707 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:35:51" (1/1) ... [2022-12-13 18:35:51,710 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:35:51" (1/1) ... [2022-12-13 18:35:51,711 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:35:51" (1/1) ... [2022-12-13 18:35:51,712 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:35:51" (1/1) ... [2022-12-13 18:35:51,714 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 18:35:51,714 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 18:35:51,714 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 18:35:51,714 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 18:35:51,715 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:35:51" (1/1) ... [2022-12-13 18:35:51,720 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 18:35:51,727 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01bfce65-57b1-4fc4-8549-4cb4a09416c4/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 18:35:51,738 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01bfce65-57b1-4fc4-8549-4cb4a09416c4/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 18:35:51,740 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01bfce65-57b1-4fc4-8549-4cb4a09416c4/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 18:35:51,764 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-13 18:35:51,764 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 18:35:51,764 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2022-12-13 18:35:51,765 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2022-12-13 18:35:51,765 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-13 18:35:51,765 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 18:35:51,765 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 18:35:51,765 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-12-13 18:35:51,765 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-12-13 18:35:51,765 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 18:35:51,765 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-12-13 18:35:51,766 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 18:35:51,766 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 18:35:51,766 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 18:35:51,865 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 18:35:51,867 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 18:35:52,176 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 18:35:52,183 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 18:35:52,183 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2022-12-13 18:35:52,185 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 06:35:52 BoogieIcfgContainer [2022-12-13 18:35:52,185 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 18:35:52,188 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 18:35:52,188 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 18:35:52,192 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 18:35:52,192 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 06:35:51" (1/3) ... [2022-12-13 18:35:52,193 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12a6846b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 06:35:52, skipping insertion in model container [2022-12-13 18:35:52,193 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:35:51" (2/3) ... [2022-12-13 18:35:52,193 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12a6846b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 06:35:52, skipping insertion in model container [2022-12-13 18:35:52,194 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 06:35:52" (3/3) ... [2022-12-13 18:35:52,195 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2c_prepend_equal.i [2022-12-13 18:35:52,214 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 18:35:52,215 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 52 error locations. [2022-12-13 18:35:52,256 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 18:35:52,261 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=PETRI_NET, 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;@bb0d580, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 18:35:52,261 INFO L358 AbstractCegarLoop]: Starting to check reachability of 52 error locations. [2022-12-13 18:35:52,264 INFO L276 IsEmpty]: Start isEmpty. Operand has 119 states, 62 states have (on average 2.0483870967741935) internal successors, (127), 114 states have internal predecessors, (127), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-13 18:35:52,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-12-13 18:35:52,269 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:35:52,270 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-12-13 18:35:52,270 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-12-13 18:35:52,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:35:52,274 INFO L85 PathProgramCache]: Analyzing trace with hash 895152213, now seen corresponding path program 1 times [2022-12-13 18:35:52,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:35:52,281 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819423453] [2022-12-13 18:35:52,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:35:52,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:35:52,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:35:52,491 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 18:35:52,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:35:52,491 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819423453] [2022-12-13 18:35:52,492 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [819423453] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:35:52,492 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:35:52,492 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 18:35:52,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459583777] [2022-12-13 18:35:52,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:35:52,497 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 18:35:52,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:35:52,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 18:35:52,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 18:35:52,521 INFO L87 Difference]: Start difference. First operand has 119 states, 62 states have (on average 2.0483870967741935) internal successors, (127), 114 states have internal predecessors, (127), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:35:52,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:35:52,619 INFO L93 Difference]: Finished difference Result 117 states and 126 transitions. [2022-12-13 18:35:52,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 18:35:52,621 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-12-13 18:35:52,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:35:52,627 INFO L225 Difference]: With dead ends: 117 [2022-12-13 18:35:52,627 INFO L226 Difference]: Without dead ends: 114 [2022-12-13 18:35:52,628 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-12-13 18:35:52,630 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 8 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 18:35:52,631 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 183 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 18:35:52,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2022-12-13 18:35:52,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2022-12-13 18:35:52,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 60 states have (on average 1.9333333333333333) internal successors, (116), 109 states have internal predecessors, (116), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-13 18:35:52,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 122 transitions. [2022-12-13 18:35:52,661 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 122 transitions. Word has length 6 [2022-12-13 18:35:52,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:35:52,662 INFO L495 AbstractCegarLoop]: Abstraction has 114 states and 122 transitions. [2022-12-13 18:35:52,662 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:35:52,662 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 122 transitions. [2022-12-13 18:35:52,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-12-13 18:35:52,662 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:35:52,662 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-12-13 18:35:52,662 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 18:35:52,663 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-12-13 18:35:52,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:35:52,663 INFO L85 PathProgramCache]: Analyzing trace with hash 895152214, now seen corresponding path program 1 times [2022-12-13 18:35:52,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:35:52,664 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113374550] [2022-12-13 18:35:52,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:35:52,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:35:52,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:35:52,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 18:35:52,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:35:52,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113374550] [2022-12-13 18:35:52,735 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2113374550] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:35:52,735 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:35:52,735 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 18:35:52,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151319479] [2022-12-13 18:35:52,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:35:52,736 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 18:35:52,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:35:52,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 18:35:52,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 18:35:52,737 INFO L87 Difference]: Start difference. First operand 114 states and 122 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:35:52,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:35:52,802 INFO L93 Difference]: Finished difference Result 112 states and 120 transitions. [2022-12-13 18:35:52,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 18:35:52,803 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-12-13 18:35:52,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:35:52,803 INFO L225 Difference]: With dead ends: 112 [2022-12-13 18:35:52,804 INFO L226 Difference]: Without dead ends: 112 [2022-12-13 18:35:52,804 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-12-13 18:35:52,804 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 4 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 18:35:52,805 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 185 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 18:35:52,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2022-12-13 18:35:52,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2022-12-13 18:35:52,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 60 states have (on average 1.9) internal successors, (114), 107 states have internal predecessors, (114), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-13 18:35:52,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 120 transitions. [2022-12-13 18:35:52,810 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 120 transitions. Word has length 6 [2022-12-13 18:35:52,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:35:52,810 INFO L495 AbstractCegarLoop]: Abstraction has 112 states and 120 transitions. [2022-12-13 18:35:52,810 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:35:52,811 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 120 transitions. [2022-12-13 18:35:52,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-12-13 18:35:52,811 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:35:52,811 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:35:52,811 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 18:35:52,811 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-12-13 18:35:52,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:35:52,812 INFO L85 PathProgramCache]: Analyzing trace with hash 972366423, now seen corresponding path program 1 times [2022-12-13 18:35:52,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:35:52,812 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978022431] [2022-12-13 18:35:52,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:35:52,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:35:52,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:35:52,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 18:35:52,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:35:52,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 18:35:52,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:35:52,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978022431] [2022-12-13 18:35:52,899 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1978022431] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:35:52,899 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:35:52,899 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 18:35:52,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958433227] [2022-12-13 18:35:52,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:35:52,900 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 18:35:52,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:35:52,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 18:35:52,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 18:35:52,901 INFO L87 Difference]: Start difference. First operand 112 states and 120 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-13 18:35:53,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:35:53,000 INFO L93 Difference]: Finished difference Result 119 states and 128 transitions. [2022-12-13 18:35:53,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 18:35:53,000 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-12-13 18:35:53,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:35:53,001 INFO L225 Difference]: With dead ends: 119 [2022-12-13 18:35:53,001 INFO L226 Difference]: Without dead ends: 119 [2022-12-13 18:35:53,001 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 18:35:53,002 INFO L413 NwaCegarLoop]: 118 mSDtfsCounter, 5 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 18:35:53,003 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 275 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 18:35:53,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2022-12-13 18:35:53,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 113. [2022-12-13 18:35:53,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 61 states have (on average 1.8852459016393444) internal successors, (115), 108 states have internal predecessors, (115), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-13 18:35:53,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 121 transitions. [2022-12-13 18:35:53,010 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 121 transitions. Word has length 13 [2022-12-13 18:35:53,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:35:53,010 INFO L495 AbstractCegarLoop]: Abstraction has 113 states and 121 transitions. [2022-12-13 18:35:53,010 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-13 18:35:53,010 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 121 transitions. [2022-12-13 18:35:53,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-12-13 18:35:53,011 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:35:53,011 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:35:53,011 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 18:35:53,011 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-12-13 18:35:53,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:35:53,011 INFO L85 PathProgramCache]: Analyzing trace with hash -1029573860, now seen corresponding path program 1 times [2022-12-13 18:35:53,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:35:53,011 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75121407] [2022-12-13 18:35:53,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:35:53,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:35:53,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:35:53,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 18:35:53,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:35:53,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 18:35:53,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:35:53,151 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-13 18:35:53,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:35:53,151 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75121407] [2022-12-13 18:35:53,151 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [75121407] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:35:53,151 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:35:53,151 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 18:35:53,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293239280] [2022-12-13 18:35:53,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:35:53,152 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 18:35:53,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:35:53,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 18:35:53,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-13 18:35:53,153 INFO L87 Difference]: Start difference. First operand 113 states and 121 transitions. Second operand has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-13 18:35:53,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:35:53,341 INFO L93 Difference]: Finished difference Result 113 states and 122 transitions. [2022-12-13 18:35:53,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 18:35:53,341 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2022-12-13 18:35:53,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:35:53,343 INFO L225 Difference]: With dead ends: 113 [2022-12-13 18:35:53,343 INFO L226 Difference]: Without dead ends: 113 [2022-12-13 18:35:53,344 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-12-13 18:35:53,345 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 13 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 387 SdHoareTripleChecker+Invalid, 322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 18:35:53,346 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 387 Invalid, 322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 320 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 18:35:53,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2022-12-13 18:35:53,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 112. [2022-12-13 18:35:53,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 61 states have (on average 1.8688524590163935) internal successors, (114), 107 states have internal predecessors, (114), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-13 18:35:53,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 120 transitions. [2022-12-13 18:35:53,353 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 120 transitions. Word has length 22 [2022-12-13 18:35:53,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:35:53,353 INFO L495 AbstractCegarLoop]: Abstraction has 112 states and 120 transitions. [2022-12-13 18:35:53,353 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-13 18:35:53,353 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 120 transitions. [2022-12-13 18:35:53,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-12-13 18:35:53,354 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:35:53,354 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:35:53,354 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 18:35:53,354 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-12-13 18:35:53,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:35:53,355 INFO L85 PathProgramCache]: Analyzing trace with hash -1029573859, now seen corresponding path program 1 times [2022-12-13 18:35:53,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:35:53,355 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947763630] [2022-12-13 18:35:53,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:35:53,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:35:53,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:35:53,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 18:35:53,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:35:53,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 18:35:53,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:35:53,573 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 18:35:53,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:35:53,573 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947763630] [2022-12-13 18:35:53,573 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [947763630] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:35:53,573 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:35:53,573 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 18:35:53,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253740023] [2022-12-13 18:35:53,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:35:53,574 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 18:35:53,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:35:53,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 18:35:53,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-13 18:35:53,575 INFO L87 Difference]: Start difference. First operand 112 states and 120 transitions. Second operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-13 18:35:53,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:35:53,775 INFO L93 Difference]: Finished difference Result 112 states and 121 transitions. [2022-12-13 18:35:53,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 18:35:53,776 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2022-12-13 18:35:53,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:35:53,777 INFO L225 Difference]: With dead ends: 112 [2022-12-13 18:35:53,777 INFO L226 Difference]: Without dead ends: 112 [2022-12-13 18:35:53,777 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-12-13 18:35:53,778 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 11 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 291 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 411 SdHoareTripleChecker+Invalid, 292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 291 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 18:35:53,779 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 411 Invalid, 292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 291 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 18:35:53,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2022-12-13 18:35:53,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 111. [2022-12-13 18:35:53,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 61 states have (on average 1.8524590163934427) internal successors, (113), 106 states have internal predecessors, (113), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-13 18:35:53,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 119 transitions. [2022-12-13 18:35:53,785 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 119 transitions. Word has length 22 [2022-12-13 18:35:53,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:35:53,785 INFO L495 AbstractCegarLoop]: Abstraction has 111 states and 119 transitions. [2022-12-13 18:35:53,786 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-13 18:35:53,786 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 119 transitions. [2022-12-13 18:35:53,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-12-13 18:35:53,786 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:35:53,786 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:35:53,787 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 18:35:53,787 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-12-13 18:35:53,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:35:53,787 INFO L85 PathProgramCache]: Analyzing trace with hash -1673413691, now seen corresponding path program 1 times [2022-12-13 18:35:53,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:35:53,788 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123272731] [2022-12-13 18:35:53,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:35:53,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:35:53,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:35:53,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 18:35:53,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:35:53,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 18:35:53,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:35:54,020 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-13 18:35:54,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:35:54,021 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123272731] [2022-12-13 18:35:54,021 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123272731] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 18:35:54,021 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [359162361] [2022-12-13 18:35:54,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:35:54,021 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 18:35:54,022 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01bfce65-57b1-4fc4-8549-4cb4a09416c4/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 18:35:54,023 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01bfce65-57b1-4fc4-8549-4cb4a09416c4/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 18:35:54,024 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01bfce65-57b1-4fc4-8549-4cb4a09416c4/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-13 18:35:54,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:35:54,101 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 23 conjunts are in the unsatisfiable core [2022-12-13 18:35:54,106 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 18:35:54,154 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 18:35:54,197 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_256 Int)) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| v_ArrVal_256))) is different from true [2022-12-13 18:35:54,213 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_256 Int)) (= |c_#valid| (store |c_old(#valid)| |c_node_create_#res#1.base| v_ArrVal_256))) is different from true [2022-12-13 18:35:54,235 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-13 18:35:54,236 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2022-12-13 18:35:54,290 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 6 not checked. [2022-12-13 18:35:54,290 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 18:35:54,560 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 18:35:54,561 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [359162361] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 18:35:54,561 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 18:35:54,561 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 10] total 18 [2022-12-13 18:35:54,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51353886] [2022-12-13 18:35:54,561 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 18:35:54,562 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-12-13 18:35:54,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:35:54,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-12-13 18:35:54,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=219, Unknown=2, NotChecked=62, Total=342 [2022-12-13 18:35:54,563 INFO L87 Difference]: Start difference. First operand 111 states and 119 transitions. Second operand has 19 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 13 states have internal predecessors, (40), 2 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2022-12-13 18:35:54,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:35:54,859 INFO L93 Difference]: Finished difference Result 128 states and 137 transitions. [2022-12-13 18:35:54,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 18:35:54,860 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 13 states have internal predecessors, (40), 2 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) Word has length 25 [2022-12-13 18:35:54,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:35:54,861 INFO L225 Difference]: With dead ends: 128 [2022-12-13 18:35:54,861 INFO L226 Difference]: Without dead ends: 128 [2022-12-13 18:35:54,862 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=271, Unknown=2, NotChecked=70, Total=420 [2022-12-13 18:35:54,862 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 97 mSDsluCounter, 418 mSDsCounter, 0 mSdLazyCounter, 475 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 483 SdHoareTripleChecker+Invalid, 745 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 475 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 266 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 18:35:54,863 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 483 Invalid, 745 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 475 Invalid, 0 Unknown, 266 Unchecked, 0.2s Time] [2022-12-13 18:35:54,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2022-12-13 18:35:54,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 110. [2022-12-13 18:35:54,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 61 states have (on average 1.8360655737704918) internal successors, (112), 105 states have internal predecessors, (112), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-13 18:35:54,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 118 transitions. [2022-12-13 18:35:54,866 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 118 transitions. Word has length 25 [2022-12-13 18:35:54,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:35:54,867 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 118 transitions. [2022-12-13 18:35:54,867 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 13 states have internal predecessors, (40), 2 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2022-12-13 18:35:54,867 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 118 transitions. [2022-12-13 18:35:54,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-12-13 18:35:54,867 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:35:54,867 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:35:54,874 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01bfce65-57b1-4fc4-8549-4cb4a09416c4/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-13 18:35:55,068 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01bfce65-57b1-4fc4-8549-4cb4a09416c4/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 18:35:55,068 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-12-13 18:35:55,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:35:55,069 INFO L85 PathProgramCache]: Analyzing trace with hash -1673413690, now seen corresponding path program 1 times [2022-12-13 18:35:55,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:35:55,069 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408104309] [2022-12-13 18:35:55,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:35:55,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:35:55,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:35:55,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 18:35:55,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:35:55,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 18:35:55,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:35:55,402 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 18:35:55,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:35:55,403 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408104309] [2022-12-13 18:35:55,403 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [408104309] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 18:35:55,403 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1866652002] [2022-12-13 18:35:55,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:35:55,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 18:35:55,403 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01bfce65-57b1-4fc4-8549-4cb4a09416c4/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 18:35:55,404 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01bfce65-57b1-4fc4-8549-4cb4a09416c4/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 18:35:55,405 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01bfce65-57b1-4fc4-8549-4cb4a09416c4/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-13 18:35:55,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:35:55,492 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 35 conjunts are in the unsatisfiable core [2022-12-13 18:35:55,494 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 18:35:55,499 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 18:35:55,687 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-13 18:35:55,687 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-12-13 18:35:55,692 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2022-12-13 18:35:55,740 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 18:35:55,740 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 18:35:55,870 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1866652002] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 18:35:55,870 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 18:35:55,870 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2022-12-13 18:35:55,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870487692] [2022-12-13 18:35:55,870 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 18:35:55,871 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-12-13 18:35:55,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:35:55,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-12-13 18:35:55,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=436, Unknown=0, NotChecked=0, Total=506 [2022-12-13 18:35:55,872 INFO L87 Difference]: Start difference. First operand 110 states and 118 transitions. Second operand has 21 states, 20 states have (on average 1.85) internal successors, (37), 16 states have internal predecessors, (37), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-12-13 18:35:56,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:35:56,437 INFO L93 Difference]: Finished difference Result 111 states and 120 transitions. [2022-12-13 18:35:56,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 18:35:56,438 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 1.85) internal successors, (37), 16 states have internal predecessors, (37), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 25 [2022-12-13 18:35:56,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:35:56,439 INFO L225 Difference]: With dead ends: 111 [2022-12-13 18:35:56,439 INFO L226 Difference]: Without dead ends: 111 [2022-12-13 18:35:56,439 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=98, Invalid=552, Unknown=0, NotChecked=0, Total=650 [2022-12-13 18:35:56,439 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 199 mSDsluCounter, 605 mSDsCounter, 0 mSdLazyCounter, 908 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 674 SdHoareTripleChecker+Invalid, 919 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 908 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-12-13 18:35:56,440 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 674 Invalid, 919 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 908 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-12-13 18:35:56,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2022-12-13 18:35:56,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 109. [2022-12-13 18:35:56,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 61 states have (on average 1.819672131147541) internal successors, (111), 104 states have internal predecessors, (111), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-13 18:35:56,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 117 transitions. [2022-12-13 18:35:56,443 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 117 transitions. Word has length 25 [2022-12-13 18:35:56,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:35:56,443 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 117 transitions. [2022-12-13 18:35:56,444 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 1.85) internal successors, (37), 16 states have internal predecessors, (37), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-12-13 18:35:56,444 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 117 transitions. [2022-12-13 18:35:56,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-12-13 18:35:56,444 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:35:56,444 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:35:56,449 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01bfce65-57b1-4fc4-8549-4cb4a09416c4/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-12-13 18:35:56,644 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01bfce65-57b1-4fc4-8549-4cb4a09416c4/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 18:35:56,645 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-12-13 18:35:56,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:35:56,645 INFO L85 PathProgramCache]: Analyzing trace with hash 512234271, now seen corresponding path program 1 times [2022-12-13 18:35:56,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:35:56,646 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219003516] [2022-12-13 18:35:56,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:35:56,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:35:56,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:35:56,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 18:35:56,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:35:56,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 18:35:56,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:35:56,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-12-13 18:35:56,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:35:56,986 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-12-13 18:35:56,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:35:56,986 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219003516] [2022-12-13 18:35:56,986 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [219003516] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 18:35:56,986 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1076884765] [2022-12-13 18:35:56,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:35:56,987 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 18:35:56,987 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01bfce65-57b1-4fc4-8549-4cb4a09416c4/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 18:35:56,988 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01bfce65-57b1-4fc4-8549-4cb4a09416c4/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 18:35:56,988 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01bfce65-57b1-4fc4-8549-4cb4a09416c4/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-13 18:35:57,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:35:57,090 INFO L263 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 22 conjunts are in the unsatisfiable core [2022-12-13 18:35:57,092 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 18:35:57,098 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 18:35:57,108 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-12-13 18:35:57,125 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_521 Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_521))) (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|))) is different from true [2022-12-13 18:35:57,163 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:35:57,164 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-12-13 18:35:57,180 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-12-13 18:35:57,189 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_522 Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_522))))) is different from true [2022-12-13 18:35:57,223 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:35:57,223 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-12-13 18:35:57,240 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| 1))) is different from true [2022-12-13 18:35:57,256 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 18:35:57,257 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2022-12-13 18:35:57,265 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 18 not checked. [2022-12-13 18:35:57,265 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 18:35:57,401 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1076884765] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 18:35:57,401 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 18:35:57,401 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 13 [2022-12-13 18:35:57,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231461835] [2022-12-13 18:35:57,401 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 18:35:57,406 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-13 18:35:57,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:35:57,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-13 18:35:57,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=122, Unknown=3, NotChecked=72, Total=240 [2022-12-13 18:35:57,407 INFO L87 Difference]: Start difference. First operand 109 states and 117 transitions. Second operand has 14 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 12 states have internal predecessors, (43), 2 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2022-12-13 18:35:57,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:35:57,636 INFO L93 Difference]: Finished difference Result 118 states and 127 transitions. [2022-12-13 18:35:57,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 18:35:57,636 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 12 states have internal predecessors, (43), 2 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) Word has length 37 [2022-12-13 18:35:57,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:35:57,637 INFO L225 Difference]: With dead ends: 118 [2022-12-13 18:35:57,637 INFO L226 Difference]: Without dead ends: 118 [2022-12-13 18:35:57,637 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 51 SyntacticMatches, 4 SemanticMatches, 16 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=163, Unknown=3, NotChecked=84, Total=306 [2022-12-13 18:35:57,638 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 251 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 273 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 251 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 587 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 303 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 18:35:57,638 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [251 Valid, 217 Invalid, 587 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 273 Invalid, 0 Unknown, 303 Unchecked, 0.2s Time] [2022-12-13 18:35:57,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2022-12-13 18:35:57,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 100. [2022-12-13 18:35:57,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 61 states have (on average 1.6721311475409837) internal successors, (102), 95 states have internal predecessors, (102), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-13 18:35:57,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 108 transitions. [2022-12-13 18:35:57,642 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 108 transitions. Word has length 37 [2022-12-13 18:35:57,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:35:57,643 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 108 transitions. [2022-12-13 18:35:57,643 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 12 states have internal predecessors, (43), 2 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2022-12-13 18:35:57,643 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 108 transitions. [2022-12-13 18:35:57,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-12-13 18:35:57,644 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:35:57,644 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:35:57,649 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01bfce65-57b1-4fc4-8549-4cb4a09416c4/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-12-13 18:35:57,844 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01bfce65-57b1-4fc4-8549-4cb4a09416c4/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2022-12-13 18:35:57,844 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-12-13 18:35:57,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:35:57,845 INFO L85 PathProgramCache]: Analyzing trace with hash 512234272, now seen corresponding path program 1 times [2022-12-13 18:35:57,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:35:57,845 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882013440] [2022-12-13 18:35:57,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:35:57,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:35:57,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:35:58,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 18:35:58,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:35:58,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 18:35:58,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:35:58,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-12-13 18:35:58,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:35:58,244 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-12-13 18:35:58,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:35:58,244 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882013440] [2022-12-13 18:35:58,244 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1882013440] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 18:35:58,244 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [272013890] [2022-12-13 18:35:58,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:35:58,245 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 18:35:58,245 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01bfce65-57b1-4fc4-8549-4cb4a09416c4/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 18:35:58,246 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01bfce65-57b1-4fc4-8549-4cb4a09416c4/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 18:35:58,246 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01bfce65-57b1-4fc4-8549-4cb4a09416c4/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-13 18:35:58,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:35:58,355 INFO L263 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 26 conjunts are in the unsatisfiable core [2022-12-13 18:35:58,357 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 18:35:58,364 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 18:35:58,388 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-12-13 18:35:58,405 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_683 Int)) (= (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_683) |c_#length|)))) is different from true [2022-12-13 18:35:58,437 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:35:58,438 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-12-13 18:35:58,459 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-12-13 18:35:58,465 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_684 Int)) (= (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_684) |c_#length|)) (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|))) is different from true [2022-12-13 18:35:58,495 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:35:58,496 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-12-13 18:35:58,548 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-12-13 18:35:58,554 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_685 Int)) (= |c_#length| (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_685))))) is different from true [2022-12-13 18:35:58,583 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:35:58,583 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-12-13 18:35:58,588 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 18 not checked. [2022-12-13 18:35:58,588 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 18:35:58,674 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [272013890] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 18:35:58,675 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 18:35:58,675 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 17 [2022-12-13 18:35:58,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399381704] [2022-12-13 18:35:58,675 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 18:35:58,675 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-12-13 18:35:58,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:35:58,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-12-13 18:35:58,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=225, Unknown=3, NotChecked=96, Total=380 [2022-12-13 18:35:58,676 INFO L87 Difference]: Start difference. First operand 100 states and 108 transitions. Second operand has 18 states, 14 states have (on average 3.7857142857142856) internal successors, (53), 16 states have internal predecessors, (53), 5 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2022-12-13 18:35:59,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:35:59,003 INFO L93 Difference]: Finished difference Result 109 states and 118 transitions. [2022-12-13 18:35:59,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 18:35:59,003 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 14 states have (on average 3.7857142857142856) internal successors, (53), 16 states have internal predecessors, (53), 5 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) Word has length 37 [2022-12-13 18:35:59,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:35:59,004 INFO L225 Difference]: With dead ends: 109 [2022-12-13 18:35:59,004 INFO L226 Difference]: Without dead ends: 109 [2022-12-13 18:35:59,004 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=93, Invalid=336, Unknown=3, NotChecked=120, Total=552 [2022-12-13 18:35:59,004 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 473 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 354 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 473 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 702 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 333 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 18:35:59,004 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [473 Valid, 259 Invalid, 702 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 354 Invalid, 0 Unknown, 333 Unchecked, 0.2s Time] [2022-12-13 18:35:59,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2022-12-13 18:35:59,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 91. [2022-12-13 18:35:59,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 61 states have (on average 1.5245901639344261) internal successors, (93), 86 states have internal predecessors, (93), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-13 18:35:59,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 99 transitions. [2022-12-13 18:35:59,007 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 99 transitions. Word has length 37 [2022-12-13 18:35:59,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:35:59,007 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 99 transitions. [2022-12-13 18:35:59,007 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 14 states have (on average 3.7857142857142856) internal successors, (53), 16 states have internal predecessors, (53), 5 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2022-12-13 18:35:59,007 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 99 transitions. [2022-12-13 18:35:59,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-12-13 18:35:59,008 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:35:59,008 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:35:59,013 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01bfce65-57b1-4fc4-8549-4cb4a09416c4/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-12-13 18:35:59,208 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01bfce65-57b1-4fc4-8549-4cb4a09416c4/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-12-13 18:35:59,210 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-12-13 18:35:59,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:35:59,211 INFO L85 PathProgramCache]: Analyzing trace with hash -47629334, now seen corresponding path program 1 times [2022-12-13 18:35:59,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:35:59,212 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804490317] [2022-12-13 18:35:59,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:35:59,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:35:59,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:35:59,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 18:35:59,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:35:59,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 18:35:59,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:35:59,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-12-13 18:35:59,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:35:59,354 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-12-13 18:35:59,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:35:59,354 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804490317] [2022-12-13 18:35:59,354 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1804490317] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:35:59,354 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:35:59,354 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 18:35:59,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382469313] [2022-12-13 18:35:59,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:35:59,355 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 18:35:59,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:35:59,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 18:35:59,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-13 18:35:59,356 INFO L87 Difference]: Start difference. First operand 91 states and 99 transitions. Second operand has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-12-13 18:35:59,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:35:59,496 INFO L93 Difference]: Finished difference Result 107 states and 116 transitions. [2022-12-13 18:35:59,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 18:35:59,496 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 40 [2022-12-13 18:35:59,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:35:59,497 INFO L225 Difference]: With dead ends: 107 [2022-12-13 18:35:59,497 INFO L226 Difference]: Without dead ends: 107 [2022-12-13 18:35:59,498 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-12-13 18:35:59,498 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 68 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 18:35:59,499 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 266 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 245 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 18:35:59,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2022-12-13 18:35:59,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 89. [2022-12-13 18:35:59,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 61 states have (on average 1.4918032786885247) internal successors, (91), 84 states have internal predecessors, (91), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-13 18:35:59,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 97 transitions. [2022-12-13 18:35:59,502 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 97 transitions. Word has length 40 [2022-12-13 18:35:59,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:35:59,503 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 97 transitions. [2022-12-13 18:35:59,503 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-12-13 18:35:59,503 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 97 transitions. [2022-12-13 18:35:59,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-12-13 18:35:59,503 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:35:59,503 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:35:59,503 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 18:35:59,503 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-12-13 18:35:59,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:35:59,504 INFO L85 PathProgramCache]: Analyzing trace with hash -47629333, now seen corresponding path program 1 times [2022-12-13 18:35:59,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:35:59,504 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778674506] [2022-12-13 18:35:59,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:35:59,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:35:59,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:35:59,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 18:35:59,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:35:59,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 18:35:59,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:35:59,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-12-13 18:35:59,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:35:59,670 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-12-13 18:35:59,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:35:59,670 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778674506] [2022-12-13 18:35:59,670 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1778674506] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:35:59,670 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:35:59,670 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 18:35:59,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660033625] [2022-12-13 18:35:59,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:35:59,671 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 18:35:59,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:35:59,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 18:35:59,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-13 18:35:59,671 INFO L87 Difference]: Start difference. First operand 89 states and 97 transitions. Second operand has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-12-13 18:35:59,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:35:59,770 INFO L93 Difference]: Finished difference Result 87 states and 95 transitions. [2022-12-13 18:35:59,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 18:35:59,771 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 40 [2022-12-13 18:35:59,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:35:59,772 INFO L225 Difference]: With dead ends: 87 [2022-12-13 18:35:59,772 INFO L226 Difference]: Without dead ends: 87 [2022-12-13 18:35:59,772 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-12-13 18:35:59,773 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 69 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 18:35:59,773 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 277 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 18:35:59,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2022-12-13 18:35:59,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2022-12-13 18:35:59,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 61 states have (on average 1.459016393442623) internal successors, (89), 82 states have internal predecessors, (89), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-13 18:35:59,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 95 transitions. [2022-12-13 18:35:59,776 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 95 transitions. Word has length 40 [2022-12-13 18:35:59,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:35:59,776 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 95 transitions. [2022-12-13 18:35:59,776 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-12-13 18:35:59,776 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 95 transitions. [2022-12-13 18:35:59,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-12-13 18:35:59,777 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:35:59,777 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:35:59,777 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 18:35:59,777 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-12-13 18:35:59,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:35:59,778 INFO L85 PathProgramCache]: Analyzing trace with hash -1476263067, now seen corresponding path program 1 times [2022-12-13 18:35:59,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:35:59,778 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120338375] [2022-12-13 18:35:59,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:35:59,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:35:59,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:35:59,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 18:35:59,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:36:00,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 18:36:00,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:36:00,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-12-13 18:36:00,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:36:00,199 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-13 18:36:00,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:36:00,199 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120338375] [2022-12-13 18:36:00,200 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2120338375] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 18:36:00,200 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [443773189] [2022-12-13 18:36:00,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:36:00,200 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 18:36:00,200 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01bfce65-57b1-4fc4-8549-4cb4a09416c4/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 18:36:00,201 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01bfce65-57b1-4fc4-8549-4cb4a09416c4/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 18:36:00,202 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01bfce65-57b1-4fc4-8549-4cb4a09416c4/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-13 18:36:00,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:36:00,318 INFO L263 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 40 conjunts are in the unsatisfiable core [2022-12-13 18:36:00,320 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 18:36:00,462 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2022-12-13 18:36:00,551 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int) (v_ArrVal_1053 (Array Int Int))) (and (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_1053)) (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2022-12-13 18:36:00,575 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:36:00,576 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-12-13 18:36:00,588 INFO L321 Elim1Store]: treesize reduction 32, result has 36.0 percent of original size [2022-12-13 18:36:00,588 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 24 [2022-12-13 18:36:00,615 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-12-13 18:36:00,618 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-12-13 18:36:00,619 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 18:36:00,619 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [443773189] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:36:00,619 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 18:36:00,619 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [16] total 24 [2022-12-13 18:36:00,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031321076] [2022-12-13 18:36:00,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:36:00,619 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-13 18:36:00,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:36:00,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-13 18:36:00,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=483, Unknown=1, NotChecked=44, Total=600 [2022-12-13 18:36:00,621 INFO L87 Difference]: Start difference. First operand 87 states and 95 transitions. Second operand has 14 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 13 states have internal predecessors, (29), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-12-13 18:36:01,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:36:01,001 INFO L93 Difference]: Finished difference Result 150 states and 164 transitions. [2022-12-13 18:36:01,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-13 18:36:01,002 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 13 states have internal predecessors, (29), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 41 [2022-12-13 18:36:01,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:36:01,003 INFO L225 Difference]: With dead ends: 150 [2022-12-13 18:36:01,003 INFO L226 Difference]: Without dead ends: 150 [2022-12-13 18:36:01,003 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 36 SyntacticMatches, 3 SemanticMatches, 29 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=157, Invalid=716, Unknown=1, NotChecked=56, Total=930 [2022-12-13 18:36:01,004 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 376 mSDsluCounter, 385 mSDsCounter, 0 mSdLazyCounter, 549 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 376 SdHoareTripleChecker+Valid, 457 SdHoareTripleChecker+Invalid, 704 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 549 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 142 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-13 18:36:01,004 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [376 Valid, 457 Invalid, 704 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 549 Invalid, 0 Unknown, 142 Unchecked, 0.3s Time] [2022-12-13 18:36:01,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2022-12-13 18:36:01,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 86. [2022-12-13 18:36:01,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 62 states have (on average 1.435483870967742) internal successors, (89), 81 states have internal predecessors, (89), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-13 18:36:01,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 95 transitions. [2022-12-13 18:36:01,008 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 95 transitions. Word has length 41 [2022-12-13 18:36:01,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:36:01,008 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 95 transitions. [2022-12-13 18:36:01,008 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 13 states have internal predecessors, (29), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-12-13 18:36:01,008 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 95 transitions. [2022-12-13 18:36:01,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-12-13 18:36:01,009 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:36:01,009 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:36:01,014 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01bfce65-57b1-4fc4-8549-4cb4a09416c4/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-12-13 18:36:01,209 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01bfce65-57b1-4fc4-8549-4cb4a09416c4/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 18:36:01,210 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-12-13 18:36:01,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:36:01,210 INFO L85 PathProgramCache]: Analyzing trace with hash -1476263066, now seen corresponding path program 1 times [2022-12-13 18:36:01,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:36:01,210 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827497866] [2022-12-13 18:36:01,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:36:01,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:36:01,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:36:01,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 18:36:01,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:36:01,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 18:36:01,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:36:01,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-12-13 18:36:01,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:36:01,921 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-13 18:36:01,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:36:01,921 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827497866] [2022-12-13 18:36:01,921 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1827497866] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 18:36:01,921 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1577375319] [2022-12-13 18:36:01,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:36:01,921 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 18:36:01,921 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01bfce65-57b1-4fc4-8549-4cb4a09416c4/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 18:36:01,922 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01bfce65-57b1-4fc4-8549-4cb4a09416c4/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 18:36:01,923 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01bfce65-57b1-4fc4-8549-4cb4a09416c4/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-13 18:36:02,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:36:02,026 INFO L263 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 63 conjunts are in the unsatisfiable core [2022-12-13 18:36:02,028 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 18:36:02,298 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2022-12-13 18:36:02,302 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2022-12-13 18:36:02,457 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_1211 (Array Int Int))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_1211))) (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_1212 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_1212))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)) (exists ((v_ArrVal_1208 Int)) (= (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_1208) |c_#length|)))) is different from true [2022-12-13 18:36:02,490 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:36:02,491 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 31 [2022-12-13 18:36:02,497 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:36:02,498 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-12-13 18:36:02,503 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:36:02,503 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 29 [2022-12-13 18:36:02,515 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-12-13 18:36:02,516 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2022-12-13 18:36:02,569 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2022-12-13 18:36:02,571 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2022-12-13 18:36:02,625 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 3 not checked. [2022-12-13 18:36:02,625 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 18:36:03,560 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1577375319] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 18:36:03,560 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 18:36:03,560 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17] total 32 [2022-12-13 18:36:03,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831068486] [2022-12-13 18:36:03,561 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 18:36:03,561 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-12-13 18:36:03,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:36:03,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-12-13 18:36:03,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=1154, Unknown=2, NotChecked=68, Total=1332 [2022-12-13 18:36:03,563 INFO L87 Difference]: Start difference. First operand 86 states and 95 transitions. Second operand has 33 states, 30 states have (on average 2.033333333333333) internal successors, (61), 29 states have internal predecessors, (61), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-12-13 18:36:05,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:36:05,163 INFO L93 Difference]: Finished difference Result 142 states and 155 transitions. [2022-12-13 18:36:05,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-12-13 18:36:05,164 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 30 states have (on average 2.033333333333333) internal successors, (61), 29 states have internal predecessors, (61), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 41 [2022-12-13 18:36:05,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:36:05,164 INFO L225 Difference]: With dead ends: 142 [2022-12-13 18:36:05,164 INFO L226 Difference]: Without dead ends: 142 [2022-12-13 18:36:05,165 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 480 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=323, Invalid=2538, Unknown=5, NotChecked=104, Total=2970 [2022-12-13 18:36:05,165 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 445 mSDsluCounter, 1119 mSDsCounter, 0 mSdLazyCounter, 1216 mSolverCounterSat, 10 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 445 SdHoareTripleChecker+Valid, 1198 SdHoareTripleChecker+Invalid, 1333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1216 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 104 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-12-13 18:36:05,165 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [445 Valid, 1198 Invalid, 1333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1216 Invalid, 3 Unknown, 104 Unchecked, 0.8s Time] [2022-12-13 18:36:05,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2022-12-13 18:36:05,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 94. [2022-12-13 18:36:05,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 70 states have (on average 1.3857142857142857) internal successors, (97), 89 states have internal predecessors, (97), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-13 18:36:05,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 103 transitions. [2022-12-13 18:36:05,167 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 103 transitions. Word has length 41 [2022-12-13 18:36:05,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:36:05,167 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 103 transitions. [2022-12-13 18:36:05,167 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 30 states have (on average 2.033333333333333) internal successors, (61), 29 states have internal predecessors, (61), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-12-13 18:36:05,168 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 103 transitions. [2022-12-13 18:36:05,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-12-13 18:36:05,168 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:36:05,168 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:36:05,174 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01bfce65-57b1-4fc4-8549-4cb4a09416c4/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-12-13 18:36:05,369 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01bfce65-57b1-4fc4-8549-4cb4a09416c4/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 18:36:05,370 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-12-13 18:36:05,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:36:05,371 INFO L85 PathProgramCache]: Analyzing trace with hash -1928392465, now seen corresponding path program 1 times [2022-12-13 18:36:05,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:36:05,372 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165498421] [2022-12-13 18:36:05,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:36:05,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:36:05,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:36:05,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 18:36:05,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:36:05,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 18:36:05,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:36:05,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-12-13 18:36:05,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:36:05,849 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-13 18:36:05,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:36:05,849 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165498421] [2022-12-13 18:36:05,849 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [165498421] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 18:36:05,849 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2136237273] [2022-12-13 18:36:05,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:36:05,849 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 18:36:05,850 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01bfce65-57b1-4fc4-8549-4cb4a09416c4/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 18:36:05,850 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01bfce65-57b1-4fc4-8549-4cb4a09416c4/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 18:36:05,851 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01bfce65-57b1-4fc4-8549-4cb4a09416c4/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-13 18:36:05,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:36:05,962 INFO L263 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 33 conjunts are in the unsatisfiable core [2022-12-13 18:36:05,963 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 18:36:06,101 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2022-12-13 18:36:06,136 WARN L859 $PredicateComparison]: unable to prove that (and (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_1402 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| v_ArrVal_1402)))) is different from true [2022-12-13 18:36:06,140 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_1403 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_1403))) (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|))) is different from true [2022-12-13 18:36:06,152 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:36:06,152 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2022-12-13 18:36:06,177 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2022-12-13 18:36:06,188 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 4 not checked. [2022-12-13 18:36:06,189 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 18:36:06,219 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_node_create_~temp~0#1.base_37| Int) (v_ArrVal_1407 (Array Int Int))) (or (not (< |v_node_create_~temp~0#1.base_37| |c_#StackHeapBarrier|)) (not (= (select (select (store |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_37| v_ArrVal_1407) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|) 0)))) is different from false [2022-12-13 18:36:06,220 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2136237273] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 18:36:06,220 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 18:36:06,220 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 16] total 33 [2022-12-13 18:36:06,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828647807] [2022-12-13 18:36:06,220 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 18:36:06,221 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-12-13 18:36:06,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:36:06,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-12-13 18:36:06,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=900, Unknown=3, NotChecked=186, Total=1190 [2022-12-13 18:36:06,222 INFO L87 Difference]: Start difference. First operand 94 states and 103 transitions. Second operand has 33 states, 31 states have (on average 2.096774193548387) internal successors, (65), 28 states have internal predecessors, (65), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-12-13 18:36:06,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:36:06,722 INFO L93 Difference]: Finished difference Result 97 states and 105 transitions. [2022-12-13 18:36:06,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-13 18:36:06,723 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 31 states have (on average 2.096774193548387) internal successors, (65), 28 states have internal predecessors, (65), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 44 [2022-12-13 18:36:06,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:36:06,723 INFO L225 Difference]: With dead ends: 97 [2022-12-13 18:36:06,723 INFO L226 Difference]: Without dead ends: 97 [2022-12-13 18:36:06,724 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 331 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=222, Invalid=1591, Unknown=5, NotChecked=252, Total=2070 [2022-12-13 18:36:06,724 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 339 mSDsluCounter, 588 mSDsCounter, 0 mSdLazyCounter, 671 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 339 SdHoareTripleChecker+Valid, 645 SdHoareTripleChecker+Invalid, 867 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 671 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 183 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-13 18:36:06,724 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [339 Valid, 645 Invalid, 867 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 671 Invalid, 0 Unknown, 183 Unchecked, 0.3s Time] [2022-12-13 18:36:06,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-12-13 18:36:06,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 91. [2022-12-13 18:36:06,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 68 states have (on average 1.3676470588235294) internal successors, (93), 86 states have internal predecessors, (93), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-13 18:36:06,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 99 transitions. [2022-12-13 18:36:06,726 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 99 transitions. Word has length 44 [2022-12-13 18:36:06,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:36:06,726 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 99 transitions. [2022-12-13 18:36:06,726 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 31 states have (on average 2.096774193548387) internal successors, (65), 28 states have internal predecessors, (65), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-12-13 18:36:06,726 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 99 transitions. [2022-12-13 18:36:06,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-12-13 18:36:06,727 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:36:06,727 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:36:06,732 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01bfce65-57b1-4fc4-8549-4cb4a09416c4/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-12-13 18:36:06,928 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01bfce65-57b1-4fc4-8549-4cb4a09416c4/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-12-13 18:36:06,929 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-12-13 18:36:06,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:36:06,930 INFO L85 PathProgramCache]: Analyzing trace with hash -710984888, now seen corresponding path program 1 times [2022-12-13 18:36:06,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:36:06,930 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712505493] [2022-12-13 18:36:06,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:36:06,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:36:06,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:36:07,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 18:36:07,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:36:07,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 18:36:07,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:36:07,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-12-13 18:36:07,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:36:07,904 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 10 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-13 18:36:07,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:36:07,904 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712505493] [2022-12-13 18:36:07,904 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [712505493] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 18:36:07,904 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [507943732] [2022-12-13 18:36:07,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:36:07,905 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 18:36:07,905 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01bfce65-57b1-4fc4-8549-4cb4a09416c4/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 18:36:07,905 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01bfce65-57b1-4fc4-8549-4cb4a09416c4/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 18:36:07,906 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01bfce65-57b1-4fc4-8549-4cb4a09416c4/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-12-13 18:36:08,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:36:08,015 INFO L263 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 94 conjunts are in the unsatisfiable core [2022-12-13 18:36:08,019 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 18:36:08,046 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 18:36:08,201 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-13 18:36:08,201 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-12-13 18:36:08,288 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-13 18:36:08,397 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 18:36:08,397 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2022-12-13 18:36:08,530 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-13 18:36:08,530 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 22 [2022-12-13 18:36:08,535 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-13 18:36:08,538 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-12-13 18:36:08,658 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_1569 (Array Int Int)) (|node_create_~temp~0#1.base| Int) (v_ArrVal_1570 (Array Int Int))) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_1570)) (= (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_1569) |c_#memory_$Pointer$.offset|))) is different from true [2022-12-13 18:36:08,688 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:36:08,693 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-12-13 18:36:08,694 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 53 treesize of output 51 [2022-12-13 18:36:08,698 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:36:08,699 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 49 [2022-12-13 18:36:08,718 INFO L321 Elim1Store]: treesize reduction 88, result has 36.7 percent of original size [2022-12-13 18:36:08,719 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 40 treesize of output 60 [2022-12-13 18:36:08,778 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 36 [2022-12-13 18:36:08,911 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-13 18:36:08,912 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 25 [2022-12-13 18:36:08,987 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 3 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2022-12-13 18:36:08,987 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 18:36:09,106 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [507943732] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 18:36:09,106 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 18:36:09,106 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 45 [2022-12-13 18:36:09,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342079066] [2022-12-13 18:36:09,106 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 18:36:09,107 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-12-13 18:36:09,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:36:09,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-12-13 18:36:09,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=1924, Unknown=1, NotChecked=88, Total=2162 [2022-12-13 18:36:09,108 INFO L87 Difference]: Start difference. First operand 91 states and 99 transitions. Second operand has 46 states, 41 states have (on average 1.8048780487804879) internal successors, (74), 39 states have internal predecessors, (74), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-12-13 18:36:10,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:36:10,606 INFO L93 Difference]: Finished difference Result 193 states and 212 transitions. [2022-12-13 18:36:10,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-12-13 18:36:10,606 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 41 states have (on average 1.8048780487804879) internal successors, (74), 39 states have internal predecessors, (74), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 46 [2022-12-13 18:36:10,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:36:10,606 INFO L225 Difference]: With dead ends: 193 [2022-12-13 18:36:10,607 INFO L226 Difference]: Without dead ends: 193 [2022-12-13 18:36:10,607 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 39 SyntacticMatches, 3 SemanticMatches, 62 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1013 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=392, Invalid=3517, Unknown=1, NotChecked=122, Total=4032 [2022-12-13 18:36:10,607 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 773 mSDsluCounter, 910 mSDsCounter, 0 mSdLazyCounter, 1377 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 775 SdHoareTripleChecker+Valid, 953 SdHoareTripleChecker+Invalid, 1607 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 1377 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 188 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-12-13 18:36:10,608 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [775 Valid, 953 Invalid, 1607 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 1377 Invalid, 0 Unknown, 188 Unchecked, 0.7s Time] [2022-12-13 18:36:10,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2022-12-13 18:36:10,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 111. [2022-12-13 18:36:10,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 86 states have (on average 1.3255813953488371) internal successors, (114), 104 states have internal predecessors, (114), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-12-13 18:36:10,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 124 transitions. [2022-12-13 18:36:10,610 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 124 transitions. Word has length 46 [2022-12-13 18:36:10,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:36:10,611 INFO L495 AbstractCegarLoop]: Abstraction has 111 states and 124 transitions. [2022-12-13 18:36:10,611 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 41 states have (on average 1.8048780487804879) internal successors, (74), 39 states have internal predecessors, (74), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-12-13 18:36:10,611 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 124 transitions. [2022-12-13 18:36:10,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-12-13 18:36:10,611 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:36:10,611 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:36:10,616 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01bfce65-57b1-4fc4-8549-4cb4a09416c4/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-12-13 18:36:10,812 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01bfce65-57b1-4fc4-8549-4cb4a09416c4/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-12-13 18:36:10,813 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-12-13 18:36:10,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:36:10,814 INFO L85 PathProgramCache]: Analyzing trace with hash -710984887, now seen corresponding path program 1 times [2022-12-13 18:36:10,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:36:10,815 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95299244] [2022-12-13 18:36:10,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:36:10,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:36:10,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:36:11,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 18:36:11,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:36:11,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 18:36:11,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:36:11,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-12-13 18:36:11,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:36:12,005 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 18 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-13 18:36:12,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:36:12,006 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95299244] [2022-12-13 18:36:12,006 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [95299244] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 18:36:12,006 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1333549193] [2022-12-13 18:36:12,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:36:12,006 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 18:36:12,006 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01bfce65-57b1-4fc4-8549-4cb4a09416c4/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 18:36:12,007 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01bfce65-57b1-4fc4-8549-4cb4a09416c4/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 18:36:12,007 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01bfce65-57b1-4fc4-8549-4cb4a09416c4/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-12-13 18:36:12,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:36:12,123 INFO L263 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 120 conjunts are in the unsatisfiable core [2022-12-13 18:36:12,127 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 18:36:12,153 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 18:36:12,346 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-13 18:36:12,346 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-12-13 18:36:12,418 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-13 18:36:12,421 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-13 18:36:12,526 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 18:36:12,527 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 44 [2022-12-13 18:36:12,533 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-13 18:36:12,711 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-13 18:36:12,712 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 79 treesize of output 38 [2022-12-13 18:36:12,723 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 10 [2022-12-13 18:36:12,867 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_1746 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_1746) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1743 Int)) (= (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_1743) |c_#length|)) (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)) (exists ((v_ArrVal_1747 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_1747) |c_#memory_$Pointer$.base|)))) is different from true [2022-12-13 18:36:12,894 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:36:12,902 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-12-13 18:36:12,902 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 85 treesize of output 75 [2022-12-13 18:36:12,908 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:36:12,909 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:36:12,911 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-13 18:36:12,912 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 83 treesize of output 80 [2022-12-13 18:36:12,919 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:36:12,920 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2022-12-13 18:36:12,934 INFO L321 Elim1Store]: treesize reduction 8, result has 75.8 percent of original size [2022-12-13 18:36:12,934 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 34 [2022-12-13 18:36:13,245 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-13 18:36:13,245 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 83 treesize of output 42 [2022-12-13 18:36:13,249 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2022-12-13 18:36:13,316 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 3 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2022-12-13 18:36:13,316 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 18:36:13,843 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1333549193] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 18:36:13,844 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 18:36:13,844 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 51 [2022-12-13 18:36:13,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51376139] [2022-12-13 18:36:13,844 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 18:36:13,844 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2022-12-13 18:36:13,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:36:13,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2022-12-13 18:36:13,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=3118, Unknown=5, NotChecked=112, Total=3422 [2022-12-13 18:36:13,845 INFO L87 Difference]: Start difference. First operand 111 states and 124 transitions. Second operand has 52 states, 47 states have (on average 1.6808510638297873) internal successors, (79), 45 states have internal predecessors, (79), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-12-13 18:36:16,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:36:16,581 INFO L93 Difference]: Finished difference Result 220 states and 241 transitions. [2022-12-13 18:36:16,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-12-13 18:36:16,581 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 47 states have (on average 1.6808510638297873) internal successors, (79), 45 states have internal predecessors, (79), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 46 [2022-12-13 18:36:16,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:36:16,582 INFO L225 Difference]: With dead ends: 220 [2022-12-13 18:36:16,582 INFO L226 Difference]: Without dead ends: 220 [2022-12-13 18:36:16,583 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 77 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1378 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=413, Invalid=5592, Unknown=5, NotChecked=152, Total=6162 [2022-12-13 18:36:16,583 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 352 mSDsluCounter, 2416 mSDsCounter, 0 mSdLazyCounter, 3259 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 354 SdHoareTripleChecker+Valid, 2495 SdHoareTripleChecker+Invalid, 3434 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 3259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 157 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-12-13 18:36:16,583 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [354 Valid, 2495 Invalid, 3434 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 3259 Invalid, 0 Unknown, 157 Unchecked, 1.5s Time] [2022-12-13 18:36:16,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2022-12-13 18:36:16,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 110. [2022-12-13 18:36:16,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 85 states have (on average 1.3176470588235294) internal successors, (112), 103 states have internal predecessors, (112), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-12-13 18:36:16,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 122 transitions. [2022-12-13 18:36:16,586 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 122 transitions. Word has length 46 [2022-12-13 18:36:16,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:36:16,586 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 122 transitions. [2022-12-13 18:36:16,586 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 47 states have (on average 1.6808510638297873) internal successors, (79), 45 states have internal predecessors, (79), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-12-13 18:36:16,586 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 122 transitions. [2022-12-13 18:36:16,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-12-13 18:36:16,587 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:36:16,587 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 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, 1] [2022-12-13 18:36:16,591 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01bfce65-57b1-4fc4-8549-4cb4a09416c4/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-12-13 18:36:16,787 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01bfce65-57b1-4fc4-8549-4cb4a09416c4/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-12-13 18:36:16,788 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-12-13 18:36:16,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:36:16,789 INFO L85 PathProgramCache]: Analyzing trace with hash 555333, now seen corresponding path program 2 times [2022-12-13 18:36:16,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:36:16,790 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373334874] [2022-12-13 18:36:16,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:36:16,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:36:16,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:36:17,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 18:36:17,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:36:17,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 18:36:17,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:36:17,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-12-13 18:36:17,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:36:18,025 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 6 proven. 20 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-13 18:36:18,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:36:18,025 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373334874] [2022-12-13 18:36:18,025 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1373334874] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 18:36:18,025 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [640175456] [2022-12-13 18:36:18,025 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 18:36:18,025 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 18:36:18,025 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01bfce65-57b1-4fc4-8549-4cb4a09416c4/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 18:36:18,026 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01bfce65-57b1-4fc4-8549-4cb4a09416c4/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 18:36:18,027 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01bfce65-57b1-4fc4-8549-4cb4a09416c4/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-12-13 18:36:18,159 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 18:36:18,159 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 18:36:18,162 INFO L263 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 134 conjunts are in the unsatisfiable core [2022-12-13 18:36:18,165 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 18:36:18,194 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 18:36:18,344 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-13 18:36:18,344 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-12-13 18:36:18,427 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-13 18:36:18,433 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-13 18:36:18,603 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-12-13 18:36:18,604 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 38 [2022-12-13 18:36:18,610 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2022-12-13 18:36:18,869 INFO L321 Elim1Store]: treesize reduction 21, result has 16.0 percent of original size [2022-12-13 18:36:18,870 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 108 treesize of output 50 [2022-12-13 18:36:18,878 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-13 18:36:18,878 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 13 [2022-12-13 18:36:19,027 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int) (v_ArrVal_1925 (Array Int Int)) (v_ArrVal_1924 (Array Int Int))) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_1925)) (= (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_1924) |c_#memory_$Pointer$.offset|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2022-12-13 18:36:19,058 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:36:19,074 INFO L321 Elim1Store]: treesize reduction 52, result has 17.5 percent of original size [2022-12-13 18:36:19,074 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 114 treesize of output 102 [2022-12-13 18:36:19,081 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:36:19,082 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:36:19,091 INFO L321 Elim1Store]: treesize reduction 47, result has 9.6 percent of original size [2022-12-13 18:36:19,091 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 112 treesize of output 111 [2022-12-13 18:36:19,113 INFO L321 Elim1Store]: treesize reduction 8, result has 75.8 percent of original size [2022-12-13 18:36:19,113 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 34 [2022-12-13 18:36:19,711 INFO L321 Elim1Store]: treesize reduction 78, result has 3.7 percent of original size [2022-12-13 18:36:19,711 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 133 treesize of output 82 [2022-12-13 18:36:19,812 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 7 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2022-12-13 18:36:19,812 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 18:36:20,436 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [640175456] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 18:36:20,437 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 18:36:20,437 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 28] total 56 [2022-12-13 18:36:20,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160335117] [2022-12-13 18:36:20,437 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 18:36:20,437 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2022-12-13 18:36:20,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:36:20,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2022-12-13 18:36:20,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=214, Invalid=3695, Unknown=1, NotChecked=122, Total=4032 [2022-12-13 18:36:20,439 INFO L87 Difference]: Start difference. First operand 110 states and 122 transitions. Second operand has 56 states, 52 states have (on average 1.5961538461538463) internal successors, (83), 49 states have internal predecessors, (83), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-12-13 18:36:23,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:36:23,609 INFO L93 Difference]: Finished difference Result 136 states and 150 transitions. [2022-12-13 18:36:23,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-12-13 18:36:23,610 INFO L78 Accepts]: Start accepts. Automaton has has 56 states, 52 states have (on average 1.5961538461538463) internal successors, (83), 49 states have internal predecessors, (83), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 51 [2022-12-13 18:36:23,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:36:23,611 INFO L225 Difference]: With dead ends: 136 [2022-12-13 18:36:23,611 INFO L226 Difference]: Without dead ends: 136 [2022-12-13 18:36:23,612 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 40 SyntacticMatches, 3 SemanticMatches, 84 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1856 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=493, Invalid=6650, Unknown=1, NotChecked=166, Total=7310 [2022-12-13 18:36:23,612 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 201 mSDsluCounter, 1364 mSDsCounter, 0 mSdLazyCounter, 2549 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 1405 SdHoareTripleChecker+Invalid, 2696 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 2549 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 128 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-12-13 18:36:23,612 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [203 Valid, 1405 Invalid, 2696 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 2549 Invalid, 0 Unknown, 128 Unchecked, 1.4s Time] [2022-12-13 18:36:23,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2022-12-13 18:36:23,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 113. [2022-12-13 18:36:23,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 88 states have (on average 1.3068181818181819) internal successors, (115), 106 states have internal predecessors, (115), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-12-13 18:36:23,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 125 transitions. [2022-12-13 18:36:23,615 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 125 transitions. Word has length 51 [2022-12-13 18:36:23,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:36:23,615 INFO L495 AbstractCegarLoop]: Abstraction has 113 states and 125 transitions. [2022-12-13 18:36:23,615 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 52 states have (on average 1.5961538461538463) internal successors, (83), 49 states have internal predecessors, (83), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-12-13 18:36:23,615 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 125 transitions. [2022-12-13 18:36:23,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-12-13 18:36:23,615 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:36:23,615 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:36:23,620 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01bfce65-57b1-4fc4-8549-4cb4a09416c4/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-12-13 18:36:23,816 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01bfce65-57b1-4fc4-8549-4cb4a09416c4/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-12-13 18:36:23,817 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-12-13 18:36:23,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:36:23,818 INFO L85 PathProgramCache]: Analyzing trace with hash 430095050, now seen corresponding path program 1 times [2022-12-13 18:36:23,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:36:23,818 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452166252] [2022-12-13 18:36:23,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:36:23,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:36:23,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:36:24,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 18:36:24,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:36:24,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 18:36:24,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:36:24,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-12-13 18:36:24,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:36:24,448 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 12 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-13 18:36:24,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:36:24,448 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452166252] [2022-12-13 18:36:24,448 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1452166252] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 18:36:24,448 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1642064220] [2022-12-13 18:36:24,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:36:24,449 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 18:36:24,449 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01bfce65-57b1-4fc4-8549-4cb4a09416c4/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 18:36:24,450 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01bfce65-57b1-4fc4-8549-4cb4a09416c4/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 18:36:24,450 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01bfce65-57b1-4fc4-8549-4cb4a09416c4/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-12-13 18:36:24,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:36:24,604 INFO L263 TraceCheckSpWp]: Trace formula consists of 440 conjuncts, 50 conjunts are in the unsatisfiable core [2022-12-13 18:36:24,607 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 18:36:24,828 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2022-12-13 18:36:24,874 WARN L859 $PredicateComparison]: unable to prove that (and (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_2124 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| v_ArrVal_2124) |c_#memory_$Pointer$.base|))) is different from true [2022-12-13 18:36:24,878 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_2125 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_2125))))) is different from true [2022-12-13 18:36:24,889 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:36:24,889 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-12-13 18:36:24,943 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-12-13 18:36:25,074 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-13 18:36:25,110 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:36:25,110 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-12-13 18:36:25,143 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-12-13 18:36:25,145 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 4 not checked. [2022-12-13 18:36:25,145 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 18:36:29,227 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 18:36:29,227 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 21 [2022-12-13 18:36:29,234 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 18:36:29,234 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 37 [2022-12-13 18:36:29,236 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2022-12-13 18:36:29,370 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-12-13 18:36:29,370 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 11 [2022-12-13 18:36:29,550 WARN L837 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (forall ((|v_node_create_~temp~0#1.base_49| Int)) (or (not (< |v_node_create_~temp~0#1.base_49| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_2132 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_49| v_ArrVal_2132) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|) |c_ULTIMATE.start_main_~#s~0#1.base|)))))) is different from false [2022-12-13 18:36:29,551 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1642064220] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 18:36:29,551 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 18:36:29,551 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 38 [2022-12-13 18:36:29,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494201294] [2022-12-13 18:36:29,551 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 18:36:29,552 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-12-13 18:36:29,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:36:29,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-12-13 18:36:29,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=1603, Unknown=20, NotChecked=246, Total=1980 [2022-12-13 18:36:29,553 INFO L87 Difference]: Start difference. First operand 113 states and 125 transitions. Second operand has 39 states, 36 states have (on average 2.25) internal successors, (81), 34 states have internal predecessors, (81), 3 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2022-12-13 18:36:31,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:36:31,096 INFO L93 Difference]: Finished difference Result 183 states and 198 transitions. [2022-12-13 18:36:31,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-12-13 18:36:31,096 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 36 states have (on average 2.25) internal successors, (81), 34 states have internal predecessors, (81), 3 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Word has length 52 [2022-12-13 18:36:31,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:36:31,098 INFO L225 Difference]: With dead ends: 183 [2022-12-13 18:36:31,098 INFO L226 Difference]: Without dead ends: 183 [2022-12-13 18:36:31,099 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 63 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 376 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=402, Invalid=3370, Unknown=22, NotChecked=366, Total=4160 [2022-12-13 18:36:31,100 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 1036 mSDsluCounter, 964 mSDsCounter, 0 mSdLazyCounter, 1472 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1036 SdHoareTripleChecker+Valid, 1007 SdHoareTripleChecker+Invalid, 1806 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 1472 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 316 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-12-13 18:36:31,100 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1036 Valid, 1007 Invalid, 1806 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 1472 Invalid, 0 Unknown, 316 Unchecked, 0.7s Time] [2022-12-13 18:36:31,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2022-12-13 18:36:31,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 122. [2022-12-13 18:36:31,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 97 states have (on average 1.288659793814433) internal successors, (125), 115 states have internal predecessors, (125), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-12-13 18:36:31,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 135 transitions. [2022-12-13 18:36:31,103 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 135 transitions. Word has length 52 [2022-12-13 18:36:31,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:36:31,104 INFO L495 AbstractCegarLoop]: Abstraction has 122 states and 135 transitions. [2022-12-13 18:36:31,104 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 36 states have (on average 2.25) internal successors, (81), 34 states have internal predecessors, (81), 3 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2022-12-13 18:36:31,104 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 135 transitions. [2022-12-13 18:36:31,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-12-13 18:36:31,104 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:36:31,104 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:36:31,109 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01bfce65-57b1-4fc4-8549-4cb4a09416c4/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-12-13 18:36:31,305 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01bfce65-57b1-4fc4-8549-4cb4a09416c4/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-12-13 18:36:31,305 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-12-13 18:36:31,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:36:31,306 INFO L85 PathProgramCache]: Analyzing trace with hash 430095051, now seen corresponding path program 1 times [2022-12-13 18:36:31,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:36:31,307 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093936161] [2022-12-13 18:36:31,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:36:31,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:36:31,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:36:31,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 18:36:31,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:36:31,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 18:36:31,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:36:31,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-12-13 18:36:31,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:36:31,968 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-12-13 18:36:31,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:36:31,968 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093936161] [2022-12-13 18:36:31,968 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2093936161] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:36:31,968 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:36:31,968 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-12-13 18:36:31,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063474540] [2022-12-13 18:36:31,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:36:31,969 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-13 18:36:31,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:36:31,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-13 18:36:31,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2022-12-13 18:36:31,970 INFO L87 Difference]: Start difference. First operand 122 states and 135 transitions. Second operand has 16 states, 14 states have (on average 2.857142857142857) internal successors, (40), 14 states have internal predecessors, (40), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-12-13 18:36:32,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:36:32,392 INFO L93 Difference]: Finished difference Result 129 states and 141 transitions. [2022-12-13 18:36:32,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-13 18:36:32,396 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 2.857142857142857) internal successors, (40), 14 states have internal predecessors, (40), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 52 [2022-12-13 18:36:32,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:36:32,397 INFO L225 Difference]: With dead ends: 129 [2022-12-13 18:36:32,397 INFO L226 Difference]: Without dead ends: 129 [2022-12-13 18:36:32,397 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=82, Invalid=338, Unknown=0, NotChecked=0, Total=420 [2022-12-13 18:36:32,398 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 382 mSDsluCounter, 364 mSDsCounter, 0 mSdLazyCounter, 391 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 382 SdHoareTripleChecker+Valid, 418 SdHoareTripleChecker+Invalid, 394 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 391 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 18:36:32,398 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [382 Valid, 418 Invalid, 394 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 391 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 18:36:32,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2022-12-13 18:36:32,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 125. [2022-12-13 18:36:32,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 100 states have (on average 1.29) internal successors, (129), 118 states have internal predecessors, (129), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-12-13 18:36:32,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 139 transitions. [2022-12-13 18:36:32,400 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 139 transitions. Word has length 52 [2022-12-13 18:36:32,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:36:32,400 INFO L495 AbstractCegarLoop]: Abstraction has 125 states and 139 transitions. [2022-12-13 18:36:32,400 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 2.857142857142857) internal successors, (40), 14 states have internal predecessors, (40), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-12-13 18:36:32,400 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 139 transitions. [2022-12-13 18:36:32,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-12-13 18:36:32,401 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:36:32,401 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:36:32,401 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-12-13 18:36:32,401 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-12-13 18:36:32,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:36:32,402 INFO L85 PathProgramCache]: Analyzing trace with hash 1004484877, now seen corresponding path program 1 times [2022-12-13 18:36:32,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:36:32,402 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168763994] [2022-12-13 18:36:32,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:36:32,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:36:32,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:36:32,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 18:36:32,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:36:32,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 18:36:32,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:36:33,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-12-13 18:36:33,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:36:33,345 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 10 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-13 18:36:33,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:36:33,345 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168763994] [2022-12-13 18:36:33,345 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [168763994] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 18:36:33,345 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1573105090] [2022-12-13 18:36:33,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:36:33,346 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 18:36:33,346 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01bfce65-57b1-4fc4-8549-4cb4a09416c4/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 18:36:33,347 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01bfce65-57b1-4fc4-8549-4cb4a09416c4/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 18:36:33,347 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01bfce65-57b1-4fc4-8549-4cb4a09416c4/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-12-13 18:36:33,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:36:33,501 INFO L263 TraceCheckSpWp]: Trace formula consists of 447 conjuncts, 96 conjunts are in the unsatisfiable core [2022-12-13 18:36:33,504 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 18:36:33,536 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 18:36:33,701 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-13 18:36:33,702 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-12-13 18:36:33,795 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-13 18:36:33,919 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 18:36:33,919 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 22 [2022-12-13 18:36:34,061 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-13 18:36:34,061 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 17 [2022-12-13 18:36:34,066 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-12-13 18:36:34,069 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-12-13 18:36:34,276 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:36:34,284 INFO L321 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2022-12-13 18:36:34,284 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 35 [2022-12-13 18:36:34,288 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:36:34,289 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 29 [2022-12-13 18:36:34,298 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-12-13 18:36:34,298 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2022-12-13 18:36:34,402 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 23 [2022-12-13 18:36:34,544 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-13 18:36:34,544 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 18 [2022-12-13 18:36:34,574 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 3 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 18:36:34,574 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 18:36:34,771 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_26| Int) (v_ArrVal_2454 (Array Int Int)) (v_ArrVal_2453 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_26|) 0)) (not (let ((.cse1 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_26| v_ArrVal_2453))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (= .cse0 (select (select .cse1 .cse0) (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_26| v_ArrVal_2454) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)))))) (not (< |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_26| |c_#StackHeapBarrier|)))) is different from false [2022-12-13 18:36:34,773 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1573105090] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 18:36:34,773 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 18:36:34,773 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 27] total 47 [2022-12-13 18:36:34,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126220444] [2022-12-13 18:36:34,774 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 18:36:34,774 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-12-13 18:36:34,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:36:34,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-12-13 18:36:34,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=2387, Unknown=1, NotChecked=98, Total=2652 [2022-12-13 18:36:34,775 INFO L87 Difference]: Start difference. First operand 125 states and 139 transitions. Second operand has 47 states, 43 states have (on average 1.813953488372093) internal successors, (78), 39 states have internal predecessors, (78), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-12-13 18:36:36,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:36:36,199 INFO L93 Difference]: Finished difference Result 126 states and 140 transitions. [2022-12-13 18:36:36,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-12-13 18:36:36,200 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 43 states have (on average 1.813953488372093) internal successors, (78), 39 states have internal predecessors, (78), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 54 [2022-12-13 18:36:36,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:36:36,200 INFO L225 Difference]: With dead ends: 126 [2022-12-13 18:36:36,200 INFO L226 Difference]: Without dead ends: 126 [2022-12-13 18:36:36,201 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 51 SyntacticMatches, 3 SemanticMatches, 65 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1131 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=332, Invalid=3961, Unknown=1, NotChecked=128, Total=4422 [2022-12-13 18:36:36,201 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 231 mSDsluCounter, 1358 mSDsCounter, 0 mSdLazyCounter, 1467 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 1415 SdHoareTripleChecker+Invalid, 1483 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 1467 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-12-13 18:36:36,201 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [233 Valid, 1415 Invalid, 1483 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 1467 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-12-13 18:36:36,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2022-12-13 18:36:36,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 125. [2022-12-13 18:36:36,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 100 states have (on average 1.28) internal successors, (128), 118 states have internal predecessors, (128), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-12-13 18:36:36,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 138 transitions. [2022-12-13 18:36:36,204 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 138 transitions. Word has length 54 [2022-12-13 18:36:36,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:36:36,204 INFO L495 AbstractCegarLoop]: Abstraction has 125 states and 138 transitions. [2022-12-13 18:36:36,204 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 43 states have (on average 1.813953488372093) internal successors, (78), 39 states have internal predecessors, (78), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-12-13 18:36:36,204 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 138 transitions. [2022-12-13 18:36:36,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-12-13 18:36:36,204 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:36:36,204 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:36:36,210 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01bfce65-57b1-4fc4-8549-4cb4a09416c4/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-12-13 18:36:36,405 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01bfce65-57b1-4fc4-8549-4cb4a09416c4/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 18:36:36,406 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-12-13 18:36:36,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:36:36,406 INFO L85 PathProgramCache]: Analyzing trace with hash 888325895, now seen corresponding path program 1 times [2022-12-13 18:36:36,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:36:36,407 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712618564] [2022-12-13 18:36:36,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:36:36,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:36:36,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:36:36,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 18:36:36,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:36:36,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 18:36:36,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:36:36,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-12-13 18:36:36,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:36:36,776 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-12-13 18:36:36,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:36:36,777 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712618564] [2022-12-13 18:36:36,777 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [712618564] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:36:36,777 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:36:36,777 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-12-13 18:36:36,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389161566] [2022-12-13 18:36:36,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:36:36,777 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-13 18:36:36,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:36:36,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-13 18:36:36,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2022-12-13 18:36:36,778 INFO L87 Difference]: Start difference. First operand 125 states and 138 transitions. Second operand has 12 states, 10 states have (on average 4.1) internal successors, (41), 10 states have internal predecessors, (41), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-12-13 18:36:37,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:36:37,040 INFO L93 Difference]: Finished difference Result 145 states and 157 transitions. [2022-12-13 18:36:37,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 18:36:37,040 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 4.1) internal successors, (41), 10 states have internal predecessors, (41), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 57 [2022-12-13 18:36:37,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:36:37,041 INFO L225 Difference]: With dead ends: 145 [2022-12-13 18:36:37,041 INFO L226 Difference]: Without dead ends: 145 [2022-12-13 18:36:37,041 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2022-12-13 18:36:37,041 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 214 mSDsluCounter, 347 mSDsCounter, 0 mSdLazyCounter, 358 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 362 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 358 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 18:36:37,041 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 402 Invalid, 362 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 358 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 18:36:37,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2022-12-13 18:36:37,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 116. [2022-12-13 18:36:37,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 91 states have (on average 1.2967032967032968) internal successors, (118), 109 states have internal predecessors, (118), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-12-13 18:36:37,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 128 transitions. [2022-12-13 18:36:37,043 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 128 transitions. Word has length 57 [2022-12-13 18:36:37,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:36:37,044 INFO L495 AbstractCegarLoop]: Abstraction has 116 states and 128 transitions. [2022-12-13 18:36:37,044 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 4.1) internal successors, (41), 10 states have internal predecessors, (41), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-12-13 18:36:37,044 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 128 transitions. [2022-12-13 18:36:37,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-12-13 18:36:37,044 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:36:37,044 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 2, 2, 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-12-13 18:36:37,044 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-12-13 18:36:37,044 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-12-13 18:36:37,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:36:37,045 INFO L85 PathProgramCache]: Analyzing trace with hash 749733786, now seen corresponding path program 3 times [2022-12-13 18:36:37,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:36:37,045 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599470743] [2022-12-13 18:36:37,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:36:37,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:36:37,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:36:37,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 18:36:37,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:36:37,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 18:36:37,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:36:37,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-12-13 18:36:37,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:36:37,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-12-13 18:36:37,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:36:37,127 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2022-12-13 18:36:37,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:36:37,127 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599470743] [2022-12-13 18:36:37,127 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1599470743] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 18:36:37,127 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [636321489] [2022-12-13 18:36:37,127 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-13 18:36:37,128 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 18:36:37,128 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01bfce65-57b1-4fc4-8549-4cb4a09416c4/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 18:36:37,128 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01bfce65-57b1-4fc4-8549-4cb4a09416c4/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 18:36:37,129 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01bfce65-57b1-4fc4-8549-4cb4a09416c4/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-12-13 18:36:37,353 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-12-13 18:36:37,353 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 18:36:37,355 INFO L263 TraceCheckSpWp]: Trace formula consists of 395 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-13 18:36:37,356 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 18:36:37,368 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-12-13 18:36:37,368 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 18:36:37,368 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [636321489] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:36:37,369 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 18:36:37,369 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2022-12-13 18:36:37,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969387053] [2022-12-13 18:36:37,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:36:37,369 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 18:36:37,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:36:37,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 18:36:37,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 18:36:37,370 INFO L87 Difference]: Start difference. First operand 116 states and 128 transitions. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-12-13 18:36:37,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:36:37,378 INFO L93 Difference]: Finished difference Result 84 states and 90 transitions. [2022-12-13 18:36:37,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 18:36:37,378 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 58 [2022-12-13 18:36:37,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:36:37,379 INFO L225 Difference]: With dead ends: 84 [2022-12-13 18:36:37,379 INFO L226 Difference]: Without dead ends: 84 [2022-12-13 18:36:37,379 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 18:36:37,380 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 130 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 18:36:37,380 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 94 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 18:36:37,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2022-12-13 18:36:37,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2022-12-13 18:36:37,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 65 states have (on average 1.2923076923076924) internal successors, (84), 79 states have internal predecessors, (84), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-13 18:36:37,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 90 transitions. [2022-12-13 18:36:37,382 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 90 transitions. Word has length 58 [2022-12-13 18:36:37,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:36:37,382 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 90 transitions. [2022-12-13 18:36:37,382 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-12-13 18:36:37,382 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 90 transitions. [2022-12-13 18:36:37,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-12-13 18:36:37,383 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:36:37,383 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:36:37,388 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01bfce65-57b1-4fc4-8549-4cb4a09416c4/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2022-12-13 18:36:37,583 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01bfce65-57b1-4fc4-8549-4cb4a09416c4/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 18:36:37,584 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-12-13 18:36:37,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:36:37,585 INFO L85 PathProgramCache]: Analyzing trace with hash -1017304566, now seen corresponding path program 1 times [2022-12-13 18:36:37,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:36:37,586 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300419688] [2022-12-13 18:36:37,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:36:37,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:36:37,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:36:38,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 18:36:38,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:36:38,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 18:36:38,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:36:39,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-12-13 18:36:39,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:36:39,601 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-13 18:36:39,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:36:39,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300419688] [2022-12-13 18:36:39,601 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [300419688] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 18:36:39,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [197104209] [2022-12-13 18:36:39,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:36:39,602 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 18:36:39,602 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01bfce65-57b1-4fc4-8549-4cb4a09416c4/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 18:36:39,602 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01bfce65-57b1-4fc4-8549-4cb4a09416c4/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 18:36:39,603 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01bfce65-57b1-4fc4-8549-4cb4a09416c4/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-12-13 18:36:39,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:36:39,750 INFO L263 TraceCheckSpWp]: Trace formula consists of 476 conjuncts, 148 conjunts are in the unsatisfiable core [2022-12-13 18:36:39,755 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 18:36:39,796 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 18:36:39,952 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-12-13 18:36:40,038 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-13 18:36:40,038 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-12-13 18:36:40,163 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-13 18:36:40,346 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 18:36:40,346 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 36 [2022-12-13 18:36:40,600 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-13 18:36:40,600 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 27 [2022-12-13 18:36:40,605 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-12-13 18:36:40,609 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-13 18:36:40,793 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-13 18:36:40,933 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:36:40,934 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2022-12-13 18:36:40,950 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:36:40,956 INFO L321 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2022-12-13 18:36:40,957 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 60 treesize of output 45 [2022-12-13 18:36:40,971 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-12-13 18:36:40,971 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2022-12-13 18:36:41,237 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-12-13 18:36:41,530 INFO L321 Elim1Store]: treesize reduction 17, result has 32.0 percent of original size [2022-12-13 18:36:41,530 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 61 treesize of output 34 [2022-12-13 18:36:41,818 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2022-12-13 18:36:41,846 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-13 18:36:41,853 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-13 18:36:41,858 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:36:41,859 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-13 18:36:41,934 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:36:41,935 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 33 [2022-12-13 18:36:41,941 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-13 18:36:41,945 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:36:41,945 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-13 18:36:42,026 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-12-13 18:36:42,030 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-12-13 18:36:42,138 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-12-13 18:36:42,181 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 9 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 18:36:42,181 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 18:36:42,326 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2988 (Array Int Int)) (v_ArrVal_2987 (Array Int Int)) (v_ArrVal_2986 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2988) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2986) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2987) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)))) is different from false [2022-12-13 18:36:42,333 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 18:36:42,333 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 46 [2022-12-13 18:36:42,342 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 18:36:42,342 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 84 treesize of output 87 [2022-12-13 18:36:42,348 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 18:36:42,348 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 72 treesize of output 64 [2022-12-13 18:36:42,352 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 26 [2022-12-13 18:36:42,360 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 18:36:42,360 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 110 treesize of output 109 [2022-12-13 18:36:42,365 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 90 [2022-12-13 18:36:43,065 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse17 (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse13 (+ |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| 4)) (.cse50 (forall ((v_ArrVal_2988 (Array Int Int)) (v_arrayElimCell_150 Int) (v_ArrVal_2982 (Array Int Int)) (v_arrayElimCell_147 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2982) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2988) v_arrayElimCell_147) (+ v_arrayElimCell_150 4))))) (.cse23 (not .cse17)) (.cse45 (forall ((v_ArrVal_2988 (Array Int Int)) (v_arrayElimCell_150 Int) (v_arrayElimCell_146 Int) (v_ArrVal_2982 (Array Int Int))) (let ((.cse66 (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2982) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2988)) (.cse67 (+ v_arrayElimCell_150 4))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse66 v_arrayElimCell_146) .cse67)) (forall ((v_arrayElimCell_147 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse66 v_arrayElimCell_147) .cse67)))))))) (let ((.cse19 (forall ((v_ArrVal_2988 (Array Int Int)) (v_arrayElimCell_150 Int) (v_ArrVal_2982 (Array Int Int))) (let ((.cse64 (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2982) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2988)) (.cse65 (+ v_arrayElimCell_150 4))) (or (= (select (select .cse64 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) .cse65) |c_ULTIMATE.start_main_~data~0#1|) (forall ((v_arrayElimCell_147 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse64 v_arrayElimCell_147) .cse65))))))) (.cse1 (forall ((v_ArrVal_2988 (Array Int Int)) (v_arrayElimCell_146 Int) (v_ArrVal_2982 (Array Int Int)) (v_arrayElimCell_149 Int)) (let ((.cse63 (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2982) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2988))) (let ((.cse61 (select .cse63 v_arrayElimCell_146))) (or (forall ((v_arrayElimCell_150 Int)) (let ((.cse62 (+ v_arrayElimCell_150 4))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse61 .cse62)) (forall ((v_arrayElimCell_147 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse63 v_arrayElimCell_147) .cse62)))))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse61 (+ v_arrayElimCell_149 4)))))))) (.cse2 (or .cse17 (forall ((v_ArrVal_2988 (Array Int Int)) (v_ArrVal_2982 (Array Int Int)) (v_arrayElimCell_146 Int) (v_arrayElimCell_149 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2982) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2988) v_arrayElimCell_146) (+ v_arrayElimCell_149 4)))))) (.cse4 (or .cse23 (and .cse45 (forall ((v_ArrVal_2988 (Array Int Int)) (v_arrayElimCell_150 Int) (v_arrayElimCell_146 Int) (v_ArrVal_2982 (Array Int Int)) (v_arrayElimCell_149 Int)) (let ((.cse59 (+ v_arrayElimCell_150 4)) (.cse58 (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2982) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2988))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse58 v_arrayElimCell_146) .cse59)) (forall ((v_arrayElimCell_147 Int)) (let ((.cse60 (select .cse58 v_arrayElimCell_147))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse60 (+ v_arrayElimCell_149 4))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse60 .cse59))))))))))) (.cse5 (forall ((v_ArrVal_2988 (Array Int Int)) (v_arrayElimCell_146 Int) (v_ArrVal_2982 (Array Int Int)) (v_arrayElimCell_149 Int)) (let ((.cse57 (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2982) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2988))) (let ((.cse53 (select .cse57 v_arrayElimCell_146)) (.cse56 (+ v_arrayElimCell_149 4))) (or (forall ((v_arrayElimCell_150 Int)) (let ((.cse54 (+ v_arrayElimCell_150 4))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse53 .cse54)) (forall ((v_arrayElimCell_147 Int)) (let ((.cse55 (select .cse57 v_arrayElimCell_147))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse55 .cse56)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse55 .cse54)))))))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse53 .cse56))))))) (.cse7 (or .cse23 (and .cse50 (forall ((v_ArrVal_2988 (Array Int Int)) (v_arrayElimCell_150 Int) (v_ArrVal_2982 (Array Int Int)) (v_arrayElimCell_147 Int) (v_arrayElimCell_149 Int)) (let ((.cse52 (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2982) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2988) v_arrayElimCell_147))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse52 (+ v_arrayElimCell_149 4))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse52 (+ v_arrayElimCell_150 4))))))))) (.cse24 (or .cse23 (and .cse50 (forall ((v_ArrVal_2988 (Array Int Int)) (v_arrayElimCell_150 Int) (v_ArrVal_2982 (Array Int Int)) (v_arrayElimCell_147 Int)) (let ((.cse51 (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2982) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2988) v_arrayElimCell_147))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse51 .cse13)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse51 (+ v_arrayElimCell_150 4)))))))))) (let ((.cse18 (and (forall ((v_ArrVal_2988 (Array Int Int)) (v_arrayElimCell_146 Int) (v_ArrVal_2982 (Array Int Int))) (let ((.cse41 (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2982) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2988))) (let ((.cse39 (select .cse41 v_arrayElimCell_146))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse39 .cse13)) (forall ((v_arrayElimCell_150 Int)) (let ((.cse40 (+ v_arrayElimCell_150 4))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse39 .cse40)) (forall ((v_arrayElimCell_147 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse41 v_arrayElimCell_147) .cse40)))))))))) (or .cse23 (and (forall ((v_ArrVal_2988 (Array Int Int)) (v_arrayElimCell_150 Int) (v_arrayElimCell_146 Int) (v_ArrVal_2982 (Array Int Int))) (let ((.cse44 (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2982) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2988)) (.cse43 (+ v_arrayElimCell_150 4))) (or (forall ((v_arrayElimCell_147 Int)) (let ((.cse42 (select .cse44 v_arrayElimCell_147))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse42 .cse13)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse42 .cse43))))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse44 v_arrayElimCell_146) .cse43))))) .cse45)) (or .cse17 (forall ((v_ArrVal_2988 (Array Int Int)) (v_ArrVal_2982 (Array Int Int)) (v_arrayElimCell_146 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2982) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2988) v_arrayElimCell_146) .cse13)))) .cse24 (forall ((v_ArrVal_2988 (Array Int Int)) (v_arrayElimCell_146 Int) (v_ArrVal_2982 (Array Int Int))) (let ((.cse49 (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2982) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2988))) (let ((.cse46 (select .cse49 v_arrayElimCell_146))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse46 .cse13)) (forall ((v_arrayElimCell_150 Int)) (let ((.cse48 (+ v_arrayElimCell_150 4))) (or (forall ((v_arrayElimCell_147 Int)) (let ((.cse47 (select .cse49 v_arrayElimCell_147))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse47 .cse13)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse47 .cse48))))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse46 .cse48))))))))))) (.cse10 (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse11 (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse9 (and .cse1 .cse2 .cse4 .cse5 .cse7)) (.cse0 (or (and .cse19 (forall ((v_ArrVal_2988 (Array Int Int)) (v_arrayElimCell_150 Int) (v_ArrVal_2982 (Array Int Int)) (v_arrayElimCell_149 Int)) (let ((.cse37 (+ v_arrayElimCell_150 4)) (.cse36 (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2982) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2988))) (or (= (select (select .cse36 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) .cse37) |c_ULTIMATE.start_main_~data~0#1|) (forall ((v_arrayElimCell_147 Int)) (let ((.cse38 (select .cse36 v_arrayElimCell_147))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse38 (+ v_arrayElimCell_149 4))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse38 .cse37))))))))) .cse23)) (.cse3 (forall ((v_ArrVal_2988 (Array Int Int)) (v_ArrVal_2982 (Array Int Int)) (v_arrayElimCell_149 Int)) (let ((.cse35 (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2982) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2988))) (let ((.cse33 (select .cse35 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|))) (or (forall ((v_arrayElimCell_150 Int)) (let ((.cse34 (+ v_arrayElimCell_150 4))) (or (= (select .cse33 .cse34) |c_ULTIMATE.start_main_~data~0#1|) (forall ((v_arrayElimCell_147 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse35 v_arrayElimCell_147) .cse34)))))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse33 (+ v_arrayElimCell_149 4)))))))) (.cse6 (forall ((v_ArrVal_2988 (Array Int Int)) (v_ArrVal_2982 (Array Int Int)) (v_arrayElimCell_149 Int)) (let ((.cse32 (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2982) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2988))) (let ((.cse28 (select .cse32 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) (.cse31 (+ v_arrayElimCell_149 4))) (or (forall ((v_arrayElimCell_150 Int)) (let ((.cse29 (+ v_arrayElimCell_150 4))) (or (= (select .cse28 .cse29) |c_ULTIMATE.start_main_~data~0#1|) (forall ((v_arrayElimCell_147 Int)) (let ((.cse30 (select .cse32 v_arrayElimCell_147))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse30 .cse31)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse30 .cse29)))))))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse28 .cse31))))))) (.cse8 (or .cse17 (forall ((v_ArrVal_2988 (Array Int Int)) (v_ArrVal_2982 (Array Int Int)) (v_arrayElimCell_149 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2982) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2988) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) (+ v_arrayElimCell_149 4))))))) (and (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (or .cse9 .cse10)) .cse11) (forall ((v_ArrVal_2988 (Array Int Int)) (v_ArrVal_2982 (Array Int Int))) (let ((.cse16 (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2982) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2988))) (let ((.cse12 (select .cse16 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse12 .cse13)) (forall ((v_arrayElimCell_150 Int)) (let ((.cse15 (+ v_arrayElimCell_150 4))) (or (forall ((v_arrayElimCell_147 Int)) (let ((.cse14 (select .cse16 v_arrayElimCell_147))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse14 .cse13)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse14 .cse15))))) (= (select .cse12 .cse15) |c_ULTIMATE.start_main_~data~0#1|)))))))) (or .cse17 (forall ((v_ArrVal_2988 (Array Int Int)) (v_ArrVal_2982 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2982) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2988) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) .cse13)))) (or .cse18 .cse10) (or .cse18 .cse11) (or (and .cse19 (forall ((v_ArrVal_2988 (Array Int Int)) (v_arrayElimCell_150 Int) (v_ArrVal_2982 (Array Int Int))) (let ((.cse22 (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2982) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2988)) (.cse21 (+ v_arrayElimCell_150 4))) (or (forall ((v_arrayElimCell_147 Int)) (let ((.cse20 (select .cse22 v_arrayElimCell_147))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse20 .cse13)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse20 .cse21))))) (= (select (select .cse22 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) .cse21) |c_ULTIMATE.start_main_~data~0#1|))))) .cse23) (or .cse10 (and (or .cse11 .cse9) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8)) .cse24 (forall ((v_ArrVal_2988 (Array Int Int)) (v_ArrVal_2982 (Array Int Int))) (let ((.cse27 (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2982) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2988))) (let ((.cse25 (select .cse27 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|))) (or (forall ((v_arrayElimCell_150 Int)) (let ((.cse26 (+ v_arrayElimCell_150 4))) (or (= (select .cse25 .cse26) |c_ULTIMATE.start_main_~data~0#1|) (forall ((v_arrayElimCell_147 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse27 v_arrayElimCell_147) .cse26)))))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse25 .cse13))))))))))) is different from false [2022-12-13 18:36:44,413 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse8 (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse5 (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|))) (let ((.cse33 (forall ((v_ArrVal_2988 (Array Int Int)) (v_arrayElimCell_150 Int) (v_ArrVal_2980 Int) (v_arrayElimCell_146 Int) (v_ArrVal_2982 (Array Int Int))) (let ((.cse67 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse5 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2980)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2982) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2988)) (.cse68 (+ v_arrayElimCell_150 4))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse67 v_arrayElimCell_146) .cse68)) (forall ((v_arrayElimCell_147 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse67 v_arrayElimCell_147) .cse68))))))) (.cse14 (not .cse8)) (.cse3 (+ |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| 4)) (.cse60 (forall ((v_ArrVal_2988 (Array Int Int)) (v_arrayElimCell_150 Int) (v_ArrVal_2980 Int) (v_ArrVal_2982 (Array Int Int)) (v_arrayElimCell_147 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse5 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2980)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2982) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2988) v_arrayElimCell_147) (+ v_arrayElimCell_150 4)))))) (let ((.cse9 (or .cse14 (and (forall ((v_ArrVal_2988 (Array Int Int)) (v_arrayElimCell_150 Int) (v_ArrVal_2980 Int) (v_ArrVal_2982 (Array Int Int)) (v_arrayElimCell_147 Int)) (let ((.cse66 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse5 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2980)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2982) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2988) v_arrayElimCell_147))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse66 .cse3)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse66 (+ v_arrayElimCell_150 4)))))) .cse60))) (.cse13 (forall ((v_ArrVal_2988 (Array Int Int)) (v_arrayElimCell_150 Int) (v_ArrVal_2980 Int) (v_ArrVal_2982 (Array Int Int))) (let ((.cse64 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse5 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2980)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2982) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2988)) (.cse65 (+ v_arrayElimCell_150 4))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse64 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) .cse65)) (forall ((v_arrayElimCell_147 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse64 v_arrayElimCell_147) .cse65))))))) (.cse20 (or .cse8 (forall ((v_ArrVal_2988 (Array Int Int)) (v_ArrVal_2980 Int) (v_ArrVal_2982 (Array Int Int)) (v_arrayElimCell_146 Int) (v_arrayElimCell_149 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse5 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2980)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2982) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2988) v_arrayElimCell_146) (+ v_arrayElimCell_149 4)))))) (.cse21 (or (and .cse33 (forall ((v_ArrVal_2988 (Array Int Int)) (v_arrayElimCell_150 Int) (v_ArrVal_2980 Int) (v_arrayElimCell_146 Int) (v_ArrVal_2982 (Array Int Int)) (v_arrayElimCell_149 Int)) (let ((.cse63 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse5 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2980)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2982) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2988)) (.cse62 (+ v_arrayElimCell_150 4))) (or (forall ((v_arrayElimCell_147 Int)) (let ((.cse61 (select .cse63 v_arrayElimCell_147))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse61 .cse62)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse61 (+ v_arrayElimCell_149 4)))))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse63 v_arrayElimCell_146) .cse62)))))) .cse14)) (.cse22 (or .cse14 (and (forall ((v_ArrVal_2988 (Array Int Int)) (v_arrayElimCell_150 Int) (v_ArrVal_2980 Int) (v_ArrVal_2982 (Array Int Int)) (v_arrayElimCell_147 Int) (v_arrayElimCell_149 Int)) (let ((.cse59 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse5 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2980)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2982) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2988) v_arrayElimCell_147))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse59 (+ v_arrayElimCell_150 4))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse59 (+ v_arrayElimCell_149 4)))))) .cse60))) (.cse23 (forall ((v_ArrVal_2988 (Array Int Int)) (v_ArrVal_2980 Int) (v_arrayElimCell_146 Int) (v_ArrVal_2982 (Array Int Int)) (v_arrayElimCell_149 Int)) (let ((.cse58 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse5 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2980)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2982) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2988))) (let ((.cse56 (select .cse58 v_arrayElimCell_146))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse56 (+ v_arrayElimCell_149 4))) (forall ((v_arrayElimCell_150 Int)) (let ((.cse57 (+ v_arrayElimCell_150 4))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse56 .cse57)) (forall ((v_arrayElimCell_147 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse58 v_arrayElimCell_147) .cse57))))))))))) (.cse25 (forall ((v_ArrVal_2988 (Array Int Int)) (v_ArrVal_2980 Int) (v_arrayElimCell_146 Int) (v_ArrVal_2982 (Array Int Int)) (v_arrayElimCell_149 Int)) (let ((.cse55 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse5 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2980)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2982) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2988))) (let ((.cse52 (+ v_arrayElimCell_149 4)) (.cse51 (select .cse55 v_arrayElimCell_146))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse51 .cse52)) (forall ((v_arrayElimCell_150 Int)) (let ((.cse54 (+ v_arrayElimCell_150 4))) (or (forall ((v_arrayElimCell_147 Int)) (let ((.cse53 (select .cse55 v_arrayElimCell_147))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse53 .cse54)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse53 .cse52))))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse51 .cse54))))))))))) (let ((.cse7 (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse18 (forall ((v_ArrVal_2988 (Array Int Int)) (v_ArrVal_2980 Int) (v_ArrVal_2982 (Array Int Int)) (v_arrayElimCell_149 Int)) (let ((.cse49 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse5 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2980)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2982) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2988))) (let ((.cse50 (select .cse49 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) (.cse48 (+ v_arrayElimCell_149 4))) (or (forall ((v_arrayElimCell_150 Int)) (let ((.cse47 (+ v_arrayElimCell_150 4))) (or (forall ((v_arrayElimCell_147 Int)) (let ((.cse46 (select .cse49 v_arrayElimCell_147))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse46 .cse47)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse46 .cse48))))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse50 .cse47))))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse50 .cse48))))))) (.cse19 (forall ((v_ArrVal_2988 (Array Int Int)) (v_ArrVal_2980 Int) (v_ArrVal_2982 (Array Int Int)) (v_arrayElimCell_149 Int)) (let ((.cse45 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse5 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2980)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2982) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2988))) (let ((.cse43 (select .cse45 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse43 (+ v_arrayElimCell_149 4))) (forall ((v_arrayElimCell_150 Int)) (let ((.cse44 (+ v_arrayElimCell_150 4))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse43 .cse44)) (forall ((v_arrayElimCell_147 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse45 v_arrayElimCell_147) .cse44))))))))))) (.cse26 (and .cse20 .cse21 .cse22 .cse23 .cse25)) (.cse24 (or .cse14 (and .cse13 (forall ((v_ArrVal_2988 (Array Int Int)) (v_arrayElimCell_150 Int) (v_ArrVal_2980 Int) (v_ArrVal_2982 (Array Int Int)) (v_arrayElimCell_149 Int)) (let ((.cse42 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse5 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2980)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2982) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2988)) (.cse41 (+ v_arrayElimCell_150 4))) (or (forall ((v_arrayElimCell_147 Int)) (let ((.cse40 (select .cse42 v_arrayElimCell_147))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse40 .cse41)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse40 (+ v_arrayElimCell_149 4)))))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse42 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) .cse41)))))))) (.cse27 (or .cse8 (forall ((v_ArrVal_2988 (Array Int Int)) (v_ArrVal_2980 Int) (v_ArrVal_2982 (Array Int Int)) (v_arrayElimCell_149 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse5 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2980)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2982) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2988) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) (+ v_arrayElimCell_149 4)))))) (.cse6 (and (forall ((v_ArrVal_2988 (Array Int Int)) (v_ArrVal_2980 Int) (v_arrayElimCell_146 Int) (v_ArrVal_2982 (Array Int Int))) (let ((.cse32 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse5 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2980)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2982) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2988))) (let ((.cse29 (select .cse32 v_arrayElimCell_146))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse29 .cse3)) (forall ((v_arrayElimCell_150 Int)) (let ((.cse30 (+ v_arrayElimCell_150 4))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse29 .cse30)) (forall ((v_arrayElimCell_147 Int)) (let ((.cse31 (select .cse32 v_arrayElimCell_147))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse31 .cse3)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse31 .cse30)))))))))))) (or .cse14 (and .cse33 (forall ((v_ArrVal_2988 (Array Int Int)) (v_arrayElimCell_150 Int) (v_ArrVal_2980 Int) (v_arrayElimCell_146 Int) (v_ArrVal_2982 (Array Int Int))) (let ((.cse35 (+ v_arrayElimCell_150 4)) (.cse34 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse5 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2980)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2982) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2988))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse34 v_arrayElimCell_146) .cse35)) (forall ((v_arrayElimCell_147 Int)) (let ((.cse36 (select .cse34 v_arrayElimCell_147))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse36 .cse3)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse36 .cse35)))))))))) .cse9 (or .cse8 (forall ((v_ArrVal_2988 (Array Int Int)) (v_ArrVal_2980 Int) (v_ArrVal_2982 (Array Int Int)) (v_arrayElimCell_146 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse5 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2980)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2982) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2988) v_arrayElimCell_146) .cse3)))) (forall ((v_ArrVal_2988 (Array Int Int)) (v_ArrVal_2980 Int) (v_arrayElimCell_146 Int) (v_ArrVal_2982 (Array Int Int))) (let ((.cse39 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse5 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2980)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2982) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2988))) (let ((.cse37 (select .cse39 v_arrayElimCell_146))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse37 .cse3)) (forall ((v_arrayElimCell_150 Int)) (let ((.cse38 (+ v_arrayElimCell_150 4))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse37 .cse38)) (forall ((v_arrayElimCell_147 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse39 v_arrayElimCell_147) .cse38)))))))))))) (.cse28 (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (forall ((v_ArrVal_2988 (Array Int Int)) (v_ArrVal_2980 Int) (v_ArrVal_2982 (Array Int Int))) (let ((.cse4 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse5 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2980)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2982) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2988))) (let ((.cse0 (select .cse4 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|))) (or (forall ((v_arrayElimCell_150 Int)) (let ((.cse1 (+ v_arrayElimCell_150 4))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse0 .cse1)) (forall ((v_arrayElimCell_147 Int)) (let ((.cse2 (select .cse4 v_arrayElimCell_147))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse2 .cse3)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse2 .cse1)))))))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse0 .cse3)))))) (or .cse6 .cse7) (or .cse8 (forall ((v_ArrVal_2988 (Array Int Int)) (v_ArrVal_2980 Int) (v_ArrVal_2982 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse5 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2980)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2982) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2988) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) .cse3)))) .cse9 (or (and (forall ((v_ArrVal_2988 (Array Int Int)) (v_arrayElimCell_150 Int) (v_ArrVal_2980 Int) (v_ArrVal_2982 (Array Int Int))) (let ((.cse11 (+ v_arrayElimCell_150 4)) (.cse10 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse5 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2980)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2982) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2988))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse10 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) .cse11)) (forall ((v_arrayElimCell_147 Int)) (let ((.cse12 (select .cse10 v_arrayElimCell_147))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse12 .cse3)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse12 .cse11)))))))) .cse13) .cse14) (forall ((v_ArrVal_2988 (Array Int Int)) (v_ArrVal_2980 Int) (v_ArrVal_2982 (Array Int Int))) (let ((.cse17 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse5 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2980)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2982) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2988))) (let ((.cse15 (select .cse17 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse15 .cse3)) (forall ((v_arrayElimCell_150 Int)) (let ((.cse16 (+ v_arrayElimCell_150 4))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse15 .cse16)) (forall ((v_arrayElimCell_147 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse17 v_arrayElimCell_147) .cse16)))))))))) (or (and .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 (or .cse7 .cse26) .cse27) .cse28) (or .cse7 (and .cse18 .cse19 .cse20 (or .cse26 .cse28) .cse21 .cse22 .cse23 .cse24 .cse25 .cse27)) (or .cse6 .cse28)))))) is different from false [2022-12-13 18:36:47,897 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse28 (= |c_ULTIMATE.start_sll_circular_prepend_#t~mem14#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse8 (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|))) (let ((.cse39 (forall ((v_ArrVal_2988 (Array Int Int)) (v_arrayElimCell_150 Int) (v_ArrVal_2980 Int) (v_arrayElimCell_146 Int) (v_ArrVal_2982 (Array Int Int))) (let ((.cse67 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse8 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2980)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2982) |c_ULTIMATE.start_sll_circular_prepend_#t~mem14#1.base| v_ArrVal_2988)) (.cse68 (+ v_arrayElimCell_150 4))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse67 v_arrayElimCell_146) .cse68)) (forall ((v_arrayElimCell_147 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse67 v_arrayElimCell_147) .cse68))))))) (.cse23 (not .cse28)) (.cse56 (forall ((v_ArrVal_2988 (Array Int Int)) (v_arrayElimCell_150 Int) (v_ArrVal_2980 Int) (v_ArrVal_2982 (Array Int Int)) (v_arrayElimCell_147 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse8 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2980)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2982) |c_ULTIMATE.start_sll_circular_prepend_#t~mem14#1.base| v_ArrVal_2988) v_arrayElimCell_147) (+ v_arrayElimCell_150 4))))) (.cse4 (+ |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| 4))) (let ((.cse0 (or .cse23 (and .cse56 (forall ((v_ArrVal_2988 (Array Int Int)) (v_arrayElimCell_150 Int) (v_ArrVal_2980 Int) (v_ArrVal_2982 (Array Int Int)) (v_arrayElimCell_147 Int)) (let ((.cse66 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse8 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2980)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2982) |c_ULTIMATE.start_sll_circular_prepend_#t~mem14#1.base| v_ArrVal_2988) v_arrayElimCell_147))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse66 .cse4)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse66 (+ v_arrayElimCell_150 4))))))))) (.cse10 (forall ((v_ArrVal_2988 (Array Int Int)) (v_ArrVal_2980 Int) (v_arrayElimCell_146 Int) (v_ArrVal_2982 (Array Int Int)) (v_arrayElimCell_149 Int)) (let ((.cse65 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse8 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2980)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2982) |c_ULTIMATE.start_sll_circular_prepend_#t~mem14#1.base| v_ArrVal_2988))) (let ((.cse63 (select .cse65 v_arrayElimCell_146))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse63 (+ v_arrayElimCell_149 4))) (forall ((v_arrayElimCell_150 Int)) (let ((.cse64 (+ v_arrayElimCell_150 4))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse63 .cse64)) (forall ((v_arrayElimCell_147 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse65 v_arrayElimCell_147) .cse64))))))))))) (.cse11 (or (forall ((v_ArrVal_2988 (Array Int Int)) (v_ArrVal_2980 Int) (v_ArrVal_2982 (Array Int Int)) (v_arrayElimCell_146 Int) (v_arrayElimCell_149 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse8 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2980)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2982) |c_ULTIMATE.start_sll_circular_prepend_#t~mem14#1.base| v_ArrVal_2988) v_arrayElimCell_146) (+ v_arrayElimCell_149 4)))) .cse28)) (.cse13 (forall ((v_ArrVal_2988 (Array Int Int)) (v_ArrVal_2980 Int) (v_arrayElimCell_146 Int) (v_ArrVal_2982 (Array Int Int)) (v_arrayElimCell_149 Int)) (let ((.cse62 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse8 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2980)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2982) |c_ULTIMATE.start_sll_circular_prepend_#t~mem14#1.base| v_ArrVal_2988))) (let ((.cse58 (select .cse62 v_arrayElimCell_146)) (.cse59 (+ v_arrayElimCell_149 4))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse58 .cse59)) (forall ((v_arrayElimCell_150 Int)) (let ((.cse60 (+ v_arrayElimCell_150 4))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse58 .cse60)) (forall ((v_arrayElimCell_147 Int)) (let ((.cse61 (select .cse62 v_arrayElimCell_147))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse61 .cse59)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse61 .cse60))))))))))))) (.cse14 (or .cse23 (and .cse56 (forall ((v_ArrVal_2988 (Array Int Int)) (v_arrayElimCell_150 Int) (v_ArrVal_2980 Int) (v_ArrVal_2982 (Array Int Int)) (v_arrayElimCell_147 Int) (v_arrayElimCell_149 Int)) (let ((.cse57 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse8 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2980)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2982) |c_ULTIMATE.start_sll_circular_prepend_#t~mem14#1.base| v_ArrVal_2988) v_arrayElimCell_147))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse57 (+ v_arrayElimCell_149 4))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse57 (+ v_arrayElimCell_150 4))))))))) (.cse18 (or .cse23 (and (forall ((v_ArrVal_2988 (Array Int Int)) (v_arrayElimCell_150 Int) (v_ArrVal_2980 Int) (v_arrayElimCell_146 Int) (v_ArrVal_2982 (Array Int Int)) (v_arrayElimCell_149 Int)) (let ((.cse54 (+ v_arrayElimCell_150 4)) (.cse53 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse8 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2980)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2982) |c_ULTIMATE.start_sll_circular_prepend_#t~mem14#1.base| v_ArrVal_2988))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse53 v_arrayElimCell_146) .cse54)) (forall ((v_arrayElimCell_147 Int)) (let ((.cse55 (select .cse53 v_arrayElimCell_147))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse55 (+ v_arrayElimCell_149 4))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse55 .cse54)))))))) .cse39))) (.cse24 (forall ((v_ArrVal_2988 (Array Int Int)) (v_arrayElimCell_150 Int) (v_ArrVal_2980 Int) (v_ArrVal_2982 (Array Int Int))) (let ((.cse51 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse8 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2980)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2982) |c_ULTIMATE.start_sll_circular_prepend_#t~mem14#1.base| v_ArrVal_2988)) (.cse52 (+ v_arrayElimCell_150 4))) (or (forall ((v_arrayElimCell_147 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse51 v_arrayElimCell_147) .cse52))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse51 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) .cse52))))))) (let ((.cse2 (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse12 (forall ((v_ArrVal_2988 (Array Int Int)) (v_ArrVal_2980 Int) (v_ArrVal_2982 (Array Int Int)) (v_arrayElimCell_149 Int)) (let ((.cse50 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse8 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2980)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2982) |c_ULTIMATE.start_sll_circular_prepend_#t~mem14#1.base| v_ArrVal_2988))) (let ((.cse47 (+ v_arrayElimCell_149 4)) (.cse46 (select .cse50 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse46 .cse47)) (forall ((v_arrayElimCell_150 Int)) (let ((.cse49 (+ v_arrayElimCell_150 4))) (or (forall ((v_arrayElimCell_147 Int)) (let ((.cse48 (select .cse50 v_arrayElimCell_147))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse48 .cse47)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse48 .cse49))))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse46 .cse49)))))))))) (.cse15 (or .cse23 (and .cse24 (forall ((v_ArrVal_2988 (Array Int Int)) (v_arrayElimCell_150 Int) (v_ArrVal_2980 Int) (v_ArrVal_2982 (Array Int Int)) (v_arrayElimCell_149 Int)) (let ((.cse45 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse8 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2980)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2982) |c_ULTIMATE.start_sll_circular_prepend_#t~mem14#1.base| v_ArrVal_2988)) (.cse44 (+ v_arrayElimCell_150 4))) (or (forall ((v_arrayElimCell_147 Int)) (let ((.cse43 (select .cse45 v_arrayElimCell_147))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse43 (+ v_arrayElimCell_149 4))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse43 .cse44))))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse45 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) .cse44)))))))) (.cse9 (and .cse10 .cse11 .cse13 .cse14 .cse18)) (.cse16 (or (forall ((v_ArrVal_2988 (Array Int Int)) (v_ArrVal_2980 Int) (v_ArrVal_2982 (Array Int Int)) (v_arrayElimCell_149 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse8 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2980)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2982) |c_ULTIMATE.start_sll_circular_prepend_#t~mem14#1.base| v_ArrVal_2988) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) (+ v_arrayElimCell_149 4)))) .cse28)) (.cse17 (forall ((v_ArrVal_2988 (Array Int Int)) (v_ArrVal_2980 Int) (v_ArrVal_2982 (Array Int Int)) (v_arrayElimCell_149 Int)) (let ((.cse40 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse8 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2980)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2982) |c_ULTIMATE.start_sll_circular_prepend_#t~mem14#1.base| v_ArrVal_2988))) (let ((.cse42 (select .cse40 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|))) (or (forall ((v_arrayElimCell_150 Int)) (let ((.cse41 (+ v_arrayElimCell_150 4))) (or (forall ((v_arrayElimCell_147 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse40 v_arrayElimCell_147) .cse41))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse42 .cse41))))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse42 (+ v_arrayElimCell_149 4)))))))) (.cse1 (and .cse0 (forall ((v_ArrVal_2988 (Array Int Int)) (v_ArrVal_2980 Int) (v_arrayElimCell_146 Int) (v_ArrVal_2982 (Array Int Int))) (let ((.cse32 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse8 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2980)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2982) |c_ULTIMATE.start_sll_circular_prepend_#t~mem14#1.base| v_ArrVal_2988))) (let ((.cse29 (select .cse32 v_arrayElimCell_146))) (or (forall ((v_arrayElimCell_150 Int)) (let ((.cse30 (+ v_arrayElimCell_150 4))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse29 .cse30)) (forall ((v_arrayElimCell_147 Int)) (let ((.cse31 (select .cse32 v_arrayElimCell_147))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse31 .cse4)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse31 .cse30)))))))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse29 .cse4)))))) (forall ((v_ArrVal_2988 (Array Int Int)) (v_ArrVal_2980 Int) (v_arrayElimCell_146 Int) (v_ArrVal_2982 (Array Int Int))) (let ((.cse35 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse8 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2980)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2982) |c_ULTIMATE.start_sll_circular_prepend_#t~mem14#1.base| v_ArrVal_2988))) (let ((.cse33 (select .cse35 v_arrayElimCell_146))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse33 .cse4)) (forall ((v_arrayElimCell_150 Int)) (let ((.cse34 (+ v_arrayElimCell_150 4))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse33 .cse34)) (forall ((v_arrayElimCell_147 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse35 v_arrayElimCell_147) .cse34)))))))))) (or .cse23 (and (forall ((v_ArrVal_2988 (Array Int Int)) (v_arrayElimCell_150 Int) (v_ArrVal_2980 Int) (v_arrayElimCell_146 Int) (v_ArrVal_2982 (Array Int Int))) (let ((.cse37 (+ v_arrayElimCell_150 4)) (.cse36 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse8 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2980)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2982) |c_ULTIMATE.start_sll_circular_prepend_#t~mem14#1.base| v_ArrVal_2988))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse36 v_arrayElimCell_146) .cse37)) (forall ((v_arrayElimCell_147 Int)) (let ((.cse38 (select .cse36 v_arrayElimCell_147))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse38 .cse4)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse38 .cse37)))))))) .cse39)) (or (forall ((v_ArrVal_2988 (Array Int Int)) (v_ArrVal_2980 Int) (v_ArrVal_2982 (Array Int Int)) (v_arrayElimCell_146 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse8 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2980)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2982) |c_ULTIMATE.start_sll_circular_prepend_#t~mem14#1.base| v_ArrVal_2988) v_arrayElimCell_146) .cse4))) .cse28))) (.cse19 (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and .cse0 (or .cse1 .cse2) (forall ((v_ArrVal_2988 (Array Int Int)) (v_ArrVal_2980 Int) (v_ArrVal_2982 (Array Int Int))) (let ((.cse6 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse8 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2980)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2982) |c_ULTIMATE.start_sll_circular_prepend_#t~mem14#1.base| v_ArrVal_2988))) (let ((.cse7 (select .cse6 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|))) (or (forall ((v_arrayElimCell_150 Int)) (let ((.cse5 (+ v_arrayElimCell_150 4))) (or (forall ((v_arrayElimCell_147 Int)) (let ((.cse3 (select .cse6 v_arrayElimCell_147))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse3 .cse4)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse3 .cse5))))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse7 .cse5))))) (= (select .cse7 .cse4) |c_ULTIMATE.start_main_~data~0#1|))))) (or (and (or .cse2 .cse9) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) .cse19) (forall ((v_ArrVal_2988 (Array Int Int)) (v_ArrVal_2980 Int) (v_ArrVal_2982 (Array Int Int))) (let ((.cse20 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse8 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2980)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2982) |c_ULTIMATE.start_sll_circular_prepend_#t~mem14#1.base| v_ArrVal_2988))) (let ((.cse22 (select .cse20 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|))) (or (forall ((v_arrayElimCell_150 Int)) (let ((.cse21 (+ v_arrayElimCell_150 4))) (or (forall ((v_arrayElimCell_147 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse20 v_arrayElimCell_147) .cse21))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse22 .cse21))))) (= (select .cse22 .cse4) |c_ULTIMATE.start_main_~data~0#1|))))) (or .cse23 (and .cse24 (forall ((v_ArrVal_2988 (Array Int Int)) (v_arrayElimCell_150 Int) (v_ArrVal_2980 Int) (v_ArrVal_2982 (Array Int Int))) (let ((.cse27 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse8 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2980)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2982) |c_ULTIMATE.start_sll_circular_prepend_#t~mem14#1.base| v_ArrVal_2988)) (.cse26 (+ v_arrayElimCell_150 4))) (or (forall ((v_arrayElimCell_147 Int)) (let ((.cse25 (select .cse27 v_arrayElimCell_147))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse25 .cse4)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse25 .cse26))))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse27 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) .cse26))))))) (or .cse2 (and .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (or .cse19 .cse9) .cse16 .cse17 .cse18)) (or (forall ((v_ArrVal_2988 (Array Int Int)) (v_ArrVal_2980 Int) (v_ArrVal_2982 (Array Int Int))) (= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse8 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2980)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2982) |c_ULTIMATE.start_sll_circular_prepend_#t~mem14#1.base| v_ArrVal_2988) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) .cse4) |c_ULTIMATE.start_main_~data~0#1|)) .cse28) (or .cse1 .cse19)))))) is different from false [2022-12-13 18:37:09,904 WARN L233 SmtUtils]: Spent 14.07s on a formula simplification. DAG size of input: 127 DAG size of output: 62 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 18:37:10,175 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_#t~mem11#1.base|) |c_ULTIMATE.start_sll_circular_prepend_#t~mem11#1.offset|))) (let ((.cse17 (= .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse8 (not .cse17)) (.cse2 (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) (.cse7 (+ |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| 4))) (and (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (or (and (forall ((v_ArrVal_2988 (Array Int Int)) (v_arrayElimCell_150 Int) (v_ArrVal_2980 Int) (v_ArrVal_2982 (Array Int Int))) (let ((.cse0 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse2 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2980)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2982) .cse3 v_ArrVal_2988)) (.cse1 (+ v_arrayElimCell_150 4))) (or (= (select (select .cse0 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) .cse1) |c_ULTIMATE.start_main_~data~0#1|) (forall ((v_arrayElimCell_147 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse0 v_arrayElimCell_147) .cse1)))))) (forall ((v_ArrVal_2988 (Array Int Int)) (v_arrayElimCell_150 Int) (v_ArrVal_2980 Int) (v_ArrVal_2982 (Array Int Int))) (let ((.cse5 (+ v_arrayElimCell_150 4)) (.cse4 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse2 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2980)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2982) .cse3 v_ArrVal_2988))) (or (= (select (select .cse4 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) .cse5) |c_ULTIMATE.start_main_~data~0#1|) (forall ((v_arrayElimCell_147 Int)) (let ((.cse6 (select .cse4 v_arrayElimCell_147))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse6 .cse5)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse6 .cse7))))))))) .cse8) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (forall ((v_ArrVal_2988 (Array Int Int)) (v_ArrVal_2980 Int) (v_ArrVal_2982 (Array Int Int))) (let ((.cse11 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse2 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2980)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2982) .cse3 v_ArrVal_2988))) (let ((.cse9 (select .cse11 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse9 .cse7)) (forall ((v_arrayElimCell_150 Int)) (let ((.cse10 (+ v_arrayElimCell_150 4))) (or (= (select .cse9 .cse10) |c_ULTIMATE.start_main_~data~0#1|) (forall ((v_arrayElimCell_147 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse11 v_arrayElimCell_147) .cse10)))))))))) (forall ((v_ArrVal_2988 (Array Int Int)) (v_ArrVal_2980 Int) (v_ArrVal_2982 (Array Int Int))) (let ((.cse15 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse2 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2980)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2982) .cse3 v_ArrVal_2988))) (let ((.cse12 (select .cse15 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse12 .cse7)) (forall ((v_arrayElimCell_150 Int)) (let ((.cse13 (+ v_arrayElimCell_150 4))) (or (= (select .cse12 .cse13) |c_ULTIMATE.start_main_~data~0#1|) (forall ((v_arrayElimCell_147 Int)) (let ((.cse14 (select .cse15 v_arrayElimCell_147))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse14 .cse13)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse14 .cse7)))))))))))) (or (and (forall ((v_ArrVal_2988 (Array Int Int)) (v_arrayElimCell_150 Int) (v_ArrVal_2980 Int) (v_ArrVal_2982 (Array Int Int)) (v_arrayElimCell_147 Int)) (let ((.cse16 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse2 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2980)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2982) .cse3 v_ArrVal_2988) v_arrayElimCell_147))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse16 (+ v_arrayElimCell_150 4))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse16 .cse7))))) (forall ((v_ArrVal_2988 (Array Int Int)) (v_arrayElimCell_150 Int) (v_ArrVal_2980 Int) (v_ArrVal_2982 (Array Int Int)) (v_arrayElimCell_147 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse2 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2980)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2982) .cse3 v_ArrVal_2988) v_arrayElimCell_147) (+ v_arrayElimCell_150 4))))) .cse8) (or .cse17 (forall ((v_ArrVal_2988 (Array Int Int)) (v_ArrVal_2980 Int) (v_ArrVal_2982 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse2 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_2980)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2982) .cse3 v_ArrVal_2988) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) .cse7)))))))) is different from false [2022-12-13 18:37:11,432 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse6 (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)))) (let ((.cse7 (= .cse6 |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse1 (+ |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset| 4)) (.cse5 (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|))) (and (forall ((v_ArrVal_2988 (Array Int Int)) (v_ArrVal_2980 Int) (v_ArrVal_2982 (Array Int Int))) (let ((.cse4 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| (store .cse5 |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset| v_ArrVal_2980)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2982) .cse6 v_ArrVal_2988))) (let ((.cse0 (select .cse4 |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse0 .cse1)) (forall ((v_arrayElimCell_150 Int)) (let ((.cse3 (+ v_arrayElimCell_150 4))) (or (forall ((v_arrayElimCell_147 Int)) (let ((.cse2 (select .cse4 v_arrayElimCell_147))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse2 .cse3)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse2 .cse1))))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse0 .cse3))))))))) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (or .cse7 (forall ((v_ArrVal_2988 (Array Int Int)) (v_ArrVal_2980 Int) (v_ArrVal_2982 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| (store .cse5 |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset| v_ArrVal_2980)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2982) .cse6 v_ArrVal_2988) |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|) .cse1)))) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (or (and (forall ((v_ArrVal_2988 (Array Int Int)) (v_arrayElimCell_150 Int) (v_ArrVal_2980 Int) (v_ArrVal_2982 (Array Int Int)) (v_arrayElimCell_147 Int)) (let ((.cse8 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| (store .cse5 |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset| v_ArrVal_2980)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2982) .cse6 v_ArrVal_2988) v_arrayElimCell_147))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse8 (+ v_arrayElimCell_150 4))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse8 .cse1))))) (forall ((v_ArrVal_2988 (Array Int Int)) (v_arrayElimCell_150 Int) (v_ArrVal_2980 Int) (v_ArrVal_2982 (Array Int Int)) (v_arrayElimCell_147 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| (store .cse5 |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset| v_ArrVal_2980)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2982) .cse6 v_ArrVal_2988) v_arrayElimCell_147) (+ v_arrayElimCell_150 4))))) (not .cse7)) (forall ((v_ArrVal_2988 (Array Int Int)) (v_ArrVal_2980 Int) (v_ArrVal_2982 (Array Int Int))) (let ((.cse9 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| (store .cse5 |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset| v_ArrVal_2980)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_2982) .cse6 v_ArrVal_2988))) (let ((.cse11 (select .cse9 |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|))) (or (forall ((v_arrayElimCell_150 Int)) (let ((.cse10 (+ v_arrayElimCell_150 4))) (or (forall ((v_arrayElimCell_147 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse9 v_arrayElimCell_147) .cse10))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse11 .cse10))))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse11 .cse1))))))))) is different from false [2022-12-13 18:37:11,597 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 18:37:11,597 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 5 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 569 treesize of output 619 [2022-12-13 18:37:11,748 INFO L321 Elim1Store]: treesize reduction 129, result has 31.0 percent of original size [2022-12-13 18:37:11,749 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 12 case distinctions, treesize of input 2936 treesize of output 2960 [2022-12-13 18:37:11,794 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 18:37:11,794 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 2887 treesize of output 2872 [2022-12-13 18:37:11,843 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 18:37:11,844 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 2863 treesize of output 2860 [2022-12-13 18:37:11,892 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 18:37:11,893 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 2858 treesize of output 2858 [2022-12-13 18:37:11,944 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 2845 treesize of output 2837 [2022-12-13 18:37:11,979 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 2837 treesize of output 2833 [2022-12-13 18:37:12,089 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 18:37:12,089 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 2836 treesize of output 2775 [2022-12-13 18:37:12,190 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 18:37:12,191 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 3562 treesize of output 3622 [2022-12-13 18:37:12,293 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 18:37:12,294 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 3482 treesize of output 3455 [2022-12-13 18:37:12,366 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 18:37:12,367 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 3446 treesize of output 3437 [2022-12-13 18:37:12,432 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 3428 treesize of output 3426 [2022-12-13 18:37:12,492 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 3426 treesize of output 3422 [2022-12-13 18:37:12,551 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 3429 treesize of output 3425 [2022-12-13 18:37:12,659 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 18:37:12,660 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 3427 treesize of output 3395 [2022-12-13 18:37:12,765 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 18:37:12,766 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 3382 treesize of output 3251 [2022-12-13 18:39:07,720 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-12-13 18:40:16,732 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-12-13 18:40:16,868 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-12-13 18:40:16,991 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-12-13 18:40:17,054 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-12-13 18:40:17,096 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-12-13 18:40:17,105 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-12-13 18:40:17,158 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-12-13 18:40:17,171 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-12-13 18:40:17,195 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-12-13 18:40:17,215 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-12-13 18:40:17,233 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-12-13 18:40:17,255 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-12-13 18:40:17,274 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-12-13 18:40:17,303 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-12-13 18:40:17,366 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-12-13 18:40:17,424 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-12-13 18:40:17,443 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 18:40:17,443 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 21 [2022-12-13 18:40:17,461 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-12-13 18:40:17,521 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-12-13 18:40:17,538 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-12-13 18:40:17,604 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-12-13 18:40:17,637 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-12-13 18:40:17,657 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-12-13 18:40:17,668 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-12-13 18:40:17,698 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-12-13 18:40:17,740 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-12-13 18:40:17,748 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-12-13 18:40:17,792 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-12-13 18:40:17,803 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-12-13 18:40:17,820 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-12-13 18:40:17,835 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-12-13 18:40:17,849 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-12-13 18:40:17,868 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-12-13 18:40:17,888 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-12-13 18:40:17,917 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-12-13 18:40:18,001 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-12-13 18:40:18,006 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-12-13 18:40:18,023 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-12-13 18:40:18,295 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-12-13 18:40:18,418 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 18:40:18,418 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 504 treesize of output 494 [2022-12-13 18:40:18,646 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-12-13 18:40:18,663 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-12-13 18:40:18,686 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-12-13 18:40:18,706 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-12-13 18:40:19,034 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 18:40:19,034 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 21 [2022-12-13 18:40:19,054 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-12-13 18:40:19,105 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-12-13 18:40:19,140 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-12-13 18:40:19,160 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-12-13 18:40:19,207 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-12-13 18:40:19,251 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-12-13 18:40:19,275 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-12-13 18:40:20,572 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-12-13 18:40:20,643 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-12-13 18:40:20,679 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-12-13 18:40:21,038 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-12-13 18:40:21,189 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-12-13 18:40:21,330 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-12-13 18:40:21,435 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-12-13 18:40:21,486 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-12-13 18:40:21,521 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-12-13 18:40:21,554 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-12-13 18:40:21,588 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-12-13 18:40:21,907 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 18:40:21,908 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 583 treesize of output 565 [2022-12-13 18:40:22,472 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-12-13 18:40:22,509 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 18:40:22,509 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 639 treesize of output 621 [2022-12-13 18:40:22,969 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-12-13 18:40:23,065 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-12-13 18:40:23,097 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-12-13 18:40:23,105 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-12-13 18:40:23,541 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-12-13 18:40:23,590 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-12-13 18:40:23,822 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 18:40:23,823 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 413 treesize of output 399 [2022-12-13 18:40:23,954 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-12-13 18:40:23,963 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-12-13 18:40:23,997 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-12-13 18:40:24,417 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-12-13 18:40:24,545 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 18:40:24,545 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 274 treesize of output 272 [2022-12-13 18:40:24,623 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-12-13 18:40:24,631 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-12-13 18:40:24,858 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 18:40:24,858 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 385 treesize of output 383 [2022-12-13 18:40:25,140 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-12-13 18:40:25,185 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-12-13 18:40:25,375 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-12-13 18:40:25,408 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-12-13 18:40:25,433 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-12-13 18:40:25,575 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 18:40:25,575 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 291 treesize of output 289 [2022-12-13 18:40:25,860 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-12-13 18:40:25,974 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-12-13 18:40:26,065 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 18:40:26,066 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 214 treesize of output 216 [2022-12-13 18:40:26,261 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-12-13 18:40:26,286 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 18:40:26,286 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 362 treesize of output 352 [2022-12-13 18:40:26,390 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-12-13 18:40:26,414 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-12-13 18:40:26,446 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-12-13 18:40:26,473 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-12-13 18:40:26,979 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-12-13 18:40:27,020 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-12-13 18:40:27,133 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-12-13 18:40:27,180 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 18:40:27,181 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 730 treesize of output 716 [2022-12-13 18:40:27,869 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-12-13 18:40:27,915 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-12-13 18:40:27,936 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-12-13 18:40:27,978 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-12-13 18:40:28,010 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-12-13 18:40:28,834 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 18:40:28,835 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 633 treesize of output 631 [2022-12-13 18:40:29,248 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-12-13 18:40:29,341 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-12-13 18:40:29,830 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-12-13 18:40:29,862 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-12-13 18:40:29,897 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-12-13 18:40:29,931 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-12-13 18:40:30,251 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 18:40:30,254 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 583 treesize of output 565 [2022-12-13 18:40:30,764 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 18:40:30,765 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 305 treesize of output 295 [2022-12-13 18:40:30,880 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-12-13 18:40:30,936 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-12-13 18:40:31,192 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-12-13 18:40:31,210 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-12-13 18:40:31,294 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-12-13 18:40:31,362 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-12-13 18:40:31,395 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-12-13 18:40:31,769 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-12-13 18:40:31,949 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-12-13 18:40:32,109 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-12-13 18:40:32,230 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-12-13 18:40:32,291 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-12-13 18:40:32,333 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-12-13 18:40:32,379 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-12-13 18:40:32,420 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-12-13 18:40:32,786 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 18:40:32,787 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 583 treesize of output 565 [2022-12-13 18:40:33,271 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-12-13 18:40:33,305 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 18:40:33,306 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 639 treesize of output 621 [2022-12-13 18:40:33,720 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-12-13 18:40:33,792 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-12-13 18:40:33,821 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-12-13 18:40:33,829 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-12-13 18:40:34,236 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-12-13 18:40:34,279 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-12-13 18:40:34,481 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 18:40:34,482 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 413 treesize of output 399 [2022-12-13 18:40:34,588 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-12-13 18:40:34,596 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-12-13 18:40:34,625 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-12-13 18:40:35,040 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-12-13 18:40:35,125 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 18:40:35,126 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 274 treesize of output 264 [2022-12-13 18:40:35,176 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-12-13 18:40:35,184 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-12-13 18:40:35,424 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 18:40:35,425 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 385 treesize of output 383 [2022-12-13 18:40:35,737 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-12-13 18:40:35,796 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-12-13 18:40:35,969 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-12-13 18:40:36,006 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-12-13 18:40:36,033 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-12-13 18:40:36,171 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 18:40:36,171 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 291 treesize of output 281 [2022-12-13 18:40:36,429 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 18:40:36,430 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 348 treesize of output 330 [2022-12-13 18:40:36,575 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-12-13 18:40:36,594 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-12-13 18:40:36,605 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-12-13 18:40:36,624 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-12-13 18:40:36,987 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-12-13 18:40:37,082 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-12-13 18:40:37,169 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-12-13 18:40:37,223 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-12-13 18:40:37,344 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-12-13 18:40:37,413 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 18:40:37,413 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 730 treesize of output 716 [2022-12-13 18:40:37,966 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-12-13 18:40:38,013 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-12-13 18:40:38,038 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-12-13 18:40:38,081 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-12-13 18:40:38,118 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-12-13 18:40:38,865 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 18:40:38,865 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 633 treesize of output 631 [2022-12-13 18:40:39,208 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-12-13 18:40:39,287 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-12-13 18:40:39,756 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-12-13 18:40:39,792 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-12-13 18:40:39,829 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-12-13 18:40:39,859 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-12-13 18:40:40,184 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 18:40:40,185 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 583 treesize of output 565 [2022-12-13 18:40:40,738 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 18:40:40,738 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 305 treesize of output 295 [2022-12-13 18:40:40,849 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-12-13 18:40:40,907 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-12-13 18:40:41,160 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-12-13 18:40:41,180 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-12-13 18:40:41,464 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-12-13 18:40:41,483 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 86 [2022-12-13 18:40:41,565 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 18:40:41,566 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 100 treesize of output 102 [2022-12-13 18:40:41,946 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 18:40:41,946 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 85 [2022-12-13 18:40:42,121 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-12-13 18:40:42,257 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-12-13 18:40:42,310 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-12-13 18:40:42,377 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-12-13 18:40:42,409 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-12-13 18:40:42,711 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-12-13 18:40:42,783 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-12-13 18:40:42,810 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-12-13 18:40:42,845 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-12-13 18:40:42,899 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-12-13 18:40:42,926 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-12-13 18:40:43,060 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-12-13 18:40:43,353 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-12-13 18:40:43,504 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-12-13 18:40:43,635 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-12-13 18:40:43,704 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-12-13 18:40:43,767 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-12-13 18:40:43,781 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-12-13 18:40:43,843 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-12-13 18:40:43,858 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-12-13 18:40:43,887 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-12-13 18:40:43,911 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-12-13 18:40:43,933 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-12-13 18:40:43,962 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-12-13 18:40:43,987 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-12-13 18:40:44,022 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-12-13 18:40:44,110 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-12-13 18:40:44,190 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-12-13 18:40:44,209 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 18:40:44,210 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 21 [2022-12-13 18:40:44,244 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-12-13 18:40:44,333 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-12-13 18:40:44,358 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-12-13 18:40:44,448 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-12-13 18:40:44,499 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-12-13 18:40:44,527 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-12-13 18:40:44,542 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-12-13 18:40:44,572 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-12-13 18:40:44,687 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-12-13 18:40:44,695 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-12-13 18:40:44,723 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-12-13 18:40:45,074 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-12-13 18:40:45,256 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 18:40:45,256 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 504 treesize of output 494 [2022-12-13 18:40:45,588 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-12-13 18:40:45,613 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-12-13 18:40:45,646 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-12-13 18:40:45,675 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-12-13 18:40:46,061 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 18:40:46,061 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 21 [2022-12-13 18:40:46,091 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-12-13 18:40:46,388 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-12-13 18:40:46,406 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 86 [2022-12-13 18:40:46,531 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 18:40:46,531 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 100 treesize of output 102 [2022-12-13 18:40:46,700 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-12-13 18:40:46,784 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-12-13 18:40:46,827 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-12-13 18:40:48,348 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-12-13 18:40:48,529 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-12-13 18:40:48,690 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-12-13 18:40:48,754 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-12-13 18:40:48,811 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-12-13 18:40:48,836 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-12-13 18:40:48,851 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-12-13 18:40:48,882 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-12-13 18:40:48,900 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-12-13 18:40:48,914 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-12-13 18:40:48,976 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-12-13 18:40:48,984 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-12-13 18:40:49,151 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 18:40:49,152 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 13 [2022-12-13 18:40:49,189 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-12-13 18:40:49,274 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-12-13 18:40:49,296 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-12-13 18:40:49,368 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-12-13 18:40:49,437 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-12-13 18:40:49,452 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-12-13 18:40:49,525 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-12-13 18:40:49,543 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-12-13 18:40:49,573 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-12-13 18:40:49,602 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-12-13 18:40:49,625 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-12-13 18:40:49,661 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-12-13 18:40:49,693 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-12-13 18:40:49,745 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-12-13 18:40:49,843 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-12-13 18:40:49,851 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-12-13 18:40:49,876 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-12-13 18:40:50,299 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-12-13 18:40:50,517 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 18:40:50,518 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 504 treesize of output 486 [2022-12-13 18:40:50,821 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-12-13 18:40:50,848 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-12-13 18:40:50,886 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-12-13 18:40:50,919 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-12-13 18:40:51,357 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 18:40:51,357 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 21 [2022-12-13 18:40:51,392 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-12-13 18:40:51,491 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-12-13 18:40:51,580 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-12-13 18:40:51,612 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-12-13 18:40:51,920 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-12-13 18:40:51,996 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-12-13 18:40:52,029 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-12-13 18:40:52,307 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-12-13 18:40:52,365 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 86 [2022-12-13 18:40:52,408 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 18:40:52,408 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 96 treesize of output 98 [2022-12-13 18:40:52,993 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-12-13 18:40:53,165 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-12-13 18:40:53,322 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-12-13 18:40:53,525 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 18:40:53,525 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 438 treesize of output 432 [2022-12-13 18:40:53,804 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-12-13 18:40:53,864 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-12-13 18:40:53,884 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-12-13 18:40:54,305 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-12-13 18:40:54,367 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-12-13 18:40:54,740 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-12-13 18:40:54,757 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-12-13 18:40:54,792 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-12-13 18:40:54,841 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-12-13 18:40:54,879 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-12-13 18:40:55,133 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 18:40:55,133 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 820 treesize of output 806 [2022-12-13 18:40:56,445 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-12-13 18:40:56,494 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-12-13 18:40:56,540 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-12-13 18:40:56,589 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-12-13 18:40:56,641 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-12-13 18:40:56,740 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-12-13 18:40:56,792 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-12-13 18:40:56,808 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-12-13 18:40:56,869 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-12-13 18:40:56,883 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-12-13 18:40:56,973 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-12-13 18:40:57,009 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-12-13 18:40:57,039 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-12-13 18:40:57,070 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-12-13 18:40:57,852 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 18:40:57,852 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 2186 treesize of output 2136 [2022-12-13 18:41:00,709 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-12-13 18:41:00,748 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-12-13 18:41:00,793 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-12-13 18:41:01,216 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 18:41:01,216 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 857 treesize of output 851 [2022-12-13 18:41:02,449 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-12-13 18:41:02,527 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-12-13 18:41:31,282 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-12-13 18:41:33,236 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 18:41:33,240 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 11935 treesize of output 11954 [2022-12-13 18:44:14,926 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 18:44:14,927 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1519 treesize of output 1522 [2022-12-13 18:44:16,343 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-12-13 18:44:16,642 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 18:44:16,643 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1519 treesize of output 1522 [2022-12-13 18:44:18,312 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 18:44:18,312 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 151 treesize of output 153 [2022-12-13 18:44:18,672 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 18:44:18,673 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 283 treesize of output 286 [2022-12-13 18:44:19,237 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-12-13 18:44:19,267 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 18:44:19,267 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 15 [2022-12-13 18:44:19,571 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 18:44:19,571 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 283 treesize of output 286