./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-simple/sll2n_prepend_unequal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 6b4ec56b 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_ac68dab7-80a7-4075-8b13-a97d4e1f9b96/bin/uautomizer-ug76WZFUDN/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac68dab7-80a7-4075-8b13-a97d4e1f9b96/bin/uautomizer-ug76WZFUDN/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac68dab7-80a7-4075-8b13-a97d4e1f9b96/bin/uautomizer-ug76WZFUDN/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac68dab7-80a7-4075-8b13-a97d4e1f9b96/bin/uautomizer-ug76WZFUDN/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/sll2n_prepend_unequal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac68dab7-80a7-4075-8b13-a97d4e1f9b96/bin/uautomizer-ug76WZFUDN/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac68dab7-80a7-4075-8b13-a97d4e1f9b96/bin/uautomizer-ug76WZFUDN --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 277634da297b7f9e262585608ed7ad62cca7d59b0122d4e61ee1b4b78256acae --- 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-6b4ec56 [2022-11-20 10:37:06,952 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-20 10:37:06,955 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-20 10:37:06,997 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-20 10:37:06,998 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-20 10:37:07,001 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-20 10:37:07,004 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-20 10:37:07,007 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-20 10:37:07,009 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-20 10:37:07,014 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-20 10:37:07,016 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-20 10:37:07,018 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-20 10:37:07,019 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-20 10:37:07,021 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-20 10:37:07,022 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-20 10:37:07,024 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-20 10:37:07,026 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-20 10:37:07,027 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-20 10:37:07,029 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-20 10:37:07,035 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-20 10:37:07,037 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-20 10:37:07,039 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-20 10:37:07,040 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-20 10:37:07,041 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-20 10:37:07,052 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-20 10:37:07,052 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-20 10:37:07,052 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-20 10:37:07,054 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-20 10:37:07,055 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-20 10:37:07,056 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-20 10:37:07,056 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-20 10:37:07,057 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-20 10:37:07,059 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-20 10:37:07,061 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-20 10:37:07,063 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-20 10:37:07,064 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-20 10:37:07,064 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-20 10:37:07,065 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-20 10:37:07,065 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-20 10:37:07,066 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-20 10:37:07,067 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-20 10:37:07,068 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac68dab7-80a7-4075-8b13-a97d4e1f9b96/bin/uautomizer-ug76WZFUDN/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-11-20 10:37:07,106 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-20 10:37:07,106 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-20 10:37:07,107 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-20 10:37:07,107 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-20 10:37:07,108 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-20 10:37:07,108 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-20 10:37:07,109 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-20 10:37:07,110 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-20 10:37:07,110 INFO L138 SettingsManager]: * Use SBE=true [2022-11-20 10:37:07,110 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-20 10:37:07,111 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-20 10:37:07,112 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-20 10:37:07,112 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-20 10:37:07,112 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-20 10:37:07,113 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-20 10:37:07,113 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-20 10:37:07,113 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-20 10:37:07,113 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-20 10:37:07,114 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-20 10:37:07,114 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-20 10:37:07,114 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-20 10:37:07,114 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-20 10:37:07,115 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-20 10:37:07,115 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-20 10:37:07,115 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-20 10:37:07,115 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 10:37:07,116 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-20 10:37:07,116 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-20 10:37:07,117 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-20 10:37:07,117 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-20 10:37:07,117 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac68dab7-80a7-4075-8b13-a97d4e1f9b96/bin/uautomizer-ug76WZFUDN/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_ac68dab7-80a7-4075-8b13-a97d4e1f9b96/bin/uautomizer-ug76WZFUDN 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 -> 277634da297b7f9e262585608ed7ad62cca7d59b0122d4e61ee1b4b78256acae [2022-11-20 10:37:07,381 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-20 10:37:07,402 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-20 10:37:07,405 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-20 10:37:07,406 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-20 10:37:07,407 INFO L275 PluginConnector]: CDTParser initialized [2022-11-20 10:37:07,408 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac68dab7-80a7-4075-8b13-a97d4e1f9b96/bin/uautomizer-ug76WZFUDN/../../sv-benchmarks/c/list-simple/sll2n_prepend_unequal.i [2022-11-20 10:37:10,490 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-20 10:37:10,805 INFO L351 CDTParser]: Found 1 translation units. [2022-11-20 10:37:10,806 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac68dab7-80a7-4075-8b13-a97d4e1f9b96/sv-benchmarks/c/list-simple/sll2n_prepend_unequal.i [2022-11-20 10:37:10,816 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac68dab7-80a7-4075-8b13-a97d4e1f9b96/bin/uautomizer-ug76WZFUDN/data/30e610fb7/b65d96b548354548ac89452905730aae/FLAGcd97123fd [2022-11-20 10:37:10,830 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac68dab7-80a7-4075-8b13-a97d4e1f9b96/bin/uautomizer-ug76WZFUDN/data/30e610fb7/b65d96b548354548ac89452905730aae [2022-11-20 10:37:10,833 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-20 10:37:10,835 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-20 10:37:10,836 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-20 10:37:10,837 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-20 10:37:10,840 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-20 10:37:10,841 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 10:37:10" (1/1) ... [2022-11-20 10:37:10,842 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@749515bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:37:10, skipping insertion in model container [2022-11-20 10:37:10,842 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 10:37:10" (1/1) ... [2022-11-20 10:37:10,850 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-20 10:37:10,885 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-20 10:37:11,260 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_ac68dab7-80a7-4075-8b13-a97d4e1f9b96/sv-benchmarks/c/list-simple/sll2n_prepend_unequal.i[24165,24178] [2022-11-20 10:37:11,264 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 10:37:11,278 INFO L203 MainTranslator]: Completed pre-run [2022-11-20 10:37:11,342 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_ac68dab7-80a7-4075-8b13-a97d4e1f9b96/sv-benchmarks/c/list-simple/sll2n_prepend_unequal.i[24165,24178] [2022-11-20 10:37:11,346 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 10:37:11,383 INFO L208 MainTranslator]: Completed translation [2022-11-20 10:37:11,383 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:37:11 WrapperNode [2022-11-20 10:37:11,385 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-20 10:37:11,387 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-20 10:37:11,387 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-20 10:37:11,387 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-20 10:37:11,395 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:37:11" (1/1) ... [2022-11-20 10:37:11,429 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:37:11" (1/1) ... [2022-11-20 10:37:11,463 INFO L138 Inliner]: procedures = 127, calls = 32, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 115 [2022-11-20 10:37:11,463 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-20 10:37:11,464 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-20 10:37:11,464 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-20 10:37:11,464 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-20 10:37:11,474 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:37:11" (1/1) ... [2022-11-20 10:37:11,474 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:37:11" (1/1) ... [2022-11-20 10:37:11,485 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:37:11" (1/1) ... [2022-11-20 10:37:11,485 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:37:11" (1/1) ... [2022-11-20 10:37:11,498 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:37:11" (1/1) ... [2022-11-20 10:37:11,507 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:37:11" (1/1) ... [2022-11-20 10:37:11,514 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:37:11" (1/1) ... [2022-11-20 10:37:11,520 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:37:11" (1/1) ... [2022-11-20 10:37:11,523 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-20 10:37:11,525 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-20 10:37:11,525 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-20 10:37:11,526 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-20 10:37:11,526 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:37:11" (1/1) ... [2022-11-20 10:37:11,533 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 10:37:11,545 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac68dab7-80a7-4075-8b13-a97d4e1f9b96/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:37:11,562 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac68dab7-80a7-4075-8b13-a97d4e1f9b96/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-20 10:37:11,591 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac68dab7-80a7-4075-8b13-a97d4e1f9b96/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-20 10:37:11,616 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-20 10:37:11,617 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-20 10:37:11,617 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2022-11-20 10:37:11,617 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2022-11-20 10:37:11,617 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-20 10:37:11,617 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-20 10:37:11,617 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-20 10:37:11,618 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-20 10:37:11,618 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-20 10:37:11,618 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-20 10:37:11,618 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-20 10:37:11,618 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-20 10:37:11,619 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-20 10:37:11,619 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-20 10:37:11,811 INFO L235 CfgBuilder]: Building ICFG [2022-11-20 10:37:11,813 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-20 10:37:12,160 INFO L276 CfgBuilder]: Performing block encoding [2022-11-20 10:37:12,167 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-20 10:37:12,167 INFO L300 CfgBuilder]: Removed 3 assume(true) statements. [2022-11-20 10:37:12,169 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:37:12 BoogieIcfgContainer [2022-11-20 10:37:12,170 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-20 10:37:12,178 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-20 10:37:12,178 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-20 10:37:12,182 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-20 10:37:12,182 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 10:37:10" (1/3) ... [2022-11-20 10:37:12,183 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7591027a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 10:37:12, skipping insertion in model container [2022-11-20 10:37:12,183 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:37:11" (2/3) ... [2022-11-20 10:37:12,186 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7591027a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 10:37:12, skipping insertion in model container [2022-11-20 10:37:12,186 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:37:12" (3/3) ... [2022-11-20 10:37:12,187 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2n_prepend_unequal.i [2022-11-20 10:37:12,207 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-20 10:37:12,208 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 31 error locations. [2022-11-20 10:37:12,258 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-20 10:37:12,264 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@5ece947d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-20 10:37:12,265 INFO L358 AbstractCegarLoop]: Starting to check reachability of 31 error locations. [2022-11-20 10:37:12,270 INFO L276 IsEmpty]: Start isEmpty. Operand has 81 states, 46 states have (on average 1.891304347826087) internal successors, (87), 77 states have internal predecessors, (87), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-20 10:37:12,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-20 10:37:12,277 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:37:12,278 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:37:12,278 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-11-20 10:37:12,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:37:12,284 INFO L85 PathProgramCache]: Analyzing trace with hash 1813443002, now seen corresponding path program 1 times [2022-11-20 10:37:12,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:37:12,294 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952232996] [2022-11-20 10:37:12,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:37:12,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:37:12,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:37:12,656 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:37:12,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:37:12,657 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952232996] [2022-11-20 10:37:12,658 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [952232996] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:37:12,658 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:37:12,658 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 10:37:12,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817161251] [2022-11-20 10:37:12,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:37:12,665 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 10:37:12,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:37:12,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 10:37:12,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 10:37:12,716 INFO L87 Difference]: Start difference. First operand has 81 states, 46 states have (on average 1.891304347826087) internal successors, (87), 77 states have internal predecessors, (87), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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-11-20 10:37:12,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:37:12,886 INFO L93 Difference]: Finished difference Result 79 states and 85 transitions. [2022-11-20 10:37:12,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 10:37:12,889 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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 7 [2022-11-20 10:37:12,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:37:12,897 INFO L225 Difference]: With dead ends: 79 [2022-11-20 10:37:12,897 INFO L226 Difference]: Without dead ends: 76 [2022-11-20 10:37:12,899 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 10:37:12,909 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 8 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 10:37:12,910 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 127 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 10:37:12,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-11-20 10:37:12,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2022-11-20 10:37:12,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 44 states have (on average 1.75) internal successors, (77), 72 states have internal predecessors, (77), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-20 10:37:12,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 81 transitions. [2022-11-20 10:37:12,953 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 81 transitions. Word has length 7 [2022-11-20 10:37:12,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:37:12,954 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 81 transitions. [2022-11-20 10:37:12,954 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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-11-20 10:37:12,954 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 81 transitions. [2022-11-20 10:37:12,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-20 10:37:12,955 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:37:12,955 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:37:12,956 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-20 10:37:12,956 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-11-20 10:37:12,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:37:12,957 INFO L85 PathProgramCache]: Analyzing trace with hash 1813443001, now seen corresponding path program 1 times [2022-11-20 10:37:12,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:37:12,957 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134588443] [2022-11-20 10:37:12,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:37:12,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:37:12,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:37:13,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:37:13,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:37:13,041 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134588443] [2022-11-20 10:37:13,041 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2134588443] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:37:13,041 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:37:13,041 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 10:37:13,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054455278] [2022-11-20 10:37:13,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:37:13,043 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 10:37:13,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:37:13,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 10:37:13,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 10:37:13,044 INFO L87 Difference]: Start difference. First operand 76 states and 81 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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-11-20 10:37:13,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:37:13,111 INFO L93 Difference]: Finished difference Result 74 states and 79 transitions. [2022-11-20 10:37:13,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 10:37:13,111 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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 7 [2022-11-20 10:37:13,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:37:13,112 INFO L225 Difference]: With dead ends: 74 [2022-11-20 10:37:13,112 INFO L226 Difference]: Without dead ends: 74 [2022-11-20 10:37:13,113 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 10:37:13,114 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 4 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 10:37:13,115 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 118 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 10:37:13,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2022-11-20 10:37:13,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2022-11-20 10:37:13,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 44 states have (on average 1.7045454545454546) internal successors, (75), 70 states have internal predecessors, (75), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-20 10:37:13,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 79 transitions. [2022-11-20 10:37:13,123 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 79 transitions. Word has length 7 [2022-11-20 10:37:13,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:37:13,123 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 79 transitions. [2022-11-20 10:37:13,123 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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-11-20 10:37:13,123 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 79 transitions. [2022-11-20 10:37:13,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-20 10:37:13,124 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:37:13,124 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:37:13,125 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-20 10:37:13,125 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-11-20 10:37:13,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:37:13,126 INFO L85 PathProgramCache]: Analyzing trace with hash 712803264, now seen corresponding path program 1 times [2022-11-20 10:37:13,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:37:13,126 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391890515] [2022-11-20 10:37:13,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:37:13,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:37:13,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:37:13,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 10:37:13,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:37:13,429 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:37:13,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:37:13,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391890515] [2022-11-20 10:37:13,430 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [391890515] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:37:13,430 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:37:13,430 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-20 10:37:13,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199114023] [2022-11-20 10:37:13,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:37:13,431 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 10:37:13,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:37:13,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 10:37:13,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-20 10:37:13,432 INFO L87 Difference]: Start difference. First operand 74 states and 79 transitions. Second operand has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 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-11-20 10:37:13,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:37:13,702 INFO L93 Difference]: Finished difference Result 78 states and 86 transitions. [2022-11-20 10:37:13,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 10:37:13,703 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 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-11-20 10:37:13,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:37:13,705 INFO L225 Difference]: With dead ends: 78 [2022-11-20 10:37:13,705 INFO L226 Difference]: Without dead ends: 78 [2022-11-20 10:37:13,706 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 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-11-20 10:37:13,707 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 11 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 10:37:13,708 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 281 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 10:37:13,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-11-20 10:37:13,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 73. [2022-11-20 10:37:13,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 44 states have (on average 1.6818181818181819) internal successors, (74), 69 states have internal predecessors, (74), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-20 10:37:13,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 78 transitions. [2022-11-20 10:37:13,730 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 78 transitions. Word has length 13 [2022-11-20 10:37:13,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:37:13,731 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 78 transitions. [2022-11-20 10:37:13,731 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 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-11-20 10:37:13,731 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 78 transitions. [2022-11-20 10:37:13,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-20 10:37:13,748 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:37:13,748 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:37:13,748 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-20 10:37:13,749 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-11-20 10:37:13,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:37:13,749 INFO L85 PathProgramCache]: Analyzing trace with hash 712803265, now seen corresponding path program 1 times [2022-11-20 10:37:13,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:37:13,750 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4509846] [2022-11-20 10:37:13,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:37:13,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:37:13,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:37:14,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 10:37:14,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:37:14,228 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:37:14,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:37:14,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4509846] [2022-11-20 10:37:14,229 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [4509846] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:37:14,231 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:37:14,231 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-20 10:37:14,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471921920] [2022-11-20 10:37:14,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:37:14,232 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 10:37:14,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:37:14,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 10:37:14,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-20 10:37:14,236 INFO L87 Difference]: Start difference. First operand 73 states and 78 transitions. Second operand has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 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-11-20 10:37:14,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:37:14,508 INFO L93 Difference]: Finished difference Result 77 states and 85 transitions. [2022-11-20 10:37:14,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 10:37:14,509 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 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-11-20 10:37:14,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:37:14,510 INFO L225 Difference]: With dead ends: 77 [2022-11-20 10:37:14,510 INFO L226 Difference]: Without dead ends: 77 [2022-11-20 10:37:14,511 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-20 10:37:14,512 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 9 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 297 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 10:37:14,512 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 297 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 10:37:14,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-11-20 10:37:14,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 72. [2022-11-20 10:37:14,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 44 states have (on average 1.6590909090909092) internal successors, (73), 68 states have internal predecessors, (73), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-20 10:37:14,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 77 transitions. [2022-11-20 10:37:14,520 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 77 transitions. Word has length 13 [2022-11-20 10:37:14,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:37:14,521 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 77 transitions. [2022-11-20 10:37:14,521 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 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-11-20 10:37:14,521 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 77 transitions. [2022-11-20 10:37:14,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-20 10:37:14,522 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:37:14,522 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:37:14,522 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-20 10:37:14,522 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-11-20 10:37:14,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:37:14,523 INFO L85 PathProgramCache]: Analyzing trace with hash 150600896, now seen corresponding path program 1 times [2022-11-20 10:37:14,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:37:14,523 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624652811] [2022-11-20 10:37:14,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:37:14,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:37:14,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:37:14,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-11-20 10:37:14,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:37:14,592 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:37:14,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:37:14,593 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624652811] [2022-11-20 10:37:14,593 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [624652811] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:37:14,593 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:37:14,593 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 10:37:14,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074541016] [2022-11-20 10:37:14,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:37:14,598 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 10:37:14,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:37:14,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 10:37:14,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 10:37:14,599 INFO L87 Difference]: Start difference. First operand 72 states and 77 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-20 10:37:14,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:37:14,687 INFO L93 Difference]: Finished difference Result 78 states and 84 transitions. [2022-11-20 10:37:14,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 10:37:14,689 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 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 15 [2022-11-20 10:37:14,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:37:14,693 INFO L225 Difference]: With dead ends: 78 [2022-11-20 10:37:14,693 INFO L226 Difference]: Without dead ends: 78 [2022-11-20 10:37:14,694 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-11-20 10:37:14,700 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 4 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 10:37:14,701 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 180 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 10:37:14,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-11-20 10:37:14,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 73. [2022-11-20 10:37:14,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 45 states have (on average 1.6444444444444444) internal successors, (74), 69 states have internal predecessors, (74), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-20 10:37:14,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 78 transitions. [2022-11-20 10:37:14,707 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 78 transitions. Word has length 15 [2022-11-20 10:37:14,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:37:14,707 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 78 transitions. [2022-11-20 10:37:14,708 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-20 10:37:14,708 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 78 transitions. [2022-11-20 10:37:14,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-20 10:37:14,709 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:37:14,709 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:37:14,709 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-20 10:37:14,709 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-11-20 10:37:14,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:37:14,710 INFO L85 PathProgramCache]: Analyzing trace with hash -513998014, now seen corresponding path program 1 times [2022-11-20 10:37:14,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:37:14,710 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977811275] [2022-11-20 10:37:14,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:37:14,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:37:14,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:37:14,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 10:37:14,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:37:14,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-20 10:37:14,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:37:14,913 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-20 10:37:14,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:37:14,914 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977811275] [2022-11-20 10:37:14,914 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [977811275] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:37:14,914 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [928841449] [2022-11-20 10:37:14,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:37:14,915 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:37:14,915 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac68dab7-80a7-4075-8b13-a97d4e1f9b96/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:37:14,918 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac68dab7-80a7-4075-8b13-a97d4e1f9b96/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:37:14,939 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac68dab7-80a7-4075-8b13-a97d4e1f9b96/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-20 10:37:15,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:37:15,051 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-20 10:37:15,057 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:37:15,138 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:37:15,138 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:37:15,211 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-20 10:37:15,211 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [928841449] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 10:37:15,211 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 10:37:15,212 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 6 [2022-11-20 10:37:15,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307864042] [2022-11-20 10:37:15,212 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 10:37:15,212 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 10:37:15,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:37:15,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 10:37:15,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-20 10:37:15,213 INFO L87 Difference]: Start difference. First operand 73 states and 78 transitions. Second operand has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-11-20 10:37:15,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:37:15,316 INFO L93 Difference]: Finished difference Result 79 states and 85 transitions. [2022-11-20 10:37:15,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 10:37:15,317 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 28 [2022-11-20 10:37:15,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:37:15,318 INFO L225 Difference]: With dead ends: 79 [2022-11-20 10:37:15,319 INFO L226 Difference]: Without dead ends: 79 [2022-11-20 10:37:15,320 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 56 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-20 10:37:15,329 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 8 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 10:37:15,329 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 250 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 10:37:15,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-11-20 10:37:15,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2022-11-20 10:37:15,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 50 states have (on average 1.58) internal successors, (79), 74 states have internal predecessors, (79), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-20 10:37:15,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 85 transitions. [2022-11-20 10:37:15,336 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 85 transitions. Word has length 28 [2022-11-20 10:37:15,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:37:15,336 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 85 transitions. [2022-11-20 10:37:15,337 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-11-20 10:37:15,337 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 85 transitions. [2022-11-20 10:37:15,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-11-20 10:37:15,338 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:37:15,338 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:37:15,350 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac68dab7-80a7-4075-8b13-a97d4e1f9b96/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-20 10:37:15,544 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac68dab7-80a7-4075-8b13-a97d4e1f9b96/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:37:15,545 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-11-20 10:37:15,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:37:15,546 INFO L85 PathProgramCache]: Analyzing trace with hash -416014336, now seen corresponding path program 2 times [2022-11-20 10:37:15,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:37:15,546 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485264181] [2022-11-20 10:37:15,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:37:15,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:37:15,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:37:16,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 10:37:16,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:37:16,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-20 10:37:16,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:37:16,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-20 10:37:16,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:37:16,215 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-11-20 10:37:16,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:37:16,215 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485264181] [2022-11-20 10:37:16,215 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [485264181] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:37:16,215 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:37:16,216 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-20 10:37:16,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679840584] [2022-11-20 10:37:16,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:37:16,216 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 10:37:16,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:37:16,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 10:37:16,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-20 10:37:16,217 INFO L87 Difference]: Start difference. First operand 79 states and 85 transitions. Second operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-20 10:37:16,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:37:16,410 INFO L93 Difference]: Finished difference Result 87 states and 94 transitions. [2022-11-20 10:37:16,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 10:37:16,411 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 41 [2022-11-20 10:37:16,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:37:16,412 INFO L225 Difference]: With dead ends: 87 [2022-11-20 10:37:16,412 INFO L226 Difference]: Without dead ends: 87 [2022-11-20 10:37:16,413 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-11-20 10:37:16,415 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 105 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 10:37:16,416 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 165 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 10:37:16,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2022-11-20 10:37:16,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 75. [2022-11-20 10:37:16,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 50 states have (on average 1.5) internal successors, (75), 70 states have internal predecessors, (75), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-20 10:37:16,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 81 transitions. [2022-11-20 10:37:16,439 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 81 transitions. Word has length 41 [2022-11-20 10:37:16,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:37:16,440 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 81 transitions. [2022-11-20 10:37:16,440 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-20 10:37:16,440 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 81 transitions. [2022-11-20 10:37:16,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-11-20 10:37:16,446 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:37:16,447 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:37:16,447 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-20 10:37:16,447 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-11-20 10:37:16,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:37:16,448 INFO L85 PathProgramCache]: Analyzing trace with hash -416014335, now seen corresponding path program 1 times [2022-11-20 10:37:16,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:37:16,448 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630755366] [2022-11-20 10:37:16,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:37:16,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:37:16,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:37:17,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 10:37:17,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:37:17,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-20 10:37:17,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:37:17,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-20 10:37:17,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:37:17,425 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-11-20 10:37:17,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:37:17,426 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630755366] [2022-11-20 10:37:17,426 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1630755366] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:37:17,426 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [668777183] [2022-11-20 10:37:17,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:37:17,427 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:37:17,427 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac68dab7-80a7-4075-8b13-a97d4e1f9b96/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:37:17,428 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac68dab7-80a7-4075-8b13-a97d4e1f9b96/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:37:17,451 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac68dab7-80a7-4075-8b13-a97d4e1f9b96/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-20 10:37:17,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:37:17,603 INFO L263 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 26 conjunts are in the unsatisfiable core [2022-11-20 10:37:17,609 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:37:17,670 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-11-20 10:37:17,731 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-20 10:37:17,784 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_452 Int)) (= |c_#length| (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_452))))) is different from true [2022-11-20 10:37:17,876 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:37:17,878 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-11-20 10:37:17,953 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-20 10:37:17,981 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_453 Int)) (= (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_453) |c_#length|)))) is different from true [2022-11-20 10:37:18,075 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:37:18,077 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-11-20 10:37:18,154 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-20 10:37:18,173 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_454 Int)) (= (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_454) |c_#length|)))) is different from true [2022-11-20 10:37:18,261 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:37:18,262 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-11-20 10:37:18,271 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 18 not checked. [2022-11-20 10:37:18,271 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:37:18,403 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [668777183] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:37:18,403 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 10:37:18,404 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 14 [2022-11-20 10:37:18,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444769521] [2022-11-20 10:37:18,404 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 10:37:18,404 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-20 10:37:18,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:37:18,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-20 10:37:18,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=145, Unknown=3, NotChecked=78, Total=272 [2022-11-20 10:37:18,405 INFO L87 Difference]: Start difference. First operand 75 states and 81 transitions. Second operand has 15 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 13 states have internal predecessors, (48), 3 states have call successors, (4), 2 states have call predecessors, (4), 5 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-11-20 10:37:18,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:37:18,782 INFO L93 Difference]: Finished difference Result 83 states and 90 transitions. [2022-11-20 10:37:18,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-20 10:37:18,782 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 13 states have internal predecessors, (48), 3 states have call successors, (4), 2 states have call predecessors, (4), 5 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 41 [2022-11-20 10:37:18,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:37:18,783 INFO L225 Difference]: With dead ends: 83 [2022-11-20 10:37:18,783 INFO L226 Difference]: Without dead ends: 83 [2022-11-20 10:37:18,784 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 42 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=62, Invalid=187, Unknown=3, NotChecked=90, Total=342 [2022-11-20 10:37:18,785 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 131 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 500 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 228 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 10:37:18,785 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 195 Invalid, 500 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 263 Invalid, 0 Unknown, 228 Unchecked, 0.3s Time] [2022-11-20 10:37:18,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2022-11-20 10:37:18,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 71. [2022-11-20 10:37:18,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 50 states have (on average 1.42) internal successors, (71), 66 states have internal predecessors, (71), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-20 10:37:18,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 77 transitions. [2022-11-20 10:37:18,789 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 77 transitions. Word has length 41 [2022-11-20 10:37:18,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:37:18,790 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 77 transitions. [2022-11-20 10:37:18,790 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 13 states have internal predecessors, (48), 3 states have call successors, (4), 2 states have call predecessors, (4), 5 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-11-20 10:37:18,790 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 77 transitions. [2022-11-20 10:37:18,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-11-20 10:37:18,791 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:37:18,791 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:37:18,803 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac68dab7-80a7-4075-8b13-a97d4e1f9b96/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-20 10:37:18,992 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac68dab7-80a7-4075-8b13-a97d4e1f9b96/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2022-11-20 10:37:18,993 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-11-20 10:37:18,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:37:18,993 INFO L85 PathProgramCache]: Analyzing trace with hash -11542527, now seen corresponding path program 1 times [2022-11-20 10:37:18,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:37:18,993 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518626434] [2022-11-20 10:37:18,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:37:18,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:37:19,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:37:19,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 10:37:19,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:37:19,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-20 10:37:19,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:37:19,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-20 10:37:19,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:37:19,310 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-11-20 10:37:19,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:37:19,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518626434] [2022-11-20 10:37:19,311 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [518626434] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:37:19,311 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:37:19,311 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-20 10:37:19,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985479252] [2022-11-20 10:37:19,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:37:19,312 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 10:37:19,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:37:19,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 10:37:19,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-20 10:37:19,314 INFO L87 Difference]: Start difference. First operand 71 states and 77 transitions. Second operand has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 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-11-20 10:37:19,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:37:19,467 INFO L93 Difference]: Finished difference Result 70 states and 76 transitions. [2022-11-20 10:37:19,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 10:37:19,467 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 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 42 [2022-11-20 10:37:19,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:37:19,468 INFO L225 Difference]: With dead ends: 70 [2022-11-20 10:37:19,468 INFO L226 Difference]: Without dead ends: 70 [2022-11-20 10:37:19,468 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-20 10:37:19,469 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 48 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 10:37:19,469 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 204 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 10:37:19,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-11-20 10:37:19,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2022-11-20 10:37:19,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 50 states have (on average 1.4) internal successors, (70), 65 states have internal predecessors, (70), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-20 10:37:19,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 76 transitions. [2022-11-20 10:37:19,485 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 76 transitions. Word has length 42 [2022-11-20 10:37:19,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:37:19,485 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 76 transitions. [2022-11-20 10:37:19,485 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 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-11-20 10:37:19,486 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 76 transitions. [2022-11-20 10:37:19,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-11-20 10:37:19,487 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:37:19,487 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:37:19,487 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-20 10:37:19,487 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-11-20 10:37:19,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:37:19,489 INFO L85 PathProgramCache]: Analyzing trace with hash -11542528, now seen corresponding path program 1 times [2022-11-20 10:37:19,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:37:19,490 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904534100] [2022-11-20 10:37:19,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:37:19,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:37:19,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:37:19,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 10:37:19,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:37:19,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-20 10:37:19,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:37:19,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-20 10:37:19,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:37:19,698 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-11-20 10:37:19,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:37:19,698 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904534100] [2022-11-20 10:37:19,698 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1904534100] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:37:19,699 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:37:19,699 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-20 10:37:19,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623203244] [2022-11-20 10:37:19,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:37:19,700 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 10:37:19,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:37:19,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 10:37:19,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-20 10:37:19,701 INFO L87 Difference]: Start difference. First operand 70 states and 76 transitions. Second operand has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 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-11-20 10:37:19,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:37:19,850 INFO L93 Difference]: Finished difference Result 81 states and 88 transitions. [2022-11-20 10:37:19,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 10:37:19,851 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 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 42 [2022-11-20 10:37:19,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:37:19,854 INFO L225 Difference]: With dead ends: 81 [2022-11-20 10:37:19,854 INFO L226 Difference]: Without dead ends: 81 [2022-11-20 10:37:19,854 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-11-20 10:37:19,855 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 45 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 10:37:19,856 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 197 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 10:37:19,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-11-20 10:37:19,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 69. [2022-11-20 10:37:19,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 50 states have (on average 1.38) internal successors, (69), 64 states have internal predecessors, (69), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-20 10:37:19,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 75 transitions. [2022-11-20 10:37:19,862 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 75 transitions. Word has length 42 [2022-11-20 10:37:19,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:37:19,863 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 75 transitions. [2022-11-20 10:37:19,863 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 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-11-20 10:37:19,863 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 75 transitions. [2022-11-20 10:37:19,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-11-20 10:37:19,867 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:37:19,867 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:37:19,868 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-20 10:37:19,868 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-11-20 10:37:19,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:37:19,869 INFO L85 PathProgramCache]: Analyzing trace with hash -2126344669, now seen corresponding path program 1 times [2022-11-20 10:37:19,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:37:19,869 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764041981] [2022-11-20 10:37:19,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:37:19,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:37:19,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:37:20,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 10:37:20,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:37:20,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-20 10:37:20,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:37:20,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-20 10:37:20,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:37:20,237 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-11-20 10:37:20,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:37:20,238 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764041981] [2022-11-20 10:37:20,238 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [764041981] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:37:20,238 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:37:20,238 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-20 10:37:20,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56065958] [2022-11-20 10:37:20,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:37:20,239 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-20 10:37:20,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:37:20,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-20 10:37:20,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-11-20 10:37:20,240 INFO L87 Difference]: Start difference. First operand 69 states and 75 transitions. Second operand has 11 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-20 10:37:20,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:37:20,479 INFO L93 Difference]: Finished difference Result 80 states and 86 transitions. [2022-11-20 10:37:20,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-20 10:37:20,479 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 48 [2022-11-20 10:37:20,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:37:20,480 INFO L225 Difference]: With dead ends: 80 [2022-11-20 10:37:20,480 INFO L226 Difference]: Without dead ends: 80 [2022-11-20 10:37:20,481 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2022-11-20 10:37:20,481 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 143 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 10:37:20,481 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 259 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 10:37:20,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-11-20 10:37:20,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 66. [2022-11-20 10:37:20,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 50 states have (on average 1.32) internal successors, (66), 61 states have internal predecessors, (66), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-20 10:37:20,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 72 transitions. [2022-11-20 10:37:20,484 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 72 transitions. Word has length 48 [2022-11-20 10:37:20,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:37:20,485 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 72 transitions. [2022-11-20 10:37:20,485 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-20 10:37:20,485 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 72 transitions. [2022-11-20 10:37:20,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-11-20 10:37:20,485 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:37:20,486 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:37:20,486 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-20 10:37:20,486 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-11-20 10:37:20,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:37:20,486 INFO L85 PathProgramCache]: Analyzing trace with hash -2126344668, now seen corresponding path program 1 times [2022-11-20 10:37:20,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:37:20,487 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360657830] [2022-11-20 10:37:20,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:37:20,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:37:20,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:37:20,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 10:37:20,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:37:20,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-20 10:37:20,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:37:20,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-20 10:37:20,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:37:21,049 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-11-20 10:37:21,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:37:21,049 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360657830] [2022-11-20 10:37:21,050 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360657830] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:37:21,050 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:37:21,050 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-20 10:37:21,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070581239] [2022-11-20 10:37:21,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:37:21,051 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-20 10:37:21,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:37:21,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-20 10:37:21,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-11-20 10:37:21,052 INFO L87 Difference]: Start difference. First operand 66 states and 72 transitions. Second operand has 11 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-20 10:37:21,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:37:21,293 INFO L93 Difference]: Finished difference Result 66 states and 71 transitions. [2022-11-20 10:37:21,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-20 10:37:21,294 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 48 [2022-11-20 10:37:21,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:37:21,295 INFO L225 Difference]: With dead ends: 66 [2022-11-20 10:37:21,295 INFO L226 Difference]: Without dead ends: 66 [2022-11-20 10:37:21,295 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2022-11-20 10:37:21,296 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 83 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 10:37:21,296 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 263 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 10:37:21,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-11-20 10:37:21,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 64. [2022-11-20 10:37:21,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 50 states have (on average 1.28) internal successors, (64), 59 states have internal predecessors, (64), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-20 10:37:21,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 70 transitions. [2022-11-20 10:37:21,298 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 70 transitions. Word has length 48 [2022-11-20 10:37:21,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:37:21,302 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 70 transitions. [2022-11-20 10:37:21,302 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-20 10:37:21,303 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 70 transitions. [2022-11-20 10:37:21,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-11-20 10:37:21,305 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:37:21,305 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:37:21,305 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-20 10:37:21,305 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-11-20 10:37:21,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:37:21,306 INFO L85 PathProgramCache]: Analyzing trace with hash 987206626, now seen corresponding path program 1 times [2022-11-20 10:37:21,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:37:21,306 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878410148] [2022-11-20 10:37:21,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:37:21,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:37:21,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:37:21,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 10:37:21,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:37:21,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-20 10:37:21,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:37:21,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-20 10:37:21,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:37:22,075 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-11-20 10:37:22,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:37:22,076 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878410148] [2022-11-20 10:37:22,076 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [878410148] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:37:22,076 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:37:22,076 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-11-20 10:37:22,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804272149] [2022-11-20 10:37:22,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:37:22,077 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-20 10:37:22,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:37:22,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-20 10:37:22,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2022-11-20 10:37:22,078 INFO L87 Difference]: Start difference. First operand 64 states and 70 transitions. Second operand has 14 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 12 states have internal predecessors, (33), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-20 10:37:22,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:37:22,540 INFO L93 Difference]: Finished difference Result 64 states and 69 transitions. [2022-11-20 10:37:22,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-20 10:37:22,541 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 12 states have internal predecessors, (33), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 50 [2022-11-20 10:37:22,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:37:22,542 INFO L225 Difference]: With dead ends: 64 [2022-11-20 10:37:22,542 INFO L226 Difference]: Without dead ends: 64 [2022-11-20 10:37:22,542 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=82, Invalid=380, Unknown=0, NotChecked=0, Total=462 [2022-11-20 10:37:22,543 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 115 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 296 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 10:37:22,543 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 312 Invalid, 297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 296 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 10:37:22,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-11-20 10:37:22,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2022-11-20 10:37:22,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 50 states have (on average 1.26) internal successors, (63), 59 states have internal predecessors, (63), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-20 10:37:22,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 69 transitions. [2022-11-20 10:37:22,546 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 69 transitions. Word has length 50 [2022-11-20 10:37:22,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:37:22,546 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 69 transitions. [2022-11-20 10:37:22,546 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 12 states have internal predecessors, (33), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-20 10:37:22,546 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 69 transitions. [2022-11-20 10:37:22,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-11-20 10:37:22,547 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:37:22,547 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 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] [2022-11-20 10:37:22,547 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-20 10:37:22,547 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-11-20 10:37:22,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:37:22,548 INFO L85 PathProgramCache]: Analyzing trace with hash -2063364139, now seen corresponding path program 1 times [2022-11-20 10:37:22,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:37:22,548 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435278302] [2022-11-20 10:37:22,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:37:22,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:37:22,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:37:23,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 10:37:23,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:37:23,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-20 10:37:23,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:37:23,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-20 10:37:23,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:37:24,180 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 18 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-20 10:37:24,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:37:24,180 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435278302] [2022-11-20 10:37:24,181 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1435278302] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:37:24,181 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [952965996] [2022-11-20 10:37:24,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:37:24,181 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:37:24,181 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac68dab7-80a7-4075-8b13-a97d4e1f9b96/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:37:24,182 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac68dab7-80a7-4075-8b13-a97d4e1f9b96/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:37:24,211 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac68dab7-80a7-4075-8b13-a97d4e1f9b96/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-20 10:37:24,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:37:24,401 INFO L263 TraceCheckSpWp]: Trace formula consists of 413 conjuncts, 69 conjunts are in the unsatisfiable core [2022-11-20 10:37:24,406 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:37:24,476 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-11-20 10:37:24,769 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-11-20 10:37:25,133 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:37:25,134 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-11-20 10:37:25,161 INFO L321 Elim1Store]: treesize reduction 30, result has 37.5 percent of original size [2022-11-20 10:37:25,161 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 21 treesize of output 29 [2022-11-20 10:37:25,419 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:37:25,420 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 26 [2022-11-20 10:37:25,565 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-11-20 10:37:25,572 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:37:25,573 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 33 [2022-11-20 10:37:25,677 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 49 treesize of output 37 [2022-11-20 10:37:25,931 INFO L321 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2022-11-20 10:37:25,932 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 56 treesize of output 21 [2022-11-20 10:37:25,941 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 20 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-20 10:37:25,941 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:37:26,081 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 84 treesize of output 80 [2022-11-20 10:37:32,386 WARN L233 SmtUtils]: Spent 6.04s on a formula simplification. DAG size of input: 34 DAG size of output: 30 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 10:38:11,546 WARN L233 SmtUtils]: Spent 13.10s on a formula simplification that was a NOOP. DAG size: 37 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 10:38:13,593 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_prepend_~new_head~1#1.base|)) (.cse6 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_prepend_~head#1.base|) |c_ULTIMATE.start_sll_prepend_~head#1.offset|))) (let ((.cse0 (forall ((v_arrayElimCell_17 Int) (|ULTIMATE.start_sll_prepend_~new_head~1#1.offset| Int)) (= (select |c_#valid| (select (let ((.cse7 (let ((.cse8 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_prepend_~new_head~1#1.base| (store .cse5 (+ |ULTIMATE.start_sll_prepend_~new_head~1#1.offset| 4) .cse6)))) (store .cse8 |c_ULTIMATE.start_sll_prepend_~head#1.base| (store (select .cse8 |c_ULTIMATE.start_sll_prepend_~head#1.base|) |c_ULTIMATE.start_sll_prepend_~head#1.offset| |c_ULTIMATE.start_sll_prepend_~new_head~1#1.base|))))) (select .cse7 (select (select .cse7 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ 4 v_arrayElimCell_17))) 1)))) (and (or (= |c_ULTIMATE.start_sll_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) .cse0) (forall ((v_arrayElimCell_17 Int) (|ULTIMATE.start_sll_prepend_~new_head~1#1.offset| Int)) (let ((.cse2 (+ |ULTIMATE.start_sll_prepend_~new_head~1#1.offset| 4))) (let ((.cse1 (let ((.cse3 (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_prepend_~new_head~1#1.base| (store .cse5 .cse2 .cse6)))) (store .cse4 |c_ULTIMATE.start_sll_prepend_~head#1.base| (store (select .cse4 |c_ULTIMATE.start_sll_prepend_~head#1.base|) |c_ULTIMATE.start_sll_prepend_~head#1.offset| |c_ULTIMATE.start_sll_prepend_~new_head~1#1.base|))))) (select .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= (select |c_#valid| (select .cse1 (+ 4 v_arrayElimCell_17))) 1) (= (select |c_#valid| (select .cse1 .cse2)) 1))))) (or (= |c_ULTIMATE.start_sll_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) .cse0)))) is different from false [2022-11-20 10:38:55,009 WARN L233 SmtUtils]: Spent 9.80s on a formula simplification that was a NOOP. DAG size: 38 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 10:38:56,569 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [952965996] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:38:56,569 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 10:38:56,569 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22] total 40 [2022-11-20 10:38:56,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519111037] [2022-11-20 10:38:56,570 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 10:38:56,570 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-11-20 10:38:56,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:38:56,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-11-20 10:38:56,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=2007, Unknown=23, NotChecked=90, Total=2256 [2022-11-20 10:38:56,572 INFO L87 Difference]: Start difference. First operand 64 states and 69 transitions. Second operand has 41 states, 38 states have (on average 2.0526315789473686) internal successors, (78), 35 states have internal predecessors, (78), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-20 10:38:58,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:38:58,214 INFO L93 Difference]: Finished difference Result 84 states and 91 transitions. [2022-11-20 10:38:58,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-20 10:38:58,215 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 38 states have (on average 2.0526315789473686) internal successors, (78), 35 states have internal predecessors, (78), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 53 [2022-11-20 10:38:58,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:38:58,216 INFO L225 Difference]: With dead ends: 84 [2022-11-20 10:38:58,216 INFO L226 Difference]: Without dead ends: 84 [2022-11-20 10:38:58,217 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 641 ImplicationChecksByTransitivity, 92.8s TimeCoverageRelationStatistics Valid=248, Invalid=3273, Unknown=23, NotChecked=116, Total=3660 [2022-11-20 10:38:58,218 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 63 mSDsluCounter, 528 mSDsCounter, 0 mSdLazyCounter, 674 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 558 SdHoareTripleChecker+Invalid, 823 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 674 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 142 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-20 10:38:58,218 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 558 Invalid, 823 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 674 Invalid, 0 Unknown, 142 Unchecked, 0.6s Time] [2022-11-20 10:38:58,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2022-11-20 10:38:58,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 66. [2022-11-20 10:38:58,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 52 states have (on average 1.2884615384615385) internal successors, (67), 61 states have internal predecessors, (67), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-20 10:38:58,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 73 transitions. [2022-11-20 10:38:58,221 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 73 transitions. Word has length 53 [2022-11-20 10:38:58,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:38:58,221 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 73 transitions. [2022-11-20 10:38:58,221 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 38 states have (on average 2.0526315789473686) internal successors, (78), 35 states have internal predecessors, (78), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-20 10:38:58,221 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 73 transitions. [2022-11-20 10:38:58,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-11-20 10:38:58,222 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:38:58,222 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 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] [2022-11-20 10:38:58,233 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac68dab7-80a7-4075-8b13-a97d4e1f9b96/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-20 10:38:58,428 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac68dab7-80a7-4075-8b13-a97d4e1f9b96/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:38:58,429 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-11-20 10:38:58,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:38:58,429 INFO L85 PathProgramCache]: Analyzing trace with hash -2063364138, now seen corresponding path program 1 times [2022-11-20 10:38:58,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:38:58,429 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107652081] [2022-11-20 10:38:58,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:38:58,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:38:58,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:39:00,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 10:39:00,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:39:00,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-20 10:39:00,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:39:00,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-20 10:39:00,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:39:00,822 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 18 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-20 10:39:00,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:39:00,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107652081] [2022-11-20 10:39:00,822 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2107652081] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:39:00,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [21113448] [2022-11-20 10:39:00,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:39:00,822 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:39:00,823 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac68dab7-80a7-4075-8b13-a97d4e1f9b96/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:39:00,825 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac68dab7-80a7-4075-8b13-a97d4e1f9b96/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:39:00,850 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac68dab7-80a7-4075-8b13-a97d4e1f9b96/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-20 10:39:01,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:39:01,044 INFO L263 TraceCheckSpWp]: Trace formula consists of 413 conjuncts, 110 conjunts are in the unsatisfiable core [2022-11-20 10:39:01,051 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:39:01,137 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-11-20 10:39:01,759 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-11-20 10:39:01,764 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-11-20 10:39:02,181 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:39:02,182 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-11-20 10:39:02,196 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:39:02,197 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 20 [2022-11-20 10:39:02,207 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-11-20 10:39:02,207 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-11-20 10:39:02,216 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 18 treesize of output 13 [2022-11-20 10:39:02,535 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:39:02,536 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2022-11-20 10:39:02,558 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:39:02,562 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 26 [2022-11-20 10:39:02,729 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:39:02,730 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 27 [2022-11-20 10:39:02,738 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:39:02,739 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2022-11-20 10:39:03,174 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:39:03,175 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:39:03,179 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 10:39:03,179 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 84 treesize of output 44 [2022-11-20 10:39:03,186 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:39:03,191 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-20 10:39:03,192 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 28 treesize of output 18 [2022-11-20 10:39:03,334 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 20 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-20 10:39:03,335 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:39:05,203 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [21113448] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:39:05,203 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 10:39:05,204 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 23] total 44 [2022-11-20 10:39:05,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813161551] [2022-11-20 10:39:05,204 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 10:39:05,205 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-11-20 10:39:05,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:39:05,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-11-20 10:39:05,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=2812, Unknown=0, NotChecked=0, Total=2970 [2022-11-20 10:39:05,207 INFO L87 Difference]: Start difference. First operand 66 states and 73 transitions. Second operand has 45 states, 42 states have (on average 1.9761904761904763) internal successors, (83), 39 states have internal predecessors, (83), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-20 10:39:08,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:39:08,285 INFO L93 Difference]: Finished difference Result 88 states and 95 transitions. [2022-11-20 10:39:08,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-20 10:39:08,286 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 42 states have (on average 1.9761904761904763) internal successors, (83), 39 states have internal predecessors, (83), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 53 [2022-11-20 10:39:08,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:39:08,286 INFO L225 Difference]: With dead ends: 88 [2022-11-20 10:39:08,286 INFO L226 Difference]: Without dead ends: 88 [2022-11-20 10:39:08,288 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 39 SyntacticMatches, 5 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1028 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=315, Invalid=4655, Unknown=0, NotChecked=0, Total=4970 [2022-11-20 10:39:08,288 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 83 mSDsluCounter, 752 mSDsCounter, 0 mSdLazyCounter, 957 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 787 SdHoareTripleChecker+Invalid, 1047 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 957 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 81 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-20 10:39:08,289 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 787 Invalid, 1047 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 957 Invalid, 0 Unknown, 81 Unchecked, 1.0s Time] [2022-11-20 10:39:08,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2022-11-20 10:39:08,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 68. [2022-11-20 10:39:08,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 54 states have (on average 1.2592592592592593) internal successors, (68), 63 states have internal predecessors, (68), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-20 10:39:08,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 74 transitions. [2022-11-20 10:39:08,291 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 74 transitions. Word has length 53 [2022-11-20 10:39:08,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:39:08,291 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 74 transitions. [2022-11-20 10:39:08,292 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 42 states have (on average 1.9761904761904763) internal successors, (83), 39 states have internal predecessors, (83), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-20 10:39:08,292 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 74 transitions. [2022-11-20 10:39:08,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-11-20 10:39:08,292 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:39:08,292 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 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-11-20 10:39:08,303 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac68dab7-80a7-4075-8b13-a97d4e1f9b96/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-20 10:39:08,493 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac68dab7-80a7-4075-8b13-a97d4e1f9b96/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-11-20 10:39:08,493 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-11-20 10:39:08,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:39:08,494 INFO L85 PathProgramCache]: Analyzing trace with hash 460219817, now seen corresponding path program 1 times [2022-11-20 10:39:08,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:39:08,494 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170498410] [2022-11-20 10:39:08,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:39:08,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:39:08,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:39:09,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 10:39:09,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:39:09,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-20 10:39:09,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:39:09,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-20 10:39:09,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:39:09,728 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 18 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-20 10:39:09,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:39:09,728 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170498410] [2022-11-20 10:39:09,728 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1170498410] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:39:09,728 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [965423949] [2022-11-20 10:39:09,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:39:09,729 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:39:09,729 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac68dab7-80a7-4075-8b13-a97d4e1f9b96/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:39:09,730 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac68dab7-80a7-4075-8b13-a97d4e1f9b96/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:39:09,744 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac68dab7-80a7-4075-8b13-a97d4e1f9b96/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-20 10:39:09,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:39:09,980 INFO L263 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 65 conjunts are in the unsatisfiable core [2022-11-20 10:39:09,990 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:39:10,543 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-11-20 10:39:10,851 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:39:10,852 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 24 treesize of output 24 [2022-11-20 10:39:11,118 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:39:11,119 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 26 [2022-11-20 10:39:11,246 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:39:11,247 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 29 [2022-11-20 10:39:11,256 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-11-20 10:39:11,419 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 59 treesize of output 47 [2022-11-20 10:39:12,051 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:39:12,164 INFO L321 Elim1Store]: treesize reduction 12, result has 88.1 percent of original size [2022-11-20 10:39:12,164 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 10 case distinctions, treesize of input 85 treesize of output 137 [2022-11-20 10:39:12,897 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 20 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-20 10:39:12,897 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:39:13,237 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 24 [2022-11-20 10:39:14,460 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (forall ((|v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_19| Int) (|v_ULTIMATE.start_sll_prepend_~new_head~1#1.offset_11| Int) (|v_ULTIMATE.start_main_~ptr~0#1.offset_21| Int) (v_ArrVal_1571 (Array Int Int))) (or (not (= (select (let ((.cse3 (let ((.cse4 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_19| (store v_ArrVal_1571 (+ |v_ULTIMATE.start_sll_prepend_~new_head~1#1.offset_11| 4) (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_19| v_ArrVal_1571) |c_ULTIMATE.start_sll_prepend_~head#1.base|) |c_ULTIMATE.start_sll_prepend_~head#1.offset|))))) (store .cse4 |c_ULTIMATE.start_sll_prepend_~head#1.base| (store (select .cse4 |c_ULTIMATE.start_sll_prepend_~head#1.base|) |c_ULTIMATE.start_sll_prepend_~head#1.offset| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_19|))))) (select .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_21| 4)) 0)) (not (< |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_19| |c_#StackHeapBarrier|)) (< 0 |v_ULTIMATE.start_sll_prepend_~new_head~1#1.offset_11|) (not (<= 0 |v_ULTIMATE.start_main_~ptr~0#1.offset_21|)))))) (and (or (= |c_ULTIMATE.start_sll_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) .cse0) (or .cse0 (= |c_ULTIMATE.start_sll_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|)) (forall ((|v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_19| Int)) (or (forall ((|v_ULTIMATE.start_sll_prepend_~new_head~1#1.offset_11| Int) (|v_ULTIMATE.start_main_~ptr~0#1.offset_21| Int) (v_ArrVal_1571 (Array Int Int))) (or (not (= (select (let ((.cse1 (let ((.cse2 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_19| (store v_ArrVal_1571 (+ |v_ULTIMATE.start_sll_prepend_~new_head~1#1.offset_11| 4) (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_19| v_ArrVal_1571) |c_ULTIMATE.start_sll_prepend_~head#1.base|) |c_ULTIMATE.start_sll_prepend_~head#1.offset|))))) (store .cse2 |c_ULTIMATE.start_sll_prepend_~head#1.base| (store (select .cse2 |c_ULTIMATE.start_sll_prepend_~head#1.base|) |c_ULTIMATE.start_sll_prepend_~head#1.offset| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_19|))))) (select .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_21| 4)) 0)) (< |v_ULTIMATE.start_sll_prepend_~new_head~1#1.offset_11| |v_ULTIMATE.start_main_~ptr~0#1.offset_21|) (< 0 |v_ULTIMATE.start_sll_prepend_~new_head~1#1.offset_11|) (not (<= 0 |v_ULTIMATE.start_main_~ptr~0#1.offset_21|)))) (not (< |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_19| |c_#StackHeapBarrier|)))))) is different from false [2022-11-20 10:39:14,464 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [965423949] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:39:14,464 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 10:39:14,465 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 24] total 41 [2022-11-20 10:39:14,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858926674] [2022-11-20 10:39:14,465 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 10:39:14,465 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-11-20 10:39:14,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:39:14,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-11-20 10:39:14,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=2205, Unknown=2, NotChecked=94, Total=2450 [2022-11-20 10:39:14,467 INFO L87 Difference]: Start difference. First operand 68 states and 74 transitions. Second operand has 41 states, 39 states have (on average 2.0256410256410255) internal successors, (79), 35 states have internal predecessors, (79), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-20 10:39:15,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:39:15,964 INFO L93 Difference]: Finished difference Result 71 states and 76 transitions. [2022-11-20 10:39:15,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-20 10:39:15,965 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 39 states have (on average 2.0256410256410255) internal successors, (79), 35 states have internal predecessors, (79), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 54 [2022-11-20 10:39:15,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:39:15,966 INFO L225 Difference]: With dead ends: 71 [2022-11-20 10:39:15,966 INFO L226 Difference]: Without dead ends: 71 [2022-11-20 10:39:15,967 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 45 SyntacticMatches, 5 SemanticMatches, 61 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 758 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=259, Invalid=3525, Unknown=2, NotChecked=120, Total=3906 [2022-11-20 10:39:15,967 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 43 mSDsluCounter, 865 mSDsCounter, 0 mSdLazyCounter, 482 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 904 SdHoareTripleChecker+Invalid, 611 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 482 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 125 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-20 10:39:15,968 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 904 Invalid, 611 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 482 Invalid, 0 Unknown, 125 Unchecked, 0.4s Time] [2022-11-20 10:39:15,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-11-20 10:39:15,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 68. [2022-11-20 10:39:15,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 54 states have (on average 1.2407407407407407) internal successors, (67), 63 states have internal predecessors, (67), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-20 10:39:15,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 73 transitions. [2022-11-20 10:39:15,971 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 73 transitions. Word has length 54 [2022-11-20 10:39:15,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:39:15,971 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 73 transitions. [2022-11-20 10:39:15,972 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 39 states have (on average 2.0256410256410255) internal successors, (79), 35 states have internal predecessors, (79), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-20 10:39:15,972 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 73 transitions. [2022-11-20 10:39:15,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-11-20 10:39:15,972 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:39:15,972 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 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, 1, 1, 1] [2022-11-20 10:39:15,983 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac68dab7-80a7-4075-8b13-a97d4e1f9b96/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-11-20 10:39:16,178 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac68dab7-80a7-4075-8b13-a97d4e1f9b96/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-11-20 10:39:16,178 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-11-20 10:39:16,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:39:16,179 INFO L85 PathProgramCache]: Analyzing trace with hash 913244988, now seen corresponding path program 1 times [2022-11-20 10:39:16,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:39:16,179 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415580835] [2022-11-20 10:39:16,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:39:16,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:39:16,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:39:17,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 10:39:17,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:39:17,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-20 10:39:17,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:39:18,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-20 10:39:18,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:39:18,866 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 12 proven. 12 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-20 10:39:18,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:39:18,867 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415580835] [2022-11-20 10:39:18,867 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1415580835] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:39:18,867 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [916370847] [2022-11-20 10:39:18,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:39:18,868 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:39:18,868 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac68dab7-80a7-4075-8b13-a97d4e1f9b96/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:39:18,872 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac68dab7-80a7-4075-8b13-a97d4e1f9b96/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:39:18,876 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac68dab7-80a7-4075-8b13-a97d4e1f9b96/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-20 10:39:19,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:39:19,112 INFO L263 TraceCheckSpWp]: Trace formula consists of 432 conjuncts, 115 conjunts are in the unsatisfiable core [2022-11-20 10:39:19,119 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:39:19,247 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-11-20 10:39:19,310 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-11-20 10:39:19,560 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:39:19,563 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 21 treesize of output 20 [2022-11-20 10:39:19,940 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 30 treesize of output 18 [2022-11-20 10:39:19,947 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-11-20 10:39:19,955 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-11-20 10:39:19,960 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-20 10:39:20,477 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:39:20,478 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 14 treesize of output 16 [2022-11-20 10:39:20,496 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:39:20,497 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 34 [2022-11-20 10:39:20,519 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-11-20 10:39:20,519 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 28 [2022-11-20 10:39:20,529 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-20 10:39:20,545 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-11-20 10:39:20,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 15 treesize of output 15 [2022-11-20 10:39:20,974 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:39:20,975 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2022-11-20 10:39:20,996 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:39:20,997 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 33 [2022-11-20 10:39:21,015 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-11-20 10:39:21,214 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:39:21,215 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 36 [2022-11-20 10:39:21,229 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:39:21,230 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 24 treesize of output 26 [2022-11-20 10:39:21,238 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:39:21,239 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 27 [2022-11-20 10:39:21,774 INFO L321 Elim1Store]: treesize reduction 17, result has 5.6 percent of original size [2022-11-20 10:39:21,774 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 123 treesize of output 54 [2022-11-20 10:39:21,781 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:39:21,782 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 27 treesize of output 12 [2022-11-20 10:39:21,962 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:39:21,964 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 10:39:21,964 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 15 treesize of output 10 [2022-11-20 10:39:22,036 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 14 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-20 10:39:22,036 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:40:05,960 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [916370847] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:40:05,960 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 10:40:05,960 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 25] total 46 [2022-11-20 10:40:05,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744132040] [2022-11-20 10:40:05,961 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 10:40:05,961 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-11-20 10:40:05,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:40:05,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-11-20 10:40:05,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=2914, Unknown=23, NotChecked=0, Total=3080 [2022-11-20 10:40:05,963 INFO L87 Difference]: Start difference. First operand 68 states and 73 transitions. Second operand has 46 states, 44 states have (on average 2.0454545454545454) internal successors, (90), 40 states have internal predecessors, (90), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-20 10:40:09,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:40:09,795 INFO L93 Difference]: Finished difference Result 69 states and 74 transitions. [2022-11-20 10:40:09,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-20 10:40:09,795 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 44 states have (on average 2.0454545454545454) internal successors, (90), 40 states have internal predecessors, (90), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 57 [2022-11-20 10:40:09,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:40:09,796 INFO L225 Difference]: With dead ends: 69 [2022-11-20 10:40:09,796 INFO L226 Difference]: Without dead ends: 69 [2022-11-20 10:40:09,798 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 49 SyntacticMatches, 3 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 604 ImplicationChecksByTransitivity, 49.2s TimeCoverageRelationStatistics Valid=310, Invalid=5367, Unknown=23, NotChecked=0, Total=5700 [2022-11-20 10:40:09,798 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 42 mSDsluCounter, 1011 mSDsCounter, 0 mSdLazyCounter, 1050 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 1049 SdHoareTripleChecker+Invalid, 1174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1050 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 117 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-20 10:40:09,798 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 1049 Invalid, 1174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1050 Invalid, 0 Unknown, 117 Unchecked, 1.0s Time] [2022-11-20 10:40:09,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-11-20 10:40:09,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2022-11-20 10:40:09,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 55 states have (on average 1.2363636363636363) internal successors, (68), 64 states have internal predecessors, (68), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-20 10:40:09,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 74 transitions. [2022-11-20 10:40:09,801 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 74 transitions. Word has length 57 [2022-11-20 10:40:09,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:40:09,802 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 74 transitions. [2022-11-20 10:40:09,802 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 44 states have (on average 2.0454545454545454) internal successors, (90), 40 states have internal predecessors, (90), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-20 10:40:09,802 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 74 transitions. [2022-11-20 10:40:09,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-20 10:40:09,803 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:40:09,803 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 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, 1, 1] [2022-11-20 10:40:09,811 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac68dab7-80a7-4075-8b13-a97d4e1f9b96/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-11-20 10:40:10,007 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac68dab7-80a7-4075-8b13-a97d4e1f9b96/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-11-20 10:40:10,008 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-11-20 10:40:10,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:40:10,008 INFO L85 PathProgramCache]: Analyzing trace with hash -1754175976, now seen corresponding path program 1 times [2022-11-20 10:40:10,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:40:10,008 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566362231] [2022-11-20 10:40:10,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:40:10,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:40:10,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:40:12,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 10:40:12,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:40:12,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-20 10:40:12,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:40:12,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-20 10:40:12,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:40:13,732 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 10 proven. 18 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-20 10:40:13,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:40:13,732 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566362231] [2022-11-20 10:40:13,733 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1566362231] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:40:13,733 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [521914420] [2022-11-20 10:40:13,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:40:13,733 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:40:13,733 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac68dab7-80a7-4075-8b13-a97d4e1f9b96/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:40:13,740 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac68dab7-80a7-4075-8b13-a97d4e1f9b96/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:40:13,749 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac68dab7-80a7-4075-8b13-a97d4e1f9b96/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-20 10:40:13,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:40:13,981 INFO L263 TraceCheckSpWp]: Trace formula consists of 440 conjuncts, 132 conjunts are in the unsatisfiable core [2022-11-20 10:40:13,992 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:40:14,056 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-11-20 10:40:14,662 INFO L321 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2022-11-20 10:40:14,663 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 19 treesize of output 16 [2022-11-20 10:40:14,865 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 13 treesize of output 9 [2022-11-20 10:40:15,407 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 10:40:15,407 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 23 [2022-11-20 10:40:15,411 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-11-20 10:40:15,420 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-11-20 10:40:15,950 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:40:15,960 INFO L321 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2022-11-20 10:40:15,961 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 56 treesize of output 45 [2022-11-20 10:40:15,998 INFO L321 Elim1Store]: treesize reduction 76, result has 36.1 percent of original size [2022-11-20 10:40:15,999 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 36 treesize of output 52 [2022-11-20 10:40:16,016 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:40:16,017 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2022-11-20 10:40:16,525 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:40:16,526 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:40:16,537 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-11-20 10:40:16,538 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 85 treesize of output 54 [2022-11-20 10:40:16,567 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:40:16,569 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2022-11-20 10:40:16,827 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:40:16,828 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 23 [2022-11-20 10:40:16,837 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:40:16,843 INFO L321 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-11-20 10:40:16,844 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 2 case distinctions, treesize of input 138 treesize of output 61 [2022-11-20 10:40:17,583 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:40:17,584 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 197 treesize of output 142 [2022-11-20 10:40:17,981 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:40:17,982 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:40:18,004 INFO L321 Elim1Store]: treesize reduction 39, result has 7.1 percent of original size [2022-11-20 10:40:18,004 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 139 treesize of output 50 [2022-11-20 10:40:18,641 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 13 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:40:18,641 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:40:21,413 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [521914420] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:40:21,413 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 10:40:21,414 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 33] total 64 [2022-11-20 10:40:21,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149769901] [2022-11-20 10:40:21,415 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 10:40:21,416 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 65 states [2022-11-20 10:40:21,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:40:21,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2022-11-20 10:40:21,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=232, Invalid=5170, Unknown=0, NotChecked=0, Total=5402 [2022-11-20 10:40:21,419 INFO L87 Difference]: Start difference. First operand 69 states and 74 transitions. Second operand has 65 states, 62 states have (on average 1.596774193548387) internal successors, (99), 56 states have internal predecessors, (99), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-20 10:40:27,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:40:27,965 INFO L93 Difference]: Finished difference Result 75 states and 83 transitions. [2022-11-20 10:40:27,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-11-20 10:40:27,965 INFO L78 Accepts]: Start accepts. Automaton has has 65 states, 62 states have (on average 1.596774193548387) internal successors, (99), 56 states have internal predecessors, (99), 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 58 [2022-11-20 10:40:27,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:40:27,966 INFO L225 Difference]: With dead ends: 75 [2022-11-20 10:40:27,966 INFO L226 Difference]: Without dead ends: 75 [2022-11-20 10:40:27,970 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 39 SyntacticMatches, 5 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1790 ImplicationChecksByTransitivity, 12.2s TimeCoverageRelationStatistics Valid=677, Invalid=8635, Unknown=0, NotChecked=0, Total=9312 [2022-11-20 10:40:27,971 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 139 mSDsluCounter, 1015 mSDsCounter, 0 mSdLazyCounter, 1607 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 1053 SdHoareTripleChecker+Invalid, 1785 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 1607 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 128 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-11-20 10:40:27,971 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 1053 Invalid, 1785 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 1607 Invalid, 0 Unknown, 128 Unchecked, 1.7s Time] [2022-11-20 10:40:27,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-11-20 10:40:27,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 71. [2022-11-20 10:40:27,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 57 states have (on average 1.263157894736842) internal successors, (72), 66 states have internal predecessors, (72), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-20 10:40:27,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 78 transitions. [2022-11-20 10:40:27,974 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 78 transitions. Word has length 58 [2022-11-20 10:40:27,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:40:27,974 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 78 transitions. [2022-11-20 10:40:27,975 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 65 states, 62 states have (on average 1.596774193548387) internal successors, (99), 56 states have internal predecessors, (99), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-20 10:40:27,975 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 78 transitions. [2022-11-20 10:40:27,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-20 10:40:27,976 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:40:27,976 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 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, 1, 1] [2022-11-20 10:40:27,984 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac68dab7-80a7-4075-8b13-a97d4e1f9b96/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-11-20 10:40:28,182 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac68dab7-80a7-4075-8b13-a97d4e1f9b96/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-11-20 10:40:28,182 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-11-20 10:40:28,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:40:28,183 INFO L85 PathProgramCache]: Analyzing trace with hash -1754175975, now seen corresponding path program 1 times [2022-11-20 10:40:28,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:40:28,183 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792279216] [2022-11-20 10:40:28,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:40:28,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:40:28,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:40:30,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 10:40:30,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:40:31,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-20 10:40:31,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:40:31,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-20 10:40:31,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:40:32,327 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 4 proven. 24 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-20 10:40:32,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:40:32,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792279216] [2022-11-20 10:40:32,328 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [792279216] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:40:32,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1170991293] [2022-11-20 10:40:32,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:40:32,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:40:32,329 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac68dab7-80a7-4075-8b13-a97d4e1f9b96/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:40:32,329 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac68dab7-80a7-4075-8b13-a97d4e1f9b96/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:40:32,332 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac68dab7-80a7-4075-8b13-a97d4e1f9b96/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-20 10:40:32,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:40:32,578 INFO L263 TraceCheckSpWp]: Trace formula consists of 440 conjuncts, 154 conjunts are in the unsatisfiable core [2022-11-20 10:40:32,584 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:40:33,456 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-20 10:40:33,456 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 14 treesize of output 20 [2022-11-20 10:40:33,480 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-20 10:40:33,481 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 17 treesize of output 21 [2022-11-20 10:40:33,734 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 13 treesize of output 9 [2022-11-20 10:40:33,748 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-11-20 10:40:34,431 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 10:40:34,432 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 33 [2022-11-20 10:40:34,440 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-11-20 10:40:34,448 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:40:34,448 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-20 10:40:35,106 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:40:35,118 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-20 10:40:35,119 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 78 treesize of output 66 [2022-11-20 10:40:35,126 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:40:35,128 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:40:35,140 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-11-20 10:40:35,140 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 25 treesize of output 38 [2022-11-20 10:40:35,171 INFO L321 Elim1Store]: treesize reduction 27, result has 48.1 percent of original size [2022-11-20 10:40:35,171 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 1 case distinctions, treesize of input 20 treesize of output 34 [2022-11-20 10:40:35,205 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-11-20 10:40:35,205 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-11-20 10:40:35,816 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:40:35,818 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:40:35,819 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 34 [2022-11-20 10:40:35,831 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:40:35,833 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:40:35,834 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:40:35,843 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-20 10:40:35,843 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 87 treesize of output 56 [2022-11-20 10:40:36,101 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:40:36,102 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:40:36,104 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:40:36,105 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 35 [2022-11-20 10:40:36,114 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:40:36,118 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-20 10:40:36,119 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 2 case distinctions, treesize of input 84 treesize of output 53 [2022-11-20 10:40:37,606 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:40:37,608 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:40:37,650 INFO L321 Elim1Store]: treesize reduction 59, result has 15.7 percent of original size [2022-11-20 10:40:37,651 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 8 new quantified variables, introduced 10 case distinctions, treesize of input 161 treesize of output 78 [2022-11-20 10:40:37,678 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:40:37,684 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:40:37,698 INFO L321 Elim1Store]: treesize reduction 10, result has 41.2 percent of original size [2022-11-20 10:40:37,698 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 25 [2022-11-20 10:40:38,138 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 20 proven. 5 refuted. 6 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:40:38,139 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:40:47,779 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1170991293] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:40:47,779 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 10:40:47,779 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 69 [2022-11-20 10:40:47,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189390706] [2022-11-20 10:40:47,779 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 10:40:47,780 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 70 states [2022-11-20 10:40:47,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:40:47,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2022-11-20 10:40:47,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=258, Invalid=6871, Unknown=11, NotChecked=0, Total=7140 [2022-11-20 10:40:47,782 INFO L87 Difference]: Start difference. First operand 71 states and 78 transitions. Second operand has 70 states, 67 states have (on average 1.537313432835821) internal successors, (103), 61 states have internal predecessors, (103), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-20 10:40:54,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:40:54,707 INFO L93 Difference]: Finished difference Result 96 states and 103 transitions. [2022-11-20 10:40:54,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-11-20 10:40:54,708 INFO L78 Accepts]: Start accepts. Automaton has has 70 states, 67 states have (on average 1.537313432835821) internal successors, (103), 61 states have internal predecessors, (103), 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 58 [2022-11-20 10:40:54,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:40:54,709 INFO L225 Difference]: With dead ends: 96 [2022-11-20 10:40:54,709 INFO L226 Difference]: Without dead ends: 96 [2022-11-20 10:40:54,712 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2471 ImplicationChecksByTransitivity, 20.3s TimeCoverageRelationStatistics Valid=554, Invalid=12317, Unknown=11, NotChecked=0, Total=12882 [2022-11-20 10:40:54,712 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 170 mSDsluCounter, 1314 mSDsCounter, 0 mSdLazyCounter, 1416 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 1352 SdHoareTripleChecker+Invalid, 1659 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 1416 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 227 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-11-20 10:40:54,713 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 1352 Invalid, 1659 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 1416 Invalid, 0 Unknown, 227 Unchecked, 1.3s Time] [2022-11-20 10:40:54,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-11-20 10:40:54,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 73. [2022-11-20 10:40:54,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 59 states have (on average 1.2372881355932204) internal successors, (73), 68 states have internal predecessors, (73), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-20 10:40:54,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 79 transitions. [2022-11-20 10:40:54,716 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 79 transitions. Word has length 58 [2022-11-20 10:40:54,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:40:54,717 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 79 transitions. [2022-11-20 10:40:54,717 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 70 states, 67 states have (on average 1.537313432835821) internal successors, (103), 61 states have internal predecessors, (103), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-20 10:40:54,717 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 79 transitions. [2022-11-20 10:40:54,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-11-20 10:40:54,718 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:40:54,718 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 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, 1, 1, 1, 1, 1] [2022-11-20 10:40:54,729 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac68dab7-80a7-4075-8b13-a97d4e1f9b96/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-20 10:40:54,924 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac68dab7-80a7-4075-8b13-a97d4e1f9b96/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:40:54,924 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-11-20 10:40:54,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:40:54,925 INFO L85 PathProgramCache]: Analyzing trace with hash 1455118278, now seen corresponding path program 1 times [2022-11-20 10:40:54,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:40:54,925 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32153496] [2022-11-20 10:40:54,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:40:54,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:40:54,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:40:57,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 10:40:57,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:40:57,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-20 10:40:57,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:40:57,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-20 10:40:57,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:40:58,116 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 4 proven. 23 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-20 10:40:58,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:40:58,116 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32153496] [2022-11-20 10:40:58,116 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [32153496] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:40:58,116 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1846334283] [2022-11-20 10:40:58,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:40:58,117 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:40:58,117 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac68dab7-80a7-4075-8b13-a97d4e1f9b96/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:40:58,118 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac68dab7-80a7-4075-8b13-a97d4e1f9b96/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:40:58,143 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac68dab7-80a7-4075-8b13-a97d4e1f9b96/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-20 10:40:58,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:40:58,404 INFO L263 TraceCheckSpWp]: Trace formula consists of 444 conjuncts, 111 conjunts are in the unsatisfiable core [2022-11-20 10:40:58,410 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:40:58,559 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-11-20 10:40:58,850 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 13 treesize of output 9 [2022-11-20 10:40:59,277 INFO L321 Elim1Store]: treesize reduction 17, result has 5.6 percent of original size [2022-11-20 10:40:59,277 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 16 [2022-11-20 10:40:59,281 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-20 10:40:59,780 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:40:59,791 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-20 10:40:59,791 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 43 treesize of output 47 [2022-11-20 10:40:59,799 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:40:59,799 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 25 treesize of output 27 [2022-11-20 10:40:59,829 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-11-20 10:40:59,830 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-11-20 10:41:00,250 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:41:00,250 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2022-11-20 10:41:00,256 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:41:00,271 INFO L321 Elim1Store]: treesize reduction 57, result has 18.6 percent of original size [2022-11-20 10:41:00,271 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 53 treesize of output 46 [2022-11-20 10:41:00,469 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:41:00,470 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 0 case distinctions, treesize of input 43 treesize of output 34 [2022-11-20 10:41:00,478 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:41:00,495 INFO L321 Elim1Store]: treesize reduction 87, result has 14.7 percent of original size [2022-11-20 10:41:00,495 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 62 treesize of output 51 [2022-11-20 10:41:01,291 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:41:01,297 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-20 10:41:01,297 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 33 [2022-11-20 10:41:01,734 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:41:01,735 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:41:01,757 INFO L321 Elim1Store]: treesize reduction 81, result has 8.0 percent of original size [2022-11-20 10:41:01,758 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 8 new quantified variables, introduced 10 case distinctions, treesize of input 82 treesize of output 37 [2022-11-20 10:41:01,836 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 5 proven. 24 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-20 10:41:01,837 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:41:06,288 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1846334283] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:41:06,288 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 10:41:06,288 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 33] total 58 [2022-11-20 10:41:06,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596112228] [2022-11-20 10:41:06,289 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 10:41:06,289 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2022-11-20 10:41:06,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:41:06,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2022-11-20 10:41:06,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=189, Invalid=4501, Unknown=2, NotChecked=0, Total=4692 [2022-11-20 10:41:06,291 INFO L87 Difference]: Start difference. First operand 73 states and 79 transitions. Second operand has 58 states, 56 states have (on average 1.5892857142857142) internal successors, (89), 51 states have internal predecessors, (89), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2022-11-20 10:41:09,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:41:09,960 INFO L93 Difference]: Finished difference Result 77 states and 83 transitions. [2022-11-20 10:41:09,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-11-20 10:41:09,961 INFO L78 Accepts]: Start accepts. Automaton has has 58 states, 56 states have (on average 1.5892857142857142) internal successors, (89), 51 states have internal predecessors, (89), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 59 [2022-11-20 10:41:09,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:41:09,961 INFO L225 Difference]: With dead ends: 77 [2022-11-20 10:41:09,962 INFO L226 Difference]: Without dead ends: 77 [2022-11-20 10:41:09,963 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 47 SyntacticMatches, 5 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1473 ImplicationChecksByTransitivity, 11.0s TimeCoverageRelationStatistics Valid=374, Invalid=7632, Unknown=4, NotChecked=0, Total=8010 [2022-11-20 10:41:09,963 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 63 mSDsluCounter, 1292 mSDsCounter, 0 mSdLazyCounter, 919 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 1335 SdHoareTripleChecker+Invalid, 1106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 919 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 177 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-20 10:41:09,964 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 1335 Invalid, 1106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 919 Invalid, 0 Unknown, 177 Unchecked, 0.8s Time] [2022-11-20 10:41:09,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-11-20 10:41:09,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 73. [2022-11-20 10:41:09,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 59 states have (on average 1.2203389830508475) internal successors, (72), 68 states have internal predecessors, (72), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-20 10:41:09,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 78 transitions. [2022-11-20 10:41:09,967 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 78 transitions. Word has length 59 [2022-11-20 10:41:09,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:41:09,968 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 78 transitions. [2022-11-20 10:41:09,968 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 58 states, 56 states have (on average 1.5892857142857142) internal successors, (89), 51 states have internal predecessors, (89), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2022-11-20 10:41:09,968 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 78 transitions. [2022-11-20 10:41:09,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-11-20 10:41:09,969 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:41:09,969 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 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-11-20 10:41:09,974 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac68dab7-80a7-4075-8b13-a97d4e1f9b96/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-20 10:41:10,169 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac68dab7-80a7-4075-8b13-a97d4e1f9b96/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:41:10,169 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-11-20 10:41:10,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:41:10,170 INFO L85 PathProgramCache]: Analyzing trace with hash 363986943, now seen corresponding path program 1 times [2022-11-20 10:41:10,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:41:10,170 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947071944] [2022-11-20 10:41:10,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:41:10,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:41:10,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:41:12,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 10:41:12,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:41:13,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-20 10:41:13,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:41:13,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-20 10:41:13,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:41:14,648 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-20 10:41:14,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:41:14,649 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947071944] [2022-11-20 10:41:14,649 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1947071944] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:41:14,649 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [356670597] [2022-11-20 10:41:14,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:41:14,649 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:41:14,650 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac68dab7-80a7-4075-8b13-a97d4e1f9b96/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:41:14,650 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac68dab7-80a7-4075-8b13-a97d4e1f9b96/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:41:14,656 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac68dab7-80a7-4075-8b13-a97d4e1f9b96/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-20 10:41:14,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:41:14,922 INFO L263 TraceCheckSpWp]: Trace formula consists of 459 conjuncts, 177 conjunts are in the unsatisfiable core [2022-11-20 10:41:14,928 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:41:14,935 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-11-20 10:41:15,036 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-20 10:41:15,198 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-11-20 10:41:15,402 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-20 10:41:15,402 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 17 treesize of output 21 [2022-11-20 10:41:15,636 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:41:15,636 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 21 treesize of output 20 [2022-11-20 10:41:15,813 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-11-20 10:41:15,901 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-11-20 10:41:16,473 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:41:16,488 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-20 10:41:16,488 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 29 [2022-11-20 10:41:16,509 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-11-20 10:41:16,866 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-20 10:41:16,874 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-11-20 10:41:16,896 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-11-20 10:41:17,662 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 10:41:17,662 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 93 treesize of output 44 [2022-11-20 10:41:17,672 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:41:17,672 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-20 10:41:17,691 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-11-20 10:41:17,697 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-11-20 10:41:18,446 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:41:18,460 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-20 10:41:18,460 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 101 treesize of output 81 [2022-11-20 10:41:18,489 INFO L321 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-11-20 10:41:18,490 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 16 treesize of output 18 [2022-11-20 10:41:18,514 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-11-20 10:41:18,514 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 28 [2022-11-20 10:41:18,530 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:41:18,531 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:41:18,548 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-11-20 10:41:18,548 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 33 [2022-11-20 10:41:18,563 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-11-20 10:41:19,224 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:41:19,225 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:41:19,236 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-11-20 10:41:19,237 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 110 treesize of output 67 [2022-11-20 10:41:19,244 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 20 treesize of output 22 [2022-11-20 10:41:19,272 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2022-11-20 10:41:19,574 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:41:19,584 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-20 10:41:19,584 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 2 case distinctions, treesize of input 135 treesize of output 70 [2022-11-20 10:41:19,598 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2022-11-20 10:41:19,605 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:41:19,606 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 29 treesize of output 28 [2022-11-20 10:41:21,099 INFO L321 Elim1Store]: treesize reduction 65, result has 11.0 percent of original size [2022-11-20 10:41:21,099 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 276 treesize of output 84 [2022-11-20 10:41:21,117 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 10:41:21,117 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 15 [2022-11-20 10:41:21,122 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 12 [2022-11-20 10:41:21,803 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-11-20 10:41:21,915 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 3 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:41:21,915 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:41:28,903 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [356670597] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:41:28,903 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 10:41:28,903 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 38] total 72 [2022-11-20 10:41:28,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797142565] [2022-11-20 10:41:28,903 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 10:41:28,904 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 72 states [2022-11-20 10:41:28,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:41:28,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2022-11-20 10:41:28,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=221, Invalid=7036, Unknown=53, NotChecked=0, Total=7310 [2022-11-20 10:41:28,905 INFO L87 Difference]: Start difference. First operand 73 states and 78 transitions. Second operand has 72 states, 70 states have (on average 1.5714285714285714) internal successors, (110), 63 states have internal predecessors, (110), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-20 10:41:36,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:41:36,431 INFO L93 Difference]: Finished difference Result 105 states and 114 transitions. [2022-11-20 10:41:36,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-11-20 10:41:36,432 INFO L78 Accepts]: Start accepts. Automaton has has 72 states, 70 states have (on average 1.5714285714285714) internal successors, (110), 63 states have internal predecessors, (110), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 62 [2022-11-20 10:41:36,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:41:36,433 INFO L225 Difference]: With dead ends: 105 [2022-11-20 10:41:36,433 INFO L226 Difference]: Without dead ends: 105 [2022-11-20 10:41:36,434 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 41 SyntacticMatches, 3 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1582 ImplicationChecksByTransitivity, 19.6s TimeCoverageRelationStatistics Valid=404, Invalid=11312, Unknown=56, NotChecked=0, Total=11772 [2022-11-20 10:41:36,435 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 46 mSDsluCounter, 1510 mSDsCounter, 0 mSdLazyCounter, 1670 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 1551 SdHoareTripleChecker+Invalid, 2026 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 1670 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 334 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-11-20 10:41:36,435 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 1551 Invalid, 2026 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 1670 Invalid, 0 Unknown, 334 Unchecked, 1.7s Time] [2022-11-20 10:41:36,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2022-11-20 10:41:36,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 104. [2022-11-20 10:41:36,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 88 states have (on average 1.1590909090909092) internal successors, (102), 97 states have internal predecessors, (102), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-11-20 10:41:36,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 112 transitions. [2022-11-20 10:41:36,439 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 112 transitions. Word has length 62 [2022-11-20 10:41:36,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:41:36,439 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 112 transitions. [2022-11-20 10:41:36,439 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 72 states, 70 states have (on average 1.5714285714285714) internal successors, (110), 63 states have internal predecessors, (110), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-20 10:41:36,439 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 112 transitions. [2022-11-20 10:41:36,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-11-20 10:41:36,440 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:41:36,440 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 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] [2022-11-20 10:41:36,445 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac68dab7-80a7-4075-8b13-a97d4e1f9b96/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-20 10:41:36,643 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac68dab7-80a7-4075-8b13-a97d4e1f9b96/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:41:36,644 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-11-20 10:41:36,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:41:36,644 INFO L85 PathProgramCache]: Analyzing trace with hash -1601306187, now seen corresponding path program 2 times [2022-11-20 10:41:36,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:41:36,644 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652011458] [2022-11-20 10:41:36,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:41:36,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:41:36,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:41:40,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 10:41:40,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:41:40,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-20 10:41:40,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:41:41,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-20 10:41:41,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:41:41,807 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 2 proven. 31 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-20 10:41:41,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:41:41,807 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652011458] [2022-11-20 10:41:41,808 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1652011458] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:41:41,808 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2129939621] [2022-11-20 10:41:41,808 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-20 10:41:41,808 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:41:41,808 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac68dab7-80a7-4075-8b13-a97d4e1f9b96/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:41:41,809 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac68dab7-80a7-4075-8b13-a97d4e1f9b96/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:41:41,811 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac68dab7-80a7-4075-8b13-a97d4e1f9b96/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-20 10:41:42,107 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-20 10:41:42,107 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 10:41:42,111 INFO L263 TraceCheckSpWp]: Trace formula consists of 467 conjuncts, 195 conjunts are in the unsatisfiable core [2022-11-20 10:41:42,117 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:41:42,126 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-11-20 10:41:42,225 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-20 10:41:42,395 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-11-20 10:41:42,494 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:41:42,495 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 21 treesize of output 20 [2022-11-20 10:41:42,641 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-20 10:41:42,641 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 17 treesize of output 21 [2022-11-20 10:41:42,934 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 13 treesize of output 9 [2022-11-20 10:41:42,949 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:41:42,951 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 21 treesize of output 13 [2022-11-20 10:41:43,296 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-11-20 10:41:43,964 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-20 10:41:43,964 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 1 case distinctions, treesize of input 16 treesize of output 22 [2022-11-20 10:41:43,975 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-20 10:41:43,995 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-20 10:41:43,996 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 1 case distinctions, treesize of input 16 treesize of output 22 [2022-11-20 10:41:44,007 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-20 10:41:44,042 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-11-20 10:41:44,043 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 22 treesize of output 33 [2022-11-20 10:41:44,393 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-20 10:41:44,398 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2022-11-20 10:41:45,250 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-20 10:41:45,251 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 100 treesize of output 46 [2022-11-20 10:41:45,259 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-11-20 10:41:45,267 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-20 10:41:45,766 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:41:45,791 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-11-20 10:41:45,791 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 33 [2022-11-20 10:41:45,891 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| .cse0) 4))) (and (= |c_ULTIMATE.start_sll_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base| .cse0)) (not (= .cse1 .cse0)) (not (= .cse1 |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|)) (= |c_ULTIMATE.start_sll_prepend_#t~ret7#1.offset| 0) (= (select (select |c_#memory_$Pointer$.base| .cse1) 4) 0) (not (= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|)) (<= (+ 2 |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|) |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (or (exists ((|v_old(#memory_$Pointer$.offset)_AFTER_CALL_32| (Array Int (Array Int Int)))) (let ((.cse2 (@diff |v_old(#memory_$Pointer$.offset)_AFTER_CALL_32| |c_#memory_$Pointer$.offset|))) (and (= .cse2 |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|) (= (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_32| .cse0) 4) 0) (= (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_32| .cse1) 4) 0) (= |c_#memory_$Pointer$.offset| (store |v_old(#memory_$Pointer$.offset)_AFTER_CALL_32| .cse2 (select |c_#memory_$Pointer$.offset| .cse2))) (= (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_32| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)))) (and (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= (select (select |c_#memory_$Pointer$.offset| .cse0) 4) 0) (= (select (select |c_#memory_$Pointer$.offset| .cse1) 4) 0))) (not (= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|))))) is different from false [2022-11-20 10:41:45,894 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| .cse0) 4))) (and (= |c_ULTIMATE.start_sll_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base| .cse0)) (not (= .cse1 .cse0)) (not (= .cse1 |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|)) (= |c_ULTIMATE.start_sll_prepend_#t~ret7#1.offset| 0) (= (select (select |c_#memory_$Pointer$.base| .cse1) 4) 0) (not (= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|)) (<= (+ 2 |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|) |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (or (exists ((|v_old(#memory_$Pointer$.offset)_AFTER_CALL_32| (Array Int (Array Int Int)))) (let ((.cse2 (@diff |v_old(#memory_$Pointer$.offset)_AFTER_CALL_32| |c_#memory_$Pointer$.offset|))) (and (= .cse2 |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|) (= (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_32| .cse0) 4) 0) (= (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_32| .cse1) 4) 0) (= |c_#memory_$Pointer$.offset| (store |v_old(#memory_$Pointer$.offset)_AFTER_CALL_32| .cse2 (select |c_#memory_$Pointer$.offset| .cse2))) (= (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_32| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)))) (and (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= (select (select |c_#memory_$Pointer$.offset| .cse0) 4) 0) (= (select (select |c_#memory_$Pointer$.offset| .cse1) 4) 0))) (not (= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|))))) is different from true [2022-11-20 10:41:46,416 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:41:46,416 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:41:46,418 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:41:46,436 INFO L321 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2022-11-20 10:41:46,436 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 115 treesize of output 74 [2022-11-20 10:41:46,448 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:41:46,451 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 52 [2022-11-20 10:41:46,754 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:41:46,758 INFO L321 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-11-20 10:41:46,758 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 5 case distinctions, treesize of input 112 treesize of output 71 [2022-11-20 10:41:46,777 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:41:46,779 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:41:46,780 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 65 [2022-11-20 10:41:49,199 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:41:49,201 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:41:49,248 INFO L321 Elim1Store]: treesize reduction 176, result has 7.4 percent of original size [2022-11-20 10:41:49,249 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 1 disjoint index pairs (out of 21 index pairs), introduced 13 new quantified variables, introduced 21 case distinctions, treesize of input 269 treesize of output 120 [2022-11-20 10:41:49,257 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:41:49,273 INFO L321 Elim1Store]: treesize reduction 15, result has 40.0 percent of original size [2022-11-20 10:41:49,273 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 6 disjoint index pairs (out of 21 index pairs), introduced 9 new quantified variables, introduced 3 case distinctions, treesize of input 57 treesize of output 38 [2022-11-20 10:41:49,628 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 6 proven. 31 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-20 10:41:49,628 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:41:53,469 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2129939621] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:41:53,469 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 10:41:53,470 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40] total 74 [2022-11-20 10:41:53,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025943802] [2022-11-20 10:41:53,470 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 10:41:53,470 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 74 states [2022-11-20 10:41:53,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:41:53,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2022-11-20 10:41:53,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=7423, Unknown=6, NotChecked=172, Total=7832 [2022-11-20 10:41:53,471 INFO L87 Difference]: Start difference. First operand 104 states and 112 transitions. Second operand has 74 states, 72 states have (on average 1.4444444444444444) internal successors, (104), 65 states have internal predecessors, (104), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-20 10:41:57,097 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_prepend_~head#1.base|) |c_ULTIMATE.start_sll_prepend_~head#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$.base| .cse0) 4))) (and (= |c_ULTIMATE.start_sll_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base| .cse0)) (not (= .cse1 |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|)) (not (= .cse2 .cse0)) (not (= .cse2 |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|)) (= |c_ULTIMATE.start_sll_prepend_#t~ret7#1.offset| 0) (let ((.cse4 (not (= |c_ULTIMATE.start_main_~data~0#1| |c_ULTIMATE.start_main_~uneq~0#1|))) (.cse3 (select (select |c_#memory_$Pointer$.base| .cse1) 4))) (or (and (= |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base| .cse3) .cse4) (and (= (select (select |c_#memory_$Pointer$.offset| .cse3) 4) 0) (= (select (select |c_#memory_$Pointer$.base| .cse3) 4) 0) .cse4 (not (= |c_ULTIMATE.start_sll_prepend_~head#1.base| .cse3))))) (= (select (select |c_#memory_$Pointer$.base| .cse2) 4) 0) (not (= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|)) (not (= |c_ULTIMATE.start_sll_prepend_~head#1.base| |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|)) (<= (+ 2 |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|) |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= |c_ULTIMATE.start_sll_prepend_~head#1.base| .cse1)) (= |c_ULTIMATE.start_sll_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= (select (select |c_#memory_$Pointer$.offset| .cse1) 4) 0) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_prepend_~head#1.base|) |c_ULTIMATE.start_sll_prepend_~head#1.offset|) |c_ULTIMATE.start_sll_prepend_#t~ret7#1.offset|) (or (exists ((|v_old(#memory_$Pointer$.offset)_AFTER_CALL_32| (Array Int (Array Int Int)))) (let ((.cse5 (@diff |v_old(#memory_$Pointer$.offset)_AFTER_CALL_32| |c_#memory_$Pointer$.offset|))) (and (= .cse5 |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|) (= (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_32| .cse0) 4) 0) (= (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_32| .cse2) 4) 0) (= |c_#memory_$Pointer$.offset| (store |v_old(#memory_$Pointer$.offset)_AFTER_CALL_32| .cse5 (select |c_#memory_$Pointer$.offset| .cse5))) (= (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_32| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)))) (and (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= (select (select |c_#memory_$Pointer$.offset| .cse0) 4) 0) (= (select (select |c_#memory_$Pointer$.offset| .cse2) 4) 0))) (not (= .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|))))) is different from false [2022-11-20 10:41:57,105 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_prepend_~head#1.base|) |c_ULTIMATE.start_sll_prepend_~head#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$.base| .cse0) 4))) (and (= |c_ULTIMATE.start_sll_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base| .cse0)) (not (= .cse1 |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|)) (not (= .cse2 .cse0)) (not (= .cse2 |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|)) (= |c_ULTIMATE.start_sll_prepend_#t~ret7#1.offset| 0) (let ((.cse4 (not (= |c_ULTIMATE.start_main_~data~0#1| |c_ULTIMATE.start_main_~uneq~0#1|))) (.cse3 (select (select |c_#memory_$Pointer$.base| .cse1) 4))) (or (and (= |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base| .cse3) .cse4) (and (= (select (select |c_#memory_$Pointer$.offset| .cse3) 4) 0) (= (select (select |c_#memory_$Pointer$.base| .cse3) 4) 0) .cse4 (not (= |c_ULTIMATE.start_sll_prepend_~head#1.base| .cse3))))) (= (select (select |c_#memory_$Pointer$.base| .cse2) 4) 0) (not (= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|)) (not (= |c_ULTIMATE.start_sll_prepend_~head#1.base| |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|)) (<= (+ 2 |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|) |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= |c_ULTIMATE.start_sll_prepend_~head#1.base| .cse1)) (= |c_ULTIMATE.start_sll_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= (select (select |c_#memory_$Pointer$.offset| .cse1) 4) 0) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_prepend_~head#1.base|) |c_ULTIMATE.start_sll_prepend_~head#1.offset|) |c_ULTIMATE.start_sll_prepend_#t~ret7#1.offset|) (or (exists ((|v_old(#memory_$Pointer$.offset)_AFTER_CALL_32| (Array Int (Array Int Int)))) (let ((.cse5 (@diff |v_old(#memory_$Pointer$.offset)_AFTER_CALL_32| |c_#memory_$Pointer$.offset|))) (and (= .cse5 |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|) (= (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_32| .cse0) 4) 0) (= (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_32| .cse2) 4) 0) (= |c_#memory_$Pointer$.offset| (store |v_old(#memory_$Pointer$.offset)_AFTER_CALL_32| .cse5 (select |c_#memory_$Pointer$.offset| .cse5))) (= (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_32| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)))) (and (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= (select (select |c_#memory_$Pointer$.offset| .cse0) 4) 0) (= (select (select |c_#memory_$Pointer$.offset| .cse2) 4) 0))) (not (= .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|))))) is different from true [2022-11-20 10:41:58,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:41:58,759 INFO L93 Difference]: Finished difference Result 127 states and 135 transitions. [2022-11-20 10:41:58,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-11-20 10:41:58,760 INFO L78 Accepts]: Start accepts. Automaton has has 74 states, 72 states have (on average 1.4444444444444444) internal successors, (104), 65 states have internal predecessors, (104), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 63 [2022-11-20 10:41:58,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:41:58,761 INFO L225 Difference]: With dead ends: 127 [2022-11-20 10:41:58,761 INFO L226 Difference]: Without dead ends: 127 [2022-11-20 10:41:58,763 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 41 SyntacticMatches, 5 SemanticMatches, 106 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1753 ImplicationChecksByTransitivity, 15.1s TimeCoverageRelationStatistics Valid=374, Invalid=10755, Unknown=9, NotChecked=418, Total=11556 [2022-11-20 10:41:58,763 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 126 mSDsluCounter, 1320 mSDsCounter, 0 mSdLazyCounter, 1430 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 1362 SdHoareTripleChecker+Invalid, 1716 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 1430 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 267 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-11-20 10:41:58,764 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 1362 Invalid, 1716 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 1430 Invalid, 0 Unknown, 267 Unchecked, 1.5s Time] [2022-11-20 10:41:58,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2022-11-20 10:41:58,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 105. [2022-11-20 10:41:58,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 89 states have (on average 1.1573033707865168) internal successors, (103), 98 states have internal predecessors, (103), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-11-20 10:41:58,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 113 transitions. [2022-11-20 10:41:58,768 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 113 transitions. Word has length 63 [2022-11-20 10:41:58,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:41:58,768 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 113 transitions. [2022-11-20 10:41:58,769 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 74 states, 72 states have (on average 1.4444444444444444) internal successors, (104), 65 states have internal predecessors, (104), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-20 10:41:58,769 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 113 transitions. [2022-11-20 10:41:58,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-11-20 10:41:58,769 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:41:58,770 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 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-11-20 10:41:58,776 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac68dab7-80a7-4075-8b13-a97d4e1f9b96/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-20 10:41:58,971 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac68dab7-80a7-4075-8b13-a97d4e1f9b96/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-11-20 10:41:58,972 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-11-20 10:41:58,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:41:58,972 INFO L85 PathProgramCache]: Analyzing trace with hash 1899114441, now seen corresponding path program 2 times [2022-11-20 10:41:58,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:41:58,972 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307614995] [2022-11-20 10:41:58,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:41:58,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:41:58,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:41:59,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 10:41:59,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:41:59,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-20 10:41:59,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:41:59,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-20 10:41:59,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:41:59,203 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-11-20 10:41:59,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:41:59,203 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307614995] [2022-11-20 10:41:59,203 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [307614995] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:41:59,203 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1528444795] [2022-11-20 10:41:59,203 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-20 10:41:59,204 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:41:59,204 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac68dab7-80a7-4075-8b13-a97d4e1f9b96/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:41:59,204 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac68dab7-80a7-4075-8b13-a97d4e1f9b96/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:41:59,207 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac68dab7-80a7-4075-8b13-a97d4e1f9b96/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-20 10:41:59,509 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-20 10:41:59,510 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 10:41:59,512 INFO L263 TraceCheckSpWp]: Trace formula consists of 471 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-20 10:41:59,513 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:41:59,708 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-11-20 10:41:59,708 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:41:59,874 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-11-20 10:41:59,874 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1528444795] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 10:41:59,875 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 10:41:59,875 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 11 [2022-11-20 10:41:59,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148423556] [2022-11-20 10:41:59,875 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 10:41:59,875 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-20 10:41:59,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:41:59,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-20 10:41:59,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-11-20 10:41:59,876 INFO L87 Difference]: Start difference. First operand 105 states and 113 transitions. Second operand has 11 states, 11 states have (on average 5.636363636363637) internal successors, (62), 10 states have internal predecessors, (62), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-20 10:41:59,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:41:59,983 INFO L93 Difference]: Finished difference Result 119 states and 128 transitions. [2022-11-20 10:41:59,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-20 10:41:59,984 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.636363636363637) internal successors, (62), 10 states have internal predecessors, (62), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 64 [2022-11-20 10:41:59,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:41:59,985 INFO L225 Difference]: With dead ends: 119 [2022-11-20 10:41:59,985 INFO L226 Difference]: Without dead ends: 119 [2022-11-20 10:41:59,985 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 127 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-11-20 10:41:59,986 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 81 mSDsluCounter, 312 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 10:41:59,986 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 378 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 10:41:59,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2022-11-20 10:41:59,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 108. [2022-11-20 10:41:59,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 92 states have (on average 1.173913043478261) internal successors, (108), 101 states have internal predecessors, (108), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-11-20 10:41:59,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 118 transitions. [2022-11-20 10:41:59,990 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 118 transitions. Word has length 64 [2022-11-20 10:41:59,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:41:59,991 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 118 transitions. [2022-11-20 10:41:59,991 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.636363636363637) internal successors, (62), 10 states have internal predecessors, (62), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-20 10:41:59,991 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 118 transitions. [2022-11-20 10:41:59,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-11-20 10:41:59,992 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:41:59,992 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1] [2022-11-20 10:42:00,000 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac68dab7-80a7-4075-8b13-a97d4e1f9b96/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-11-20 10:42:00,198 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac68dab7-80a7-4075-8b13-a97d4e1f9b96/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-11-20 10:42:00,198 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-11-20 10:42:00,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:42:00,199 INFO L85 PathProgramCache]: Analyzing trace with hash -1084778802, now seen corresponding path program 1 times [2022-11-20 10:42:00,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:42:00,199 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673242346] [2022-11-20 10:42:00,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:42:00,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:42:00,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:42:00,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 10:42:00,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:42:00,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-20 10:42:00,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:42:00,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-20 10:42:00,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:42:00,492 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-11-20 10:42:00,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:42:00,494 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673242346] [2022-11-20 10:42:00,496 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1673242346] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:42:00,497 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:42:00,497 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-20 10:42:00,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348915045] [2022-11-20 10:42:00,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:42:00,497 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-20 10:42:00,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:42:00,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-20 10:42:00,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-11-20 10:42:00,498 INFO L87 Difference]: Start difference. First operand 108 states and 118 transitions. Second operand has 11 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 states have internal predecessors, (43), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-20 10:42:00,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:42:00,731 INFO L93 Difference]: Finished difference Result 117 states and 128 transitions. [2022-11-20 10:42:00,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-20 10:42:00,731 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 states have internal predecessors, (43), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 67 [2022-11-20 10:42:00,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:42:00,732 INFO L225 Difference]: With dead ends: 117 [2022-11-20 10:42:00,732 INFO L226 Difference]: Without dead ends: 117 [2022-11-20 10:42:00,733 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2022-11-20 10:42:00,733 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 91 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 10:42:00,733 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 230 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 10:42:00,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2022-11-20 10:42:00,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 109. [2022-11-20 10:42:00,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 94 states have (on average 1.1808510638297873) internal successors, (111), 102 states have internal predecessors, (111), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-11-20 10:42:00,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 121 transitions. [2022-11-20 10:42:00,737 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 121 transitions. Word has length 67 [2022-11-20 10:42:00,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:42:00,738 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 121 transitions. [2022-11-20 10:42:00,738 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 states have internal predecessors, (43), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-20 10:42:00,738 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 121 transitions. [2022-11-20 10:42:00,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-11-20 10:42:00,739 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:42:00,745 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1] [2022-11-20 10:42:00,746 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-11-20 10:42:00,746 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-11-20 10:42:00,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:42:00,746 INFO L85 PathProgramCache]: Analyzing trace with hash -1084778801, now seen corresponding path program 1 times [2022-11-20 10:42:00,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:42:00,747 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191942258] [2022-11-20 10:42:00,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:42:00,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:42:00,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:42:01,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 10:42:01,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:42:01,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-20 10:42:01,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:42:01,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-20 10:42:01,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:42:01,135 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-11-20 10:42:01,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:42:01,136 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191942258] [2022-11-20 10:42:01,136 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [191942258] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:42:01,136 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:42:01,136 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-20 10:42:01,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752547814] [2022-11-20 10:42:01,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:42:01,137 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-20 10:42:01,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:42:01,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-20 10:42:01,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-11-20 10:42:01,138 INFO L87 Difference]: Start difference. First operand 109 states and 121 transitions. Second operand has 11 states, 9 states have (on average 5.0) internal successors, (45), 9 states have internal predecessors, (45), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-20 10:42:01,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:42:01,437 INFO L93 Difference]: Finished difference Result 117 states and 127 transitions. [2022-11-20 10:42:01,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-20 10:42:01,438 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 5.0) internal successors, (45), 9 states have internal predecessors, (45), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 67 [2022-11-20 10:42:01,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:42:01,439 INFO L225 Difference]: With dead ends: 117 [2022-11-20 10:42:01,439 INFO L226 Difference]: Without dead ends: 117 [2022-11-20 10:42:01,439 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2022-11-20 10:42:01,440 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 103 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 10:42:01,440 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 221 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 10:42:01,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2022-11-20 10:42:01,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 111. [2022-11-20 10:42:01,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 96 states have (on average 1.1666666666666667) internal successors, (112), 104 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-11-20 10:42:01,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 122 transitions. [2022-11-20 10:42:01,444 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 122 transitions. Word has length 67 [2022-11-20 10:42:01,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:42:01,444 INFO L495 AbstractCegarLoop]: Abstraction has 111 states and 122 transitions. [2022-11-20 10:42:01,445 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 5.0) internal successors, (45), 9 states have internal predecessors, (45), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-20 10:42:01,445 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 122 transitions. [2022-11-20 10:42:01,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-11-20 10:42:01,445 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:42:01,445 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1] [2022-11-20 10:42:01,446 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-11-20 10:42:01,446 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-11-20 10:42:01,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:42:01,446 INFO L85 PathProgramCache]: Analyzing trace with hash 731594071, now seen corresponding path program 1 times [2022-11-20 10:42:01,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:42:01,447 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792413131] [2022-11-20 10:42:01,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:42:01,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:42:01,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:42:01,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 10:42:01,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:42:01,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-20 10:42:01,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:42:01,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-20 10:42:01,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:42:01,732 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-11-20 10:42:01,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:42:01,733 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792413131] [2022-11-20 10:42:01,733 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [792413131] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:42:01,733 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:42:01,733 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-20 10:42:01,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303191266] [2022-11-20 10:42:01,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:42:01,733 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-20 10:42:01,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:42:01,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-20 10:42:01,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-11-20 10:42:01,734 INFO L87 Difference]: Start difference. First operand 111 states and 122 transitions. Second operand has 11 states, 10 states have (on average 4.6) internal successors, (46), 9 states have internal predecessors, (46), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-20 10:42:01,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:42:01,928 INFO L93 Difference]: Finished difference Result 114 states and 124 transitions. [2022-11-20 10:42:01,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-20 10:42:01,928 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.6) internal successors, (46), 9 states have internal predecessors, (46), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 68 [2022-11-20 10:42:01,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:42:01,929 INFO L225 Difference]: With dead ends: 114 [2022-11-20 10:42:01,930 INFO L226 Difference]: Without dead ends: 114 [2022-11-20 10:42:01,930 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2022-11-20 10:42:01,930 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 98 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 288 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 10:42:01,931 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 288 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 10:42:01,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2022-11-20 10:42:01,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 111. [2022-11-20 10:42:01,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 96 states have (on average 1.15625) internal successors, (111), 104 states have internal predecessors, (111), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-11-20 10:42:01,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 121 transitions. [2022-11-20 10:42:01,935 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 121 transitions. Word has length 68 [2022-11-20 10:42:01,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:42:01,935 INFO L495 AbstractCegarLoop]: Abstraction has 111 states and 121 transitions. [2022-11-20 10:42:01,936 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.6) internal successors, (46), 9 states have internal predecessors, (46), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-20 10:42:01,936 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 121 transitions. [2022-11-20 10:42:01,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-11-20 10:42:01,936 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:42:01,937 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1] [2022-11-20 10:42:01,937 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-11-20 10:42:01,937 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-11-20 10:42:01,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:42:01,937 INFO L85 PathProgramCache]: Analyzing trace with hash -1311285704, now seen corresponding path program 1 times [2022-11-20 10:42:01,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:42:01,938 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113801469] [2022-11-20 10:42:01,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:42:01,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:42:01,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:42:02,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 10:42:02,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:42:02,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-20 10:42:02,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:42:02,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-20 10:42:02,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:42:02,272 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-11-20 10:42:02,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:42:02,272 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113801469] [2022-11-20 10:42:02,272 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1113801469] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:42:02,272 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:42:02,272 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-20 10:42:02,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813152698] [2022-11-20 10:42:02,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:42:02,273 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-20 10:42:02,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:42:02,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-20 10:42:02,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-11-20 10:42:02,273 INFO L87 Difference]: Start difference. First operand 111 states and 121 transitions. Second operand has 11 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-20 10:42:02,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:42:02,498 INFO L93 Difference]: Finished difference Result 112 states and 122 transitions. [2022-11-20 10:42:02,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-20 10:42:02,499 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 70 [2022-11-20 10:42:02,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:42:02,500 INFO L225 Difference]: With dead ends: 112 [2022-11-20 10:42:02,500 INFO L226 Difference]: Without dead ends: 112 [2022-11-20 10:42:02,501 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2022-11-20 10:42:02,501 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 87 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 10:42:02,501 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 269 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 10:42:02,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2022-11-20 10:42:02,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2022-11-20 10:42:02,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 97 states have (on average 1.1546391752577319) internal successors, (112), 105 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-11-20 10:42:02,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 122 transitions. [2022-11-20 10:42:02,506 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 122 transitions. Word has length 70 [2022-11-20 10:42:02,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:42:02,506 INFO L495 AbstractCegarLoop]: Abstraction has 112 states and 122 transitions. [2022-11-20 10:42:02,506 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-20 10:42:02,507 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 122 transitions. [2022-11-20 10:42:02,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-11-20 10:42:02,507 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:42:02,508 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:42:02,508 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-11-20 10:42:02,508 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-11-20 10:42:02,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:42:02,508 INFO L85 PathProgramCache]: Analyzing trace with hash -1784716013, now seen corresponding path program 1 times [2022-11-20 10:42:02,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:42:02,509 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252147557] [2022-11-20 10:42:02,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:42:02,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:42:02,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:42:03,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 10:42:03,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:42:03,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-20 10:42:03,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:42:03,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-20 10:42:03,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:42:04,024 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 18 proven. 6 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-11-20 10:42:04,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:42:04,024 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252147557] [2022-11-20 10:42:04,024 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1252147557] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:42:04,024 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1344858079] [2022-11-20 10:42:04,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:42:04,024 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:42:04,025 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac68dab7-80a7-4075-8b13-a97d4e1f9b96/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:42:04,026 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac68dab7-80a7-4075-8b13-a97d4e1f9b96/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:42:04,051 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac68dab7-80a7-4075-8b13-a97d4e1f9b96/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-11-20 10:42:04,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:42:04,400 INFO L263 TraceCheckSpWp]: Trace formula consists of 513 conjuncts, 68 conjunts are in the unsatisfiable core [2022-11-20 10:42:04,403 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:42:04,542 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-11-20 10:42:04,786 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-11-20 10:42:05,376 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 10:42:05,376 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 17 treesize of output 21 [2022-11-20 10:42:05,520 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 10:42:05,520 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 37 treesize of output 41 [2022-11-20 10:42:05,826 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 66 treesize of output 46 [2022-11-20 10:42:06,355 INFO L321 Elim1Store]: treesize reduction 42, result has 82.6 percent of original size [2022-11-20 10:42:06,356 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 10 new quantified variables, introduced 21 case distinctions, treesize of input 106 treesize of output 251 [2022-11-20 10:42:06,832 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 10:42:06,832 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 16 treesize of output 18 [2022-11-20 10:42:06,837 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 12 proven. 8 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-11-20 10:42:06,837 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:42:07,478 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 10:42:07,478 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 37 treesize of output 41 [2022-11-20 10:42:08,052 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 10:42:08,052 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 21 treesize of output 24 [2022-11-20 10:42:08,420 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 161 treesize of output 129 [2022-11-20 10:42:08,556 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 10:42:08,556 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 370 treesize of output 336 [2022-11-20 10:42:12,666 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 10:42:12,667 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 196 treesize of output 405 [2022-11-20 10:42:15,569 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 15 proven. 5 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-11-20 10:42:15,569 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1344858079] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 10:42:15,569 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 10:42:15,570 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 23, 23] total 64 [2022-11-20 10:42:15,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516233330] [2022-11-20 10:42:15,570 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 10:42:15,570 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 65 states [2022-11-20 10:42:15,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:42:15,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2022-11-20 10:42:15,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=218, Invalid=3942, Unknown=0, NotChecked=0, Total=4160 [2022-11-20 10:42:15,571 INFO L87 Difference]: Start difference. First operand 112 states and 122 transitions. Second operand has 65 states, 61 states have (on average 2.360655737704918) internal successors, (144), 60 states have internal predecessors, (144), 6 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (7), 7 states have call predecessors, (7), 6 states have call successors, (7) [2022-11-20 10:42:20,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:42:20,434 INFO L93 Difference]: Finished difference Result 123 states and 134 transitions. [2022-11-20 10:42:20,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-11-20 10:42:20,435 INFO L78 Accepts]: Start accepts. Automaton has has 65 states, 61 states have (on average 2.360655737704918) internal successors, (144), 60 states have internal predecessors, (144), 6 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (7), 7 states have call predecessors, (7), 6 states have call successors, (7) Word has length 73 [2022-11-20 10:42:20,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:42:20,436 INFO L225 Difference]: With dead ends: 123 [2022-11-20 10:42:20,436 INFO L226 Difference]: Without dead ends: 123 [2022-11-20 10:42:20,437 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 106 SyntacticMatches, 6 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1582 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=714, Invalid=7658, Unknown=0, NotChecked=0, Total=8372 [2022-11-20 10:42:20,438 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 364 mSDsluCounter, 643 mSDsCounter, 0 mSdLazyCounter, 1741 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 364 SdHoareTripleChecker+Valid, 665 SdHoareTripleChecker+Invalid, 2093 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 1741 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 328 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-11-20 10:42:20,438 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [364 Valid, 665 Invalid, 2093 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 1741 Invalid, 0 Unknown, 328 Unchecked, 1.4s Time] [2022-11-20 10:42:20,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2022-11-20 10:42:20,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 115. [2022-11-20 10:42:20,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 100 states have (on average 1.17) internal successors, (117), 108 states have internal predecessors, (117), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-11-20 10:42:20,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 127 transitions. [2022-11-20 10:42:20,442 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 127 transitions. Word has length 73 [2022-11-20 10:42:20,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:42:20,443 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 127 transitions. [2022-11-20 10:42:20,443 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 65 states, 61 states have (on average 2.360655737704918) internal successors, (144), 60 states have internal predecessors, (144), 6 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (7), 7 states have call predecessors, (7), 6 states have call successors, (7) [2022-11-20 10:42:20,443 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 127 transitions. [2022-11-20 10:42:20,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-11-20 10:42:20,444 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:42:20,444 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:42:20,470 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac68dab7-80a7-4075-8b13-a97d4e1f9b96/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-11-20 10:42:20,651 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac68dab7-80a7-4075-8b13-a97d4e1f9b96/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-11-20 10:42:20,651 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-11-20 10:42:20,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:42:20,651 INFO L85 PathProgramCache]: Analyzing trace with hash -1784716012, now seen corresponding path program 1 times [2022-11-20 10:42:20,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:42:20,652 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424145536] [2022-11-20 10:42:20,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:42:20,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:42:20,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:42:22,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 10:42:22,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:42:22,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-20 10:42:22,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:42:22,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-20 10:42:22,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:42:22,495 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 24 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-20 10:42:22,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:42:22,496 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424145536] [2022-11-20 10:42:22,496 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [424145536] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:42:22,496 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [150131403] [2022-11-20 10:42:22,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:42:22,496 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:42:22,496 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac68dab7-80a7-4075-8b13-a97d4e1f9b96/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:42:22,498 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac68dab7-80a7-4075-8b13-a97d4e1f9b96/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:42:22,499 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac68dab7-80a7-4075-8b13-a97d4e1f9b96/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-11-20 10:42:22,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:42:22,838 INFO L263 TraceCheckSpWp]: Trace formula consists of 513 conjuncts, 114 conjunts are in the unsatisfiable core [2022-11-20 10:42:22,843 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:42:23,391 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-11-20 10:42:23,396 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-11-20 10:42:23,892 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:42:23,892 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 14 treesize of output 16 [2022-11-20 10:42:23,906 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:42:23,907 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 18 [2022-11-20 10:42:23,913 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:42:23,913 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 25 treesize of output 25 [2022-11-20 10:42:23,925 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-11-20 10:42:23,925 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-11-20 10:42:24,230 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:42:24,231 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 24 [2022-11-20 10:42:24,243 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:42:24,244 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2022-11-20 10:42:24,387 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:42:24,389 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 27 [2022-11-20 10:42:24,398 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:42:24,399 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-20 10:42:24,404 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-20 10:42:24,984 INFO L321 Elim1Store]: treesize reduction 15, result has 34.8 percent of original size [2022-11-20 10:42:24,985 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 76 treesize of output 45 [2022-11-20 10:42:24,995 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 10:42:24,995 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 15 [2022-11-20 10:42:25,210 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 26 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-20 10:42:25,210 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:42:25,850 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_prepend_~head#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_prepend_~head#1.base|) |c_ULTIMATE.start_sll_prepend_~head#1.offset| |c_ULTIMATE.start_sll_prepend_~new_head~1#1.base|)))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (forall ((v_ArrVal_3832 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_3832) .cse0) 4) 4))) (forall ((v_ArrVal_3832 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_3832) .cse0) 4) 8) (select |c_#length| (select (select .cse1 .cse0) 4))))))) is different from false [2022-11-20 10:42:26,157 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (+ 4 |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|))) (let ((.cse2 (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_prepend_~new_head~1#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_prepend_~new_head~1#1.base|) .cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_prepend_~head#1.base|) |c_ULTIMATE.start_sll_prepend_~head#1.offset|))))) (store .cse4 |c_ULTIMATE.start_sll_prepend_~head#1.base| (store (select .cse4 |c_ULTIMATE.start_sll_prepend_~head#1.base|) |c_ULTIMATE.start_sll_prepend_~head#1.offset| |c_ULTIMATE.start_sll_prepend_~new_head~1#1.base|))))) (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_prepend_~new_head~1#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_prepend_~new_head~1#1.base|) .cse3 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_prepend_~head#1.base|) |c_ULTIMATE.start_sll_prepend_~head#1.offset|)))) (.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (forall ((v_ArrVal_3832 (Array Int Int))) (<= (+ (select (select (store .cse0 |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_3832) .cse1) 4) 8) (select |c_#length| (select (select .cse2 .cse1) 4)))) (forall ((v_ArrVal_3832 (Array Int Int))) (<= 0 (+ (select (select (store .cse0 |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_3832) .cse1) 4) 4))))))) is different from false [2022-11-20 10:42:26,175 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_sll_prepend_#t~ret7#1.offset| 4))) (let ((.cse2 (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|) .cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_prepend_~head#1.base|) |c_ULTIMATE.start_sll_prepend_~head#1.offset|))))) (store .cse4 |c_ULTIMATE.start_sll_prepend_~head#1.base| (store (select .cse4 |c_ULTIMATE.start_sll_prepend_~head#1.base|) |c_ULTIMATE.start_sll_prepend_~head#1.offset| |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|))))) (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|) .cse3 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_prepend_~head#1.base|) |c_ULTIMATE.start_sll_prepend_~head#1.offset|)))) (.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (forall ((v_ArrVal_3832 (Array Int Int))) (<= (+ (select (select (store .cse0 |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_3832) .cse1) 4) 8) (select |c_#length| (select (select .cse2 .cse1) 4)))) (forall ((v_ArrVal_3832 (Array Int Int))) (<= 0 (+ (select (select (store .cse0 |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_3832) .cse1) 4) 4))))))) is different from false [2022-11-20 10:42:27,299 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [150131403] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:42:27,299 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 10:42:27,299 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 26] total 52 [2022-11-20 10:42:27,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935315117] [2022-11-20 10:42:27,299 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 10:42:27,300 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2022-11-20 10:42:27,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:42:27,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2022-11-20 10:42:27,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=200, Invalid=3570, Unknown=24, NotChecked=366, Total=4160 [2022-11-20 10:42:27,301 INFO L87 Difference]: Start difference. First operand 115 states and 127 transitions. Second operand has 53 states, 50 states have (on average 2.22) internal successors, (111), 47 states have internal predecessors, (111), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-20 10:42:29,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:42:29,303 INFO L93 Difference]: Finished difference Result 123 states and 133 transitions. [2022-11-20 10:42:29,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-11-20 10:42:29,304 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 50 states have (on average 2.22) internal successors, (111), 47 states have internal predecessors, (111), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 73 [2022-11-20 10:42:29,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:42:29,305 INFO L225 Difference]: With dead ends: 123 [2022-11-20 10:42:29,305 INFO L226 Difference]: Without dead ends: 123 [2022-11-20 10:42:29,305 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 78 SyntacticMatches, 1 SemanticMatches, 77 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1421 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=344, Invalid=5343, Unknown=25, NotChecked=450, Total=6162 [2022-11-20 10:42:29,306 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 132 mSDsluCounter, 720 mSDsCounter, 0 mSdLazyCounter, 1015 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 748 SdHoareTripleChecker+Invalid, 1265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1015 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 239 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-20 10:42:29,306 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 748 Invalid, 1265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1015 Invalid, 0 Unknown, 239 Unchecked, 0.7s Time] [2022-11-20 10:42:29,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2022-11-20 10:42:29,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 117. [2022-11-20 10:42:29,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 102 states have (on average 1.1568627450980393) internal successors, (118), 110 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-11-20 10:42:29,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 128 transitions. [2022-11-20 10:42:29,310 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 128 transitions. Word has length 73 [2022-11-20 10:42:29,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:42:29,311 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 128 transitions. [2022-11-20 10:42:29,311 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 50 states have (on average 2.22) internal successors, (111), 47 states have internal predecessors, (111), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-20 10:42:29,311 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 128 transitions. [2022-11-20 10:42:29,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-11-20 10:42:29,313 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:42:29,313 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:42:29,330 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac68dab7-80a7-4075-8b13-a97d4e1f9b96/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-11-20 10:42:29,519 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac68dab7-80a7-4075-8b13-a97d4e1f9b96/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-11-20 10:42:29,520 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-11-20 10:42:29,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:42:29,520 INFO L85 PathProgramCache]: Analyzing trace with hash 508377010, now seen corresponding path program 1 times [2022-11-20 10:42:29,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:42:29,520 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212457451] [2022-11-20 10:42:29,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:42:29,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:42:29,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:42:30,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 10:42:30,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:42:30,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-20 10:42:30,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:42:30,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-20 10:42:30,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:42:30,777 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 18 proven. 7 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-20 10:42:30,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:42:30,777 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212457451] [2022-11-20 10:42:30,778 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1212457451] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:42:30,778 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1803060070] [2022-11-20 10:42:30,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:42:30,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:42:30,778 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac68dab7-80a7-4075-8b13-a97d4e1f9b96/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:42:30,779 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac68dab7-80a7-4075-8b13-a97d4e1f9b96/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:42:30,782 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac68dab7-80a7-4075-8b13-a97d4e1f9b96/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-11-20 10:42:31,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:42:31,133 INFO L263 TraceCheckSpWp]: Trace formula consists of 521 conjuncts, 75 conjunts are in the unsatisfiable core [2022-11-20 10:42:31,137 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:42:31,470 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-11-20 10:42:31,694 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:42:31,695 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 17 treesize of output 12 [2022-11-20 10:42:31,913 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:42:31,914 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 19 [2022-11-20 10:42:31,999 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:42:32,000 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 22 [2022-11-20 10:42:32,439 INFO L321 Elim1Store]: treesize reduction 15, result has 34.8 percent of original size [2022-11-20 10:42:32,440 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 24 [2022-11-20 10:42:32,545 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 20 proven. 7 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-20 10:42:32,546 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:42:33,105 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_50| Int) (v_ArrVal_4037 (Array Int Int))) (or (not (< |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_50| |c_#StackHeapBarrier|)) (not (= (select (let ((.cse0 (let ((.cse1 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_50| (store v_ArrVal_4037 4 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_50| v_ArrVal_4037) |c_ULTIMATE.start_sll_prepend_~head#1.base|) |c_ULTIMATE.start_sll_prepend_~head#1.offset|))))) (store .cse1 |c_ULTIMATE.start_sll_prepend_~head#1.base| (store (select .cse1 |c_ULTIMATE.start_sll_prepend_~head#1.base|) |c_ULTIMATE.start_sll_prepend_~head#1.offset| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_50|))))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) 4) 0)))) is different from false [2022-11-20 10:42:33,107 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1803060070] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:42:33,107 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 10:42:33,107 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 44 [2022-11-20 10:42:33,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070037324] [2022-11-20 10:42:33,108 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 10:42:33,110 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2022-11-20 10:42:33,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:42:33,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2022-11-20 10:42:33,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=2399, Unknown=1, NotChecked=98, Total=2652 [2022-11-20 10:42:33,111 INFO L87 Difference]: Start difference. First operand 117 states and 128 transitions. Second operand has 44 states, 42 states have (on average 2.5) internal successors, (105), 38 states have internal predecessors, (105), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-20 10:42:34,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:42:34,888 INFO L93 Difference]: Finished difference Result 120 states and 130 transitions. [2022-11-20 10:42:34,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-11-20 10:42:34,888 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 42 states have (on average 2.5) internal successors, (105), 38 states have internal predecessors, (105), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 74 [2022-11-20 10:42:34,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:42:34,889 INFO L225 Difference]: With dead ends: 120 [2022-11-20 10:42:34,889 INFO L226 Difference]: Without dead ends: 120 [2022-11-20 10:42:34,889 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 87 SyntacticMatches, 3 SemanticMatches, 69 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 921 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=415, Invalid=4418, Unknown=1, NotChecked=136, Total=4970 [2022-11-20 10:42:34,890 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 224 mSDsluCounter, 818 mSDsCounter, 0 mSdLazyCounter, 906 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 854 SdHoareTripleChecker+Invalid, 1008 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 906 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 82 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-20 10:42:34,891 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 854 Invalid, 1008 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 906 Invalid, 0 Unknown, 82 Unchecked, 0.6s Time] [2022-11-20 10:42:34,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2022-11-20 10:42:34,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 117. [2022-11-20 10:42:34,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 102 states have (on average 1.1470588235294117) internal successors, (117), 110 states have internal predecessors, (117), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-11-20 10:42:34,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 127 transitions. [2022-11-20 10:42:34,897 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 127 transitions. Word has length 74 [2022-11-20 10:42:34,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:42:34,898 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 127 transitions. [2022-11-20 10:42:34,898 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 42 states have (on average 2.5) internal successors, (105), 38 states have internal predecessors, (105), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-20 10:42:34,898 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 127 transitions. [2022-11-20 10:42:34,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-11-20 10:42:34,903 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:42:34,903 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:42:34,909 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac68dab7-80a7-4075-8b13-a97d4e1f9b96/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2022-11-20 10:42:35,104 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac68dab7-80a7-4075-8b13-a97d4e1f9b96/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:42:35,104 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-11-20 10:42:35,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:42:35,105 INFO L85 PathProgramCache]: Analyzing trace with hash -274698947, now seen corresponding path program 2 times [2022-11-20 10:42:35,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:42:35,105 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880493022] [2022-11-20 10:42:35,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:42:35,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:42:35,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:42:35,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 10:42:35,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:42:35,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-20 10:42:35,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:42:35,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-11-20 10:42:35,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:42:35,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-11-20 10:42:35,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:42:35,273 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 14 proven. 7 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2022-11-20 10:42:35,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:42:35,273 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880493022] [2022-11-20 10:42:35,273 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1880493022] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:42:35,273 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1327755595] [2022-11-20 10:42:35,274 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-20 10:42:35,274 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:42:35,274 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac68dab7-80a7-4075-8b13-a97d4e1f9b96/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:42:35,275 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac68dab7-80a7-4075-8b13-a97d4e1f9b96/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:42:35,299 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac68dab7-80a7-4075-8b13-a97d4e1f9b96/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-11-20 10:42:35,699 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-20 10:42:35,699 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 10:42:35,702 INFO L263 TraceCheckSpWp]: Trace formula consists of 554 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-20 10:42:35,704 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:42:35,733 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-11-20 10:42:35,733 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 10:42:35,733 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1327755595] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:42:35,733 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-20 10:42:35,733 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2022-11-20 10:42:35,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009723137] [2022-11-20 10:42:35,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:42:35,734 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 10:42:35,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:42:35,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 10:42:35,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-20 10:42:35,735 INFO L87 Difference]: Start difference. First operand 117 states and 127 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-11-20 10:42:35,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:42:35,754 INFO L93 Difference]: Finished difference Result 74 states and 76 transitions. [2022-11-20 10:42:35,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 10:42:35,755 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 75 [2022-11-20 10:42:35,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:42:35,756 INFO L225 Difference]: With dead ends: 74 [2022-11-20 10:42:35,756 INFO L226 Difference]: Without dead ends: 74 [2022-11-20 10:42:35,756 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-20 10:42:35,757 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 37 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 10:42:35,757 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 95 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 10:42:35,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2022-11-20 10:42:35,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2022-11-20 10:42:35,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 65 states have (on average 1.0769230769230769) internal successors, (70), 69 states have internal predecessors, (70), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-20 10:42:35,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 76 transitions. [2022-11-20 10:42:35,760 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 76 transitions. Word has length 75 [2022-11-20 10:42:35,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:42:35,760 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 76 transitions. [2022-11-20 10:42:35,760 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-11-20 10:42:35,760 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 76 transitions. [2022-11-20 10:42:35,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-11-20 10:42:35,761 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:42:35,761 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1] [2022-11-20 10:42:35,768 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac68dab7-80a7-4075-8b13-a97d4e1f9b96/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-11-20 10:42:35,968 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac68dab7-80a7-4075-8b13-a97d4e1f9b96/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:42:35,968 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-11-20 10:42:35,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:42:35,969 INFO L85 PathProgramCache]: Analyzing trace with hash -1074516525, now seen corresponding path program 1 times [2022-11-20 10:42:35,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:42:35,969 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039258597] [2022-11-20 10:42:35,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:42:35,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:42:36,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:42:36,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 10:42:36,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:42:36,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-20 10:42:36,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:42:36,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-20 10:42:36,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:42:37,166 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 24 proven. 5 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-20 10:42:37,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:42:37,166 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039258597] [2022-11-20 10:42:37,167 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2039258597] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:42:37,167 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [14202565] [2022-11-20 10:42:37,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:42:37,167 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:42:37,167 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac68dab7-80a7-4075-8b13-a97d4e1f9b96/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:42:37,168 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac68dab7-80a7-4075-8b13-a97d4e1f9b96/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:42:37,170 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac68dab7-80a7-4075-8b13-a97d4e1f9b96/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-11-20 10:42:37,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:42:37,538 INFO L263 TraceCheckSpWp]: Trace formula consists of 527 conjuncts, 63 conjunts are in the unsatisfiable core [2022-11-20 10:42:37,541 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:42:37,887 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-11-20 10:42:38,114 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:42:38,114 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 13 [2022-11-20 10:42:38,394 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:42:38,395 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2022-11-20 10:42:38,500 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:42:38,501 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2022-11-20 10:42:39,027 INFO L321 Elim1Store]: treesize reduction 15, result has 34.8 percent of original size [2022-11-20 10:42:39,028 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 25 [2022-11-20 10:42:39,163 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 26 proven. 5 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-20 10:42:39,163 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:42:39,974 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4459 (Array Int Int)) (|v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_53| Int) (v_ArrVal_4452 Int)) (or (< (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_53| v_ArrVal_4459) |c_ULTIMATE.start_sll_prepend_~head#1.base|) |c_ULTIMATE.start_sll_prepend_~head#1.offset|) v_ArrVal_4452) (< (select (let ((.cse0 (let ((.cse1 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_53| (store v_ArrVal_4459 4 v_ArrVal_4452)))) (store .cse1 |c_ULTIMATE.start_sll_prepend_~head#1.base| (store (select .cse1 |c_ULTIMATE.start_sll_prepend_~head#1.base|) |c_ULTIMATE.start_sll_prepend_~head#1.offset| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_53|))))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) 4) |c_#StackHeapBarrier|) (not (< |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_53| |c_#StackHeapBarrier|)))) is different from false [2022-11-20 10:42:39,976 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [14202565] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:42:39,977 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 10:42:39,977 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 25] total 44 [2022-11-20 10:42:39,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240698002] [2022-11-20 10:42:39,977 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 10:42:39,977 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-11-20 10:42:39,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:42:39,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-11-20 10:42:39,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=2471, Unknown=1, NotChecked=100, Total=2756 [2022-11-20 10:42:39,980 INFO L87 Difference]: Start difference. First operand 74 states and 76 transitions. Second operand has 45 states, 42 states have (on average 2.5476190476190474) internal successors, (107), 39 states have internal predecessors, (107), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-20 10:42:41,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:42:41,944 INFO L93 Difference]: Finished difference Result 75 states and 77 transitions. [2022-11-20 10:42:41,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-11-20 10:42:41,945 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 42 states have (on average 2.5476190476190474) internal successors, (107), 39 states have internal predecessors, (107), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 76 [2022-11-20 10:42:41,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:42:41,946 INFO L225 Difference]: With dead ends: 75 [2022-11-20 10:42:41,946 INFO L226 Difference]: Without dead ends: 75 [2022-11-20 10:42:41,946 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 86 SyntacticMatches, 7 SemanticMatches, 70 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1186 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=474, Invalid=4499, Unknown=1, NotChecked=138, Total=5112 [2022-11-20 10:42:41,947 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 204 mSDsluCounter, 542 mSDsCounter, 0 mSdLazyCounter, 1006 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 570 SdHoareTripleChecker+Invalid, 1112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1006 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 83 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-20 10:42:41,947 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 570 Invalid, 1112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1006 Invalid, 0 Unknown, 83 Unchecked, 0.8s Time] [2022-11-20 10:42:41,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-11-20 10:42:41,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2022-11-20 10:42:41,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 66 states have (on average 1.0757575757575757) internal successors, (71), 70 states have internal predecessors, (71), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-20 10:42:41,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 77 transitions. [2022-11-20 10:42:41,950 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 77 transitions. Word has length 76 [2022-11-20 10:42:41,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:42:41,950 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 77 transitions. [2022-11-20 10:42:41,950 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 42 states have (on average 2.5476190476190474) internal successors, (107), 39 states have internal predecessors, (107), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-20 10:42:41,950 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 77 transitions. [2022-11-20 10:42:41,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-11-20 10:42:41,951 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:42:41,951 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1] [2022-11-20 10:42:41,964 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac68dab7-80a7-4075-8b13-a97d4e1f9b96/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-11-20 10:42:42,158 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac68dab7-80a7-4075-8b13-a97d4e1f9b96/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:42:42,158 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-11-20 10:42:42,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:42:42,159 INFO L85 PathProgramCache]: Analyzing trace with hash -530404456, now seen corresponding path program 2 times [2022-11-20 10:42:42,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:42:42,159 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129303566] [2022-11-20 10:42:42,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:42:42,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:42:42,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:42:44,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 10:42:44,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:42:44,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-20 10:42:44,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:42:44,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-20 10:42:44,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:42:45,127 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 12 proven. 24 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-20 10:42:45,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:42:45,127 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129303566] [2022-11-20 10:42:45,128 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [129303566] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:42:45,128 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1730050339] [2022-11-20 10:42:45,128 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-20 10:42:45,128 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:42:45,128 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac68dab7-80a7-4075-8b13-a97d4e1f9b96/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:42:45,129 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac68dab7-80a7-4075-8b13-a97d4e1f9b96/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:42:45,131 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac68dab7-80a7-4075-8b13-a97d4e1f9b96/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-11-20 10:42:45,530 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-20 10:42:45,530 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 10:42:45,535 INFO L263 TraceCheckSpWp]: Trace formula consists of 537 conjuncts, 157 conjunts are in the unsatisfiable core [2022-11-20 10:42:45,540 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:42:45,598 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-11-20 10:42:46,034 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 13 treesize of output 9 [2022-11-20 10:42:46,110 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-11-20 10:42:46,268 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-20 10:42:46,269 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 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-20 10:42:46,482 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-20 10:42:46,482 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 1 case distinctions, treesize of input 21 treesize of output 24 [2022-11-20 10:42:46,882 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 10:42:46,883 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 12 [2022-11-20 10:42:46,957 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-11-20 10:42:47,345 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:42:47,357 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-11-20 10:42:47,358 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 31 treesize of output 39 [2022-11-20 10:42:47,369 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-11-20 10:42:47,836 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:42:47,837 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:42:47,848 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-20 10:42:47,848 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 48 treesize of output 41 [2022-11-20 10:42:48,054 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:42:48,057 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-20 10:42:48,057 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 2 case distinctions, treesize of input 55 treesize of output 40 [2022-11-20 10:42:49,978 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 10:42:49,979 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 66 treesize of output 64 [2022-11-20 10:42:52,869 INFO L321 Elim1Store]: treesize reduction 48, result has 69.4 percent of original size [2022-11-20 10:42:52,870 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 7 new quantified variables, introduced 10 case distinctions, treesize of input 426 treesize of output 386 [2022-11-20 10:44:01,302 WARN L233 SmtUtils]: Spent 28.76s on a formula simplification. DAG size of input: 319 DAG size of output: 87 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 10:44:09,942 WARN L233 SmtUtils]: Spent 8.10s on a formula simplification that was a NOOP. DAG size: 87 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 10:44:16,528 WARN L233 SmtUtils]: Spent 6.10s on a formula simplification that was a NOOP. DAG size: 81 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 10:44:16,821 INFO L321 Elim1Store]: treesize reduction 114, result has 65.9 percent of original size [2022-11-20 10:44:16,821 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 402 treesize of output 572 [2022-11-20 10:45:24,150 WARN L230 Executor]: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac68dab7-80a7-4075-8b13-a97d4e1f9b96/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) stderr output: (error "out of memory") [2022-11-20 10:45:24,151 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac68dab7-80a7-4075-8b13-a97d4e1f9b96/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 101 [2022-11-20 10:45:24,152 WARN L319 FreeRefinementEngine]: Global settings require throwing the following exception [2022-11-20 10:45:24,158 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac68dab7-80a7-4075-8b13-a97d4e1f9b96/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2022-11-20 10:45:24,352 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac68dab7-80a7-4075-8b13-a97d4e1f9b96/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2022-11-20 10:45:24,353 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac68dab7-80a7-4075-8b13-a97d4e1f9b96/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:243) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseSuccess(Executor.java:258) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.push(Scriptor.java:133) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.push(DiffWrapperScript.java:90) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.push(WrapperScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.push(HistoryRecordingScript.java:107) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.push(WrapperScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.UndoableWrapperScript.push(UndoableWrapperScript.java:54) at de.uni_freiburg.informatik.ultimate.logic.Util.checkSat(Util.java:48) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA.getRedundancy(SimplifyDDA.java:620) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.simplify.SimplifyDDAWithTimeout.getRedundancy(SimplifyDDAWithTimeout.java:120) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA$Simplifier.walk(SimplifyDDA.java:370) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA.simplifyOnce(SimplifyDDA.java:649) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.simplify.SimplifyDDAWithTimeout.getSimplifiedTerm(SimplifyDDAWithTimeout.java:180) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:198) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:361) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:306) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp$UnifyPostprocessor.postprocess(TraceCheckSpWp.java:582) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:199) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:299) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:185) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:163) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1465) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:658) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:239) ... 54 more [2022-11-20 10:45:24,356 INFO L158 Benchmark]: Toolchain (without parser) took 493521.41ms. Allocated memory was 132.1MB in the beginning and 406.8MB in the end (delta: 274.7MB). Free memory was 97.9MB in the beginning and 125.1MB in the end (delta: -27.2MB). Peak memory consumption was 260.0MB. Max. memory is 16.1GB. [2022-11-20 10:45:24,356 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 132.1MB. Free memory is still 76.7MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-20 10:45:24,356 INFO L158 Benchmark]: CACSL2BoogieTranslator took 549.41ms. Allocated memory is still 132.1MB. Free memory was 97.9MB in the beginning and 80.7MB in the end (delta: 17.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-11-20 10:45:24,357 INFO L158 Benchmark]: Boogie Procedure Inliner took 76.38ms. Allocated memory is still 132.1MB. Free memory was 80.2MB in the beginning and 78.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-20 10:45:24,357 INFO L158 Benchmark]: Boogie Preprocessor took 60.65ms. Allocated memory is still 132.1MB. Free memory was 78.1MB in the beginning and 76.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-20 10:45:24,357 INFO L158 Benchmark]: RCFGBuilder took 644.61ms. Allocated memory is still 132.1MB. Free memory was 76.5MB in the beginning and 58.2MB in the end (delta: 18.4MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2022-11-20 10:45:24,357 INFO L158 Benchmark]: TraceAbstraction took 492177.83ms. Allocated memory was 132.1MB in the beginning and 406.8MB in the end (delta: 274.7MB). Free memory was 57.7MB in the beginning and 125.1MB in the end (delta: -67.5MB). Peak memory consumption was 220.1MB. Max. memory is 16.1GB. [2022-11-20 10:45:24,358 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.27ms. Allocated memory is still 132.1MB. Free memory is still 76.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 549.41ms. Allocated memory is still 132.1MB. Free memory was 97.9MB in the beginning and 80.7MB in the end (delta: 17.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 76.38ms. Allocated memory is still 132.1MB. Free memory was 80.2MB in the beginning and 78.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 60.65ms. Allocated memory is still 132.1MB. Free memory was 78.1MB in the beginning and 76.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 644.61ms. Allocated memory is still 132.1MB. Free memory was 76.5MB in the beginning and 58.2MB in the end (delta: 18.4MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 492177.83ms. Allocated memory was 132.1MB in the beginning and 406.8MB in the end (delta: 274.7MB). Free memory was 57.7MB in the beginning and 125.1MB in the end (delta: -67.5MB). Peak memory consumption was 220.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac68dab7-80a7-4075-8b13-a97d4e1f9b96/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac68dab7-80a7-4075-8b13-a97d4e1f9b96/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:243) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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_ac68dab7-80a7-4075-8b13-a97d4e1f9b96/bin/uautomizer-ug76WZFUDN/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac68dab7-80a7-4075-8b13-a97d4e1f9b96/bin/uautomizer-ug76WZFUDN/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac68dab7-80a7-4075-8b13-a97d4e1f9b96/bin/uautomizer-ug76WZFUDN/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac68dab7-80a7-4075-8b13-a97d4e1f9b96/bin/uautomizer-ug76WZFUDN/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/sll2n_prepend_unequal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac68dab7-80a7-4075-8b13-a97d4e1f9b96/bin/uautomizer-ug76WZFUDN/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac68dab7-80a7-4075-8b13-a97d4e1f9b96/bin/uautomizer-ug76WZFUDN --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 277634da297b7f9e262585608ed7ad62cca7d59b0122d4e61ee1b4b78256acae --- 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-6b4ec56 [2022-11-20 10:45:26,600 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-20 10:45:26,603 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-20 10:45:26,638 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-20 10:45:26,639 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-20 10:45:26,643 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-20 10:45:26,645 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-20 10:45:26,649 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-20 10:45:26,652 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-20 10:45:26,657 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-20 10:45:26,659 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-20 10:45:26,660 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-20 10:45:26,662 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-20 10:45:26,664 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-20 10:45:26,665 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-20 10:45:26,670 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-20 10:45:26,671 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-20 10:45:26,672 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-20 10:45:26,676 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-20 10:45:26,678 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-20 10:45:26,683 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-20 10:45:26,684 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-20 10:45:26,685 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-20 10:45:26,686 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-20 10:45:26,689 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-20 10:45:26,690 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-20 10:45:26,690 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-20 10:45:26,691 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-20 10:45:26,691 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-20 10:45:26,692 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-20 10:45:26,693 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-20 10:45:26,693 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-20 10:45:26,694 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-20 10:45:26,695 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-20 10:45:26,705 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-20 10:45:26,705 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-20 10:45:26,706 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-20 10:45:26,707 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-20 10:45:26,707 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-20 10:45:26,708 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-20 10:45:26,717 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-20 10:45:26,724 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac68dab7-80a7-4075-8b13-a97d4e1f9b96/bin/uautomizer-ug76WZFUDN/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2022-11-20 10:45:26,748 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-20 10:45:26,748 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-20 10:45:26,749 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-20 10:45:26,749 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-20 10:45:26,750 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-20 10:45:26,750 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-20 10:45:26,751 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-20 10:45:26,751 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-20 10:45:26,751 INFO L138 SettingsManager]: * Use SBE=true [2022-11-20 10:45:26,751 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-20 10:45:26,752 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-20 10:45:26,752 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-20 10:45:26,752 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-20 10:45:26,752 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-20 10:45:26,753 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-20 10:45:26,753 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-20 10:45:26,753 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-20 10:45:26,753 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-20 10:45:26,754 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-20 10:45:26,754 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-20 10:45:26,754 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-20 10:45:26,754 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-20 10:45:26,754 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-20 10:45:26,755 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-20 10:45:26,755 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-20 10:45:26,755 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-20 10:45:26,755 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-20 10:45:26,756 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 10:45:26,756 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-20 10:45:26,756 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-20 10:45:26,756 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-11-20 10:45:26,757 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-20 10:45:26,757 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-20 10:45:26,757 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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_ac68dab7-80a7-4075-8b13-a97d4e1f9b96/bin/uautomizer-ug76WZFUDN/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_ac68dab7-80a7-4075-8b13-a97d4e1f9b96/bin/uautomizer-ug76WZFUDN 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 -> 277634da297b7f9e262585608ed7ad62cca7d59b0122d4e61ee1b4b78256acae [2022-11-20 10:45:27,170 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-20 10:45:27,201 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-20 10:45:27,203 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-20 10:45:27,205 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-20 10:45:27,205 INFO L275 PluginConnector]: CDTParser initialized [2022-11-20 10:45:27,207 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac68dab7-80a7-4075-8b13-a97d4e1f9b96/bin/uautomizer-ug76WZFUDN/../../sv-benchmarks/c/list-simple/sll2n_prepend_unequal.i [2022-11-20 10:45:30,365 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-20 10:45:30,650 INFO L351 CDTParser]: Found 1 translation units. [2022-11-20 10:45:30,651 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac68dab7-80a7-4075-8b13-a97d4e1f9b96/sv-benchmarks/c/list-simple/sll2n_prepend_unequal.i [2022-11-20 10:45:30,674 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac68dab7-80a7-4075-8b13-a97d4e1f9b96/bin/uautomizer-ug76WZFUDN/data/4aaf73e23/2707567729584c4a8bd4cc695e1752f3/FLAG9f8af31c9 [2022-11-20 10:45:30,698 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac68dab7-80a7-4075-8b13-a97d4e1f9b96/bin/uautomizer-ug76WZFUDN/data/4aaf73e23/2707567729584c4a8bd4cc695e1752f3 [2022-11-20 10:45:30,705 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-20 10:45:30,707 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-20 10:45:30,710 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-20 10:45:30,711 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-20 10:45:30,714 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-20 10:45:30,715 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 10:45:30" (1/1) ... [2022-11-20 10:45:30,716 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@327f7332 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:45:30, skipping insertion in model container [2022-11-20 10:45:30,716 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 10:45:30" (1/1) ... [2022-11-20 10:45:30,723 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-20 10:45:30,780 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-20 10:45:31,142 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_ac68dab7-80a7-4075-8b13-a97d4e1f9b96/sv-benchmarks/c/list-simple/sll2n_prepend_unequal.i[24165,24178] [2022-11-20 10:45:31,144 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 10:45:31,157 INFO L203 MainTranslator]: Completed pre-run [2022-11-20 10:45:31,198 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_ac68dab7-80a7-4075-8b13-a97d4e1f9b96/sv-benchmarks/c/list-simple/sll2n_prepend_unequal.i[24165,24178] [2022-11-20 10:45:31,199 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 10:45:31,237 INFO L208 MainTranslator]: Completed translation [2022-11-20 10:45:31,238 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:45:31 WrapperNode [2022-11-20 10:45:31,238 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-20 10:45:31,240 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-20 10:45:31,240 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-20 10:45:31,240 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-20 10:45:31,248 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:45:31" (1/1) ... [2022-11-20 10:45:31,267 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:45:31" (1/1) ... [2022-11-20 10:45:31,290 INFO L138 Inliner]: procedures = 130, calls = 32, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 116 [2022-11-20 10:45:31,290 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-20 10:45:31,291 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-20 10:45:31,291 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-20 10:45:31,291 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-20 10:45:31,300 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:45:31" (1/1) ... [2022-11-20 10:45:31,301 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:45:31" (1/1) ... [2022-11-20 10:45:31,305 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:45:31" (1/1) ... [2022-11-20 10:45:31,305 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:45:31" (1/1) ... [2022-11-20 10:45:31,314 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:45:31" (1/1) ... [2022-11-20 10:45:31,323 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:45:31" (1/1) ... [2022-11-20 10:45:31,325 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:45:31" (1/1) ... [2022-11-20 10:45:31,326 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:45:31" (1/1) ... [2022-11-20 10:45:31,330 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-20 10:45:31,331 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-20 10:45:31,331 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-20 10:45:31,331 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-20 10:45:31,332 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:45:31" (1/1) ... [2022-11-20 10:45:31,338 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 10:45:31,351 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac68dab7-80a7-4075-8b13-a97d4e1f9b96/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:45:31,362 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac68dab7-80a7-4075-8b13-a97d4e1f9b96/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-20 10:45:31,390 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac68dab7-80a7-4075-8b13-a97d4e1f9b96/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-20 10:45:31,409 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-11-20 10:45:31,410 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2022-11-20 10:45:31,410 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2022-11-20 10:45:31,410 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-20 10:45:31,410 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-20 10:45:31,411 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-20 10:45:31,411 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-20 10:45:31,413 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-20 10:45:31,413 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-20 10:45:31,413 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-11-20 10:45:31,414 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-20 10:45:31,414 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-11-20 10:45:31,414 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-20 10:45:31,414 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-20 10:45:31,590 INFO L235 CfgBuilder]: Building ICFG [2022-11-20 10:45:31,596 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-20 10:45:32,138 INFO L276 CfgBuilder]: Performing block encoding [2022-11-20 10:45:32,148 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-20 10:45:32,148 INFO L300 CfgBuilder]: Removed 3 assume(true) statements. [2022-11-20 10:45:32,150 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:45:32 BoogieIcfgContainer [2022-11-20 10:45:32,150 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-20 10:45:32,153 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-20 10:45:32,153 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-20 10:45:32,156 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-20 10:45:32,156 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 10:45:30" (1/3) ... [2022-11-20 10:45:32,157 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@580230f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 10:45:32, skipping insertion in model container [2022-11-20 10:45:32,157 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:45:31" (2/3) ... [2022-11-20 10:45:32,157 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@580230f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 10:45:32, skipping insertion in model container [2022-11-20 10:45:32,158 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:45:32" (3/3) ... [2022-11-20 10:45:32,159 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2n_prepend_unequal.i [2022-11-20 10:45:32,177 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-20 10:45:32,177 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 31 error locations. [2022-11-20 10:45:32,229 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-20 10:45:32,235 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@686e188b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-20 10:45:32,235 INFO L358 AbstractCegarLoop]: Starting to check reachability of 31 error locations. [2022-11-20 10:45:32,239 INFO L276 IsEmpty]: Start isEmpty. Operand has 81 states, 46 states have (on average 1.891304347826087) internal successors, (87), 77 states have internal predecessors, (87), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-20 10:45:32,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-20 10:45:32,246 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:45:32,247 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:45:32,248 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-11-20 10:45:32,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:45:32,253 INFO L85 PathProgramCache]: Analyzing trace with hash 1813443002, now seen corresponding path program 1 times [2022-11-20 10:45:32,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 10:45:32,267 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1950366608] [2022-11-20 10:45:32,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:45:32,267 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 10:45:32,268 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac68dab7-80a7-4075-8b13-a97d4e1f9b96/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 10:45:32,273 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac68dab7-80a7-4075-8b13-a97d4e1f9b96/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-20 10:45:32,291 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac68dab7-80a7-4075-8b13-a97d4e1f9b96/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-11-20 10:45:32,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:45:32,404 INFO L263 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-20 10:45:32,410 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:45:32,506 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-11-20 10:45:32,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:45:32,542 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 10:45:32,543 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 10:45:32,543 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1950366608] [2022-11-20 10:45:32,545 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1950366608] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:45:32,545 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:45:32,545 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 10:45:32,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213242798] [2022-11-20 10:45:32,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:45:32,554 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 10:45:32,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 10:45:32,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 10:45:32,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 10:45:32,594 INFO L87 Difference]: Start difference. First operand has 81 states, 46 states have (on average 1.891304347826087) internal successors, (87), 77 states have internal predecessors, (87), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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-11-20 10:45:32,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:45:32,778 INFO L93 Difference]: Finished difference Result 79 states and 85 transitions. [2022-11-20 10:45:32,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 10:45:32,780 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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 7 [2022-11-20 10:45:32,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:45:32,788 INFO L225 Difference]: With dead ends: 79 [2022-11-20 10:45:32,788 INFO L226 Difference]: Without dead ends: 76 [2022-11-20 10:45:32,790 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 10:45:32,793 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 8 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 10:45:32,795 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 127 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 10:45:32,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-11-20 10:45:32,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2022-11-20 10:45:32,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 44 states have (on average 1.75) internal successors, (77), 72 states have internal predecessors, (77), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-20 10:45:32,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 81 transitions. [2022-11-20 10:45:32,833 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 81 transitions. Word has length 7 [2022-11-20 10:45:32,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:45:32,833 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 81 transitions. [2022-11-20 10:45:32,834 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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-11-20 10:45:32,834 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 81 transitions. [2022-11-20 10:45:32,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-20 10:45:32,835 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:45:32,835 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:45:32,854 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac68dab7-80a7-4075-8b13-a97d4e1f9b96/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-11-20 10:45:33,054 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac68dab7-80a7-4075-8b13-a97d4e1f9b96/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 10:45:33,054 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-11-20 10:45:33,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:45:33,055 INFO L85 PathProgramCache]: Analyzing trace with hash 1813443001, now seen corresponding path program 1 times [2022-11-20 10:45:33,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 10:45:33,056 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1884178854] [2022-11-20 10:45:33,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:45:33,056 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 10:45:33,056 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac68dab7-80a7-4075-8b13-a97d4e1f9b96/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 10:45:33,059 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac68dab7-80a7-4075-8b13-a97d4e1f9b96/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-20 10:45:33,060 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac68dab7-80a7-4075-8b13-a97d4e1f9b96/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-11-20 10:45:33,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:45:33,151 INFO L263 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-20 10:45:33,153 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:45:33,161 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 7 [2022-11-20 10:45:33,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:45:33,170 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 10:45:33,170 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 10:45:33,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1884178854] [2022-11-20 10:45:33,171 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1884178854] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:45:33,171 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:45:33,171 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 10:45:33,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708612940] [2022-11-20 10:45:33,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:45:33,173 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 10:45:33,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 10:45:33,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 10:45:33,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 10:45:33,174 INFO L87 Difference]: Start difference. First operand 76 states and 81 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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-11-20 10:45:33,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:45:33,302 INFO L93 Difference]: Finished difference Result 74 states and 79 transitions. [2022-11-20 10:45:33,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 10:45:33,302 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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 7 [2022-11-20 10:45:33,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:45:33,304 INFO L225 Difference]: With dead ends: 74 [2022-11-20 10:45:33,304 INFO L226 Difference]: Without dead ends: 74 [2022-11-20 10:45:33,304 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 10:45:33,305 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 4 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 10:45:33,306 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 118 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 10:45:33,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2022-11-20 10:45:33,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2022-11-20 10:45:33,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 44 states have (on average 1.7045454545454546) internal successors, (75), 70 states have internal predecessors, (75), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-20 10:45:33,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 79 transitions. [2022-11-20 10:45:33,314 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 79 transitions. Word has length 7 [2022-11-20 10:45:33,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:45:33,314 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 79 transitions. [2022-11-20 10:45:33,314 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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-11-20 10:45:33,315 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 79 transitions. [2022-11-20 10:45:33,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-20 10:45:33,315 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:45:33,316 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:45:33,332 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac68dab7-80a7-4075-8b13-a97d4e1f9b96/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-11-20 10:45:33,526 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac68dab7-80a7-4075-8b13-a97d4e1f9b96/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 10:45:33,527 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-11-20 10:45:33,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:45:33,528 INFO L85 PathProgramCache]: Analyzing trace with hash 712803264, now seen corresponding path program 1 times [2022-11-20 10:45:33,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 10:45:33,528 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1324081849] [2022-11-20 10:45:33,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:45:33,529 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 10:45:33,529 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac68dab7-80a7-4075-8b13-a97d4e1f9b96/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 10:45:33,534 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac68dab7-80a7-4075-8b13-a97d4e1f9b96/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-20 10:45:33,543 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac68dab7-80a7-4075-8b13-a97d4e1f9b96/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-11-20 10:45:33,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:45:33,652 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-20 10:45:33,654 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:45:33,660 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 7 [2022-11-20 10:45:33,713 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:45:33,714 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 10:45:33,714 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 10:45:33,714 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1324081849] [2022-11-20 10:45:33,714 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1324081849] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:45:33,715 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:45:33,715 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-20 10:45:33,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704155477] [2022-11-20 10:45:33,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:45:33,716 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 10:45:33,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 10:45:33,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 10:45:33,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-20 10:45:33,717 INFO L87 Difference]: Start difference. First operand 74 states and 79 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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-11-20 10:45:34,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:45:34,052 INFO L93 Difference]: Finished difference Result 78 states and 86 transitions. [2022-11-20 10:45:34,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 10:45:34,053 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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-11-20 10:45:34,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:45:34,055 INFO L225 Difference]: With dead ends: 78 [2022-11-20 10:45:34,055 INFO L226 Difference]: Without dead ends: 78 [2022-11-20 10:45:34,056 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-20 10:45:34,057 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 10 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 10:45:34,057 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 251 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-20 10:45:34,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-11-20 10:45:34,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 73. [2022-11-20 10:45:34,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 44 states have (on average 1.6818181818181819) internal successors, (74), 69 states have internal predecessors, (74), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-20 10:45:34,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 78 transitions. [2022-11-20 10:45:34,077 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 78 transitions. Word has length 13 [2022-11-20 10:45:34,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:45:34,078 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 78 transitions. [2022-11-20 10:45:34,078 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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-11-20 10:45:34,080 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 78 transitions. [2022-11-20 10:45:34,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-20 10:45:34,081 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:45:34,081 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:45:34,098 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac68dab7-80a7-4075-8b13-a97d4e1f9b96/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-11-20 10:45:34,282 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac68dab7-80a7-4075-8b13-a97d4e1f9b96/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 10:45:34,283 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-11-20 10:45:34,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:45:34,283 INFO L85 PathProgramCache]: Analyzing trace with hash 712803265, now seen corresponding path program 1 times [2022-11-20 10:45:34,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 10:45:34,284 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1927220633] [2022-11-20 10:45:34,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:45:34,284 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 10:45:34,284 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac68dab7-80a7-4075-8b13-a97d4e1f9b96/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 10:45:34,293 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac68dab7-80a7-4075-8b13-a97d4e1f9b96/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-20 10:45:34,297 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac68dab7-80a7-4075-8b13-a97d4e1f9b96/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-11-20 10:45:34,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:45:34,380 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-20 10:45:34,382 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:45:34,392 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-11-20 10:45:34,507 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:45:34,508 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 10:45:34,508 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 10:45:34,508 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1927220633] [2022-11-20 10:45:34,508 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1927220633] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:45:34,509 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:45:34,509 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-20 10:45:34,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72698758] [2022-11-20 10:45:34,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:45:34,510 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 10:45:34,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 10:45:34,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 10:45:34,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-20 10:45:34,511 INFO L87 Difference]: Start difference. First operand 73 states and 78 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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-11-20 10:45:34,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:45:34,915 INFO L93 Difference]: Finished difference Result 77 states and 85 transitions. [2022-11-20 10:45:34,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 10:45:34,916 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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-11-20 10:45:34,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:45:34,917 INFO L225 Difference]: With dead ends: 77 [2022-11-20 10:45:34,917 INFO L226 Difference]: Without dead ends: 77 [2022-11-20 10:45:34,917 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-20 10:45:34,918 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 9 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-20 10:45:34,918 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 267 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-20 10:45:34,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-11-20 10:45:34,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 72. [2022-11-20 10:45:34,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 44 states have (on average 1.6590909090909092) internal successors, (73), 68 states have internal predecessors, (73), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-20 10:45:34,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 77 transitions. [2022-11-20 10:45:34,925 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 77 transitions. Word has length 13 [2022-11-20 10:45:34,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:45:34,926 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 77 transitions. [2022-11-20 10:45:34,926 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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-11-20 10:45:34,926 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 77 transitions. [2022-11-20 10:45:34,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-20 10:45:34,927 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:45:34,927 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:45:34,944 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac68dab7-80a7-4075-8b13-a97d4e1f9b96/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-11-20 10:45:35,138 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac68dab7-80a7-4075-8b13-a97d4e1f9b96/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 10:45:35,139 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-11-20 10:45:35,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:45:35,139 INFO L85 PathProgramCache]: Analyzing trace with hash 150600896, now seen corresponding path program 1 times [2022-11-20 10:45:35,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 10:45:35,140 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1734496941] [2022-11-20 10:45:35,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:45:35,140 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 10:45:35,140 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac68dab7-80a7-4075-8b13-a97d4e1f9b96/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 10:45:35,142 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac68dab7-80a7-4075-8b13-a97d4e1f9b96/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-20 10:45:35,147 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac68dab7-80a7-4075-8b13-a97d4e1f9b96/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-11-20 10:45:35,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:45:35,236 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-20 10:45:35,238 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:45:35,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:45:35,253 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 10:45:35,254 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 10:45:35,254 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1734496941] [2022-11-20 10:45:35,254 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1734496941] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:45:35,255 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:45:35,255 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 10:45:35,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217143809] [2022-11-20 10:45:35,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:45:35,256 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 10:45:35,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 10:45:35,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 10:45:35,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 10:45:35,257 INFO L87 Difference]: Start difference. First operand 72 states and 77 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-20 10:45:35,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:45:35,273 INFO L93 Difference]: Finished difference Result 78 states and 84 transitions. [2022-11-20 10:45:35,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 10:45:35,274 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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 15 [2022-11-20 10:45:35,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:45:35,275 INFO L225 Difference]: With dead ends: 78 [2022-11-20 10:45:35,275 INFO L226 Difference]: Without dead ends: 78 [2022-11-20 10:45:35,276 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 10:45:35,278 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 4 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 10:45:35,279 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 149 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 10:45:35,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-11-20 10:45:35,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 73. [2022-11-20 10:45:35,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 45 states have (on average 1.6444444444444444) internal successors, (74), 69 states have internal predecessors, (74), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-20 10:45:35,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 78 transitions. [2022-11-20 10:45:35,295 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 78 transitions. Word has length 15 [2022-11-20 10:45:35,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:45:35,295 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 78 transitions. [2022-11-20 10:45:35,296 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-20 10:45:35,296 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 78 transitions. [2022-11-20 10:45:35,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-20 10:45:35,297 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:45:35,297 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:45:35,316 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac68dab7-80a7-4075-8b13-a97d4e1f9b96/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2022-11-20 10:45:35,508 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac68dab7-80a7-4075-8b13-a97d4e1f9b96/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 10:45:35,509 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-11-20 10:45:35,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:45:35,509 INFO L85 PathProgramCache]: Analyzing trace with hash -513998014, now seen corresponding path program 1 times [2022-11-20 10:45:35,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 10:45:35,510 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [776657521] [2022-11-20 10:45:35,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:45:35,510 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 10:45:35,510 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac68dab7-80a7-4075-8b13-a97d4e1f9b96/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 10:45:35,511 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac68dab7-80a7-4075-8b13-a97d4e1f9b96/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-20 10:45:35,513 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac68dab7-80a7-4075-8b13-a97d4e1f9b96/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-11-20 10:45:35,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:45:35,651 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-20 10:45:35,653 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:45:35,697 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:45:35,697 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:45:35,778 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-20 10:45:35,778 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 10:45:35,778 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [776657521] [2022-11-20 10:45:35,779 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [776657521] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 10:45:35,781 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 10:45:35,781 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2022-11-20 10:45:35,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154628551] [2022-11-20 10:45:35,782 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 10:45:35,782 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 10:45:35,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 10:45:35,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 10:45:35,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-20 10:45:35,783 INFO L87 Difference]: Start difference. First operand 73 states and 78 transitions. Second operand has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-11-20 10:45:35,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:45:35,823 INFO L93 Difference]: Finished difference Result 84 states and 91 transitions. [2022-11-20 10:45:35,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 10:45:35,824 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 28 [2022-11-20 10:45:35,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:45:35,826 INFO L225 Difference]: With dead ends: 84 [2022-11-20 10:45:35,829 INFO L226 Difference]: Without dead ends: 84 [2022-11-20 10:45:35,830 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-20 10:45:35,832 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 11 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 370 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 10:45:35,833 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 370 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 10:45:35,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2022-11-20 10:45:35,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 79. [2022-11-20 10:45:35,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 50 states have (on average 1.58) internal successors, (79), 74 states have internal predecessors, (79), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-20 10:45:35,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 85 transitions. [2022-11-20 10:45:35,848 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 85 transitions. Word has length 28 [2022-11-20 10:45:35,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:45:35,849 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 85 transitions. [2022-11-20 10:45:35,849 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-11-20 10:45:35,849 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 85 transitions. [2022-11-20 10:45:35,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-11-20 10:45:35,851 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:45:35,851 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:45:35,863 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac68dab7-80a7-4075-8b13-a97d4e1f9b96/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-11-20 10:45:36,063 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac68dab7-80a7-4075-8b13-a97d4e1f9b96/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 10:45:36,063 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-11-20 10:45:36,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:45:36,064 INFO L85 PathProgramCache]: Analyzing trace with hash -416014336, now seen corresponding path program 2 times [2022-11-20 10:45:36,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 10:45:36,064 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [209908331] [2022-11-20 10:45:36,064 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-20 10:45:36,065 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 10:45:36,065 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac68dab7-80a7-4075-8b13-a97d4e1f9b96/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 10:45:36,066 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac68dab7-80a7-4075-8b13-a97d4e1f9b96/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-20 10:45:36,068 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac68dab7-80a7-4075-8b13-a97d4e1f9b96/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-11-20 10:45:36,279 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-20 10:45:36,279 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 10:45:36,290 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 19 conjunts are in the unsatisfiable core [2022-11-20 10:45:36,294 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:45:36,311 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-20 10:45:36,356 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-11-20 10:45:36,410 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_154 (_ BitVec 1)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_154)) (= (_ bv0 1) (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) (not (= (bvadd |c_#StackHeapBarrier| (_ bv1 32)) (_ bv0 32)))) is different from true [2022-11-20 10:45:36,528 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-20 10:45:36,528 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 19 treesize of output 27 [2022-11-20 10:45:36,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 7 treesize of output 5 [2022-11-20 10:45:36,782 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:45:36,784 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 14 treesize of output 20 [2022-11-20 10:45:37,011 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| (_ bv1 1)))) is different from true [2022-11-20 10:45:37,070 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-20 10:45:37,070 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 14 treesize of output 20 [2022-11-20 10:45:37,124 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 18 not checked. [2022-11-20 10:45:37,125 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:45:37,468 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 10:45:37,468 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [209908331] [2022-11-20 10:45:37,469 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [209908331] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:45:37,469 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [461713667] [2022-11-20 10:45:37,469 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-20 10:45:37,469 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-20 10:45:37,469 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac68dab7-80a7-4075-8b13-a97d4e1f9b96/bin/uautomizer-ug76WZFUDN/cvc4 [2022-11-20 10:45:37,474 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac68dab7-80a7-4075-8b13-a97d4e1f9b96/bin/uautomizer-ug76WZFUDN/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-20 10:45:37,491 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac68dab7-80a7-4075-8b13-a97d4e1f9b96/bin/uautomizer-ug76WZFUDN/cvc4 --incremental --print-success --lang smt (9)] Waiting until timeout for monitored process [2022-11-20 10:45:37,777 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-20 10:45:37,777 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [682275046] [2022-11-20 10:45:37,777 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-20 10:45:37,777 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:45:37,778 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac68dab7-80a7-4075-8b13-a97d4e1f9b96/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:45:37,787 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac68dab7-80a7-4075-8b13-a97d4e1f9b96/bin/uautomizer-ug76WZFUDN/cvc4 --incremental --print-success --lang smt (9)] Forceful destruction successful, exit code 1 [2022-11-20 10:45:37,792 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac68dab7-80a7-4075-8b13-a97d4e1f9b96/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:45:37,803 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac68dab7-80a7-4075-8b13-a97d4e1f9b96/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-20 10:45:38,030 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-20 10:45:38,030 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 10:45:38,036 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 17 conjunts are in the unsatisfiable core [2022-11-20 10:45:38,039 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:45:38,042 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 7 [2022-11-20 10:45:38,062 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (exists ((v_ArrVal_274 (_ BitVec 1))) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_274))) (= (_ bv0 1) (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2022-11-20 10:45:38,127 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-20 10:45:38,127 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 19 treesize of output 27 [2022-11-20 10:45:38,159 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_275 (_ BitVec 1))) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| v_ArrVal_275))) is different from true [2022-11-20 10:45:38,248 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-20 10:45:38,249 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 14 treesize of output 20 [2022-11-20 10:45:38,307 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_276 (_ BitVec 1))) (= (store |c_old(#valid)| |c_node_create_~temp~0#1.base| v_ArrVal_276) |c_#valid|)) is different from true [2022-11-20 10:45:38,396 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-20 10:45:38,397 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 14 treesize of output 20 [2022-11-20 10:45:38,434 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 14 not checked. [2022-11-20 10:45:38,435 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:45:39,069 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-11-20 10:45:39,069 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [682275046] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 10:45:39,069 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 10:45:39,070 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 5] total 17 [2022-11-20 10:45:39,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732936028] [2022-11-20 10:45:39,070 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 10:45:39,070 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-11-20 10:45:39,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 10:45:39,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-11-20 10:45:39,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=150, Unknown=5, NotChecked=140, Total=342 [2022-11-20 10:45:39,071 INFO L87 Difference]: Start difference. First operand 79 states and 85 transitions. Second operand has 18 states, 17 states have (on average 4.0588235294117645) internal successors, (69), 16 states have internal predecessors, (69), 4 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2022-11-20 10:45:57,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:45:57,796 INFO L93 Difference]: Finished difference Result 96 states and 102 transitions. [2022-11-20 10:45:57,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-20 10:45:57,796 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 4.0588235294117645) internal successors, (69), 16 states have internal predecessors, (69), 4 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Word has length 41 [2022-11-20 10:45:57,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:45:57,797 INFO L225 Difference]: With dead ends: 96 [2022-11-20 10:45:57,797 INFO L226 Difference]: Without dead ends: 96 [2022-11-20 10:45:57,798 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 108 SyntacticMatches, 15 SemanticMatches, 23 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 19.2s TimeCoverageRelationStatistics Valid=84, Invalid=310, Unknown=6, NotChecked=200, Total=600 [2022-11-20 10:45:57,798 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 87 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 611 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 543 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 10:45:57,799 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 258 Invalid, 611 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 65 Invalid, 0 Unknown, 543 Unchecked, 0.2s Time] [2022-11-20 10:45:57,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-11-20 10:45:57,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 84. [2022-11-20 10:45:57,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 56 states have (on average 1.4821428571428572) internal successors, (83), 78 states have internal predecessors, (83), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-20 10:45:57,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 89 transitions. [2022-11-20 10:45:57,804 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 89 transitions. Word has length 41 [2022-11-20 10:45:57,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:45:57,804 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 89 transitions. [2022-11-20 10:45:57,805 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 4.0588235294117645) internal successors, (69), 16 states have internal predecessors, (69), 4 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2022-11-20 10:45:57,805 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 89 transitions. [2022-11-20 10:45:57,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-11-20 10:45:57,806 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:45:57,806 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:45:57,824 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac68dab7-80a7-4075-8b13-a97d4e1f9b96/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2022-11-20 10:45:58,025 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac68dab7-80a7-4075-8b13-a97d4e1f9b96/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-11-20 10:45:58,220 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac68dab7-80a7-4075-8b13-a97d4e1f9b96/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac68dab7-80a7-4075-8b13-a97d4e1f9b96/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:45:58,220 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-11-20 10:45:58,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:45:58,220 INFO L85 PathProgramCache]: Analyzing trace with hash -416014335, now seen corresponding path program 1 times [2022-11-20 10:45:58,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 10:45:58,221 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1040021564] [2022-11-20 10:45:58,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:45:58,221 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 10:45:58,221 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac68dab7-80a7-4075-8b13-a97d4e1f9b96/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 10:45:58,222 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac68dab7-80a7-4075-8b13-a97d4e1f9b96/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-20 10:45:58,227 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac68dab7-80a7-4075-8b13-a97d4e1f9b96/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-11-20 10:45:58,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:45:58,506 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 26 conjunts are in the unsatisfiable core [2022-11-20 10:45:58,511 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:45:58,526 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 7 [2022-11-20 10:45:58,538 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-11-20 10:45:58,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 5 treesize of output 3 [2022-11-20 10:45:58,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 5 [2022-11-20 10:45:58,643 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_344 (_ BitVec 32)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_344) |c_#length|) (= (_ bv0 1) (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) (not (= (bvadd |c_#StackHeapBarrier| (_ bv1 32)) (_ bv0 32)))) is different from true [2022-11-20 10:45:58,734 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:45:58,736 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-11-20 10:45:58,755 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-20 10:45:58,756 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 13 [2022-11-20 10:45:58,842 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-20 10:45:59,024 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:45:59,025 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 12 treesize of output 14 [2022-11-20 10:45:59,373 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (= (store |c_old(#length)| |node_create_~temp~0#1.base| (_ bv8 32)) |c_#length|)) is different from true [2022-11-20 10:45:59,431 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-20 10:45:59,431 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-11-20 10:45:59,550 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 18 not checked. [2022-11-20 10:45:59,551 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:45:59,880 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 10:45:59,880 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1040021564] [2022-11-20 10:45:59,880 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1040021564] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:45:59,880 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [460197324] [2022-11-20 10:45:59,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:45:59,880 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-20 10:45:59,880 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac68dab7-80a7-4075-8b13-a97d4e1f9b96/bin/uautomizer-ug76WZFUDN/cvc4 [2022-11-20 10:45:59,882 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac68dab7-80a7-4075-8b13-a97d4e1f9b96/bin/uautomizer-ug76WZFUDN/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-20 10:45:59,911 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac68dab7-80a7-4075-8b13-a97d4e1f9b96/bin/uautomizer-ug76WZFUDN/cvc4 --incremental --print-success --lang smt (12)] Waiting until timeout for monitored process [2022-11-20 10:46:00,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:46:00,245 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 24 conjunts are in the unsatisfiable core [2022-11-20 10:46:00,249 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:46:00,273 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-11-20 10:46:00,296 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-20 10:46:00,506 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:46:00,508 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-11-20 10:46:00,662 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-20 10:46:00,964 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:46:00,966 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-11-20 10:46:01,252 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-20 10:46:01,421 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:46:01,422 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-11-20 10:46:01,547 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 12 proven. 6 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-11-20 10:46:01,549 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:46:02,862 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [460197324] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:46:02,863 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 10:46:02,863 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 20 [2022-11-20 10:46:02,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790969248] [2022-11-20 10:46:02,863 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 10:46:02,863 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-11-20 10:46:02,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 10:46:02,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-11-20 10:46:02,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=386, Unknown=14, NotChecked=82, Total=552 [2022-11-20 10:46:02,864 INFO L87 Difference]: Start difference. First operand 84 states and 89 transitions. Second operand has 21 states, 18 states have (on average 3.3333333333333335) internal successors, (60), 16 states have internal predecessors, (60), 5 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-11-20 10:46:02,907 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_345 (_ BitVec 32)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_345) |c_#length|) (not (= (_ bv0 32) |node_create_~temp~0#1.base|)) (bvult |node_create_~temp~0#1.base| |c_#StackHeapBarrier|))) (exists ((v_ArrVal_344 (_ BitVec 32)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_344) |c_#length|) (= (_ bv0 1) (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) (exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (= (store |c_old(#length)| |node_create_~temp~0#1.base| (_ bv8 32)) |c_#length|)) (not (= (bvadd |c_#StackHeapBarrier| (_ bv1 32)) (_ bv0 32)))) is different from true [2022-11-20 10:46:03,103 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_345 (_ BitVec 32)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_345) |c_#length|) (not (= (_ bv0 32) |node_create_~temp~0#1.base|)) (bvult |node_create_~temp~0#1.base| |c_#StackHeapBarrier|))) (exists ((v_ArrVal_406 (_ BitVec 32))) (= |c_#length| (store |c_old(#length)| |c_node_create_#res#1.base| v_ArrVal_406))) (exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (= (store |c_old(#length)| |node_create_~temp~0#1.base| (_ bv8 32)) |c_#length|)) (not (= (bvadd |c_#StackHeapBarrier| (_ bv1 32)) (_ bv0 32))) (bvult |c_node_create_#res#1.base| |c_#StackHeapBarrier|)) is different from true [2022-11-20 10:46:03,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:46:03,666 INFO L93 Difference]: Finished difference Result 90 states and 94 transitions. [2022-11-20 10:46:03,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-20 10:46:03,667 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 18 states have (on average 3.3333333333333335) internal successors, (60), 16 states have internal predecessors, (60), 5 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 41 [2022-11-20 10:46:03,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:46:03,668 INFO L225 Difference]: With dead ends: 90 [2022-11-20 10:46:03,668 INFO L226 Difference]: Without dead ends: 90 [2022-11-20 10:46:03,668 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 63 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=106, Invalid=583, Unknown=29, NotChecked=212, Total=930 [2022-11-20 10:46:03,669 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 4 mSDsluCounter, 415 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 484 SdHoareTripleChecker+Invalid, 450 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 321 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 10:46:03,669 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 484 Invalid, 450 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 128 Invalid, 0 Unknown, 321 Unchecked, 0.3s Time] [2022-11-20 10:46:03,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2022-11-20 10:46:03,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2022-11-20 10:46:03,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 62 states have (on average 1.4193548387096775) internal successors, (88), 83 states have internal predecessors, (88), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-20 10:46:03,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 94 transitions. [2022-11-20 10:46:03,674 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 94 transitions. Word has length 41 [2022-11-20 10:46:03,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:46:03,675 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 94 transitions. [2022-11-20 10:46:03,675 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 18 states have (on average 3.3333333333333335) internal successors, (60), 16 states have internal predecessors, (60), 5 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-11-20 10:46:03,675 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 94 transitions. [2022-11-20 10:46:03,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-11-20 10:46:03,676 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:46:03,676 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:46:03,691 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac68dab7-80a7-4075-8b13-a97d4e1f9b96/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2022-11-20 10:46:03,880 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac68dab7-80a7-4075-8b13-a97d4e1f9b96/bin/uautomizer-ug76WZFUDN/cvc4 --incremental --print-success --lang smt (12)] Forceful destruction successful, exit code 0 [2022-11-20 10:46:04,077 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac68dab7-80a7-4075-8b13-a97d4e1f9b96/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac68dab7-80a7-4075-8b13-a97d4e1f9b96/bin/uautomizer-ug76WZFUDN/cvc4 --incremental --print-success --lang smt [2022-11-20 10:46:04,077 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-11-20 10:46:04,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:46:04,078 INFO L85 PathProgramCache]: Analyzing trace with hash -11542527, now seen corresponding path program 1 times [2022-11-20 10:46:04,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 10:46:04,078 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [610335736] [2022-11-20 10:46:04,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:46:04,078 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 10:46:04,078 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac68dab7-80a7-4075-8b13-a97d4e1f9b96/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 10:46:04,079 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac68dab7-80a7-4075-8b13-a97d4e1f9b96/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-20 10:46:04,080 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac68dab7-80a7-4075-8b13-a97d4e1f9b96/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2022-11-20 10:46:04,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:46:04,268 INFO L263 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-20 10:46:04,270 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:46:04,279 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-11-20 10:46:04,389 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-11-20 10:46:04,389 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 10:46:04,389 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 10:46:04,389 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [610335736] [2022-11-20 10:46:04,389 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [610335736] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:46:04,390 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:46:04,390 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-20 10:46:04,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879719546] [2022-11-20 10:46:04,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:46:04,390 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 10:46:04,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 10:46:04,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 10:46:04,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-20 10:46:04,391 INFO L87 Difference]: Start difference. First operand 90 states and 94 transitions. Second operand has 6 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 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-11-20 10:46:04,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:46:04,741 INFO L93 Difference]: Finished difference Result 89 states and 93 transitions. [2022-11-20 10:46:04,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 10:46:04,742 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 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 42 [2022-11-20 10:46:04,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:46:04,743 INFO L225 Difference]: With dead ends: 89 [2022-11-20 10:46:04,743 INFO L226 Difference]: Without dead ends: 89 [2022-11-20 10:46:04,744 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-20 10:46:04,744 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 53 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 10:46:04,744 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 184 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-20 10:46:04,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-11-20 10:46:04,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2022-11-20 10:46:04,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 62 states have (on average 1.403225806451613) internal successors, (87), 82 states have internal predecessors, (87), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-20 10:46:04,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 93 transitions. [2022-11-20 10:46:04,749 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 93 transitions. Word has length 42 [2022-11-20 10:46:04,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:46:04,750 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 93 transitions. [2022-11-20 10:46:04,750 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 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-11-20 10:46:04,750 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 93 transitions. [2022-11-20 10:46:04,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-11-20 10:46:04,751 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:46:04,751 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:46:04,773 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac68dab7-80a7-4075-8b13-a97d4e1f9b96/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2022-11-20 10:46:04,973 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac68dab7-80a7-4075-8b13-a97d4e1f9b96/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 10:46:04,973 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-11-20 10:46:04,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:46:04,974 INFO L85 PathProgramCache]: Analyzing trace with hash -11542528, now seen corresponding path program 1 times [2022-11-20 10:46:04,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 10:46:04,975 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [646473736] [2022-11-20 10:46:04,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:46:04,975 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 10:46:04,975 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac68dab7-80a7-4075-8b13-a97d4e1f9b96/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 10:46:04,976 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac68dab7-80a7-4075-8b13-a97d4e1f9b96/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-20 10:46:04,982 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac68dab7-80a7-4075-8b13-a97d4e1f9b96/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2022-11-20 10:46:05,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:46:05,161 INFO L263 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-20 10:46:05,164 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:46:05,169 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 7 [2022-11-20 10:46:05,219 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-11-20 10:46:05,219 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 10:46:05,220 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 10:46:05,220 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [646473736] [2022-11-20 10:46:05,220 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [646473736] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:46:05,220 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:46:05,221 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-20 10:46:05,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913263725] [2022-11-20 10:46:05,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:46:05,222 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 10:46:05,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 10:46:05,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 10:46:05,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-20 10:46:05,223 INFO L87 Difference]: Start difference. First operand 89 states and 93 transitions. Second operand has 6 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 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-11-20 10:46:05,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:46:05,563 INFO L93 Difference]: Finished difference Result 100 states and 105 transitions. [2022-11-20 10:46:05,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 10:46:05,564 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 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 42 [2022-11-20 10:46:05,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:46:05,565 INFO L225 Difference]: With dead ends: 100 [2022-11-20 10:46:05,565 INFO L226 Difference]: Without dead ends: 100 [2022-11-20 10:46:05,565 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-20 10:46:05,566 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 49 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 10:46:05,566 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 181 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-20 10:46:05,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-11-20 10:46:05,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 88. [2022-11-20 10:46:05,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 62 states have (on average 1.3870967741935485) internal successors, (86), 81 states have internal predecessors, (86), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-20 10:46:05,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 92 transitions. [2022-11-20 10:46:05,570 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 92 transitions. Word has length 42 [2022-11-20 10:46:05,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:46:05,570 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 92 transitions. [2022-11-20 10:46:05,570 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 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-11-20 10:46:05,570 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 92 transitions. [2022-11-20 10:46:05,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-11-20 10:46:05,571 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:46:05,571 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:46:05,595 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac68dab7-80a7-4075-8b13-a97d4e1f9b96/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2022-11-20 10:46:05,784 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac68dab7-80a7-4075-8b13-a97d4e1f9b96/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 10:46:05,784 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-11-20 10:46:05,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:46:05,784 INFO L85 PathProgramCache]: Analyzing trace with hash 1792532577, now seen corresponding path program 1 times [2022-11-20 10:46:05,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 10:46:05,785 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1425821161] [2022-11-20 10:46:05,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:46:05,785 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 10:46:05,785 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac68dab7-80a7-4075-8b13-a97d4e1f9b96/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 10:46:05,786 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac68dab7-80a7-4075-8b13-a97d4e1f9b96/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-20 10:46:05,788 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac68dab7-80a7-4075-8b13-a97d4e1f9b96/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2022-11-20 10:46:05,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:46:06,005 INFO L263 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-20 10:46:06,007 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:46:06,020 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-11-20 10:46:06,021 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 10:46:06,021 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 10:46:06,021 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1425821161] [2022-11-20 10:46:06,021 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1425821161] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:46:06,021 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:46:06,022 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 10:46:06,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688211373] [2022-11-20 10:46:06,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:46:06,022 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 10:46:06,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 10:46:06,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 10:46:06,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 10:46:06,023 INFO L87 Difference]: Start difference. First operand 88 states and 92 transitions. Second operand has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-20 10:46:06,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:46:06,146 INFO L93 Difference]: Finished difference Result 99 states and 104 transitions. [2022-11-20 10:46:06,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 10:46:06,146 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 44 [2022-11-20 10:46:06,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:46:06,147 INFO L225 Difference]: With dead ends: 99 [2022-11-20 10:46:06,147 INFO L226 Difference]: Without dead ends: 99 [2022-11-20 10:46:06,147 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 10:46:06,148 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 44 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 10:46:06,148 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 74 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 10:46:06,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2022-11-20 10:46:06,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 87. [2022-11-20 10:46:06,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 62 states have (on average 1.3709677419354838) internal successors, (85), 80 states have internal predecessors, (85), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-20 10:46:06,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 91 transitions. [2022-11-20 10:46:06,152 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 91 transitions. Word has length 44 [2022-11-20 10:46:06,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:46:06,152 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 91 transitions. [2022-11-20 10:46:06,152 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-20 10:46:06,152 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 91 transitions. [2022-11-20 10:46:06,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-11-20 10:46:06,153 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:46:06,153 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:46:06,168 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac68dab7-80a7-4075-8b13-a97d4e1f9b96/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2022-11-20 10:46:06,364 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac68dab7-80a7-4075-8b13-a97d4e1f9b96/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 10:46:06,364 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-11-20 10:46:06,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:46:06,365 INFO L85 PathProgramCache]: Analyzing trace with hash 1792532578, now seen corresponding path program 1 times [2022-11-20 10:46:06,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 10:46:06,365 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [228529516] [2022-11-20 10:46:06,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:46:06,365 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 10:46:06,365 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac68dab7-80a7-4075-8b13-a97d4e1f9b96/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 10:46:06,366 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac68dab7-80a7-4075-8b13-a97d4e1f9b96/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-20 10:46:06,369 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac68dab7-80a7-4075-8b13-a97d4e1f9b96/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2022-11-20 10:46:06,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:46:06,565 INFO L263 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-20 10:46:06,567 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:46:06,649 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-11-20 10:46:06,649 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 10:46:06,650 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 10:46:06,650 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [228529516] [2022-11-20 10:46:06,650 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [228529516] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:46:06,650 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:46:06,650 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 10:46:06,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874304925] [2022-11-20 10:46:06,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:46:06,651 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 10:46:06,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 10:46:06,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 10:46:06,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-20 10:46:06,652 INFO L87 Difference]: Start difference. First operand 87 states and 91 transitions. Second operand has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-20 10:46:06,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:46:06,816 INFO L93 Difference]: Finished difference Result 86 states and 90 transitions. [2022-11-20 10:46:06,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 10:46:06,817 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 44 [2022-11-20 10:46:06,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:46:06,817 INFO L225 Difference]: With dead ends: 86 [2022-11-20 10:46:06,818 INFO L226 Difference]: Without dead ends: 86 [2022-11-20 10:46:06,818 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-11-20 10:46:06,819 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 98 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 10:46:06,819 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 93 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 10:46:06,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2022-11-20 10:46:06,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2022-11-20 10:46:06,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 62 states have (on average 1.3548387096774193) internal successors, (84), 79 states have internal predecessors, (84), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-20 10:46:06,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 90 transitions. [2022-11-20 10:46:06,822 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 90 transitions. Word has length 44 [2022-11-20 10:46:06,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:46:06,823 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 90 transitions. [2022-11-20 10:46:06,823 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-20 10:46:06,823 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 90 transitions. [2022-11-20 10:46:06,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-11-20 10:46:06,824 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:46:06,824 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:46:06,843 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac68dab7-80a7-4075-8b13-a97d4e1f9b96/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2022-11-20 10:46:07,037 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac68dab7-80a7-4075-8b13-a97d4e1f9b96/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 10:46:07,037 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-11-20 10:46:07,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:46:07,038 INFO L85 PathProgramCache]: Analyzing trace with hash 341921058, now seen corresponding path program 1 times [2022-11-20 10:46:07,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 10:46:07,038 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1847391965] [2022-11-20 10:46:07,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:46:07,038 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 10:46:07,038 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac68dab7-80a7-4075-8b13-a97d4e1f9b96/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 10:46:07,039 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac68dab7-80a7-4075-8b13-a97d4e1f9b96/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-20 10:46:07,040 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac68dab7-80a7-4075-8b13-a97d4e1f9b96/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2022-11-20 10:46:07,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:46:07,238 INFO L263 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-20 10:46:07,240 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:46:07,273 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-11-20 10:46:07,273 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 10:46:07,273 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 10:46:07,273 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1847391965] [2022-11-20 10:46:07,273 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1847391965] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:46:07,274 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:46:07,274 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 10:46:07,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906284917] [2022-11-20 10:46:07,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:46:07,274 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 10:46:07,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 10:46:07,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 10:46:07,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 10:46:07,275 INFO L87 Difference]: Start difference. First operand 86 states and 90 transitions. Second operand has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-20 10:46:07,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:46:07,400 INFO L93 Difference]: Finished difference Result 97 states and 102 transitions. [2022-11-20 10:46:07,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 10:46:07,400 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 46 [2022-11-20 10:46:07,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:46:07,401 INFO L225 Difference]: With dead ends: 97 [2022-11-20 10:46:07,401 INFO L226 Difference]: Without dead ends: 97 [2022-11-20 10:46:07,401 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-20 10:46:07,402 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 99 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 10:46:07,402 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 88 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 10:46:07,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-11-20 10:46:07,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 85. [2022-11-20 10:46:07,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 62 states have (on average 1.3387096774193548) internal successors, (83), 78 states have internal predecessors, (83), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-20 10:46:07,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 89 transitions. [2022-11-20 10:46:07,406 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 89 transitions. Word has length 46 [2022-11-20 10:46:07,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:46:07,406 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 89 transitions. [2022-11-20 10:46:07,406 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-20 10:46:07,406 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 89 transitions. [2022-11-20 10:46:07,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-11-20 10:46:07,407 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:46:07,407 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:46:07,420 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac68dab7-80a7-4075-8b13-a97d4e1f9b96/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Ended with exit code 0 [2022-11-20 10:46:07,620 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac68dab7-80a7-4075-8b13-a97d4e1f9b96/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 10:46:07,620 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-11-20 10:46:07,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:46:07,620 INFO L85 PathProgramCache]: Analyzing trace with hash 341921059, now seen corresponding path program 1 times [2022-11-20 10:46:07,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 10:46:07,621 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [838176831] [2022-11-20 10:46:07,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:46:07,621 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 10:46:07,622 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac68dab7-80a7-4075-8b13-a97d4e1f9b96/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 10:46:07,622 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac68dab7-80a7-4075-8b13-a97d4e1f9b96/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-20 10:46:07,658 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac68dab7-80a7-4075-8b13-a97d4e1f9b96/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2022-11-20 10:46:07,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:46:07,835 INFO L263 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-20 10:46:07,837 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:46:07,960 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-11-20 10:46:07,960 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 10:46:07,960 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 10:46:07,960 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [838176831] [2022-11-20 10:46:07,960 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [838176831] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:46:07,960 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:46:07,961 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 10:46:07,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617979425] [2022-11-20 10:46:07,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:46:07,961 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 10:46:07,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 10:46:07,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 10:46:07,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-20 10:46:07,962 INFO L87 Difference]: Start difference. First operand 85 states and 89 transitions. Second operand has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-20 10:46:08,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:46:08,132 INFO L93 Difference]: Finished difference Result 83 states and 87 transitions. [2022-11-20 10:46:08,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 10:46:08,133 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 46 [2022-11-20 10:46:08,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:46:08,134 INFO L225 Difference]: With dead ends: 83 [2022-11-20 10:46:08,134 INFO L226 Difference]: Without dead ends: 83 [2022-11-20 10:46:08,134 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-11-20 10:46:08,135 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 91 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 10:46:08,135 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 80 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 10:46:08,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2022-11-20 10:46:08,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2022-11-20 10:46:08,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 62 states have (on average 1.3064516129032258) internal successors, (81), 76 states have internal predecessors, (81), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-20 10:46:08,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 87 transitions. [2022-11-20 10:46:08,138 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 87 transitions. Word has length 46 [2022-11-20 10:46:08,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:46:08,138 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 87 transitions. [2022-11-20 10:46:08,139 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-20 10:46:08,139 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 87 transitions. [2022-11-20 10:46:08,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-11-20 10:46:08,139 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:46:08,139 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:46:08,160 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac68dab7-80a7-4075-8b13-a97d4e1f9b96/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2022-11-20 10:46:08,352 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac68dab7-80a7-4075-8b13-a97d4e1f9b96/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 10:46:08,352 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-11-20 10:46:08,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:46:08,353 INFO L85 PathProgramCache]: Analyzing trace with hash -2126344669, now seen corresponding path program 1 times [2022-11-20 10:46:08,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 10:46:08,353 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1445514966] [2022-11-20 10:46:08,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:46:08,353 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 10:46:08,353 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac68dab7-80a7-4075-8b13-a97d4e1f9b96/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 10:46:08,355 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac68dab7-80a7-4075-8b13-a97d4e1f9b96/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-20 10:46:08,371 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac68dab7-80a7-4075-8b13-a97d4e1f9b96/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2022-11-20 10:46:08,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:46:08,579 INFO L263 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 15 conjunts are in the unsatisfiable core [2022-11-20 10:46:08,581 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:46:08,601 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 7 [2022-11-20 10:46:08,744 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-11-20 10:46:08,766 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-11-20 10:46:08,798 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-11-20 10:46:08,798 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 10:46:08,798 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 10:46:08,798 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1445514966] [2022-11-20 10:46:08,798 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1445514966] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:46:08,798 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:46:08,798 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-20 10:46:08,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278438852] [2022-11-20 10:46:08,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:46:08,799 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-20 10:46:08,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 10:46:08,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-20 10:46:08,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-11-20 10:46:08,800 INFO L87 Difference]: Start difference. First operand 83 states and 87 transitions. Second operand has 10 states, 8 states have (on average 3.875) internal successors, (31), 9 states have internal predecessors, (31), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-20 10:46:09,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:46:09,385 INFO L93 Difference]: Finished difference Result 94 states and 98 transitions. [2022-11-20 10:46:09,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-20 10:46:09,386 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 3.875) internal successors, (31), 9 states have internal predecessors, (31), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 48 [2022-11-20 10:46:09,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:46:09,386 INFO L225 Difference]: With dead ends: 94 [2022-11-20 10:46:09,387 INFO L226 Difference]: Without dead ends: 94 [2022-11-20 10:46:09,387 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2022-11-20 10:46:09,387 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 104 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-20 10:46:09,388 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 233 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-20 10:46:09,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-11-20 10:46:09,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 80. [2022-11-20 10:46:09,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 62 states have (on average 1.2580645161290323) internal successors, (78), 73 states have internal predecessors, (78), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-20 10:46:09,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 84 transitions. [2022-11-20 10:46:09,391 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 84 transitions. Word has length 48 [2022-11-20 10:46:09,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:46:09,391 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 84 transitions. [2022-11-20 10:46:09,391 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 3.875) internal successors, (31), 9 states have internal predecessors, (31), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-20 10:46:09,391 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 84 transitions. [2022-11-20 10:46:09,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-11-20 10:46:09,392 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:46:09,392 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:46:09,412 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac68dab7-80a7-4075-8b13-a97d4e1f9b96/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2022-11-20 10:46:09,602 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac68dab7-80a7-4075-8b13-a97d4e1f9b96/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 10:46:09,603 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-11-20 10:46:09,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:46:09,603 INFO L85 PathProgramCache]: Analyzing trace with hash -2126344668, now seen corresponding path program 1 times [2022-11-20 10:46:09,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 10:46:09,603 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1625948207] [2022-11-20 10:46:09,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:46:09,604 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 10:46:09,604 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac68dab7-80a7-4075-8b13-a97d4e1f9b96/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 10:46:09,604 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac68dab7-80a7-4075-8b13-a97d4e1f9b96/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-20 10:46:09,611 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac68dab7-80a7-4075-8b13-a97d4e1f9b96/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2022-11-20 10:46:09,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:46:09,864 INFO L263 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 24 conjunts are in the unsatisfiable core [2022-11-20 10:46:09,867 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:46:09,903 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-11-20 10:46:10,083 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-11-20 10:46:10,090 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-11-20 10:46:10,128 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-11-20 10:46:10,135 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-11-20 10:46:10,194 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-11-20 10:46:10,194 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 10:46:10,195 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 10:46:10,196 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1625948207] [2022-11-20 10:46:10,196 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1625948207] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:46:10,196 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:46:10,196 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-20 10:46:10,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210314214] [2022-11-20 10:46:10,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:46:10,200 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-20 10:46:10,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 10:46:10,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-20 10:46:10,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-11-20 10:46:10,201 INFO L87 Difference]: Start difference. First operand 80 states and 84 transitions. Second operand has 10 states, 8 states have (on average 3.875) internal successors, (31), 9 states have internal predecessors, (31), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-20 10:46:10,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:46:10,835 INFO L93 Difference]: Finished difference Result 80 states and 83 transitions. [2022-11-20 10:46:10,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-20 10:46:10,840 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 3.875) internal successors, (31), 9 states have internal predecessors, (31), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 48 [2022-11-20 10:46:10,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:46:10,841 INFO L225 Difference]: With dead ends: 80 [2022-11-20 10:46:10,841 INFO L226 Difference]: Without dead ends: 80 [2022-11-20 10:46:10,841 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2022-11-20 10:46:10,841 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 83 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-20 10:46:10,842 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 237 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-20 10:46:10,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-11-20 10:46:10,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 78. [2022-11-20 10:46:10,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 62 states have (on average 1.2258064516129032) internal successors, (76), 71 states have internal predecessors, (76), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-20 10:46:10,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 82 transitions. [2022-11-20 10:46:10,845 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 82 transitions. Word has length 48 [2022-11-20 10:46:10,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:46:10,846 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 82 transitions. [2022-11-20 10:46:10,846 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 3.875) internal successors, (31), 9 states have internal predecessors, (31), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-20 10:46:10,846 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 82 transitions. [2022-11-20 10:46:10,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-11-20 10:46:10,846 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:46:10,847 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:46:10,864 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac68dab7-80a7-4075-8b13-a97d4e1f9b96/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2022-11-20 10:46:11,055 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac68dab7-80a7-4075-8b13-a97d4e1f9b96/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 10:46:11,056 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-11-20 10:46:11,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:46:11,056 INFO L85 PathProgramCache]: Analyzing trace with hash 987206626, now seen corresponding path program 1 times [2022-11-20 10:46:11,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 10:46:11,056 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [778647790] [2022-11-20 10:46:11,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:46:11,057 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 10:46:11,057 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac68dab7-80a7-4075-8b13-a97d4e1f9b96/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 10:46:11,058 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac68dab7-80a7-4075-8b13-a97d4e1f9b96/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-20 10:46:11,064 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac68dab7-80a7-4075-8b13-a97d4e1f9b96/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2022-11-20 10:46:11,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:46:11,356 INFO L263 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 36 conjunts are in the unsatisfiable core [2022-11-20 10:46:11,359 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:46:11,578 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-11-20 10:46:11,917 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:46:11,918 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 21 treesize of output 20 [2022-11-20 10:46:11,986 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-11-20 10:46:11,995 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-11-20 10:46:12,019 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-11-20 10:46:12,019 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 28 [2022-11-20 10:46:12,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 5 treesize of output 3 [2022-11-20 10:46:12,160 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-11-20 10:46:12,167 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-11-20 10:46:12,335 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-11-20 10:46:12,379 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-11-20 10:46:12,379 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 10:46:12,379 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 10:46:12,379 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [778647790] [2022-11-20 10:46:12,380 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [778647790] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:46:12,380 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:46:12,380 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-11-20 10:46:12,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793802305] [2022-11-20 10:46:12,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:46:12,380 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-20 10:46:12,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 10:46:12,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-20 10:46:12,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2022-11-20 10:46:12,381 INFO L87 Difference]: Start difference. First operand 78 states and 82 transitions. Second operand has 14 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 13 states have internal predecessors, (33), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-20 10:46:12,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:46:12,748 INFO L93 Difference]: Finished difference Result 78 states and 81 transitions. [2022-11-20 10:46:12,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-20 10:46:12,748 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 13 states have internal predecessors, (33), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 50 [2022-11-20 10:46:12,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:46:12,749 INFO L225 Difference]: With dead ends: 78 [2022-11-20 10:46:12,749 INFO L226 Difference]: Without dead ends: 78 [2022-11-20 10:46:12,749 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2022-11-20 10:46:12,750 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 14 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 94 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 10:46:12,750 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 327 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 67 Invalid, 0 Unknown, 94 Unchecked, 0.2s Time] [2022-11-20 10:46:12,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-11-20 10:46:12,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2022-11-20 10:46:12,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 62 states have (on average 1.2096774193548387) internal successors, (75), 71 states have internal predecessors, (75), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-20 10:46:12,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 81 transitions. [2022-11-20 10:46:12,753 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 81 transitions. Word has length 50 [2022-11-20 10:46:12,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:46:12,753 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 81 transitions. [2022-11-20 10:46:12,754 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 13 states have internal predecessors, (33), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-20 10:46:12,754 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 81 transitions. [2022-11-20 10:46:12,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-11-20 10:46:12,754 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:46:12,754 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 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] [2022-11-20 10:46:12,776 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac68dab7-80a7-4075-8b13-a97d4e1f9b96/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Forceful destruction successful, exit code 0 [2022-11-20 10:46:12,968 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac68dab7-80a7-4075-8b13-a97d4e1f9b96/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 10:46:12,968 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-11-20 10:46:12,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:46:12,969 INFO L85 PathProgramCache]: Analyzing trace with hash -2063364139, now seen corresponding path program 1 times [2022-11-20 10:46:12,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 10:46:12,969 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2351663] [2022-11-20 10:46:12,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:46:12,969 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 10:46:12,969 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac68dab7-80a7-4075-8b13-a97d4e1f9b96/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 10:46:12,971 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac68dab7-80a7-4075-8b13-a97d4e1f9b96/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-20 10:46:13,010 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac68dab7-80a7-4075-8b13-a97d4e1f9b96/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2022-11-20 10:46:13,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:46:13,304 INFO L263 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 47 conjunts are in the unsatisfiable core [2022-11-20 10:46:13,307 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:46:13,357 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 7 [2022-11-20 10:46:13,617 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 11 treesize of output 7 [2022-11-20 10:46:13,989 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-20 10:46:13,989 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 24 [2022-11-20 10:46:14,014 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-11-20 10:46:14,014 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 16 treesize of output 22 [2022-11-20 10:46:14,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 9 treesize of output 7 [2022-11-20 10:46:14,490 INFO L321 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2022-11-20 10:46:14,491 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 24 [2022-11-20 10:46:14,663 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-11-20 10:46:14,680 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:46:14,682 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2022-11-20 10:46:14,821 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-11-20 10:46:15,128 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-20 10:46:15,128 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 45 treesize of output 24 [2022-11-20 10:46:15,447 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-20 10:46:15,447 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 10:46:15,448 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 10:46:15,448 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2351663] [2022-11-20 10:46:15,448 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2351663] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:46:15,448 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:46:15,448 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2022-11-20 10:46:15,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317526287] [2022-11-20 10:46:15,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:46:15,448 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-11-20 10:46:15,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 10:46:15,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-11-20 10:46:15,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=483, Unknown=1, NotChecked=0, Total=552 [2022-11-20 10:46:15,450 INFO L87 Difference]: Start difference. First operand 78 states and 81 transitions. Second operand has 24 states, 22 states have (on average 2.090909090909091) internal successors, (46), 21 states have internal predecessors, (46), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-20 10:46:15,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:46:15,981 INFO L93 Difference]: Finished difference Result 80 states and 85 transitions. [2022-11-20 10:46:15,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-20 10:46:15,982 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 22 states have (on average 2.090909090909091) internal successors, (46), 21 states have internal predecessors, (46), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 53 [2022-11-20 10:46:15,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:46:15,983 INFO L225 Difference]: With dead ends: 80 [2022-11-20 10:46:15,983 INFO L226 Difference]: Without dead ends: 80 [2022-11-20 10:46:15,983 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=92, Invalid=609, Unknown=1, NotChecked=0, Total=702 [2022-11-20 10:46:15,984 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 15 mSDsluCounter, 397 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 435 SdHoareTripleChecker+Invalid, 379 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 193 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-20 10:46:15,984 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 435 Invalid, 379 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 183 Invalid, 0 Unknown, 193 Unchecked, 0.4s Time] [2022-11-20 10:46:15,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-11-20 10:46:15,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2022-11-20 10:46:15,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 64 states have (on average 1.234375) internal successors, (79), 73 states have internal predecessors, (79), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-20 10:46:15,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 85 transitions. [2022-11-20 10:46:15,987 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 85 transitions. Word has length 53 [2022-11-20 10:46:15,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:46:15,987 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 85 transitions. [2022-11-20 10:46:15,987 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 22 states have (on average 2.090909090909091) internal successors, (46), 21 states have internal predecessors, (46), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-20 10:46:15,988 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 85 transitions. [2022-11-20 10:46:15,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-11-20 10:46:15,988 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:46:15,988 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 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] [2022-11-20 10:46:16,000 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac68dab7-80a7-4075-8b13-a97d4e1f9b96/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Forceful destruction successful, exit code 0 [2022-11-20 10:46:16,195 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac68dab7-80a7-4075-8b13-a97d4e1f9b96/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 10:46:16,195 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-11-20 10:46:16,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:46:16,196 INFO L85 PathProgramCache]: Analyzing trace with hash -2063364138, now seen corresponding path program 1 times [2022-11-20 10:46:16,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 10:46:16,196 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [684182123] [2022-11-20 10:46:16,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:46:16,196 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 10:46:16,196 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac68dab7-80a7-4075-8b13-a97d4e1f9b96/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 10:46:16,203 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac68dab7-80a7-4075-8b13-a97d4e1f9b96/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-20 10:46:16,204 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac68dab7-80a7-4075-8b13-a97d4e1f9b96/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2022-11-20 10:46:16,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:46:16,546 INFO L263 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 66 conjunts are in the unsatisfiable core [2022-11-20 10:46:16,550 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:46:16,617 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-11-20 10:46:16,780 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 6 treesize of output 5 [2022-11-20 10:46:16,789 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 6 treesize of output 5 [2022-11-20 10:46:16,980 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-11-20 10:46:16,988 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-11-20 10:46:17,458 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-20 10:46:17,458 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 22 [2022-11-20 10:46:17,480 INFO L321 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-11-20 10:46:17,480 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 14 treesize of output 16 [2022-11-20 10:46:17,501 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-11-20 10:46:17,545 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-20 10:46:17,546 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-11-20 10:46:17,570 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-20 10:46:18,047 INFO L321 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2022-11-20 10:46:18,048 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 22 [2022-11-20 10:46:18,089 INFO L321 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2022-11-20 10:46:18,089 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 20 [2022-11-20 10:46:18,319 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:46:18,320 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2022-11-20 10:46:18,346 INFO L321 Elim1Store]: treesize reduction 53, result has 17.2 percent of original size [2022-11-20 10:46:18,346 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 25 [2022-11-20 10:46:18,833 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:46:18,858 INFO L321 Elim1Store]: treesize reduction 31, result has 8.8 percent of original size [2022-11-20 10:46:18,858 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 75 treesize of output 43 [2022-11-20 10:46:18,874 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:46:18,890 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-20 10:46:18,891 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 18 [2022-11-20 10:46:19,334 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-20 10:46:19,334 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 10:46:19,334 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 10:46:19,334 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [684182123] [2022-11-20 10:46:19,334 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [684182123] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:46:19,334 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:46:19,334 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2022-11-20 10:46:19,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428335211] [2022-11-20 10:46:19,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:46:19,337 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-11-20 10:46:19,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 10:46:19,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-11-20 10:46:19,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=483, Unknown=1, NotChecked=0, Total=552 [2022-11-20 10:46:19,338 INFO L87 Difference]: Start difference. First operand 80 states and 85 transitions. Second operand has 24 states, 22 states have (on average 2.090909090909091) internal successors, (46), 21 states have internal predecessors, (46), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-20 10:46:19,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:46:19,805 INFO L93 Difference]: Finished difference Result 80 states and 84 transitions. [2022-11-20 10:46:19,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-20 10:46:19,806 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 22 states have (on average 2.090909090909091) internal successors, (46), 21 states have internal predecessors, (46), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 53 [2022-11-20 10:46:19,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:46:19,807 INFO L225 Difference]: With dead ends: 80 [2022-11-20 10:46:19,807 INFO L226 Difference]: Without dead ends: 80 [2022-11-20 10:46:19,807 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=92, Invalid=609, Unknown=1, NotChecked=0, Total=702 [2022-11-20 10:46:19,808 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 20 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 347 SdHoareTripleChecker+Invalid, 262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 161 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 10:46:19,808 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 347 Invalid, 262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 98 Invalid, 0 Unknown, 161 Unchecked, 0.3s Time] [2022-11-20 10:46:19,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-11-20 10:46:19,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2022-11-20 10:46:19,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 64 states have (on average 1.21875) internal successors, (78), 73 states have internal predecessors, (78), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-20 10:46:19,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 84 transitions. [2022-11-20 10:46:19,811 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 84 transitions. Word has length 53 [2022-11-20 10:46:19,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:46:19,812 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 84 transitions. [2022-11-20 10:46:19,812 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 22 states have (on average 2.090909090909091) internal successors, (46), 21 states have internal predecessors, (46), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-20 10:46:19,812 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 84 transitions. [2022-11-20 10:46:19,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-11-20 10:46:19,813 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:46:19,813 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 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-11-20 10:46:19,824 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac68dab7-80a7-4075-8b13-a97d4e1f9b96/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Forceful destruction successful, exit code 0 [2022-11-20 10:46:20,015 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac68dab7-80a7-4075-8b13-a97d4e1f9b96/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 10:46:20,016 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-11-20 10:46:20,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:46:20,016 INFO L85 PathProgramCache]: Analyzing trace with hash 460219817, now seen corresponding path program 1 times [2022-11-20 10:46:20,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 10:46:20,016 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [349529372] [2022-11-20 10:46:20,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:46:20,016 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 10:46:20,017 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac68dab7-80a7-4075-8b13-a97d4e1f9b96/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 10:46:20,018 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac68dab7-80a7-4075-8b13-a97d4e1f9b96/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-20 10:46:20,033 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac68dab7-80a7-4075-8b13-a97d4e1f9b96/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2022-11-20 10:46:20,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:46:20,314 INFO L263 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 43 conjunts are in the unsatisfiable core [2022-11-20 10:46:20,318 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:46:20,480 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 6 treesize of output 5 [2022-11-20 10:46:20,618 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-11-20 10:46:20,935 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-20 10:46:20,935 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 21 [2022-11-20 10:46:20,943 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-11-20 10:46:21,298 INFO L321 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2022-11-20 10:46:21,299 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 21 [2022-11-20 10:46:21,445 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-11-20 10:46:21,459 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:46:21,460 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 22 [2022-11-20 10:46:21,577 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-11-20 10:46:21,848 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-20 10:46:21,849 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 31 treesize of output 14 [2022-11-20 10:46:21,945 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 20 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-20 10:46:21,946 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:46:22,174 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 82 treesize of output 78 [2022-11-20 10:46:59,931 WARN L233 SmtUtils]: Spent 6.06s on a formula simplification that was a NOOP. DAG size: 35 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 10:47:17,336 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 10:47:17,337 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [349529372] [2022-11-20 10:47:17,337 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [349529372] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:47:17,337 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1419241499] [2022-11-20 10:47:17,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:47:17,337 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-20 10:47:17,337 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac68dab7-80a7-4075-8b13-a97d4e1f9b96/bin/uautomizer-ug76WZFUDN/cvc4 [2022-11-20 10:47:17,340 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac68dab7-80a7-4075-8b13-a97d4e1f9b96/bin/uautomizer-ug76WZFUDN/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-20 10:47:17,341 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac68dab7-80a7-4075-8b13-a97d4e1f9b96/bin/uautomizer-ug76WZFUDN/cvc4 --incremental --print-success --lang smt (25)] Waiting until timeout for monitored process [2022-11-20 10:47:17,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:47:17,902 INFO L263 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 42 conjunts are in the unsatisfiable core [2022-11-20 10:47:17,905 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:47:18,943 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-11-20 10:47:19,165 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-20 10:47:19,165 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 21 [2022-11-20 10:47:19,174 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-11-20 10:47:19,893 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:47:19,893 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2022-11-20 10:47:20,193 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:47:20,195 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 22 [2022-11-20 10:47:20,213 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-11-20 10:47:20,478 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-11-20 10:47:23,039 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 10:47:23,040 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 14 [2022-11-20 10:47:23,047 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 20 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-20 10:47:23,047 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:47:23,086 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 82 treesize of output 78 [2022-11-20 10:47:25,397 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1419241499] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:47:25,397 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 10:47:25,397 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 37 [2022-11-20 10:47:25,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892443418] [2022-11-20 10:47:25,399 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 10:47:25,399 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-11-20 10:47:25,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 10:47:25,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-11-20 10:47:25,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=176, Invalid=1863, Unknown=31, NotChecked=0, Total=2070 [2022-11-20 10:47:25,401 INFO L87 Difference]: Start difference. First operand 80 states and 84 transitions. Second operand has 37 states, 35 states have (on average 2.0285714285714285) internal successors, (71), 32 states have internal predecessors, (71), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-20 10:47:26,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:47:26,496 INFO L93 Difference]: Finished difference Result 86 states and 89 transitions. [2022-11-20 10:47:26,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-20 10:47:26,497 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 35 states have (on average 2.0285714285714285) internal successors, (71), 32 states have internal predecessors, (71), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 54 [2022-11-20 10:47:26,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:47:26,498 INFO L225 Difference]: With dead ends: 86 [2022-11-20 10:47:26,498 INFO L226 Difference]: Without dead ends: 86 [2022-11-20 10:47:26,499 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 90 SyntacticMatches, 4 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 805 ImplicationChecksByTransitivity, 63.0s TimeCoverageRelationStatistics Valid=232, Invalid=2386, Unknown=34, NotChecked=0, Total=2652 [2022-11-20 10:47:26,499 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 38 mSDsluCounter, 492 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 530 SdHoareTripleChecker+Invalid, 338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 205 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 10:47:26,500 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 530 Invalid, 338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 130 Invalid, 0 Unknown, 205 Unchecked, 0.3s Time] [2022-11-20 10:47:26,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2022-11-20 10:47:26,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 80. [2022-11-20 10:47:26,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 64 states have (on average 1.203125) internal successors, (77), 73 states have internal predecessors, (77), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-20 10:47:26,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 83 transitions. [2022-11-20 10:47:26,504 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 83 transitions. Word has length 54 [2022-11-20 10:47:26,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:47:26,505 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 83 transitions. [2022-11-20 10:47:26,505 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 35 states have (on average 2.0285714285714285) internal successors, (71), 32 states have internal predecessors, (71), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-20 10:47:26,505 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 83 transitions. [2022-11-20 10:47:26,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-11-20 10:47:26,505 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:47:26,506 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 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, 1] [2022-11-20 10:47:26,514 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac68dab7-80a7-4075-8b13-a97d4e1f9b96/bin/uautomizer-ug76WZFUDN/cvc4 --incremental --print-success --lang smt (25)] Forceful destruction successful, exit code 0 [2022-11-20 10:47:26,720 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac68dab7-80a7-4075-8b13-a97d4e1f9b96/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Forceful destruction successful, exit code 0 [2022-11-20 10:47:26,910 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac68dab7-80a7-4075-8b13-a97d4e1f9b96/bin/uautomizer-ug76WZFUDN/cvc4 --incremental --print-success --lang smt,24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac68dab7-80a7-4075-8b13-a97d4e1f9b96/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 10:47:26,910 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-11-20 10:47:26,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:47:26,911 INFO L85 PathProgramCache]: Analyzing trace with hash 1381954359, now seen corresponding path program 1 times [2022-11-20 10:47:26,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 10:47:26,911 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1770843655] [2022-11-20 10:47:26,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:47:26,911 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 10:47:26,912 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac68dab7-80a7-4075-8b13-a97d4e1f9b96/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 10:47:26,913 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac68dab7-80a7-4075-8b13-a97d4e1f9b96/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-20 10:47:26,914 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac68dab7-80a7-4075-8b13-a97d4e1f9b96/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Waiting until timeout for monitored process [2022-11-20 10:47:27,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:47:27,318 INFO L263 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 44 conjunts are in the unsatisfiable core [2022-11-20 10:47:27,321 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:47:27,497 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 6 treesize of output 5 [2022-11-20 10:47:27,660 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-11-20 10:47:27,993 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-20 10:47:27,994 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-11-20 10:47:28,003 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-20 10:47:28,422 INFO L321 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2022-11-20 10:47:28,423 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 20 [2022-11-20 10:47:28,586 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-11-20 10:47:28,610 INFO L321 Elim1Store]: treesize reduction 53, result has 17.2 percent of original size [2022-11-20 10:47:28,610 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 25 [2022-11-20 10:47:28,726 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-11-20 10:47:29,043 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:47:29,055 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-20 10:47:29,055 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 18 [2022-11-20 10:47:29,272 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-20 10:47:29,272 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 10:47:29,272 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 10:47:29,272 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1770843655] [2022-11-20 10:47:29,272 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1770843655] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:47:29,272 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:47:29,272 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2022-11-20 10:47:29,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489668226] [2022-11-20 10:47:29,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:47:29,273 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-11-20 10:47:29,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 10:47:29,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-11-20 10:47:29,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=527, Unknown=1, NotChecked=0, Total=600 [2022-11-20 10:47:29,274 INFO L87 Difference]: Start difference. First operand 80 states and 83 transitions. Second operand has 25 states, 23 states have (on average 2.0869565217391304) internal successors, (48), 22 states have internal predecessors, (48), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-20 10:47:29,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:47:29,926 INFO L93 Difference]: Finished difference Result 87 states and 89 transitions. [2022-11-20 10:47:29,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-20 10:47:29,927 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 23 states have (on average 2.0869565217391304) internal successors, (48), 22 states have internal predecessors, (48), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 55 [2022-11-20 10:47:29,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:47:29,927 INFO L225 Difference]: With dead ends: 87 [2022-11-20 10:47:29,928 INFO L226 Difference]: Without dead ends: 87 [2022-11-20 10:47:29,928 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 200 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=96, Invalid=659, Unknown=1, NotChecked=0, Total=756 [2022-11-20 10:47:29,929 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 43 mSDsluCounter, 546 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 585 SdHoareTripleChecker+Invalid, 338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 130 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-20 10:47:29,929 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 585 Invalid, 338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 204 Invalid, 0 Unknown, 130 Unchecked, 0.5s Time] [2022-11-20 10:47:29,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2022-11-20 10:47:29,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 82. [2022-11-20 10:47:29,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 66 states have (on average 1.196969696969697) internal successors, (79), 75 states have internal predecessors, (79), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-20 10:47:29,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 85 transitions. [2022-11-20 10:47:29,933 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 85 transitions. Word has length 55 [2022-11-20 10:47:29,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:47:29,933 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 85 transitions. [2022-11-20 10:47:29,933 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 23 states have (on average 2.0869565217391304) internal successors, (48), 22 states have internal predecessors, (48), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-20 10:47:29,933 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 85 transitions. [2022-11-20 10:47:29,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-11-20 10:47:29,934 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:47:29,934 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 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, 1, 1, 1] [2022-11-20 10:47:29,949 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac68dab7-80a7-4075-8b13-a97d4e1f9b96/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Forceful destruction successful, exit code 0 [2022-11-20 10:47:30,148 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac68dab7-80a7-4075-8b13-a97d4e1f9b96/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 10:47:30,149 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-11-20 10:47:30,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:47:30,149 INFO L85 PathProgramCache]: Analyzing trace with hash 913244988, now seen corresponding path program 1 times [2022-11-20 10:47:30,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 10:47:30,150 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [592601673] [2022-11-20 10:47:30,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:47:30,150 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 10:47:30,150 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac68dab7-80a7-4075-8b13-a97d4e1f9b96/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 10:47:30,151 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac68dab7-80a7-4075-8b13-a97d4e1f9b96/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-20 10:47:30,154 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac68dab7-80a7-4075-8b13-a97d4e1f9b96/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Waiting until timeout for monitored process [2022-11-20 10:47:30,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:47:30,561 INFO L263 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 93 conjunts are in the unsatisfiable core [2022-11-20 10:47:30,566 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:47:30,600 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:47:30,601 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 14 treesize of output 20 [2022-11-20 10:47:30,833 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-20 10:47:30,833 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 19 treesize of output 27 [2022-11-20 10:47:31,053 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-11-20 10:47:31,255 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-20 10:47:31,255 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 19 treesize of output 27 [2022-11-20 10:47:31,487 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 6 treesize of output 5 [2022-11-20 10:47:31,515 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:47:31,516 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 21 treesize of output 20 [2022-11-20 10:47:32,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 38 treesize of output 22 [2022-11-20 10:47:32,039 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 15 treesize of output 11 [2022-11-20 10:47:32,046 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-11-20 10:47:32,062 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-11-20 10:47:32,788 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-20 10:47:32,789 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 1 case distinctions, treesize of input 14 treesize of output 20 [2022-11-20 10:47:32,806 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-20 10:47:32,836 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:47:32,836 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 44 treesize of output 40 [2022-11-20 10:47:32,896 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-11-20 10:47:32,897 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 1 case distinctions, treesize of input 18 treesize of output 28 [2022-11-20 10:47:32,910 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-20 10:47:32,960 INFO L321 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2022-11-20 10:47:32,960 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 26 [2022-11-20 10:47:33,783 INFO L321 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2022-11-20 10:47:33,783 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 20 [2022-11-20 10:47:33,816 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:47:33,817 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 35 [2022-11-20 10:47:33,831 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2022-11-20 10:47:34,598 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:47:34,600 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 36 [2022-11-20 10:47:34,633 INFO L321 Elim1Store]: treesize reduction 27, result has 48.1 percent of original size [2022-11-20 10:47:34,633 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 1 case distinctions, treesize of input 22 treesize of output 36 [2022-11-20 10:47:34,640 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-20 10:47:34,707 INFO L321 Elim1Store]: treesize reduction 53, result has 17.2 percent of original size [2022-11-20 10:47:34,708 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 2 case distinctions, treesize of input 34 treesize of output 25 [2022-11-20 10:47:35,654 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:47:35,684 INFO L321 Elim1Store]: treesize reduction 31, result has 8.8 percent of original size [2022-11-20 10:47:35,685 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 123 treesize of output 59 [2022-11-20 10:47:35,711 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:47:35,724 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-20 10:47:35,725 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 18 [2022-11-20 10:47:36,298 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-20 10:47:36,407 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 8 proven. 12 refuted. 6 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-20 10:47:36,407 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:47:48,739 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 10:47:48,739 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [592601673] [2022-11-20 10:47:48,739 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [592601673] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:47:48,739 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1428874982] [2022-11-20 10:47:48,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:47:48,740 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-20 10:47:48,740 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac68dab7-80a7-4075-8b13-a97d4e1f9b96/bin/uautomizer-ug76WZFUDN/cvc4 [2022-11-20 10:47:48,741 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac68dab7-80a7-4075-8b13-a97d4e1f9b96/bin/uautomizer-ug76WZFUDN/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-20 10:47:48,742 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac68dab7-80a7-4075-8b13-a97d4e1f9b96/bin/uautomizer-ug76WZFUDN/cvc4 --incremental --print-success --lang smt (28)] Waiting until timeout for monitored process [2022-11-20 10:47:49,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:47:49,358 INFO L263 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 78 conjunts are in the unsatisfiable core [2022-11-20 10:47:49,371 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:47:50,040 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 7 [2022-11-20 10:47:50,048 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-11-20 10:47:50,365 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-11-20 10:47:51,617 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 19 treesize of output 18 [2022-11-20 10:47:53,163 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 39 treesize of output 23 [2022-11-20 10:47:53,173 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-11-20 10:47:53,181 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-11-20 10:47:53,187 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-20 10:47:55,376 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:47:55,377 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 45 treesize of output 41 [2022-11-20 10:47:55,412 INFO L321 Elim1Store]: treesize reduction 6, result has 57.1 percent of original size [2022-11-20 10:47:55,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 17 treesize of output 17 [2022-11-20 10:47:55,423 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-11-20 10:47:55,434 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 18 [2022-11-20 10:47:56,833 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:47:56,834 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 36 [2022-11-20 10:47:56,863 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 20 treesize of output 22 [2022-11-20 10:47:57,620 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:47:57,622 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 37 [2022-11-20 10:47:57,683 INFO L321 Elim1Store]: treesize reduction 27, result has 48.1 percent of original size [2022-11-20 10:47:57,683 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 1 case distinctions, treesize of input 22 treesize of output 36 [2022-11-20 10:47:57,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 5 treesize of output 3 [2022-11-20 10:47:57,710 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-11-20 10:47:59,437 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:47:59,444 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 10:47:59,444 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 97 treesize of output 45 [2022-11-20 10:47:59,461 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:47:59,462 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 21 treesize of output 12 [2022-11-20 10:48:01,000 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:48:01,001 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-20 10:48:01,011 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 14 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-20 10:48:01,012 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:48:04,860 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 10:48:04,860 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 1136 treesize of output 944 [2022-11-20 10:50:05,191 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse930 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_prepend_~head#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_prepend_~head#1.base|) |c_ULTIMATE.start_sll_prepend_~head#1.offset| |c_ULTIMATE.start_sll_prepend_~new_head~1#1.base|)))) (let ((.cse641 (select (select .cse930 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse8 (select .cse930 .cse641))) (let ((.cse20 (select .cse8 |c_ULTIMATE.start_sll_prepend_~head#1.offset|))) (let ((.cse18 (bvadd (_ bv4294967292 32) |c_ULTIMATE.start_sll_prepend_~head#1.offset|)) (.cse0 (bvadd |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset| (_ bv4 32))) (.cse913 (select |c_#length| .cse20))) (let ((.cse28 (= .cse641 |c_ULTIMATE.start_sll_prepend_~head#1.base|)) (.cse633 (bvadd |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset| (_ bv8 32))) (.cse226 (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_152 (_ BitVec 32))) (let ((.cse929 (select (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593) .cse20))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse929 v_arrayElimCell_152)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse929 |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|)))))) (.cse12 (not (bvule .cse0 .cse913))) (.cse13 (not (bvule |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset| .cse0))) (.cse14 (= |c_ULTIMATE.start_sll_prepend_~head#1.offset| .cse0)) (.cse223 (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593) .cse20) |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|)))) (.cse333 (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse928 (select (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593) .cse20))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse928 .cse18)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse928 |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|)))))) (.cse7 (select .cse8 .cse0))) (let ((.cse642 (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse927 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse927 .cse7) .cse18)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse927 .cse20) |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|)))))) (.cse72 (and .cse223 .cse333)) (.cse838 (forall ((v_arrayElimIndex_11 (_ BitVec 32))) (let ((.cse926 (select .cse8 v_arrayElimIndex_11))) (let ((.cse924 (select |c_#length| .cse926)) (.cse925 (bvadd (_ bv4294967292 32) v_arrayElimIndex_11))) (or (not (bvule v_arrayElimIndex_11 .cse924)) (not (bvule .cse925 v_arrayElimIndex_11)) (not (bvule (bvadd (_ bv4 32) v_arrayElimIndex_11) .cse924)) (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593) .cse926) .cse925))) (= v_arrayElimIndex_11 |c_ULTIMATE.start_sll_prepend_~head#1.offset|)))))) (.cse701 (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimIndex_11 (_ BitVec 32)) (v_arrayElimCell_152 (_ BitVec 32))) (let ((.cse923 (select .cse8 v_arrayElimIndex_11))) (let ((.cse922 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593)) (.cse920 (bvadd v_arrayElimCell_152 (_ bv4 32))) (.cse921 (select |c_#length| .cse923))) (or (not (bvule .cse920 .cse921)) (= (select (select .cse922 .cse923) v_arrayElimCell_152) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse922 .cse7) v_arrayElimCell_152)) (not (bvule v_arrayElimCell_152 .cse920)) (= v_arrayElimIndex_11 |c_ULTIMATE.start_sll_prepend_~head#1.offset|) (not (bvule (bvadd v_arrayElimCell_152 (_ bv8 32)) .cse921))))))) (.cse112 (not .cse14)) (.cse82 (select |c_#length| .cse7)) (.cse136 (and (or .cse12 .cse13 .cse226) (or .cse12 .cse13 .cse223))) (.cse454 (forall ((v_arrayElimIndex_11 (_ BitVec 32))) (or (= v_arrayElimIndex_11 .cse0) (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_152 (_ BitVec 32))) (let ((.cse919 (select .cse8 v_arrayElimIndex_11))) (let ((.cse917 (bvadd v_arrayElimCell_152 (_ bv4 32))) (.cse918 (select |c_#length| .cse919))) (or (not (bvule .cse917 .cse918)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593) .cse919) v_arrayElimCell_152) |c_ULTIMATE.start_main_~data~0#1|) (not (bvule v_arrayElimCell_152 .cse917)) (not (bvule (bvadd v_arrayElimCell_152 (_ bv8 32)) .cse918)))))) (= v_arrayElimIndex_11 |c_ULTIMATE.start_sll_prepend_~head#1.offset|)))) (.cse125 (and (or (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_151 (_ BitVec 32))) (let ((.cse914 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse914 .cse7) v_arrayElimCell_151)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse914 .cse20) |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|))))) .cse13) (or .cse13 (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_151 (_ BitVec 32))) (let ((.cse916 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593))) (let ((.cse915 (select .cse916 .cse7))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse915 v_arrayElimCell_151)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse916 .cse20) |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse915 |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|))))))))) (.cse15 (not (bvule .cse633 .cse913))) (.cse21 (not .cse28)) (.cse42 (= |c_ULTIMATE.start_main_~#s~0#1.base| |c_ULTIMATE.start_sll_prepend_~head#1.base|)) (.cse59 (= |c_ULTIMATE.start_main_~#s~0#1.offset| |c_ULTIMATE.start_sll_prepend_~head#1.offset|))) (let ((.cse1 (and .cse42 .cse59)) (.cse10 (or .cse125 .cse12 .cse14 .cse15 .cse21)) (.cse137 (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_151 (_ BitVec 32)) (v_arrayElimCell_152 (_ BitVec 32))) (let ((.cse911 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593))) (let ((.cse912 (select .cse911 .cse20))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse911 .cse7) v_arrayElimCell_151)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse912 v_arrayElimCell_152)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse912 |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|))))))) (.cse111 (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_151 (_ BitVec 32)) (v_arrayElimCell_152 (_ BitVec 32))) (let ((.cse910 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593))) (let ((.cse909 (select .cse910 .cse20)) (.cse908 (select .cse910 .cse7))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse908 v_arrayElimCell_151)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse909 v_arrayElimCell_152)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse909 |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse908 |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|))))))) (.cse372 (and (forall ((v_arrayElimIndex_11 (_ BitVec 32))) (or (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_152 (_ BitVec 32))) (let ((.cse904 (select .cse8 v_arrayElimIndex_11))) (let ((.cse901 (select (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593) .cse904)) (.cse902 (bvadd v_arrayElimCell_152 (_ bv4 32))) (.cse903 (select |c_#length| .cse904))) (or (= (select .cse901 |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|) |c_ULTIMATE.start_main_~data~0#1|) (not (bvule .cse902 .cse903)) (= (select .cse901 v_arrayElimCell_152) |c_ULTIMATE.start_main_~data~0#1|) (not (bvule v_arrayElimCell_152 .cse902)) (not (bvule (bvadd v_arrayElimCell_152 (_ bv8 32)) .cse903)))))) (= v_arrayElimIndex_11 .cse0))) (forall ((v_arrayElimIndex_11 (_ BitVec 32))) (or (= v_arrayElimIndex_11 .cse0) (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_152 (_ BitVec 32))) (let ((.cse907 (select .cse8 v_arrayElimIndex_11))) (let ((.cse905 (bvadd v_arrayElimCell_152 (_ bv4 32))) (.cse906 (select |c_#length| .cse907))) (or (not (bvule .cse905 .cse906)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593) .cse907) v_arrayElimCell_152) |c_ULTIMATE.start_main_~data~0#1|) (not (bvule v_arrayElimCell_152 .cse905)) (not (bvule (bvadd v_arrayElimCell_152 (_ bv8 32)) .cse906)))))))) .cse454)) (.cse102 (or .cse14 .cse15 .cse21 .cse136)) (.cse452 (forall ((v_arrayElimIndex_11 (_ BitVec 32))) (or (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_152 (_ BitVec 32))) (let ((.cse900 (select .cse8 v_arrayElimIndex_11))) (let ((.cse897 (select (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593) .cse900)) (.cse898 (bvadd v_arrayElimCell_152 (_ bv4 32))) (.cse899 (select |c_#length| .cse900))) (or (= (select .cse897 |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|) |c_ULTIMATE.start_main_~data~0#1|) (not (bvule .cse898 .cse899)) (= (select .cse897 v_arrayElimCell_152) |c_ULTIMATE.start_main_~data~0#1|) (not (bvule v_arrayElimCell_152 .cse898)) (not (bvule (bvadd v_arrayElimCell_152 (_ bv8 32)) .cse899)))))) (= v_arrayElimIndex_11 .cse0) (= v_arrayElimIndex_11 |c_ULTIMATE.start_sll_prepend_~head#1.offset|)))) (.cse453 (or (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimIndex_11 (_ BitVec 32)) (v_arrayElimCell_152 (_ BitVec 32))) (let ((.cse896 (select .cse8 v_arrayElimIndex_11))) (let ((.cse894 (bvadd v_arrayElimCell_152 (_ bv4 32))) (.cse895 (select |c_#length| .cse896))) (or (not (bvule .cse894 .cse895)) (= v_arrayElimIndex_11 .cse0) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593) .cse896) v_arrayElimCell_152) |c_ULTIMATE.start_main_~data~0#1|) (not (bvule v_arrayElimCell_152 .cse894)) (= v_arrayElimIndex_11 |c_ULTIMATE.start_sll_prepend_~head#1.offset|) (not (bvule (bvadd v_arrayElimCell_152 (_ bv8 32)) .cse895)))))) .cse28)) (.cse97 (not .cse42)) (.cse85 (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_151 (_ BitVec 32))) (let ((.cse893 (bvadd v_arrayElimCell_151 (_ bv4 32)))) (or (not (bvule (bvadd v_arrayElimCell_151 (_ bv8 32)) .cse82)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593) .cse7) v_arrayElimCell_151)) (not (bvule v_arrayElimCell_151 .cse893)) (not (bvule .cse893 .cse82)))))) (.cse86 (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_151 (_ BitVec 32))) (let ((.cse892 (bvadd v_arrayElimCell_151 (_ bv4 32))) (.cse891 (select (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593) .cse7))) (or (not (bvule (bvadd v_arrayElimCell_151 (_ bv8 32)) .cse82)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse891 v_arrayElimCell_151)) (not (bvule v_arrayElimCell_151 .cse892)) (not (bvule .cse892 .cse82)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse891 |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|)))))) (.cse98 (not .cse59)) (.cse222 (and .cse223 .cse226)) (.cse224 (or .cse14 (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_152 (_ BitVec 32))) (let ((.cse890 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593))) (let ((.cse889 (select .cse890 .cse20))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse889 v_arrayElimCell_152)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse889 |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse890 .cse7) v_arrayElimCell_152)))))))) (.cse225 (or (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_152 (_ BitVec 32))) (let ((.cse888 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse888 .cse20) |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse888 .cse7) v_arrayElimCell_152))))) .cse14)) (.cse227 (or (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_152 (_ BitVec 32))) (let ((.cse887 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse887 .cse20) v_arrayElimCell_152)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse887 .cse7) |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|))))) .cse112)) (.cse228 (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_152 (_ BitVec 32))) (let ((.cse886 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593))) (let ((.cse884 (select .cse886 .cse20)) (.cse885 (select .cse886 .cse7))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse884 v_arrayElimCell_152)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse884 |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse885 v_arrayElimCell_152)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse885 |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|))))))) (.cse229 (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_152 (_ BitVec 32))) (let ((.cse882 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593))) (let ((.cse883 (select .cse882 .cse7))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse882 .cse20) |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse883 v_arrayElimCell_152)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse883 |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|))))))) (.cse436 (or .cse112 (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimIndex_11 (_ BitVec 32)) (v_arrayElimCell_152 (_ BitVec 32))) (let ((.cse881 (select .cse8 v_arrayElimIndex_11))) (let ((.cse878 (bvadd v_arrayElimCell_152 (_ bv4 32))) (.cse880 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593)) (.cse879 (select |c_#length| .cse881))) (or (not (bvule .cse878 .cse879)) (= (select (select .cse880 .cse881) v_arrayElimCell_152) |c_ULTIMATE.start_main_~data~0#1|) (not (bvule v_arrayElimCell_152 .cse878)) (= v_arrayElimIndex_11 |c_ULTIMATE.start_sll_prepend_~head#1.offset|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse880 .cse7) |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|)) (not (bvule (bvadd v_arrayElimCell_152 (_ bv8 32)) .cse879)))))) .cse21)) (.cse446 (or (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimIndex_11 (_ BitVec 32)) (v_arrayElimCell_152 (_ BitVec 32))) (let ((.cse876 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593)) (.cse877 (select .cse8 v_arrayElimIndex_11))) (let ((.cse873 (select .cse876 .cse877)) (.cse874 (bvadd v_arrayElimCell_152 (_ bv4 32))) (.cse875 (select |c_#length| .cse877))) (or (= (select .cse873 |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|) |c_ULTIMATE.start_main_~data~0#1|) (not (bvule .cse874 .cse875)) (= (select .cse873 v_arrayElimCell_152) |c_ULTIMATE.start_main_~data~0#1|) (not (bvule v_arrayElimCell_152 .cse874)) (= v_arrayElimIndex_11 |c_ULTIMATE.start_sll_prepend_~head#1.offset|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse876 .cse7) |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|)) (not (bvule (bvadd v_arrayElimCell_152 (_ bv8 32)) .cse875)))))) .cse112 .cse21)) (.cse703 (forall ((v_arrayElimIndex_11 (_ BitVec 32))) (or (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_152 (_ BitVec 32))) (let ((.cse871 (select .cse8 v_arrayElimIndex_11)) (.cse870 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593))) (let ((.cse868 (bvadd v_arrayElimCell_152 (_ bv4 32))) (.cse872 (select .cse870 .cse7)) (.cse869 (select |c_#length| .cse871))) (or (not (bvule .cse868 .cse869)) (= (select (select .cse870 .cse871) v_arrayElimCell_152) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse872 v_arrayElimCell_152)) (not (bvule v_arrayElimCell_152 .cse868)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse872 |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|)) (not (bvule (bvadd v_arrayElimCell_152 (_ bv8 32)) .cse869)))))) (= v_arrayElimIndex_11 |c_ULTIMATE.start_sll_prepend_~head#1.offset|)))) (.cse710 (or .cse701 .cse14)) (.cse719 (forall ((v_arrayElimIndex_11 (_ BitVec 32))) (or (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_152 (_ BitVec 32))) (let ((.cse867 (select .cse8 v_arrayElimIndex_11))) (let ((.cse865 (bvadd v_arrayElimCell_152 (_ bv4 32))) (.cse866 (select |c_#length| .cse867))) (or (not (bvule .cse865 .cse866)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593) .cse867) v_arrayElimCell_152) |c_ULTIMATE.start_main_~data~0#1|) (not (bvule v_arrayElimCell_152 .cse865)) (not (bvule (bvadd v_arrayElimCell_152 (_ bv8 32)) .cse866)))))) (= v_arrayElimIndex_11 |c_ULTIMATE.start_sll_prepend_~head#1.offset|)))) (.cse773 (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimIndex_11 (_ BitVec 32))) (let ((.cse863 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593)) (.cse864 (select .cse8 v_arrayElimIndex_11))) (let ((.cse861 (select .cse863 .cse864)) (.cse862 (bvadd (_ bv4294967292 32) v_arrayElimIndex_11)) (.cse860 (select |c_#length| .cse864))) (or (not (bvule v_arrayElimIndex_11 .cse860)) (= (select .cse861 |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse861 .cse862)) (not (bvule .cse862 v_arrayElimIndex_11)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse863 .cse7) .cse862)) (not (bvule (bvadd (_ bv4 32) v_arrayElimIndex_11) .cse860)) (= v_arrayElimIndex_11 |c_ULTIMATE.start_sll_prepend_~head#1.offset|)))))) (.cse783 (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimIndex_11 (_ BitVec 32))) (let ((.cse858 (select .cse8 v_arrayElimIndex_11))) (let ((.cse857 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593)) (.cse859 (bvadd (_ bv4294967292 32) v_arrayElimIndex_11)) (.cse856 (select |c_#length| .cse858))) (or (not (bvule v_arrayElimIndex_11 .cse856)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse857 .cse858) .cse859)) (not (bvule .cse859 v_arrayElimIndex_11)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse857 .cse7) .cse859)) (not (bvule (bvadd (_ bv4 32) v_arrayElimIndex_11) .cse856)) (= v_arrayElimIndex_11 |c_ULTIMATE.start_sll_prepend_~head#1.offset|)))))) (.cse100 (forall ((v_arrayElimIndex_11 (_ BitVec 32))) (or (= v_arrayElimIndex_11 .cse0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| v_arrayElimIndex_11) (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_152 (_ BitVec 32))) (let ((.cse855 (select .cse8 v_arrayElimIndex_11))) (let ((.cse853 (bvadd v_arrayElimCell_152 (_ bv4 32))) (.cse854 (select |c_#length| .cse855))) (or (not (bvule .cse853 .cse854)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593) .cse855) v_arrayElimCell_152) |c_ULTIMATE.start_main_~data~0#1|) (not (bvule v_arrayElimCell_152 .cse853)) (not (bvule (bvadd v_arrayElimCell_152 (_ bv8 32)) .cse854)))))) (= v_arrayElimIndex_11 |c_ULTIMATE.start_sll_prepend_~head#1.offset|)))) (.cse797 (and .cse838 (forall ((v_arrayElimIndex_11 (_ BitVec 32))) (let ((.cse848 (select .cse8 v_arrayElimIndex_11))) (let ((.cse846 (select |c_#length| .cse848)) (.cse847 (bvadd (_ bv4294967292 32) v_arrayElimIndex_11))) (or (not (bvule v_arrayElimIndex_11 .cse846)) (not (bvule .cse847 v_arrayElimIndex_11)) (not (bvule (bvadd (_ bv4 32) v_arrayElimIndex_11) .cse846)) (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593) .cse848) .cse847))))))) (forall ((v_arrayElimIndex_11 (_ BitVec 32))) (let ((.cse852 (select .cse8 v_arrayElimIndex_11))) (let ((.cse850 (bvadd (_ bv4294967292 32) v_arrayElimIndex_11)) (.cse849 (select |c_#length| .cse852))) (or (not (bvule v_arrayElimIndex_11 .cse849)) (not (bvule .cse850 v_arrayElimIndex_11)) (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse851 (select (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593) .cse852))) (or (= (select .cse851 |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse851 .cse850))))) (not (bvule (bvadd (_ bv4 32) v_arrayElimIndex_11) .cse849)))))))) (.cse767 (and .cse838 (forall ((v_arrayElimIndex_11 (_ BitVec 32))) (let ((.cse842 (select .cse8 v_arrayElimIndex_11))) (let ((.cse840 (bvadd (_ bv4294967292 32) v_arrayElimIndex_11)) (.cse839 (select |c_#length| .cse842))) (or (not (bvule v_arrayElimIndex_11 .cse839)) (not (bvule .cse840 v_arrayElimIndex_11)) (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse841 (select (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593) .cse842))) (or (= (select .cse841 |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse841 .cse840))))) (not (bvule (bvadd (_ bv4 32) v_arrayElimIndex_11) .cse839)) (= v_arrayElimIndex_11 |c_ULTIMATE.start_sll_prepend_~head#1.offset|))))) (or (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimIndex_11 (_ BitVec 32))) (let ((.cse844 (select .cse8 v_arrayElimIndex_11))) (let ((.cse845 (bvadd (_ bv4294967292 32) v_arrayElimIndex_11)) (.cse843 (select |c_#length| .cse844))) (or (not (bvule v_arrayElimIndex_11 .cse843)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593) .cse844) .cse845)) (not (bvule .cse845 v_arrayElimIndex_11)) (not (bvule (bvadd (_ bv4 32) v_arrayElimIndex_11) .cse843)) (= v_arrayElimIndex_11 |c_ULTIMATE.start_sll_prepend_~head#1.offset|))))) .cse28))) (.cse327 (or .cse14 (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse837 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593))) (let ((.cse836 (select .cse837 .cse20))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse836 .cse18)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse837 .cse7) .cse18)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse836 |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|)))))))) (.cse328 (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse835 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593))) (let ((.cse834 (select .cse835 .cse7))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse834 .cse18)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse835 .cse20) |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse834 |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|))))))) (.cse547 (or .cse223 .cse112)) (.cse329 (or .cse72 .cse59)) (.cse330 (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse833 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593))) (let ((.cse831 (select .cse833 .cse20)) (.cse832 (select .cse833 .cse7))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse831 .cse18)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse832 .cse18)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse831 |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse832 |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|))))))) (.cse334 (or .cse42 .cse72)) (.cse331 (or .cse14 .cse642)) (.cse332 (or (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593) .cse20) .cse18))) .cse112))) (let ((.cse9 (or .cse112 (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimIndex_11 (_ BitVec 32))) (let ((.cse829 (select .cse8 v_arrayElimIndex_11))) (let ((.cse830 (bvadd (_ bv4294967292 32) v_arrayElimIndex_11)) (.cse827 (select |c_#length| .cse829)) (.cse828 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593))) (or (not (bvule v_arrayElimIndex_11 .cse827)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse828 .cse829) .cse830)) (not (bvule .cse830 v_arrayElimIndex_11)) (not (bvule (bvadd (_ bv4 32) v_arrayElimIndex_11) .cse827)) (= v_arrayElimIndex_11 |c_ULTIMATE.start_sll_prepend_~head#1.offset|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse828 .cse7) |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|)))))) .cse21)) (.cse11 (or .cse112 (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimIndex_11 (_ BitVec 32))) (let ((.cse825 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593)) (.cse826 (select .cse8 v_arrayElimIndex_11))) (let ((.cse823 (select .cse825 .cse826)) (.cse824 (bvadd (_ bv4294967292 32) v_arrayElimIndex_11)) (.cse822 (select |c_#length| .cse826))) (or (not (bvule v_arrayElimIndex_11 .cse822)) (= (select .cse823 |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse823 .cse824)) (not (bvule .cse824 v_arrayElimIndex_11)) (not (bvule (bvadd (_ bv4 32) v_arrayElimIndex_11) .cse822)) (= v_arrayElimIndex_11 |c_ULTIMATE.start_sll_prepend_~head#1.offset|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse825 .cse7) |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|)))))) .cse21)) (.cse231 (or (and .cse327 .cse328 .cse547 .cse329 .cse330 .cse334 .cse331 .cse332) .cse12 .cse15)) (.cse221 (forall ((v_arrayElimIndex_11 (_ BitVec 32))) (let ((.cse821 (select .cse8 v_arrayElimIndex_11))) (let ((.cse817 (bvadd (_ bv4294967292 32) v_arrayElimIndex_11)) (.cse816 (select |c_#length| .cse821))) (or (not (bvule v_arrayElimIndex_11 .cse816)) (not (bvule .cse817 v_arrayElimIndex_11)) (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse820 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593))) (let ((.cse818 (select .cse820 .cse821)) (.cse819 (select .cse820 .cse7))) (or (= (select .cse818 |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse818 .cse817)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse819 .cse817)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse819 |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|)))))) (not (bvule (bvadd (_ bv4 32) v_arrayElimIndex_11) .cse816)) (= v_arrayElimIndex_11 |c_ULTIMATE.start_sll_prepend_~head#1.offset|)))))) (.cse238 (or .cse767 .cse59)) (.cse177 (forall ((v_arrayElimIndex_11 (_ BitVec 32))) (let ((.cse815 (select .cse8 v_arrayElimIndex_11))) (let ((.cse811 (select |c_#length| .cse815)) (.cse812 (bvadd (_ bv4294967292 32) v_arrayElimIndex_11))) (or (not (bvule v_arrayElimIndex_11 .cse811)) (not (bvule .cse812 v_arrayElimIndex_11)) (not (bvule (bvadd (_ bv4 32) v_arrayElimIndex_11) .cse811)) (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse814 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593))) (let ((.cse813 (select .cse814 .cse815))) (or (= (select .cse813 |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse813 .cse812)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse814 .cse7) .cse812))))))))))) (.cse178 (forall ((v_arrayElimIndex_11 (_ BitVec 32))) (let ((.cse809 (select .cse8 v_arrayElimIndex_11))) (let ((.cse810 (bvadd (_ bv4294967292 32) v_arrayElimIndex_11)) (.cse807 (select |c_#length| .cse809))) (or (not (bvule v_arrayElimIndex_11 .cse807)) (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse808 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse808 .cse809) .cse810)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse808 .cse7) .cse810))))) (not (bvule .cse810 v_arrayElimIndex_11)) (not (bvule (bvadd (_ bv4 32) v_arrayElimIndex_11) .cse807))))))) (.cse184 (or .cse59 .cse797)) (.cse191 (or .cse14 (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimIndex_11 (_ BitVec 32))) (let ((.cse805 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593)) (.cse806 (select .cse8 v_arrayElimIndex_11))) (let ((.cse803 (select .cse805 .cse806)) (.cse804 (bvadd (_ bv4294967292 32) v_arrayElimIndex_11)) (.cse802 (select |c_#length| .cse806))) (or (not (bvule v_arrayElimIndex_11 .cse802)) (= (select .cse803 |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse803 .cse804)) (not (bvule .cse804 v_arrayElimIndex_11)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse805 .cse7) .cse804)) (not (bvule (bvadd (_ bv4 32) v_arrayElimIndex_11) .cse802)))))))) (.cse197 (forall ((v_arrayElimIndex_11 (_ BitVec 32))) (let ((.cse800 (select .cse8 v_arrayElimIndex_11))) (let ((.cse801 (bvadd (_ bv4294967292 32) v_arrayElimIndex_11)) (.cse798 (select |c_#length| .cse800))) (or (not (bvule v_arrayElimIndex_11 .cse798)) (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse799 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse799 .cse800) .cse801)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse799 .cse7) .cse801))))) (not (bvule .cse801 v_arrayElimIndex_11)) (not (bvule (bvadd (_ bv4 32) v_arrayElimIndex_11) .cse798)) (= v_arrayElimIndex_11 |c_ULTIMATE.start_sll_prepend_~head#1.offset|)))))) (.cse205 (or .cse42 .cse797)) (.cse148 (and .cse100 (forall ((v_arrayElimIndex_11 (_ BitVec 32))) (or (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_152 (_ BitVec 32))) (let ((.cse793 (select .cse8 v_arrayElimIndex_11))) (let ((.cse790 (select (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593) .cse793)) (.cse791 (bvadd v_arrayElimCell_152 (_ bv4 32))) (.cse792 (select |c_#length| .cse793))) (or (= (select .cse790 |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|) |c_ULTIMATE.start_main_~data~0#1|) (not (bvule .cse791 .cse792)) (= (select .cse790 v_arrayElimCell_152) |c_ULTIMATE.start_main_~data~0#1|) (not (bvule v_arrayElimCell_152 .cse791)) (not (bvule (bvadd v_arrayElimCell_152 (_ bv8 32)) .cse792)))))) (= v_arrayElimIndex_11 .cse0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| v_arrayElimIndex_11))) (forall ((v_arrayElimIndex_11 (_ BitVec 32))) (or (= v_arrayElimIndex_11 .cse0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| v_arrayElimIndex_11) (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_152 (_ BitVec 32))) (let ((.cse796 (select .cse8 v_arrayElimIndex_11))) (let ((.cse794 (bvadd v_arrayElimCell_152 (_ bv4 32))) (.cse795 (select |c_#length| .cse796))) (or (not (bvule .cse794 .cse795)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593) .cse796) v_arrayElimCell_152) |c_ULTIMATE.start_main_~data~0#1|) (not (bvule v_arrayElimCell_152 .cse794)) (not (bvule (bvadd v_arrayElimCell_152 (_ bv8 32)) .cse795)))))))))) (.cse212 (forall ((v_arrayElimIndex_11 (_ BitVec 32))) (let ((.cse789 (select .cse8 v_arrayElimIndex_11))) (let ((.cse785 (bvadd (_ bv4294967292 32) v_arrayElimIndex_11)) (.cse784 (select |c_#length| .cse789))) (or (not (bvule v_arrayElimIndex_11 .cse784)) (not (bvule .cse785 v_arrayElimIndex_11)) (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse788 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593))) (let ((.cse786 (select .cse788 .cse789)) (.cse787 (select .cse788 .cse7))) (or (= (select .cse786 |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse786 .cse785)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse787 .cse785)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse787 |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|)))))) (not (bvule (bvadd (_ bv4 32) v_arrayElimIndex_11) .cse784))))))) (.cse196 (or .cse14 .cse783)) (.cse240 (or .cse783 .cse28)) (.cse241 (or .cse773 .cse28)) (.cse198 (forall ((v_arrayElimIndex_11 (_ BitVec 32))) (let ((.cse781 (select .cse8 v_arrayElimIndex_11))) (let ((.cse779 (bvadd (_ bv4294967292 32) v_arrayElimIndex_11)) (.cse778 (select |c_#length| .cse781))) (or (not (bvule v_arrayElimIndex_11 .cse778)) (not (bvule .cse779 v_arrayElimIndex_11)) (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse780 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593))) (let ((.cse782 (select .cse780 .cse7))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse780 .cse781) .cse779)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse782 .cse779)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse782 |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|)))))) (not (bvule (bvadd (_ bv4 32) v_arrayElimIndex_11) .cse778)) (= v_arrayElimIndex_11 |c_ULTIMATE.start_sll_prepend_~head#1.offset|)))))) (.cse118 (or .cse112 (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimIndex_11 (_ BitVec 32)) (v_arrayElimCell_152 (_ BitVec 32))) (let ((.cse777 (select .cse8 v_arrayElimIndex_11))) (let ((.cse774 (bvadd v_arrayElimCell_152 (_ bv4 32))) (.cse776 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593)) (.cse775 (select |c_#length| .cse777))) (or (not (bvule .cse774 .cse775)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| v_arrayElimIndex_11) (= (select (select .cse776 .cse777) v_arrayElimCell_152) |c_ULTIMATE.start_main_~data~0#1|) (not (bvule v_arrayElimCell_152 .cse774)) (= v_arrayElimIndex_11 |c_ULTIMATE.start_sll_prepend_~head#1.offset|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse776 .cse7) |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|)) (not (bvule (bvadd v_arrayElimCell_152 (_ bv8 32)) .cse775)))))) .cse21)) (.cse242 (or .cse14 .cse773)) (.cse243 (or .cse112 (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimIndex_11 (_ BitVec 32)) (v_arrayElimCell_152 (_ BitVec 32))) (let ((.cse771 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593)) (.cse772 (select .cse8 v_arrayElimIndex_11))) (let ((.cse768 (select .cse771 .cse772)) (.cse769 (bvadd v_arrayElimCell_152 (_ bv4 32))) (.cse770 (select |c_#length| .cse772))) (or (= (select .cse768 |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|) |c_ULTIMATE.start_main_~data~0#1|) (not (bvule .cse769 .cse770)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| v_arrayElimIndex_11) (= (select .cse768 v_arrayElimCell_152) |c_ULTIMATE.start_main_~data~0#1|) (not (bvule v_arrayElimCell_152 .cse769)) (= v_arrayElimIndex_11 |c_ULTIMATE.start_sll_prepend_~head#1.offset|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse771 .cse7) |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|)) (not (bvule (bvadd v_arrayElimCell_152 (_ bv8 32)) .cse770)))))) .cse21)) (.cse244 (or .cse42 .cse767)) (.cse64 (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimIndex_11 (_ BitVec 32))) (let ((.cse765 (select .cse8 v_arrayElimIndex_11))) (let ((.cse766 (bvadd (_ bv4294967292 32) v_arrayElimIndex_11)) (.cse764 (select |c_#length| .cse765))) (or (not (bvule v_arrayElimIndex_11 .cse764)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593) .cse765) .cse766)) (not (bvule .cse766 v_arrayElimIndex_11)) (not (bvule (bvadd (_ bv4 32) v_arrayElimIndex_11) .cse764)) (= v_arrayElimIndex_11 .cse0) (= v_arrayElimIndex_11 |c_ULTIMATE.start_sll_prepend_~head#1.offset|)))))) (.cse99 (forall ((v_arrayElimIndex_11 (_ BitVec 32))) (or (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_152 (_ BitVec 32))) (let ((.cse763 (select .cse8 v_arrayElimIndex_11))) (let ((.cse760 (select (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593) .cse763)) (.cse761 (bvadd v_arrayElimCell_152 (_ bv4 32))) (.cse762 (select |c_#length| .cse763))) (or (= (select .cse760 |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|) |c_ULTIMATE.start_main_~data~0#1|) (not (bvule .cse761 .cse762)) (= (select .cse760 v_arrayElimCell_152) |c_ULTIMATE.start_main_~data~0#1|) (not (bvule v_arrayElimCell_152 .cse761)) (not (bvule (bvadd v_arrayElimCell_152 (_ bv8 32)) .cse762)))))) (= v_arrayElimIndex_11 .cse0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| v_arrayElimIndex_11) (= v_arrayElimIndex_11 |c_ULTIMATE.start_sll_prepend_~head#1.offset|)))) (.cse103 (or (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimIndex_11 (_ BitVec 32)) (v_arrayElimCell_152 (_ BitVec 32))) (let ((.cse759 (select .cse8 v_arrayElimIndex_11))) (let ((.cse757 (bvadd v_arrayElimCell_152 (_ bv4 32))) (.cse758 (select |c_#length| .cse759))) (or (not (bvule .cse757 .cse758)) (= v_arrayElimIndex_11 .cse0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| v_arrayElimIndex_11) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593) .cse759) v_arrayElimCell_152) |c_ULTIMATE.start_main_~data~0#1|) (not (bvule v_arrayElimCell_152 .cse757)) (= v_arrayElimIndex_11 |c_ULTIMATE.start_sll_prepend_~head#1.offset|) (not (bvule (bvadd v_arrayElimCell_152 (_ bv8 32)) .cse758)))))) .cse28)) (.cse275 (forall ((v_arrayElimCell_152 (_ BitVec 32))) (let ((.cse756 (bvadd v_arrayElimCell_152 (_ bv4 32)))) (or (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593) .cse7) v_arrayElimCell_152))) (not (bvule (bvadd v_arrayElimCell_152 (_ bv8 32)) .cse82)) (not (bvule .cse756 .cse82)) (not (bvule v_arrayElimCell_152 .cse756)))))) (.cse300 (forall ((v_arrayElimCell_152 (_ BitVec 32))) (let ((.cse754 (bvadd v_arrayElimCell_152 (_ bv4 32)))) (or (not (bvule (bvadd v_arrayElimCell_152 (_ bv8 32)) .cse82)) (not (bvule .cse754 .cse82)) (not (bvule v_arrayElimCell_152 .cse754)) (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse755 (select (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593) .cse7))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse755 v_arrayElimCell_152)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse755 |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|))))))))) (.cse276 (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimIndex_11 (_ BitVec 32)) (v_arrayElimCell_152 (_ BitVec 32))) (let ((.cse752 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593))) (let ((.cse751 (select .cse752 (select .cse8 v_arrayElimIndex_11))) (.cse753 (bvadd v_arrayElimCell_152 (_ bv4 32)))) (or (= (select .cse751 |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|) |c_ULTIMATE.start_main_~data~0#1|) (not (bvule (bvadd v_arrayElimCell_152 (_ bv8 32)) .cse82)) (= (select .cse751 v_arrayElimCell_152) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse752 .cse7) v_arrayElimCell_152)) (not (bvule .cse753 .cse82)) (not (bvule v_arrayElimCell_152 .cse753))))))) (.cse204 (let ((.cse724 (and (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimIndex_11 (_ BitVec 32)) (v_arrayElimCell_152 (_ BitVec 32))) (let ((.cse746 (select .cse8 v_arrayElimIndex_11))) (let ((.cse744 (bvadd v_arrayElimCell_152 (_ bv4 32))) (.cse745 (select |c_#length| .cse746))) (or (not (bvule .cse744 .cse745)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593) .cse746) v_arrayElimCell_152) |c_ULTIMATE.start_main_~data~0#1|) (not (bvule v_arrayElimCell_152 .cse744)) (not (bvule (bvadd v_arrayElimCell_152 (_ bv8 32)) .cse745)))))) .cse719 (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimIndex_11 (_ BitVec 32)) (v_arrayElimCell_152 (_ BitVec 32))) (let ((.cse750 (select .cse8 v_arrayElimIndex_11))) (let ((.cse747 (select (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593) .cse750)) (.cse748 (bvadd v_arrayElimCell_152 (_ bv4 32))) (.cse749 (select |c_#length| .cse750))) (or (= (select .cse747 |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|) |c_ULTIMATE.start_main_~data~0#1|) (not (bvule .cse748 .cse749)) (= (select .cse747 v_arrayElimCell_152) |c_ULTIMATE.start_main_~data~0#1|) (not (bvule v_arrayElimCell_152 .cse748)) (not (bvule (bvadd v_arrayElimCell_152 (_ bv8 32)) .cse749))))))))) (and (or .cse59 .cse724) (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimIndex_11 (_ BitVec 32)) (v_arrayElimCell_152 (_ BitVec 32))) (let ((.cse728 (select .cse8 v_arrayElimIndex_11))) (let ((.cse727 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593)) (.cse725 (bvadd v_arrayElimCell_152 (_ bv4 32))) (.cse726 (select |c_#length| .cse728))) (or (not (bvule .cse725 .cse726)) (= (select (select .cse727 .cse728) v_arrayElimCell_152) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse727 .cse7) v_arrayElimCell_152)) (not (bvule v_arrayElimCell_152 .cse725)) (not (bvule (bvadd v_arrayElimCell_152 (_ bv8 32)) .cse726)))))) (forall ((v_arrayElimIndex_11 (_ BitVec 32))) (or (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_152 (_ BitVec 32))) (let ((.cse732 (select .cse8 v_arrayElimIndex_11))) (let ((.cse731 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593)) (.cse729 (bvadd v_arrayElimCell_152 (_ bv4 32))) (.cse730 (select |c_#length| .cse732))) (or (not (bvule .cse729 .cse730)) (= (select (select .cse731 .cse732) v_arrayElimCell_152) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse731 .cse7) v_arrayElimCell_152)) (not (bvule v_arrayElimCell_152 .cse729)) (not (bvule (bvadd v_arrayElimCell_152 (_ bv8 32)) .cse730)))))) (= v_arrayElimIndex_11 |c_ULTIMATE.start_sll_prepend_~head#1.offset|))) .cse703 (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimIndex_11 (_ BitVec 32)) (v_arrayElimCell_152 (_ BitVec 32))) (let ((.cse738 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593)) (.cse737 (select .cse8 v_arrayElimIndex_11))) (let ((.cse733 (select .cse738 .cse737)) (.cse734 (bvadd v_arrayElimCell_152 (_ bv4 32))) (.cse736 (select .cse738 .cse7)) (.cse735 (select |c_#length| .cse737))) (or (= (select .cse733 |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|) |c_ULTIMATE.start_main_~data~0#1|) (not (bvule .cse734 .cse735)) (= (select .cse733 v_arrayElimCell_152) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse736 v_arrayElimCell_152)) (not (bvule v_arrayElimCell_152 .cse734)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse736 |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|)) (not (bvule (bvadd v_arrayElimCell_152 (_ bv8 32)) .cse735)))))) (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimIndex_11 (_ BitVec 32)) (v_arrayElimCell_152 (_ BitVec 32))) (let ((.cse742 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593)) (.cse743 (select .cse8 v_arrayElimIndex_11))) (let ((.cse739 (select .cse742 .cse743)) (.cse740 (bvadd v_arrayElimCell_152 (_ bv4 32))) (.cse741 (select |c_#length| .cse743))) (or (= (select .cse739 |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|) |c_ULTIMATE.start_main_~data~0#1|) (not (bvule .cse740 .cse741)) (= (select .cse739 v_arrayElimCell_152) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse742 .cse7) v_arrayElimCell_152)) (not (bvule v_arrayElimCell_152 .cse740)) (not (bvule (bvadd v_arrayElimCell_152 (_ bv8 32)) .cse741)))))) (or .cse42 .cse724) .cse710))) (.cse239 (let ((.cse700 (and (or (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimIndex_11 (_ BitVec 32)) (v_arrayElimCell_152 (_ BitVec 32))) (let ((.cse718 (select .cse8 v_arrayElimIndex_11))) (let ((.cse716 (bvadd v_arrayElimCell_152 (_ bv4 32))) (.cse717 (select |c_#length| .cse718))) (or (not (bvule .cse716 .cse717)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593) .cse718) v_arrayElimCell_152) |c_ULTIMATE.start_main_~data~0#1|) (not (bvule v_arrayElimCell_152 .cse716)) (= v_arrayElimIndex_11 |c_ULTIMATE.start_sll_prepend_~head#1.offset|) (not (bvule (bvadd v_arrayElimCell_152 (_ bv8 32)) .cse717)))))) .cse28) .cse719 (forall ((v_arrayElimIndex_11 (_ BitVec 32))) (or (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_152 (_ BitVec 32))) (let ((.cse723 (select .cse8 v_arrayElimIndex_11))) (let ((.cse720 (select (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593) .cse723)) (.cse721 (bvadd v_arrayElimCell_152 (_ bv4 32))) (.cse722 (select |c_#length| .cse723))) (or (= (select .cse720 |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|) |c_ULTIMATE.start_main_~data~0#1|) (not (bvule .cse721 .cse722)) (= (select .cse720 v_arrayElimCell_152) |c_ULTIMATE.start_main_~data~0#1|) (not (bvule v_arrayElimCell_152 .cse721)) (not (bvule (bvadd v_arrayElimCell_152 (_ bv8 32)) .cse722)))))) (= v_arrayElimIndex_11 |c_ULTIMATE.start_sll_prepend_~head#1.offset|))))) (.cse702 (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimIndex_11 (_ BitVec 32)) (v_arrayElimCell_152 (_ BitVec 32))) (let ((.cse714 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593)) (.cse715 (select .cse8 v_arrayElimIndex_11))) (let ((.cse711 (select .cse714 .cse715)) (.cse712 (bvadd v_arrayElimCell_152 (_ bv4 32))) (.cse713 (select |c_#length| .cse715))) (or (= (select .cse711 |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|) |c_ULTIMATE.start_main_~data~0#1|) (not (bvule .cse712 .cse713)) (= (select .cse711 v_arrayElimCell_152) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse714 .cse7) v_arrayElimCell_152)) (not (bvule v_arrayElimCell_152 .cse712)) (= v_arrayElimIndex_11 |c_ULTIMATE.start_sll_prepend_~head#1.offset|) (not (bvule (bvadd v_arrayElimCell_152 (_ bv8 32)) .cse713)))))))) (and (or .cse42 .cse700) (or .cse701 .cse28) (or .cse59 .cse700) (or .cse14 .cse702) .cse703 .cse436 (forall ((v_arrayElimIndex_11 (_ BitVec 32))) (or (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_152 (_ BitVec 32))) (let ((.cse709 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593)) (.cse708 (select .cse8 v_arrayElimIndex_11))) (let ((.cse704 (select .cse709 .cse708)) (.cse705 (bvadd v_arrayElimCell_152 (_ bv4 32))) (.cse707 (select .cse709 .cse7)) (.cse706 (select |c_#length| .cse708))) (or (= (select .cse704 |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|) |c_ULTIMATE.start_main_~data~0#1|) (not (bvule .cse705 .cse706)) (= (select .cse704 v_arrayElimCell_152) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse707 v_arrayElimCell_152)) (not (bvule v_arrayElimCell_152 .cse705)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse707 |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|)) (not (bvule (bvadd v_arrayElimCell_152 (_ bv8 32)) .cse706)))))) (= v_arrayElimIndex_11 |c_ULTIMATE.start_sll_prepend_~head#1.offset|))) .cse446 (or .cse702 .cse28) .cse710))) (.cse230 (and (or .cse59 .cse222) .cse223 .cse224 .cse225 .cse226 .cse227 .cse228 .cse229)) (.cse172 (or .cse97 (and (forall ((v_arrayElimIndex_11 (_ BitVec 32))) (or (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_151 (_ BitVec 32)) (v_arrayElimCell_152 (_ BitVec 32))) (let ((.cse689 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593))) (let ((.cse688 (bvadd v_arrayElimCell_151 (_ bv4 32))) (.cse686 (select .cse689 (select .cse8 v_arrayElimIndex_11))) (.cse687 (select .cse689 .cse7))) (or (not (bvule (bvadd v_arrayElimCell_151 (_ bv8 32)) .cse82)) (= (select .cse686 |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse687 v_arrayElimCell_151)) (not (bvule v_arrayElimCell_151 .cse688)) (not (bvule .cse688 .cse82)) (= (select .cse686 v_arrayElimCell_152) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse687 |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|)))))) (= v_arrayElimIndex_11 .cse0))) .cse85 (forall ((v_arrayElimIndex_11 (_ BitVec 32))) (or (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_151 (_ BitVec 32)) (v_arrayElimCell_152 (_ BitVec 32))) (let ((.cse691 (bvadd v_arrayElimCell_151 (_ bv4 32))) (.cse690 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593))) (or (not (bvule (bvadd v_arrayElimCell_151 (_ bv8 32)) .cse82)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse690 .cse7) v_arrayElimCell_151)) (not (bvule v_arrayElimCell_151 .cse691)) (not (bvule .cse691 .cse82)) (= (select (select .cse690 (select .cse8 v_arrayElimIndex_11)) v_arrayElimCell_152) |c_ULTIMATE.start_main_~data~0#1|)))) (= v_arrayElimIndex_11 .cse0))) (forall ((v_arrayElimIndex_11 (_ BitVec 32))) (or (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_151 (_ BitVec 32)) (v_arrayElimCell_152 (_ BitVec 32))) (let ((.cse693 (bvadd v_arrayElimCell_151 (_ bv4 32))) (.cse692 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593))) (or (not (bvule (bvadd v_arrayElimCell_151 (_ bv8 32)) .cse82)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse692 .cse7) v_arrayElimCell_151)) (not (bvule v_arrayElimCell_151 .cse693)) (not (bvule .cse693 .cse82)) (= (select (select .cse692 (select .cse8 v_arrayElimIndex_11)) v_arrayElimCell_152) |c_ULTIMATE.start_main_~data~0#1|)))) (= v_arrayElimIndex_11 .cse0) (= v_arrayElimIndex_11 |c_ULTIMATE.start_sll_prepend_~head#1.offset|))) .cse86 (forall ((v_arrayElimIndex_11 (_ BitVec 32))) (or (= v_arrayElimIndex_11 .cse0) (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_151 (_ BitVec 32)) (v_arrayElimCell_152 (_ BitVec 32))) (let ((.cse695 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593))) (let ((.cse696 (bvadd v_arrayElimCell_151 (_ bv4 32))) (.cse694 (select .cse695 (select .cse8 v_arrayElimIndex_11)))) (or (not (bvule (bvadd v_arrayElimCell_151 (_ bv8 32)) .cse82)) (= (select .cse694 |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse695 .cse7) v_arrayElimCell_151)) (not (bvule v_arrayElimCell_151 .cse696)) (not (bvule .cse696 .cse82)) (= (select .cse694 v_arrayElimCell_152) |c_ULTIMATE.start_main_~data~0#1|))))))) (forall ((v_arrayElimIndex_11 (_ BitVec 32))) (or (= v_arrayElimIndex_11 .cse0) (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_151 (_ BitVec 32)) (v_arrayElimCell_152 (_ BitVec 32))) (let ((.cse699 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593))) (let ((.cse698 (bvadd v_arrayElimCell_151 (_ bv4 32))) (.cse697 (select .cse699 .cse7))) (or (not (bvule (bvadd v_arrayElimCell_151 (_ bv8 32)) .cse82)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse697 v_arrayElimCell_151)) (not (bvule v_arrayElimCell_151 .cse698)) (not (bvule .cse698 .cse82)) (= (select (select .cse699 (select .cse8 v_arrayElimIndex_11)) v_arrayElimCell_152) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse697 |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|)))))) (= v_arrayElimIndex_11 |c_ULTIMATE.start_sll_prepend_~head#1.offset|)))) .cse98)) (.cse173 (or .cse1 (let ((.cse663 (and (or .cse372 .cse28) .cse102 .cse452 .cse453 .cse454)) (.cse676 (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimIndex_11 (_ BitVec 32)) (v_arrayElimCell_151 (_ BitVec 32)) (v_arrayElimCell_152 (_ BitVec 32))) (let ((.cse685 (select .cse8 v_arrayElimIndex_11))) (let ((.cse682 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593)) (.cse683 (bvadd v_arrayElimCell_152 (_ bv4 32))) (.cse684 (select |c_#length| .cse685))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse682 .cse7) v_arrayElimCell_151)) (not (bvule .cse683 .cse684)) (= v_arrayElimIndex_11 .cse0) (= (select (select .cse682 .cse685) v_arrayElimCell_152) |c_ULTIMATE.start_main_~data~0#1|) (not (bvule v_arrayElimCell_152 .cse683)) (= v_arrayElimIndex_11 |c_ULTIMATE.start_sll_prepend_~head#1.offset|) (not (bvule (bvadd v_arrayElimCell_152 (_ bv8 32)) .cse684))))))) (.cse675 (or (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimIndex_11 (_ BitVec 32)) (v_arrayElimCell_151 (_ BitVec 32)) (v_arrayElimCell_152 (_ BitVec 32))) (let ((.cse678 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593)) (.cse681 (select .cse8 v_arrayElimIndex_11))) (let ((.cse677 (select .cse678 .cse681)) (.cse679 (bvadd v_arrayElimCell_152 (_ bv4 32))) (.cse680 (select |c_#length| .cse681))) (or (= (select .cse677 |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse678 .cse7) v_arrayElimCell_151)) (not (bvule .cse679 .cse680)) (= v_arrayElimIndex_11 .cse0) (= (select .cse677 v_arrayElimCell_152) |c_ULTIMATE.start_main_~data~0#1|) (not (bvule v_arrayElimCell_152 .cse679)) (not (bvule (bvadd v_arrayElimCell_152 (_ bv8 32)) .cse680)))))) .cse28))) (and (forall ((v_arrayElimCell_152 (_ BitVec 32))) (let ((.cse645 (bvadd v_arrayElimCell_152 (_ bv4 32)))) (or (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_151 (_ BitVec 32))) (let ((.cse648 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593))) (let ((.cse643 (select .cse648 .cse7))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse643 v_arrayElimCell_151)) (forall ((v_arrayElimIndex_11 (_ BitVec 32))) (let ((.cse647 (select .cse8 v_arrayElimIndex_11))) (let ((.cse644 (select .cse648 .cse647)) (.cse646 (select |c_#length| .cse647))) (or (= (select .cse644 |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|) |c_ULTIMATE.start_main_~data~0#1|) (not (bvule .cse645 .cse646)) (= v_arrayElimIndex_11 .cse0) (= (select .cse644 v_arrayElimCell_152) |c_ULTIMATE.start_main_~data~0#1|) (= v_arrayElimIndex_11 |c_ULTIMATE.start_sll_prepend_~head#1.offset|) (not (bvule (bvadd v_arrayElimCell_152 (_ bv8 32)) .cse646)))))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse643 |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|)))))) (not (bvule v_arrayElimCell_152 .cse645))))) .cse10 (or .cse112 (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimIndex_11 (_ BitVec 32)) (v_arrayElimCell_152 (_ BitVec 32))) (let ((.cse652 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593)) (.cse653 (select .cse8 v_arrayElimIndex_11))) (let ((.cse649 (select .cse652 .cse653)) (.cse650 (bvadd v_arrayElimCell_152 (_ bv4 32))) (.cse651 (select |c_#length| .cse653))) (or (= (select .cse649 |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|) |c_ULTIMATE.start_main_~data~0#1|) (not (bvule .cse650 .cse651)) (= v_arrayElimIndex_11 .cse0) (= (select .cse649 v_arrayElimCell_152) |c_ULTIMATE.start_main_~data~0#1|) (not (bvule v_arrayElimCell_152 .cse650)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse652 .cse7) |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|)) (not (bvule (bvadd v_arrayElimCell_152 (_ bv8 32)) .cse651)))))) .cse21) .cse436 (forall ((v_arrayElimIndex_11 (_ BitVec 32))) (or (= v_arrayElimIndex_11 .cse0) (forall ((v_arrayElimCell_152 (_ BitVec 32))) (let ((.cse658 (select .cse8 v_arrayElimIndex_11))) (let ((.cse654 (bvadd v_arrayElimCell_152 (_ bv4 32))) (.cse655 (select |c_#length| .cse658))) (or (not (bvule .cse654 .cse655)) (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_151 (_ BitVec 32))) (let ((.cse657 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593))) (let ((.cse656 (select .cse657 .cse7))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse656 v_arrayElimCell_151)) (= (select (select .cse657 .cse658) v_arrayElimCell_152) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse656 |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|)))))) (not (bvule v_arrayElimCell_152 .cse654)) (not (bvule (bvadd v_arrayElimCell_152 (_ bv8 32)) .cse655)))))) (= v_arrayElimIndex_11 |c_ULTIMATE.start_sll_prepend_~head#1.offset|))) (or (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimIndex_11 (_ BitVec 32)) (v_arrayElimCell_151 (_ BitVec 32)) (v_arrayElimCell_152 (_ BitVec 32))) (let ((.cse662 (select .cse8 v_arrayElimIndex_11))) (let ((.cse659 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593)) (.cse660 (bvadd v_arrayElimCell_152 (_ bv4 32))) (.cse661 (select |c_#length| .cse662))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse659 .cse7) v_arrayElimCell_151)) (not (bvule .cse660 .cse661)) (= v_arrayElimIndex_11 .cse0) (= (select (select .cse659 .cse662) v_arrayElimCell_152) |c_ULTIMATE.start_main_~data~0#1|) (not (bvule v_arrayElimCell_152 .cse660)) (not (bvule (bvadd v_arrayElimCell_152 (_ bv8 32)) .cse661)))))) .cse28) (or .cse59 .cse663) (or (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimIndex_11 (_ BitVec 32)) (v_arrayElimCell_151 (_ BitVec 32)) (v_arrayElimCell_152 (_ BitVec 32))) (let ((.cse669 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593)) (.cse668 (select .cse8 v_arrayElimIndex_11))) (let ((.cse664 (select .cse669 .cse668)) (.cse666 (bvadd v_arrayElimCell_152 (_ bv4 32))) (.cse665 (select .cse669 .cse7)) (.cse667 (select |c_#length| .cse668))) (or (= (select .cse664 |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse665 v_arrayElimCell_151)) (not (bvule .cse666 .cse667)) (= v_arrayElimIndex_11 .cse0) (= (select .cse664 v_arrayElimCell_152) |c_ULTIMATE.start_main_~data~0#1|) (not (bvule v_arrayElimCell_152 .cse666)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse665 |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|)) (not (bvule (bvadd v_arrayElimCell_152 (_ bv8 32)) .cse667)))))) .cse28) (or .cse42 .cse663) (or (and (forall ((v_arrayElimCell_152 (_ BitVec 32))) (let ((.cse672 (bvadd v_arrayElimCell_152 (_ bv4 32)))) (or (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_151 (_ BitVec 32))) (let ((.cse670 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse670 .cse7) v_arrayElimCell_151)) (forall ((v_arrayElimIndex_11 (_ BitVec 32))) (let ((.cse674 (select .cse8 v_arrayElimIndex_11))) (let ((.cse671 (select .cse670 .cse674)) (.cse673 (select |c_#length| .cse674))) (or (= (select .cse671 |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|) |c_ULTIMATE.start_main_~data~0#1|) (not (bvule .cse672 .cse673)) (= v_arrayElimIndex_11 .cse0) (= (select .cse671 v_arrayElimCell_152) |c_ULTIMATE.start_main_~data~0#1|) (= v_arrayElimIndex_11 |c_ULTIMATE.start_sll_prepend_~head#1.offset|) (not (bvule (bvadd v_arrayElimCell_152 (_ bv8 32)) .cse673))))))))) (not (bvule v_arrayElimCell_152 .cse672))))) (or .cse12 .cse13 .cse15 .cse21 .cse137) .cse675) .cse14) (or .cse14 .cse676) (or .cse676 .cse28) (or .cse111 .cse12 .cse13 .cse14 .cse15 .cse21) .cse675)))) (.cse277 (not (bvule (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_prepend_~head#1.offset|) .cse82))) (.cse278 (not (bvule .cse18 |c_ULTIMATE.start_sll_prepend_~head#1.offset|))) (.cse279 (and .cse328 .cse642)) (.cse280 (not (bvule |c_ULTIMATE.start_sll_prepend_~head#1.offset| .cse82))) (.cse174 (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse641))) (and (or (= |c_ULTIMATE.start_main_~#s~0#1.offset| .cse0) (and (or .cse1 (let ((.cse35 (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimIndex_11 (_ BitVec 32)) (v_arrayElimCell_151 (_ BitVec 32))) (let ((.cse80 (select .cse8 v_arrayElimIndex_11))) (let ((.cse79 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593)) (.cse81 (bvadd (_ bv4294967292 32) v_arrayElimIndex_11)) (.cse78 (select |c_#length| .cse80))) (or (not (bvule v_arrayElimIndex_11 .cse78)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse79 .cse7) v_arrayElimCell_151)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse79 .cse80) .cse81)) (not (bvule .cse81 v_arrayElimIndex_11)) (not (bvule (bvadd (_ bv4 32) v_arrayElimIndex_11) .cse78)) (= v_arrayElimIndex_11 .cse0) (= v_arrayElimIndex_11 |c_ULTIMATE.start_sll_prepend_~head#1.offset|)))))) (.cse36 (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_151 (_ BitVec 32))) (let ((.cse73 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse73 .cse7) v_arrayElimCell_151)) (forall ((v_arrayElimIndex_11 (_ BitVec 32))) (let ((.cse77 (select .cse8 v_arrayElimIndex_11))) (let ((.cse75 (select .cse73 .cse77)) (.cse76 (bvadd (_ bv4294967292 32) v_arrayElimIndex_11)) (.cse74 (select |c_#length| .cse77))) (or (not (bvule v_arrayElimIndex_11 .cse74)) (= (select .cse75 |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse75 .cse76)) (not (bvule .cse76 v_arrayElimIndex_11)) (not (bvule (bvadd (_ bv4 32) v_arrayElimIndex_11) .cse74)) (= v_arrayElimIndex_11 .cse0) (= v_arrayElimIndex_11 |c_ULTIMATE.start_sll_prepend_~head#1.offset|))))))))) (.cse43 (and (or (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimIndex_11 (_ BitVec 32))) (let ((.cse63 (select .cse8 v_arrayElimIndex_11))) (let ((.cse61 (select (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593) .cse63)) (.cse62 (bvadd (_ bv4294967292 32) v_arrayElimIndex_11)) (.cse60 (select |c_#length| .cse63))) (or (not (bvule v_arrayElimIndex_11 .cse60)) (= (select .cse61 |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse61 .cse62)) (not (bvule .cse62 v_arrayElimIndex_11)) (not (bvule (bvadd (_ bv4 32) v_arrayElimIndex_11) .cse60)) (= v_arrayElimIndex_11 .cse0))))) .cse28) .cse64 (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimIndex_11 (_ BitVec 32))) (let ((.cse68 (select .cse8 v_arrayElimIndex_11))) (let ((.cse66 (select (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593) .cse68)) (.cse67 (bvadd (_ bv4294967292 32) v_arrayElimIndex_11)) (.cse65 (select |c_#length| .cse68))) (or (not (bvule v_arrayElimIndex_11 .cse65)) (= (select .cse66 |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse66 .cse67)) (not (bvule .cse67 v_arrayElimIndex_11)) (not (bvule (bvadd (_ bv4 32) v_arrayElimIndex_11) .cse65)) (= v_arrayElimIndex_11 .cse0) (= v_arrayElimIndex_11 |c_ULTIMATE.start_sll_prepend_~head#1.offset|))))) (or (and .cse64 (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimIndex_11 (_ BitVec 32))) (let ((.cse70 (select .cse8 v_arrayElimIndex_11))) (let ((.cse71 (bvadd (_ bv4294967292 32) v_arrayElimIndex_11)) (.cse69 (select |c_#length| .cse70))) (or (not (bvule v_arrayElimIndex_11 .cse69)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593) .cse70) .cse71)) (not (bvule .cse71 v_arrayElimIndex_11)) (not (bvule (bvadd (_ bv4 32) v_arrayElimIndex_11) .cse69)) (= v_arrayElimIndex_11 .cse0)))))) .cse28) (or .cse12 .cse13 .cse14 .cse72 .cse15 .cse21)))) (and (forall ((v_arrayElimIndex_11 (_ BitVec 32))) (let ((.cse6 (select .cse8 v_arrayElimIndex_11))) (let ((.cse2 (select |c_#length| .cse6)) (.cse3 (bvadd (_ bv4294967292 32) v_arrayElimIndex_11))) (or (not (bvule v_arrayElimIndex_11 .cse2)) (not (bvule .cse3 v_arrayElimIndex_11)) (not (bvule (bvadd (_ bv4 32) v_arrayElimIndex_11) .cse2)) (= v_arrayElimIndex_11 .cse0) (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_151 (_ BitVec 32))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593))) (let ((.cse4 (select .cse5 .cse7))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse4 v_arrayElimCell_151)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse5 .cse6) .cse3)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse4 |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|)))))) (= v_arrayElimIndex_11 |c_ULTIMATE.start_sll_prepend_~head#1.offset|))))) .cse9 .cse10 .cse11 (or .cse12 .cse13 .cse14 .cse15 (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_151 (_ BitVec 32))) (let ((.cse19 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593))) (let ((.cse17 (select .cse19 .cse20)) (.cse16 (select .cse19 .cse7))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse16 v_arrayElimCell_151)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse17 .cse18)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse17 |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse16 |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|)))))) .cse21) (or (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimIndex_11 (_ BitVec 32)) (v_arrayElimCell_151 (_ BitVec 32))) (let ((.cse26 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593)) (.cse27 (select .cse8 v_arrayElimIndex_11))) (let ((.cse23 (select .cse26 .cse27)) (.cse25 (bvadd (_ bv4294967292 32) v_arrayElimIndex_11)) (.cse22 (select |c_#length| .cse27)) (.cse24 (select .cse26 .cse7))) (or (not (bvule v_arrayElimIndex_11 .cse22)) (= (select .cse23 |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse24 v_arrayElimCell_151)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse23 .cse25)) (not (bvule .cse25 v_arrayElimIndex_11)) (not (bvule (bvadd (_ bv4 32) v_arrayElimIndex_11) .cse22)) (= v_arrayElimIndex_11 .cse0) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse24 |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|)))))) .cse28) (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_151 (_ BitVec 32))) (let ((.cse34 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593))) (let ((.cse29 (select .cse34 .cse7))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse29 v_arrayElimCell_151)) (forall ((v_arrayElimIndex_11 (_ BitVec 32))) (let ((.cse33 (select .cse8 v_arrayElimIndex_11))) (let ((.cse31 (select .cse34 .cse33)) (.cse32 (bvadd (_ bv4294967292 32) v_arrayElimIndex_11)) (.cse30 (select |c_#length| .cse33))) (or (not (bvule v_arrayElimIndex_11 .cse30)) (= (select .cse31 |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse31 .cse32)) (not (bvule .cse32 v_arrayElimIndex_11)) (not (bvule (bvadd (_ bv4 32) v_arrayElimIndex_11) .cse30)) (= v_arrayElimIndex_11 .cse0) (= v_arrayElimIndex_11 |c_ULTIMATE.start_sll_prepend_~head#1.offset|))))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse29 |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|)))))) (or .cse14 .cse35) (or (and .cse36 (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_151 (_ BitVec 32))) (let ((.cse37 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse37 .cse7) v_arrayElimCell_151)) (forall ((v_arrayElimIndex_11 (_ BitVec 32))) (let ((.cse41 (select .cse8 v_arrayElimIndex_11))) (let ((.cse39 (select .cse37 .cse41)) (.cse40 (bvadd (_ bv4294967292 32) v_arrayElimIndex_11)) (.cse38 (select |c_#length| .cse41))) (or (not (bvule v_arrayElimIndex_11 .cse38)) (= (select .cse39 |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse39 .cse40)) (not (bvule .cse40 v_arrayElimIndex_11)) (not (bvule (bvadd (_ bv4 32) v_arrayElimIndex_11) .cse38)) (= v_arrayElimIndex_11 .cse0))))))))) .cse28) (or .cse42 .cse43) (or (and (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_151 (_ BitVec 32))) (let ((.cse44 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse44 .cse7) v_arrayElimCell_151)) (forall ((v_arrayElimIndex_11 (_ BitVec 32))) (let ((.cse46 (select .cse8 v_arrayElimIndex_11))) (let ((.cse47 (bvadd (_ bv4294967292 32) v_arrayElimIndex_11)) (.cse45 (select |c_#length| .cse46))) (or (not (bvule v_arrayElimIndex_11 .cse45)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse44 .cse46) .cse47)) (not (bvule .cse47 v_arrayElimIndex_11)) (not (bvule (bvadd (_ bv4 32) v_arrayElimIndex_11) .cse45)) (= v_arrayElimIndex_11 .cse0)))))))) (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_151 (_ BitVec 32))) (let ((.cse48 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse48 .cse7) v_arrayElimCell_151)) (forall ((v_arrayElimIndex_11 (_ BitVec 32))) (let ((.cse50 (select .cse8 v_arrayElimIndex_11))) (let ((.cse51 (bvadd (_ bv4294967292 32) v_arrayElimIndex_11)) (.cse49 (select |c_#length| .cse50))) (or (not (bvule v_arrayElimIndex_11 .cse49)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse48 .cse50) .cse51)) (not (bvule .cse51 v_arrayElimIndex_11)) (not (bvule (bvadd (_ bv4 32) v_arrayElimIndex_11) .cse49)) (= v_arrayElimIndex_11 .cse0) (= v_arrayElimIndex_11 |c_ULTIMATE.start_sll_prepend_~head#1.offset|))))))))) .cse28) (or .cse35 .cse28) (or (and .cse36 (or (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimIndex_11 (_ BitVec 32)) (v_arrayElimCell_151 (_ BitVec 32))) (let ((.cse54 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593)) (.cse56 (select .cse8 v_arrayElimIndex_11))) (let ((.cse53 (select .cse54 .cse56)) (.cse55 (bvadd (_ bv4294967292 32) v_arrayElimIndex_11)) (.cse52 (select |c_#length| .cse56))) (or (not (bvule v_arrayElimIndex_11 .cse52)) (= (select .cse53 |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse54 .cse7) v_arrayElimCell_151)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse53 .cse55)) (not (bvule .cse55 v_arrayElimIndex_11)) (not (bvule (bvadd (_ bv4 32) v_arrayElimIndex_11) .cse52)) (= v_arrayElimIndex_11 .cse0))))) .cse28) (or .cse12 .cse13 .cse15 (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_151 (_ BitVec 32))) (let ((.cse57 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593))) (let ((.cse58 (select .cse57 .cse20))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse57 .cse7) v_arrayElimCell_151)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse58 .cse18)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse58 |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|)))))) .cse21)) .cse14) (or .cse59 .cse43)))) (or (and (forall ((v_arrayElimIndex_11 (_ BitVec 32))) (or (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_151 (_ BitVec 32)) (v_arrayElimCell_152 (_ BitVec 32))) (let ((.cse84 (bvadd v_arrayElimCell_151 (_ bv4 32))) (.cse83 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593))) (or (not (bvule (bvadd v_arrayElimCell_151 (_ bv8 32)) .cse82)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse83 .cse7) v_arrayElimCell_151)) (not (bvule v_arrayElimCell_151 .cse84)) (not (bvule .cse84 .cse82)) (= (select (select .cse83 (select .cse8 v_arrayElimIndex_11)) v_arrayElimCell_152) |c_ULTIMATE.start_main_~data~0#1|)))) (= v_arrayElimIndex_11 .cse0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| v_arrayElimIndex_11))) .cse85 .cse86 (forall ((v_arrayElimIndex_11 (_ BitVec 32))) (or (= v_arrayElimIndex_11 .cse0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| v_arrayElimIndex_11) (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_151 (_ BitVec 32)) (v_arrayElimCell_152 (_ BitVec 32))) (let ((.cse88 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593))) (let ((.cse89 (bvadd v_arrayElimCell_151 (_ bv4 32))) (.cse87 (select .cse88 (select .cse8 v_arrayElimIndex_11)))) (or (not (bvule (bvadd v_arrayElimCell_151 (_ bv8 32)) .cse82)) (= (select .cse87 |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse88 .cse7) v_arrayElimCell_151)) (not (bvule v_arrayElimCell_151 .cse89)) (not (bvule .cse89 .cse82)) (= (select .cse87 v_arrayElimCell_152) |c_ULTIMATE.start_main_~data~0#1|))))))) (forall ((v_arrayElimIndex_11 (_ BitVec 32))) (or (= v_arrayElimIndex_11 .cse0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| v_arrayElimIndex_11) (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_151 (_ BitVec 32)) (v_arrayElimCell_152 (_ BitVec 32))) (let ((.cse92 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593))) (let ((.cse91 (bvadd v_arrayElimCell_151 (_ bv4 32))) (.cse90 (select .cse92 .cse7))) (or (not (bvule (bvadd v_arrayElimCell_151 (_ bv8 32)) .cse82)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse90 v_arrayElimCell_151)) (not (bvule v_arrayElimCell_151 .cse91)) (not (bvule .cse91 .cse82)) (= (select (select .cse92 (select .cse8 v_arrayElimIndex_11)) v_arrayElimCell_152) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse90 |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|)))))))) (forall ((v_arrayElimIndex_11 (_ BitVec 32))) (or (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_151 (_ BitVec 32)) (v_arrayElimCell_152 (_ BitVec 32))) (let ((.cse96 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593))) (let ((.cse95 (bvadd v_arrayElimCell_151 (_ bv4 32))) (.cse93 (select .cse96 (select .cse8 v_arrayElimIndex_11))) (.cse94 (select .cse96 .cse7))) (or (not (bvule (bvadd v_arrayElimCell_151 (_ bv8 32)) .cse82)) (= (select .cse93 |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse94 v_arrayElimCell_151)) (not (bvule v_arrayElimCell_151 .cse95)) (not (bvule .cse95 .cse82)) (= (select .cse93 v_arrayElimCell_152) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse94 |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|)))))) (= v_arrayElimIndex_11 .cse0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| v_arrayElimIndex_11)))) .cse97 .cse98) (or .cse1 (let ((.cse109 (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimIndex_11 (_ BitVec 32)) (v_arrayElimCell_151 (_ BitVec 32)) (v_arrayElimCell_152 (_ BitVec 32))) (let ((.cse152 (select .cse8 v_arrayElimIndex_11))) (let ((.cse149 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593)) (.cse150 (bvadd v_arrayElimCell_152 (_ bv4 32))) (.cse151 (select |c_#length| .cse152))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse149 .cse7) v_arrayElimCell_151)) (not (bvule .cse150 .cse151)) (= v_arrayElimIndex_11 .cse0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| v_arrayElimIndex_11) (= (select (select .cse149 .cse152) v_arrayElimCell_152) |c_ULTIMATE.start_main_~data~0#1|) (not (bvule v_arrayElimCell_152 .cse150)) (= v_arrayElimIndex_11 |c_ULTIMATE.start_sll_prepend_~head#1.offset|) (not (bvule (bvadd v_arrayElimCell_152 (_ bv8 32)) .cse151))))))) (.cse101 (or .cse148 .cse28)) (.cse110 (or (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimIndex_11 (_ BitVec 32)) (v_arrayElimCell_151 (_ BitVec 32)) (v_arrayElimCell_152 (_ BitVec 32))) (let ((.cse144 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593)) (.cse147 (select .cse8 v_arrayElimIndex_11))) (let ((.cse143 (select .cse144 .cse147)) (.cse145 (bvadd v_arrayElimCell_152 (_ bv4 32))) (.cse146 (select |c_#length| .cse147))) (or (= (select .cse143 |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse144 .cse7) v_arrayElimCell_151)) (not (bvule .cse145 .cse146)) (= v_arrayElimIndex_11 .cse0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| v_arrayElimIndex_11) (= (select .cse143 v_arrayElimCell_152) |c_ULTIMATE.start_main_~data~0#1|) (not (bvule v_arrayElimCell_152 .cse145)) (not (bvule (bvadd v_arrayElimCell_152 (_ bv8 32)) .cse146)))))) .cse28))) (and (or .cse59 (and .cse99 .cse100 .cse101 .cse102 .cse103)) (forall ((v_arrayElimIndex_11 (_ BitVec 32))) (or (= v_arrayElimIndex_11 .cse0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| v_arrayElimIndex_11) (forall ((v_arrayElimCell_152 (_ BitVec 32))) (let ((.cse108 (select .cse8 v_arrayElimIndex_11))) (let ((.cse104 (bvadd v_arrayElimCell_152 (_ bv4 32))) (.cse105 (select |c_#length| .cse108))) (or (not (bvule .cse104 .cse105)) (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_151 (_ BitVec 32))) (let ((.cse107 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593))) (let ((.cse106 (select .cse107 .cse7))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse106 v_arrayElimCell_151)) (= (select (select .cse107 .cse108) v_arrayElimCell_152) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse106 |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|)))))) (not (bvule v_arrayElimCell_152 .cse104)) (not (bvule (bvadd v_arrayElimCell_152 (_ bv8 32)) .cse105)))))) (= v_arrayElimIndex_11 |c_ULTIMATE.start_sll_prepend_~head#1.offset|))) (or .cse109 .cse28) .cse110 (or .cse111 .cse12 .cse13 .cse14 .cse59 .cse15 .cse21) (or .cse112 (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimIndex_11 (_ BitVec 32)) (v_arrayElimCell_152 (_ BitVec 32))) (let ((.cse116 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593)) (.cse117 (select .cse8 v_arrayElimIndex_11))) (let ((.cse113 (select .cse116 .cse117)) (.cse114 (bvadd v_arrayElimCell_152 (_ bv4 32))) (.cse115 (select |c_#length| .cse117))) (or (= (select .cse113 |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|) |c_ULTIMATE.start_main_~data~0#1|) (not (bvule .cse114 .cse115)) (= v_arrayElimIndex_11 .cse0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| v_arrayElimIndex_11) (= (select .cse113 v_arrayElimCell_152) |c_ULTIMATE.start_main_~data~0#1|) (not (bvule v_arrayElimCell_152 .cse114)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse116 .cse7) |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|)) (not (bvule (bvadd v_arrayElimCell_152 (_ bv8 32)) .cse115)))))) .cse21) .cse118 (or (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimIndex_11 (_ BitVec 32)) (v_arrayElimCell_151 (_ BitVec 32)) (v_arrayElimCell_152 (_ BitVec 32))) (let ((.cse124 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593)) (.cse123 (select .cse8 v_arrayElimIndex_11))) (let ((.cse119 (select .cse124 .cse123)) (.cse121 (bvadd v_arrayElimCell_152 (_ bv4 32))) (.cse120 (select .cse124 .cse7)) (.cse122 (select |c_#length| .cse123))) (or (= (select .cse119 |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse120 v_arrayElimCell_151)) (not (bvule .cse121 .cse122)) (= v_arrayElimIndex_11 .cse0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| v_arrayElimIndex_11) (= (select .cse119 v_arrayElimCell_152) |c_ULTIMATE.start_main_~data~0#1|) (not (bvule v_arrayElimCell_152 .cse121)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse120 |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|)) (not (bvule (bvadd v_arrayElimCell_152 (_ bv8 32)) .cse122)))))) .cse28) (or .cse125 .cse12 .cse14 .cse59 .cse15 .cse21) (forall ((v_arrayElimCell_152 (_ BitVec 32))) (let ((.cse127 (bvadd v_arrayElimCell_152 (_ bv4 32)))) (or (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_151 (_ BitVec 32))) (let ((.cse130 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593))) (let ((.cse131 (select .cse130 .cse7))) (or (forall ((v_arrayElimIndex_11 (_ BitVec 32))) (let ((.cse129 (select .cse8 v_arrayElimIndex_11))) (let ((.cse126 (select .cse130 .cse129)) (.cse128 (select |c_#length| .cse129))) (or (= (select .cse126 |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|) |c_ULTIMATE.start_main_~data~0#1|) (not (bvule .cse127 .cse128)) (= v_arrayElimIndex_11 .cse0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| v_arrayElimIndex_11) (= (select .cse126 v_arrayElimCell_152) |c_ULTIMATE.start_main_~data~0#1|) (= v_arrayElimIndex_11 |c_ULTIMATE.start_sll_prepend_~head#1.offset|) (not (bvule (bvadd v_arrayElimCell_152 (_ bv8 32)) .cse128)))))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse131 v_arrayElimCell_151)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse131 |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|)))))) (not (bvule v_arrayElimCell_152 .cse127))))) (or .cse109 .cse14) (or (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimIndex_11 (_ BitVec 32)) (v_arrayElimCell_151 (_ BitVec 32)) (v_arrayElimCell_152 (_ BitVec 32))) (let ((.cse135 (select .cse8 v_arrayElimIndex_11))) (let ((.cse132 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593)) (.cse133 (bvadd v_arrayElimCell_152 (_ bv4 32))) (.cse134 (select |c_#length| .cse135))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse132 .cse7) v_arrayElimCell_151)) (not (bvule .cse133 .cse134)) (= v_arrayElimIndex_11 .cse0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| v_arrayElimIndex_11) (= (select (select .cse132 .cse135) v_arrayElimCell_152) |c_ULTIMATE.start_main_~data~0#1|) (not (bvule v_arrayElimCell_152 .cse133)) (not (bvule (bvadd v_arrayElimCell_152 (_ bv8 32)) .cse134)))))) .cse28) (or .cse42 (and .cse99 .cse100 .cse101 .cse103 (or .cse14 .cse59 .cse15 .cse21 .cse136))) (or (and (or .cse12 .cse13 .cse59 .cse15 .cse21 .cse137) (forall ((v_arrayElimCell_152 (_ BitVec 32))) (let ((.cse139 (bvadd v_arrayElimCell_152 (_ bv4 32)))) (or (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_151 (_ BitVec 32))) (let ((.cse142 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593))) (or (forall ((v_arrayElimIndex_11 (_ BitVec 32))) (let ((.cse141 (select .cse8 v_arrayElimIndex_11))) (let ((.cse138 (select .cse142 .cse141)) (.cse140 (select |c_#length| .cse141))) (or (= (select .cse138 |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|) |c_ULTIMATE.start_main_~data~0#1|) (not (bvule .cse139 .cse140)) (= v_arrayElimIndex_11 .cse0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| v_arrayElimIndex_11) (= (select .cse138 v_arrayElimCell_152) |c_ULTIMATE.start_main_~data~0#1|) (= v_arrayElimIndex_11 |c_ULTIMATE.start_sll_prepend_~head#1.offset|) (not (bvule (bvadd v_arrayElimCell_152 (_ bv8 32)) .cse140)))))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse142 .cse7) v_arrayElimCell_151))))) (not (bvule v_arrayElimCell_152 .cse139))))) .cse110) .cse14)))) (or (and .cse85 (forall ((v_arrayElimIndex_11 (_ BitVec 32))) (or (= v_arrayElimIndex_11 .cse0) (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_151 (_ BitVec 32))) (let ((.cse156 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593))) (let ((.cse153 (select .cse156 (select .cse8 v_arrayElimIndex_11))) (.cse155 (bvadd v_arrayElimCell_151 (_ bv4 32))) (.cse154 (select .cse156 .cse7))) (or (not (bvule (bvadd v_arrayElimCell_151 (_ bv8 32)) .cse82)) (= (select .cse153 |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse154 v_arrayElimCell_151)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse153 (bvadd (_ bv4294967292 32) v_arrayElimIndex_11))) (not (bvule v_arrayElimCell_151 .cse155)) (not (bvule .cse155 .cse82)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse154 |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|)))))))) (forall ((v_arrayElimIndex_11 (_ BitVec 32))) (or (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_151 (_ BitVec 32))) (let ((.cse158 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593))) (let ((.cse159 (bvadd v_arrayElimCell_151 (_ bv4 32))) (.cse157 (select .cse158 .cse7))) (or (not (bvule (bvadd v_arrayElimCell_151 (_ bv8 32)) .cse82)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse157 v_arrayElimCell_151)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse158 (select .cse8 v_arrayElimIndex_11)) (bvadd (_ bv4294967292 32) v_arrayElimIndex_11))) (not (bvule v_arrayElimCell_151 .cse159)) (not (bvule .cse159 .cse82)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse157 |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|)))))) (= v_arrayElimIndex_11 .cse0) (= v_arrayElimIndex_11 |c_ULTIMATE.start_sll_prepend_~head#1.offset|))) (or (and (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_151 (_ BitVec 32))) (let ((.cse162 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593))) (let ((.cse161 (bvadd v_arrayElimCell_151 (_ bv4 32))) (.cse160 (select .cse162 .cse7))) (or (not (bvule (bvadd v_arrayElimCell_151 (_ bv8 32)) .cse82)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse160 v_arrayElimCell_151)) (not (bvule v_arrayElimCell_151 .cse161)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse162 .cse20) |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|)) (not (bvule .cse161 .cse82)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse160 |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|)))))) (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_151 (_ BitVec 32))) (let ((.cse163 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593)) (.cse164 (bvadd v_arrayElimCell_151 (_ bv4 32)))) (or (not (bvule (bvadd v_arrayElimCell_151 (_ bv8 32)) .cse82)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse163 .cse7) v_arrayElimCell_151)) (not (bvule v_arrayElimCell_151 .cse164)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse163 .cse20) |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|)) (not (bvule .cse164 .cse82)))))) .cse21) .cse86 (forall ((v_arrayElimIndex_11 (_ BitVec 32))) (or (= v_arrayElimIndex_11 .cse0) (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_151 (_ BitVec 32))) (let ((.cse165 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593)) (.cse166 (bvadd v_arrayElimCell_151 (_ bv4 32)))) (or (not (bvule (bvadd v_arrayElimCell_151 (_ bv8 32)) .cse82)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse165 .cse7) v_arrayElimCell_151)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse165 (select .cse8 v_arrayElimIndex_11)) (bvadd (_ bv4294967292 32) v_arrayElimIndex_11))) (not (bvule v_arrayElimCell_151 .cse166)) (not (bvule .cse166 .cse82))))) (= v_arrayElimIndex_11 |c_ULTIMATE.start_sll_prepend_~head#1.offset|))) (or (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimIndex_11 (_ BitVec 32)) (v_arrayElimCell_151 (_ BitVec 32))) (let ((.cse167 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593)) (.cse168 (bvadd v_arrayElimCell_151 (_ bv4 32)))) (or (not (bvule (bvadd v_arrayElimCell_151 (_ bv8 32)) .cse82)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse167 .cse7) v_arrayElimCell_151)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse167 (select .cse8 v_arrayElimIndex_11)) (bvadd (_ bv4294967292 32) v_arrayElimIndex_11))) (not (bvule v_arrayElimCell_151 .cse168)) (not (bvule .cse168 .cse82)) (= v_arrayElimIndex_11 .cse0)))) .cse28) (forall ((v_arrayElimIndex_11 (_ BitVec 32))) (or (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_151 (_ BitVec 32))) (let ((.cse170 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593))) (let ((.cse169 (select .cse170 (select .cse8 v_arrayElimIndex_11))) (.cse171 (bvadd v_arrayElimCell_151 (_ bv4 32)))) (or (not (bvule (bvadd v_arrayElimCell_151 (_ bv8 32)) .cse82)) (= (select .cse169 |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse170 .cse7) v_arrayElimCell_151)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse169 (bvadd (_ bv4294967292 32) v_arrayElimIndex_11))) (not (bvule v_arrayElimCell_151 .cse171)) (not (bvule .cse171 .cse82)))))) (= v_arrayElimIndex_11 .cse0)))) .cse97 .cse98) (or (and .cse172 .cse173) .cse174) (or .cse1 (let ((.cse213 (forall ((v_arrayElimIndex_11 (_ BitVec 32))) (or (= |c_ULTIMATE.start_main_~#s~0#1.offset| v_arrayElimIndex_11) (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_152 (_ BitVec 32))) (let ((.cse270 (select .cse8 v_arrayElimIndex_11))) (let ((.cse268 (bvadd v_arrayElimCell_152 (_ bv4 32))) (.cse269 (select |c_#length| .cse270))) (or (not (bvule .cse268 .cse269)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593) .cse270) v_arrayElimCell_152) |c_ULTIMATE.start_main_~data~0#1|) (not (bvule v_arrayElimCell_152 .cse268)) (not (bvule (bvadd v_arrayElimCell_152 (_ bv8 32)) .cse269)))))) (= v_arrayElimIndex_11 |c_ULTIMATE.start_sll_prepend_~head#1.offset|)))) (.cse246 (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimIndex_11 (_ BitVec 32)) (v_arrayElimCell_152 (_ BitVec 32))) (let ((.cse267 (select .cse8 v_arrayElimIndex_11))) (let ((.cse266 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593)) (.cse264 (bvadd v_arrayElimCell_152 (_ bv4 32))) (.cse265 (select |c_#length| .cse267))) (or (not (bvule .cse264 .cse265)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| v_arrayElimIndex_11) (= (select (select .cse266 .cse267) v_arrayElimCell_152) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse266 .cse7) v_arrayElimCell_152)) (not (bvule v_arrayElimCell_152 .cse264)) (= v_arrayElimIndex_11 |c_ULTIMATE.start_sll_prepend_~head#1.offset|) (not (bvule (bvadd v_arrayElimCell_152 (_ bv8 32)) .cse265)))))))) (let ((.cse176 (forall ((v_arrayElimIndex_11 (_ BitVec 32))) (or (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_152 (_ BitVec 32))) (let ((.cse262 (select .cse8 v_arrayElimIndex_11)) (.cse261 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593))) (let ((.cse259 (bvadd v_arrayElimCell_152 (_ bv4 32))) (.cse263 (select .cse261 .cse7)) (.cse260 (select |c_#length| .cse262))) (or (not (bvule .cse259 .cse260)) (= (select (select .cse261 .cse262) v_arrayElimCell_152) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse263 v_arrayElimCell_152)) (not (bvule v_arrayElimCell_152 .cse259)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse263 |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|)) (not (bvule (bvadd v_arrayElimCell_152 (_ bv8 32)) .cse260)))))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| v_arrayElimIndex_11) (= v_arrayElimIndex_11 |c_ULTIMATE.start_sll_prepend_~head#1.offset|)))) (.cse199 (or .cse246 .cse14)) (.cse175 (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimIndex_11 (_ BitVec 32)) (v_arrayElimCell_152 (_ BitVec 32))) (let ((.cse257 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593)) (.cse258 (select .cse8 v_arrayElimIndex_11))) (let ((.cse254 (select .cse257 .cse258)) (.cse255 (bvadd v_arrayElimCell_152 (_ bv4 32))) (.cse256 (select |c_#length| .cse258))) (or (= (select .cse254 |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|) |c_ULTIMATE.start_main_~data~0#1|) (not (bvule .cse255 .cse256)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| v_arrayElimIndex_11) (= (select .cse254 v_arrayElimCell_152) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse257 .cse7) v_arrayElimCell_152)) (not (bvule v_arrayElimCell_152 .cse255)) (= v_arrayElimIndex_11 |c_ULTIMATE.start_sll_prepend_~head#1.offset|) (not (bvule (bvadd v_arrayElimCell_152 (_ bv8 32)) .cse256))))))) (.cse245 (and (forall ((v_arrayElimIndex_11 (_ BitVec 32))) (or (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_152 (_ BitVec 32))) (let ((.cse250 (select .cse8 v_arrayElimIndex_11))) (let ((.cse247 (select (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593) .cse250)) (.cse248 (bvadd v_arrayElimCell_152 (_ bv4 32))) (.cse249 (select |c_#length| .cse250))) (or (= (select .cse247 |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|) |c_ULTIMATE.start_main_~data~0#1|) (not (bvule .cse248 .cse249)) (= (select .cse247 v_arrayElimCell_152) |c_ULTIMATE.start_main_~data~0#1|) (not (bvule v_arrayElimCell_152 .cse248)) (not (bvule (bvadd v_arrayElimCell_152 (_ bv8 32)) .cse249)))))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| v_arrayElimIndex_11) (= v_arrayElimIndex_11 |c_ULTIMATE.start_sll_prepend_~head#1.offset|))) (or (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimIndex_11 (_ BitVec 32)) (v_arrayElimCell_152 (_ BitVec 32))) (let ((.cse253 (select .cse8 v_arrayElimIndex_11))) (let ((.cse251 (bvadd v_arrayElimCell_152 (_ bv4 32))) (.cse252 (select |c_#length| .cse253))) (or (not (bvule .cse251 .cse252)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| v_arrayElimIndex_11) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593) .cse253) v_arrayElimCell_152) |c_ULTIMATE.start_main_~data~0#1|) (not (bvule v_arrayElimCell_152 .cse251)) (= v_arrayElimIndex_11 |c_ULTIMATE.start_sll_prepend_~head#1.offset|) (not (bvule (bvadd v_arrayElimCell_152 (_ bv8 32)) .cse252)))))) .cse28) .cse213))) (and (or .cse175 .cse28) .cse176 (or (let ((.cse185 (and .cse213 (forall ((v_arrayElimIndex_11 (_ BitVec 32))) (or (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_152 (_ BitVec 32))) (let ((.cse217 (select .cse8 v_arrayElimIndex_11))) (let ((.cse214 (select (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593) .cse217)) (.cse215 (bvadd v_arrayElimCell_152 (_ bv4 32))) (.cse216 (select |c_#length| .cse217))) (or (= (select .cse214 |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|) |c_ULTIMATE.start_main_~data~0#1|) (not (bvule .cse215 .cse216)) (= (select .cse214 v_arrayElimCell_152) |c_ULTIMATE.start_main_~data~0#1|) (not (bvule v_arrayElimCell_152 .cse215)) (not (bvule (bvadd v_arrayElimCell_152 (_ bv8 32)) .cse216)))))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| v_arrayElimIndex_11))) (forall ((v_arrayElimIndex_11 (_ BitVec 32))) (or (= |c_ULTIMATE.start_main_~#s~0#1.offset| v_arrayElimIndex_11) (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_152 (_ BitVec 32))) (let ((.cse220 (select .cse8 v_arrayElimIndex_11))) (let ((.cse218 (bvadd v_arrayElimCell_152 (_ bv4 32))) (.cse219 (select |c_#length| .cse220))) (or (not (bvule .cse218 .cse219)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593) .cse220) v_arrayElimCell_152) |c_ULTIMATE.start_main_~data~0#1|) (not (bvule v_arrayElimCell_152 .cse218)) (not (bvule (bvadd v_arrayElimCell_152 (_ bv8 32)) .cse219))))))))))) (and .cse177 .cse176 .cse178 (or .cse14 (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimIndex_11 (_ BitVec 32)) (v_arrayElimCell_152 (_ BitVec 32))) (let ((.cse182 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593)) (.cse183 (select .cse8 v_arrayElimIndex_11))) (let ((.cse179 (select .cse182 .cse183)) (.cse180 (bvadd v_arrayElimCell_152 (_ bv4 32))) (.cse181 (select |c_#length| .cse183))) (or (= (select .cse179 |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|) |c_ULTIMATE.start_main_~data~0#1|) (not (bvule .cse180 .cse181)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| v_arrayElimIndex_11) (= (select .cse179 v_arrayElimCell_152) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse182 .cse7) v_arrayElimCell_152)) (not (bvule v_arrayElimCell_152 .cse180)) (not (bvule (bvadd v_arrayElimCell_152 (_ bv8 32)) .cse181))))))) .cse184 (or .cse59 .cse185) (forall ((v_arrayElimIndex_11 (_ BitVec 32))) (or (= |c_ULTIMATE.start_main_~#s~0#1.offset| v_arrayElimIndex_11) (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_152 (_ BitVec 32))) (let ((.cse189 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593)) (.cse190 (select .cse8 v_arrayElimIndex_11))) (let ((.cse186 (select .cse189 .cse190)) (.cse187 (bvadd v_arrayElimCell_152 (_ bv4 32))) (.cse188 (select |c_#length| .cse190))) (or (= (select .cse186 |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|) |c_ULTIMATE.start_main_~data~0#1|) (not (bvule .cse187 .cse188)) (= (select .cse186 v_arrayElimCell_152) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse189 .cse7) v_arrayElimCell_152)) (not (bvule v_arrayElimCell_152 .cse187)) (not (bvule (bvadd v_arrayElimCell_152 (_ bv8 32)) .cse188)))))))) (or .cse42 .cse185) .cse191 (forall ((v_arrayElimIndex_11 (_ BitVec 32))) (or (= |c_ULTIMATE.start_main_~#s~0#1.offset| v_arrayElimIndex_11) (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_152 (_ BitVec 32))) (let ((.cse195 (select .cse8 v_arrayElimIndex_11))) (let ((.cse194 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593)) (.cse192 (bvadd v_arrayElimCell_152 (_ bv4 32))) (.cse193 (select |c_#length| .cse195))) (or (not (bvule .cse192 .cse193)) (= (select (select .cse194 .cse195) v_arrayElimCell_152) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse194 .cse7) v_arrayElimCell_152)) (not (bvule v_arrayElimCell_152 .cse192)) (not (bvule (bvadd v_arrayElimCell_152 (_ bv8 32)) .cse193)))))) (= v_arrayElimIndex_11 |c_ULTIMATE.start_sll_prepend_~head#1.offset|))) .cse196 .cse197 .cse198 .cse199 (forall ((v_arrayElimIndex_11 (_ BitVec 32))) (or (= |c_ULTIMATE.start_main_~#s~0#1.offset| v_arrayElimIndex_11) (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_152 (_ BitVec 32))) (let ((.cse203 (select .cse8 v_arrayElimIndex_11))) (let ((.cse202 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593)) (.cse200 (bvadd v_arrayElimCell_152 (_ bv4 32))) (.cse201 (select |c_#length| .cse203))) (or (not (bvule .cse200 .cse201)) (= (select (select .cse202 .cse203) v_arrayElimCell_152) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse202 .cse7) v_arrayElimCell_152)) (not (bvule v_arrayElimCell_152 .cse200)) (not (bvule (bvadd v_arrayElimCell_152 (_ bv8 32)) .cse201)))))))) (or .cse204 .cse174) .cse205 (forall ((v_arrayElimIndex_11 (_ BitVec 32))) (or (= |c_ULTIMATE.start_main_~#s~0#1.offset| v_arrayElimIndex_11) (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_152 (_ BitVec 32))) (let ((.cse211 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593)) (.cse210 (select .cse8 v_arrayElimIndex_11))) (let ((.cse206 (select .cse211 .cse210)) (.cse207 (bvadd v_arrayElimCell_152 (_ bv4 32))) (.cse209 (select .cse211 .cse7)) (.cse208 (select |c_#length| .cse210))) (or (= (select .cse206 |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|) |c_ULTIMATE.start_main_~data~0#1|) (not (bvule .cse207 .cse208)) (= (select .cse206 v_arrayElimCell_152) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse209 v_arrayElimCell_152)) (not (bvule v_arrayElimCell_152 .cse207)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse209 |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|)) (not (bvule (bvadd v_arrayElimCell_152 (_ bv8 32)) .cse208)))))))) .cse212)) .cse28) .cse9 .cse11 .cse221 (or .cse13 (and (or .cse12 .cse59 .cse15 (and (or .cse42 .cse222) .cse223 .cse224 .cse225 .cse226 .cse227 .cse228 .cse229)) (or .cse12 .cse15 .cse230 .cse174) .cse231) .cse21) (forall ((v_arrayElimIndex_11 (_ BitVec 32))) (or (= |c_ULTIMATE.start_main_~#s~0#1.offset| v_arrayElimIndex_11) (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_152 (_ BitVec 32))) (let ((.cse237 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593)) (.cse236 (select .cse8 v_arrayElimIndex_11))) (let ((.cse232 (select .cse237 .cse236)) (.cse233 (bvadd v_arrayElimCell_152 (_ bv4 32))) (.cse235 (select .cse237 .cse7)) (.cse234 (select |c_#length| .cse236))) (or (= (select .cse232 |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|) |c_ULTIMATE.start_main_~data~0#1|) (not (bvule .cse233 .cse234)) (= (select .cse232 v_arrayElimCell_152) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse235 v_arrayElimCell_152)) (not (bvule v_arrayElimCell_152 .cse233)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse235 |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|)) (not (bvule (bvadd v_arrayElimCell_152 (_ bv8 32)) .cse234)))))) (= v_arrayElimIndex_11 |c_ULTIMATE.start_sll_prepend_~head#1.offset|))) .cse238 (or .cse239 .cse174) .cse196 .cse240 .cse241 .cse198 .cse118 .cse242 .cse199 .cse243 (or .cse14 .cse175) .cse244 (or .cse42 .cse245) (or .cse59 .cse245) (or .cse246 .cse28))))) (or (let ((.cse283 (forall ((v_arrayElimCell_152 (_ BitVec 32))) (let ((.cse318 (bvadd v_arrayElimCell_152 (_ bv4 32)))) (or (not (bvule (bvadd v_arrayElimCell_152 (_ bv8 32)) .cse82)) (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse317 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593))) (let ((.cse316 (select .cse317 (select .cse8 .cse318)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse316 |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse317 .cse7) v_arrayElimCell_152)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse316 v_arrayElimCell_152)))))) (not (bvule .cse318 .cse82)) (not (bvule v_arrayElimCell_152 .cse318)))))) (.cse304 (forall ((v_arrayElimCell_152 (_ BitVec 32))) (let ((.cse313 (bvadd v_arrayElimCell_152 (_ bv4 32)))) (or (not (bvule (bvadd v_arrayElimCell_152 (_ bv8 32)) .cse82)) (not (bvule .cse313 .cse82)) (not (bvule v_arrayElimCell_152 .cse313)) (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse315 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593))) (or (forall ((v_arrayElimIndex_11 (_ BitVec 32))) (let ((.cse314 (select .cse315 (select .cse8 v_arrayElimIndex_11)))) (or (= (select .cse314 |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| v_arrayElimIndex_11) (= (select .cse314 v_arrayElimCell_152) |c_ULTIMATE.start_main_~data~0#1|)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse315 .cse7) v_arrayElimCell_152))))))))) (.cse281 (forall ((v_arrayElimCell_152 (_ BitVec 32))) (let ((.cse311 (bvadd v_arrayElimCell_152 (_ bv4 32)))) (or (not (bvule (bvadd v_arrayElimCell_152 (_ bv8 32)) .cse82)) (not (bvule .cse311 .cse82)) (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimIndex_11 (_ BitVec 32))) (let ((.cse312 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593))) (or (= (select (select .cse312 (select .cse8 v_arrayElimIndex_11)) v_arrayElimCell_152) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse312 .cse7) v_arrayElimCell_152)) (= v_arrayElimIndex_11 |c_ULTIMATE.start_sll_prepend_~head#1.offset|)))) (not (bvule v_arrayElimCell_152 .cse311)))))) (.cse282 (forall ((v_arrayElimCell_152 (_ BitVec 32))) (let ((.cse310 (bvadd v_arrayElimCell_152 (_ bv4 32)))) (or (forall ((v_arrayElimIndex_11 (_ BitVec 32))) (or (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse308 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593))) (let ((.cse309 (select .cse308 .cse7))) (or (= (select (select .cse308 (select .cse8 v_arrayElimIndex_11)) v_arrayElimCell_152) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse309 v_arrayElimCell_152)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse309 |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|)))))) (= v_arrayElimIndex_11 |c_ULTIMATE.start_sll_prepend_~head#1.offset|))) (not (bvule (bvadd v_arrayElimCell_152 (_ bv8 32)) .cse82)) (not (bvule .cse310 .cse82)) (not (bvule v_arrayElimCell_152 .cse310))))))) (and (or .cse174 (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimIndex_11 (_ BitVec 32)) (v_arrayElimCell_152 (_ BitVec 32))) (let ((.cse274 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593))) (let ((.cse271 (select .cse274 (select .cse8 v_arrayElimIndex_11))) (.cse273 (bvadd v_arrayElimCell_152 (_ bv4 32))) (.cse272 (select .cse274 .cse7))) (or (= (select .cse271 |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|) |c_ULTIMATE.start_main_~data~0#1|) (not (bvule (bvadd v_arrayElimCell_152 (_ bv8 32)) .cse82)) (= (select .cse271 v_arrayElimCell_152) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse272 v_arrayElimCell_152)) (not (bvule .cse273 .cse82)) (not (bvule v_arrayElimCell_152 .cse273)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse272 |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|))))))) .cse275 (or .cse174 .cse276) (or .cse277 .cse278 .cse279 .cse280 .cse21) .cse281 .cse282 .cse283 (forall ((v_arrayElimCell_152 (_ BitVec 32))) (let ((.cse287 (bvadd v_arrayElimCell_152 (_ bv4 32)))) (or (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse286 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593))) (let ((.cse284 (select .cse286 (select .cse8 .cse287))) (.cse285 (select .cse286 .cse7))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse284 |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse285 v_arrayElimCell_152)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse284 v_arrayElimCell_152)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse285 |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|)))))) (not (bvule (bvadd v_arrayElimCell_152 (_ bv8 32)) .cse82)) (not (bvule .cse287 .cse82)) (not (bvule v_arrayElimCell_152 .cse287))))) (forall ((v_arrayElimCell_152 (_ BitVec 32))) (let ((.cse291 (bvadd v_arrayElimCell_152 (_ bv4 32)))) (or (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse289 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593))) (let ((.cse290 (select .cse289 .cse7))) (or (forall ((v_arrayElimIndex_11 (_ BitVec 32))) (let ((.cse288 (select .cse289 (select .cse8 v_arrayElimIndex_11)))) (or (= (select .cse288 |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| v_arrayElimIndex_11) (= (select .cse288 v_arrayElimCell_152) |c_ULTIMATE.start_main_~data~0#1|)))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse290 v_arrayElimCell_152)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse290 |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|)))))) (not (bvule (bvadd v_arrayElimCell_152 (_ bv8 32)) .cse82)) (not (bvule .cse291 .cse82)) (not (bvule v_arrayElimCell_152 .cse291))))) (forall ((v_arrayElimCell_152 (_ BitVec 32))) (let ((.cse292 (bvadd v_arrayElimCell_152 (_ bv4 32)))) (or (= |c_ULTIMATE.start_sll_prepend_~head#1.offset| .cse292) (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse293 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse293 .cse7) v_arrayElimCell_152)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse293 (select .cse8 .cse292)) v_arrayElimCell_152))))) (not (bvule (bvadd v_arrayElimCell_152 (_ bv8 32)) .cse82)) (not (bvule .cse292 .cse82)) (not (bvule v_arrayElimCell_152 .cse292))))) (or (and (forall ((v_arrayElimCell_152 (_ BitVec 32))) (let ((.cse295 (bvadd v_arrayElimCell_152 (_ bv4 32)))) (or (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse294 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593))) (or (forall ((v_arrayElimIndex_11 (_ BitVec 32))) (or (= |c_ULTIMATE.start_main_~#s~0#1.offset| v_arrayElimIndex_11) (= (select (select .cse294 (select .cse8 v_arrayElimIndex_11)) v_arrayElimCell_152) |c_ULTIMATE.start_main_~data~0#1|))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse294 .cse7) v_arrayElimCell_152))))) (not (bvule (bvadd v_arrayElimCell_152 (_ bv8 32)) .cse82)) (not (bvule .cse295 .cse82)) (not (bvule v_arrayElimCell_152 .cse295))))) (forall ((v_arrayElimCell_152 (_ BitVec 32))) (let ((.cse297 (bvadd v_arrayElimCell_152 (_ bv4 32)))) (or (not (bvule (bvadd v_arrayElimCell_152 (_ bv8 32)) .cse82)) (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse296 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593))) (or (forall ((v_arrayElimIndex_11 (_ BitVec 32))) (= (select (select .cse296 (select .cse8 v_arrayElimIndex_11)) v_arrayElimCell_152) |c_ULTIMATE.start_main_~data~0#1|)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse296 .cse7) v_arrayElimCell_152))))) (not (bvule .cse297 .cse82)) (not (bvule v_arrayElimCell_152 .cse297))))) (forall ((v_arrayElimCell_152 (_ BitVec 32))) (let ((.cse299 (bvadd v_arrayElimCell_152 (_ bv4 32)))) (or (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse298 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse298 .cse7) v_arrayElimCell_152)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse298 (select .cse8 .cse299)) v_arrayElimCell_152))))) (not (bvule (bvadd v_arrayElimCell_152 (_ bv8 32)) .cse82)) (not (bvule .cse299 .cse82)) (not (bvule v_arrayElimCell_152 .cse299)))))) .cse28) .cse300 (forall ((v_arrayElimCell_152 (_ BitVec 32))) (let ((.cse301 (bvadd v_arrayElimCell_152 (_ bv4 32)))) (or (= |c_ULTIMATE.start_sll_prepend_~head#1.offset| .cse301) (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse303 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593))) (let ((.cse302 (select .cse303 .cse7))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse302 v_arrayElimCell_152)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse303 (select .cse8 .cse301)) v_arrayElimCell_152)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse302 |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|)))))) (not (bvule (bvadd v_arrayElimCell_152 (_ bv8 32)) .cse82)) (not (bvule .cse301 .cse82)) (not (bvule v_arrayElimCell_152 .cse301))))) .cse304 (or (and .cse283 .cse304 (forall ((v_arrayElimCell_152 (_ BitVec 32))) (let ((.cse307 (bvadd v_arrayElimCell_152 (_ bv4 32)))) (or (not (bvule (bvadd v_arrayElimCell_152 (_ bv8 32)) .cse82)) (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse305 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse305 .cse7) v_arrayElimCell_152)) (forall ((v_arrayElimIndex_11 (_ BitVec 32))) (let ((.cse306 (select .cse305 (select .cse8 v_arrayElimIndex_11)))) (or (= (select .cse306 |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|) |c_ULTIMATE.start_main_~data~0#1|) (= (select .cse306 v_arrayElimCell_152) |c_ULTIMATE.start_main_~data~0#1|))))))) (not (bvule .cse307 .cse82)) (not (bvule v_arrayElimCell_152 .cse307)))))) .cse28) (or (and .cse281 .cse282) .cse174))) .cse97 .cse98))) (or .cse1 (let ((.cse437 (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimIndex_11 (_ BitVec 32)) (v_arrayElimCell_152 (_ BitVec 32))) (let ((.cse504 (select .cse8 v_arrayElimIndex_11))) (let ((.cse501 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593)) (.cse502 (bvadd v_arrayElimCell_152 (_ bv4 32))) (.cse503 (select |c_#length| .cse504))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse501 .cse7) (bvadd (_ bv4294967292 32) v_arrayElimIndex_11))) (not (bvule .cse502 .cse503)) (= v_arrayElimIndex_11 .cse0) (= (select (select .cse501 .cse504) v_arrayElimCell_152) |c_ULTIMATE.start_main_~data~0#1|) (not (bvule v_arrayElimCell_152 .cse502)) (= v_arrayElimIndex_11 |c_ULTIMATE.start_sll_prepend_~head#1.offset|) (not (bvule (bvadd v_arrayElimCell_152 (_ bv8 32)) .cse503))))))) (.cse428 (forall ((v_arrayElimIndex_11 (_ BitVec 32))) (let ((.cse500 (select .cse8 v_arrayElimIndex_11))) (let ((.cse498 (select |c_#length| .cse500)) (.cse499 (bvadd (_ bv4294967292 32) v_arrayElimIndex_11))) (or (not (bvule v_arrayElimIndex_11 .cse498)) (not (bvule .cse499 v_arrayElimIndex_11)) (not (bvule (bvadd (_ bv4 32) v_arrayElimIndex_11) .cse498)) (= v_arrayElimIndex_11 .cse0) (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593) .cse500) .cse499))) (= v_arrayElimIndex_11 |c_ULTIMATE.start_sll_prepend_~head#1.offset|)))))) (.cse322 (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimIndex_11 (_ BitVec 32)) (v_arrayElimCell_152 (_ BitVec 32))) (let ((.cse497 (select .cse8 v_arrayElimIndex_11))) (let ((.cse494 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593)) (.cse495 (bvadd v_arrayElimCell_152 (_ bv4 32))) (.cse496 (select |c_#length| .cse497))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse494 .cse7) (bvadd (_ bv4294967292 32) v_arrayElimIndex_11))) (not (bvule .cse495 .cse496)) (= v_arrayElimIndex_11 .cse0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| v_arrayElimIndex_11) (= (select (select .cse494 .cse497) v_arrayElimCell_152) |c_ULTIMATE.start_main_~data~0#1|) (not (bvule v_arrayElimCell_152 .cse495)) (= v_arrayElimIndex_11 |c_ULTIMATE.start_sll_prepend_~head#1.offset|) (not (bvule (bvadd v_arrayElimCell_152 (_ bv8 32)) .cse496))))))) (.cse321 (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimIndex_11 (_ BitVec 32))) (let ((.cse492 (select .cse8 v_arrayElimIndex_11))) (let ((.cse491 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593)) (.cse493 (bvadd (_ bv4294967292 32) v_arrayElimIndex_11)) (.cse490 (select |c_#length| .cse492))) (or (not (bvule v_arrayElimIndex_11 .cse490)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse491 .cse492) .cse493)) (not (bvule .cse493 v_arrayElimIndex_11)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse491 .cse7) .cse493)) (not (bvule (bvadd (_ bv4 32) v_arrayElimIndex_11) .cse490)) (= v_arrayElimIndex_11 .cse0) (= v_arrayElimIndex_11 |c_ULTIMATE.start_sll_prepend_~head#1.offset|))))))) (let ((.cse340 (and .cse99 .cse100 .cse103)) (.cse320 (forall ((v_arrayElimIndex_11 (_ BitVec 32))) (let ((.cse488 (select .cse8 v_arrayElimIndex_11))) (let ((.cse486 (bvadd (_ bv4294967292 32) v_arrayElimIndex_11)) (.cse485 (select |c_#length| .cse488))) (or (not (bvule v_arrayElimIndex_11 .cse485)) (not (bvule .cse486 v_arrayElimIndex_11)) (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse487 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593))) (let ((.cse489 (select .cse487 .cse7))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse487 .cse488) .cse486)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse489 .cse486)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse489 |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|)))))) (not (bvule (bvadd (_ bv4 32) v_arrayElimIndex_11) .cse485)) (= v_arrayElimIndex_11 .cse0) (= v_arrayElimIndex_11 |c_ULTIMATE.start_sll_prepend_~head#1.offset|)))))) (.cse342 (or .cse14 .cse321)) (.cse343 (or .cse14 .cse322)) (.cse344 (forall ((v_arrayElimIndex_11 (_ BitVec 32))) (or (= v_arrayElimIndex_11 .cse0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| v_arrayElimIndex_11) (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_152 (_ BitVec 32))) (let ((.cse484 (select .cse8 v_arrayElimIndex_11)) (.cse483 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593))) (let ((.cse481 (bvadd v_arrayElimCell_152 (_ bv4 32))) (.cse480 (select .cse483 .cse7)) (.cse482 (select |c_#length| .cse484))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse480 (bvadd (_ bv4294967292 32) v_arrayElimIndex_11))) (not (bvule .cse481 .cse482)) (= (select (select .cse483 .cse484) v_arrayElimCell_152) |c_ULTIMATE.start_main_~data~0#1|) (not (bvule v_arrayElimCell_152 .cse481)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse480 |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|)) (not (bvule (bvadd v_arrayElimCell_152 (_ bv8 32)) .cse482)))))) (= v_arrayElimIndex_11 |c_ULTIMATE.start_sll_prepend_~head#1.offset|)))) (.cse351 (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimIndex_11 (_ BitVec 32)) (v_arrayElimCell_152 (_ BitVec 32))) (let ((.cse476 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593)) (.cse479 (select .cse8 v_arrayElimIndex_11))) (let ((.cse475 (select .cse476 .cse479)) (.cse477 (bvadd v_arrayElimCell_152 (_ bv4 32))) (.cse478 (select |c_#length| .cse479))) (or (= (select .cse475 |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse476 .cse7) (bvadd (_ bv4294967292 32) v_arrayElimIndex_11))) (not (bvule .cse477 .cse478)) (= v_arrayElimIndex_11 .cse0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| v_arrayElimIndex_11) (= (select .cse475 v_arrayElimCell_152) |c_ULTIMATE.start_main_~data~0#1|) (not (bvule v_arrayElimCell_152 .cse477)) (= v_arrayElimIndex_11 |c_ULTIMATE.start_sll_prepend_~head#1.offset|) (not (bvule (bvadd v_arrayElimCell_152 (_ bv8 32)) .cse478))))))) (.cse341 (and (or .cse64 .cse28) .cse428 (forall ((v_arrayElimIndex_11 (_ BitVec 32))) (let ((.cse474 (select .cse8 v_arrayElimIndex_11))) (let ((.cse472 (bvadd (_ bv4294967292 32) v_arrayElimIndex_11)) (.cse471 (select |c_#length| .cse474))) (or (not (bvule v_arrayElimIndex_11 .cse471)) (not (bvule .cse472 v_arrayElimIndex_11)) (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse473 (select (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593) .cse474))) (or (= (select .cse473 |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse473 .cse472))))) (not (bvule (bvadd (_ bv4 32) v_arrayElimIndex_11) .cse471)) (= v_arrayElimIndex_11 .cse0) (= v_arrayElimIndex_11 |c_ULTIMATE.start_sll_prepend_~head#1.offset|))))))) (.cse352 (forall ((v_arrayElimIndex_11 (_ BitVec 32))) (or (= v_arrayElimIndex_11 .cse0) (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_152 (_ BitVec 32))) (let ((.cse470 (select .cse8 v_arrayElimIndex_11)) (.cse469 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593))) (let ((.cse467 (bvadd v_arrayElimCell_152 (_ bv4 32))) (.cse466 (select .cse469 .cse7)) (.cse468 (select |c_#length| .cse470))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse466 (bvadd (_ bv4294967292 32) v_arrayElimIndex_11))) (not (bvule .cse467 .cse468)) (= (select (select .cse469 .cse470) v_arrayElimCell_152) |c_ULTIMATE.start_main_~data~0#1|) (not (bvule v_arrayElimCell_152 .cse467)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse466 |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|)) (not (bvule (bvadd v_arrayElimCell_152 (_ bv8 32)) .cse468)))))) (= v_arrayElimIndex_11 |c_ULTIMATE.start_sll_prepend_~head#1.offset|)))) (.cse373 (or .cse437 .cse14)) (.cse319 (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimIndex_11 (_ BitVec 32))) (let ((.cse464 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593)) (.cse465 (select .cse8 v_arrayElimIndex_11))) (let ((.cse462 (select .cse464 .cse465)) (.cse463 (bvadd (_ bv4294967292 32) v_arrayElimIndex_11)) (.cse461 (select |c_#length| .cse465))) (or (not (bvule v_arrayElimIndex_11 .cse461)) (= (select .cse462 |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse462 .cse463)) (not (bvule .cse463 v_arrayElimIndex_11)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse464 .cse7) .cse463)) (not (bvule (bvadd (_ bv4 32) v_arrayElimIndex_11) .cse461)) (= v_arrayElimIndex_11 .cse0) (= v_arrayElimIndex_11 |c_ULTIMATE.start_sll_prepend_~head#1.offset|))))))) (and (or .cse14 .cse319) .cse320 (or .cse321 .cse28) .cse9 (or .cse322 .cse28) .cse11 (or .cse13 (let ((.cse323 (or .cse12 (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_152 (_ BitVec 32))) (let ((.cse339 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593))) (let ((.cse338 (select .cse339 .cse20))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse338 v_arrayElimCell_152)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse339 .cse7) .cse18)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse338 |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|)))))))) (.cse324 (or .cse12 .cse222)) (.cse325 (or .cse12 (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_152 (_ BitVec 32))) (let ((.cse337 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593))) (let ((.cse335 (select .cse337 .cse20)) (.cse336 (select .cse337 .cse7))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse335 v_arrayElimCell_152)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse336 .cse18)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse335 |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse336 |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|)))))))) (.cse326 (or .cse12 .cse279))) (and (or (and (or (and .cse323 .cse324 (or .cse12 .cse59 .cse222) .cse325 .cse326) .cse14 .cse15) (or (and .cse327 .cse328 .cse223 .cse329 .cse330 .cse331 .cse332 .cse333) .cse12 .cse15)) .cse174) .cse231 (or (and (or .cse14 .cse15 (and .cse323 (or .cse42 .cse12 .cse222) .cse324 .cse325 .cse326)) (or (and .cse327 .cse328 .cse223 .cse330 .cse334 .cse331 .cse332 .cse333) .cse12 .cse15)) .cse59))) .cse21) .cse221 (or .cse42 .cse340) (or .cse59 .cse341) .cse342 .cse343 .cse238 (or .cse59 .cse340) .cse344 (forall ((v_arrayElimIndex_11 (_ BitVec 32))) (let ((.cse350 (select .cse8 v_arrayElimIndex_11))) (let ((.cse346 (bvadd (_ bv4294967292 32) v_arrayElimIndex_11)) (.cse345 (select |c_#length| .cse350))) (or (not (bvule v_arrayElimIndex_11 .cse345)) (not (bvule .cse346 v_arrayElimIndex_11)) (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse349 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593))) (let ((.cse347 (select .cse349 .cse350)) (.cse348 (select .cse349 .cse7))) (or (= (select .cse347 |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse347 .cse346)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse348 .cse346)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse348 |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|)))))) (not (bvule (bvadd (_ bv4 32) v_arrayElimIndex_11) .cse345)) (= v_arrayElimIndex_11 .cse0) (= v_arrayElimIndex_11 |c_ULTIMATE.start_sll_prepend_~head#1.offset|))))) (or .cse351 .cse28) (or (let ((.cse407 (and .cse428 (forall ((v_arrayElimIndex_11 (_ BitVec 32))) (let ((.cse431 (select .cse8 v_arrayElimIndex_11))) (let ((.cse429 (select |c_#length| .cse431)) (.cse430 (bvadd (_ bv4294967292 32) v_arrayElimIndex_11))) (or (not (bvule v_arrayElimIndex_11 .cse429)) (not (bvule .cse430 v_arrayElimIndex_11)) (not (bvule (bvadd (_ bv4 32) v_arrayElimIndex_11) .cse429)) (= v_arrayElimIndex_11 .cse0) (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593) .cse431) .cse430))))))) (forall ((v_arrayElimIndex_11 (_ BitVec 32))) (let ((.cse435 (select .cse8 v_arrayElimIndex_11))) (let ((.cse433 (bvadd (_ bv4294967292 32) v_arrayElimIndex_11)) (.cse432 (select |c_#length| .cse435))) (or (not (bvule v_arrayElimIndex_11 .cse432)) (not (bvule .cse433 v_arrayElimIndex_11)) (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse434 (select (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593) .cse435))) (or (= (select .cse434 |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse434 .cse433))))) (not (bvule (bvadd (_ bv4 32) v_arrayElimIndex_11) .cse432)) (= v_arrayElimIndex_11 .cse0)))))))) (and (or (and .cse352 (forall ((v_arrayElimIndex_11 (_ BitVec 32))) (or (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_152 (_ BitVec 32))) (let ((.cse356 (select .cse8 v_arrayElimIndex_11))) (let ((.cse353 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593)) (.cse354 (bvadd v_arrayElimCell_152 (_ bv4 32))) (.cse355 (select |c_#length| .cse356))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse353 .cse7) (bvadd (_ bv4294967292 32) v_arrayElimIndex_11))) (not (bvule .cse354 .cse355)) (= (select (select .cse353 .cse356) v_arrayElimCell_152) |c_ULTIMATE.start_main_~data~0#1|) (not (bvule v_arrayElimCell_152 .cse354)) (not (bvule (bvadd v_arrayElimCell_152 (_ bv8 32)) .cse355)))))) (= v_arrayElimIndex_11 .cse0))) (forall ((v_arrayElimIndex_11 (_ BitVec 32))) (or (= v_arrayElimIndex_11 .cse0) (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_152 (_ BitVec 32))) (let ((.cse362 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593)) (.cse361 (select .cse8 v_arrayElimIndex_11))) (let ((.cse357 (select .cse362 .cse361)) (.cse359 (bvadd v_arrayElimCell_152 (_ bv4 32))) (.cse358 (select .cse362 .cse7)) (.cse360 (select |c_#length| .cse361))) (or (= (select .cse357 |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse358 (bvadd (_ bv4294967292 32) v_arrayElimIndex_11))) (not (bvule .cse359 .cse360)) (= (select .cse357 v_arrayElimCell_152) |c_ULTIMATE.start_main_~data~0#1|) (not (bvule v_arrayElimCell_152 .cse359)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse358 |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|)) (not (bvule (bvadd v_arrayElimCell_152 (_ bv8 32)) .cse360)))))))) (forall ((v_arrayElimIndex_11 (_ BitVec 32))) (or (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_152 (_ BitVec 32))) (let ((.cse366 (select .cse8 v_arrayElimIndex_11))) (let ((.cse363 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593)) (.cse364 (bvadd v_arrayElimCell_152 (_ bv4 32))) (.cse365 (select |c_#length| .cse366))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse363 .cse7) (bvadd (_ bv4294967292 32) v_arrayElimIndex_11))) (not (bvule .cse364 .cse365)) (= (select (select .cse363 .cse366) v_arrayElimCell_152) |c_ULTIMATE.start_main_~data~0#1|) (not (bvule v_arrayElimCell_152 .cse364)) (not (bvule (bvadd v_arrayElimCell_152 (_ bv8 32)) .cse365)))))) (= v_arrayElimIndex_11 .cse0) (= v_arrayElimIndex_11 |c_ULTIMATE.start_sll_prepend_~head#1.offset|))) (forall ((v_arrayElimIndex_11 (_ BitVec 32))) (or (= v_arrayElimIndex_11 .cse0) (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_152 (_ BitVec 32))) (let ((.cse368 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593)) (.cse371 (select .cse8 v_arrayElimIndex_11))) (let ((.cse367 (select .cse368 .cse371)) (.cse369 (bvadd v_arrayElimCell_152 (_ bv4 32))) (.cse370 (select |c_#length| .cse371))) (or (= (select .cse367 |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse368 .cse7) (bvadd (_ bv4294967292 32) v_arrayElimIndex_11))) (not (bvule .cse369 .cse370)) (= (select .cse367 v_arrayElimCell_152) |c_ULTIMATE.start_main_~data~0#1|) (not (bvule v_arrayElimCell_152 .cse369)) (not (bvule (bvadd v_arrayElimCell_152 (_ bv8 32)) .cse370)))))))) (or .cse372 .cse59) (or .cse42 .cse372) .cse373 (or .cse14 (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimIndex_11 (_ BitVec 32)) (v_arrayElimCell_152 (_ BitVec 32))) (let ((.cse375 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593)) (.cse378 (select .cse8 v_arrayElimIndex_11))) (let ((.cse374 (select .cse375 .cse378)) (.cse376 (bvadd v_arrayElimCell_152 (_ bv4 32))) (.cse377 (select |c_#length| .cse378))) (or (= (select .cse374 |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse375 .cse7) (bvadd (_ bv4294967292 32) v_arrayElimIndex_11))) (not (bvule .cse376 .cse377)) (= v_arrayElimIndex_11 .cse0) (= (select .cse374 v_arrayElimCell_152) |c_ULTIMATE.start_main_~data~0#1|) (not (bvule v_arrayElimCell_152 .cse376)) (not (bvule (bvadd v_arrayElimCell_152 (_ bv8 32)) .cse377)))))))) .cse174) .cse177 .cse320 .cse178 (forall ((v_arrayElimIndex_11 (_ BitVec 32))) (or (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_152 (_ BitVec 32))) (let ((.cse382 (select .cse8 v_arrayElimIndex_11))) (let ((.cse379 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593)) (.cse380 (bvadd v_arrayElimCell_152 (_ bv4 32))) (.cse381 (select |c_#length| .cse382))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse379 .cse7) (bvadd (_ bv4294967292 32) v_arrayElimIndex_11))) (not (bvule .cse380 .cse381)) (= (select (select .cse379 .cse382) v_arrayElimCell_152) |c_ULTIMATE.start_main_~data~0#1|) (not (bvule v_arrayElimCell_152 .cse380)) (not (bvule (bvadd v_arrayElimCell_152 (_ bv8 32)) .cse381)))))) (= v_arrayElimIndex_11 .cse0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| v_arrayElimIndex_11) (= v_arrayElimIndex_11 |c_ULTIMATE.start_sll_prepend_~head#1.offset|))) (or (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimIndex_11 (_ BitVec 32))) (let ((.cse386 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593)) (.cse387 (select .cse8 v_arrayElimIndex_11))) (let ((.cse384 (select .cse386 .cse387)) (.cse385 (bvadd (_ bv4294967292 32) v_arrayElimIndex_11)) (.cse383 (select |c_#length| .cse387))) (or (not (bvule v_arrayElimIndex_11 .cse383)) (= (select .cse384 |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse384 .cse385)) (not (bvule .cse385 v_arrayElimIndex_11)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse386 .cse7) .cse385)) (not (bvule (bvadd (_ bv4 32) v_arrayElimIndex_11) .cse383)) (= v_arrayElimIndex_11 .cse0))))) .cse14) (or .cse59 .cse148) (or .cse14 (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimIndex_11 (_ BitVec 32)) (v_arrayElimCell_152 (_ BitVec 32))) (let ((.cse389 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593)) (.cse392 (select .cse8 v_arrayElimIndex_11))) (let ((.cse388 (select .cse389 .cse392)) (.cse390 (bvadd v_arrayElimCell_152 (_ bv4 32))) (.cse391 (select |c_#length| .cse392))) (or (= (select .cse388 |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse389 .cse7) (bvadd (_ bv4294967292 32) v_arrayElimIndex_11))) (not (bvule .cse390 .cse391)) (= v_arrayElimIndex_11 .cse0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| v_arrayElimIndex_11) (= (select .cse388 v_arrayElimCell_152) |c_ULTIMATE.start_main_~data~0#1|) (not (bvule v_arrayElimCell_152 .cse390)) (not (bvule (bvadd v_arrayElimCell_152 (_ bv8 32)) .cse391))))))) .cse342 (forall ((v_arrayElimIndex_11 (_ BitVec 32))) (let ((.cse397 (select .cse8 v_arrayElimIndex_11))) (let ((.cse393 (select |c_#length| .cse397)) (.cse394 (bvadd (_ bv4294967292 32) v_arrayElimIndex_11))) (or (not (bvule v_arrayElimIndex_11 .cse393)) (not (bvule .cse394 v_arrayElimIndex_11)) (not (bvule (bvadd (_ bv4 32) v_arrayElimIndex_11) .cse393)) (= v_arrayElimIndex_11 .cse0) (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse396 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593))) (let ((.cse395 (select .cse396 .cse397))) (or (= (select .cse395 |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse395 .cse394)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse396 .cse7) .cse394)))))))))) (forall ((v_arrayElimIndex_11 (_ BitVec 32))) (let ((.cse400 (select .cse8 v_arrayElimIndex_11))) (let ((.cse401 (bvadd (_ bv4294967292 32) v_arrayElimIndex_11)) (.cse398 (select |c_#length| .cse400))) (or (not (bvule v_arrayElimIndex_11 .cse398)) (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse399 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse399 .cse400) .cse401)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse399 .cse7) .cse401))))) (not (bvule .cse401 v_arrayElimIndex_11)) (not (bvule (bvadd (_ bv4 32) v_arrayElimIndex_11) .cse398)) (= v_arrayElimIndex_11 .cse0) (= v_arrayElimIndex_11 |c_ULTIMATE.start_sll_prepend_~head#1.offset|))))) .cse184 .cse343 .cse191 .cse344 (forall ((v_arrayElimIndex_11 (_ BitVec 32))) (or (= v_arrayElimIndex_11 .cse0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| v_arrayElimIndex_11) (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_152 (_ BitVec 32))) (let ((.cse403 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593)) (.cse406 (select .cse8 v_arrayElimIndex_11))) (let ((.cse402 (select .cse403 .cse406)) (.cse404 (bvadd v_arrayElimCell_152 (_ bv4 32))) (.cse405 (select |c_#length| .cse406))) (or (= (select .cse402 |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse403 .cse7) (bvadd (_ bv4294967292 32) v_arrayElimIndex_11))) (not (bvule .cse404 .cse405)) (= (select .cse402 v_arrayElimCell_152) |c_ULTIMATE.start_main_~data~0#1|) (not (bvule v_arrayElimCell_152 .cse404)) (not (bvule (bvadd v_arrayElimCell_152 (_ bv8 32)) .cse405)))))))) .cse196 .cse197 (or .cse42 .cse407) .cse198 (or .cse407 .cse59) (forall ((v_arrayElimIndex_11 (_ BitVec 32))) (let ((.cse413 (select .cse8 v_arrayElimIndex_11))) (let ((.cse409 (bvadd (_ bv4294967292 32) v_arrayElimIndex_11)) (.cse408 (select |c_#length| .cse413))) (or (not (bvule v_arrayElimIndex_11 .cse408)) (not (bvule .cse409 v_arrayElimIndex_11)) (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse412 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593))) (let ((.cse410 (select .cse412 .cse413)) (.cse411 (select .cse412 .cse7))) (or (= (select .cse410 |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse410 .cse409)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse411 .cse409)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse411 |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|)))))) (not (bvule (bvadd (_ bv4 32) v_arrayElimIndex_11) .cse408)) (= v_arrayElimIndex_11 .cse0))))) (forall ((v_arrayElimIndex_11 (_ BitVec 32))) (let ((.cse416 (select .cse8 v_arrayElimIndex_11))) (let ((.cse417 (bvadd (_ bv4294967292 32) v_arrayElimIndex_11)) (.cse414 (select |c_#length| .cse416))) (or (not (bvule v_arrayElimIndex_11 .cse414)) (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse415 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse415 .cse416) .cse417)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse415 .cse7) .cse417))))) (not (bvule .cse417 v_arrayElimIndex_11)) (not (bvule (bvadd (_ bv4 32) v_arrayElimIndex_11) .cse414)) (= v_arrayElimIndex_11 .cse0))))) .cse205 (forall ((v_arrayElimIndex_11 (_ BitVec 32))) (or (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_152 (_ BitVec 32))) (let ((.cse421 (select .cse8 v_arrayElimIndex_11))) (let ((.cse418 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593)) (.cse419 (bvadd v_arrayElimCell_152 (_ bv4 32))) (.cse420 (select |c_#length| .cse421))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse418 .cse7) (bvadd (_ bv4294967292 32) v_arrayElimIndex_11))) (not (bvule .cse419 .cse420)) (= (select (select .cse418 .cse421) v_arrayElimCell_152) |c_ULTIMATE.start_main_~data~0#1|) (not (bvule v_arrayElimCell_152 .cse419)) (not (bvule (bvadd v_arrayElimCell_152 (_ bv8 32)) .cse420)))))) (= v_arrayElimIndex_11 .cse0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| v_arrayElimIndex_11))) (or .cse42 .cse148) (forall ((v_arrayElimIndex_11 (_ BitVec 32))) (or (= v_arrayElimIndex_11 .cse0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| v_arrayElimIndex_11) (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_152 (_ BitVec 32))) (let ((.cse427 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593)) (.cse426 (select .cse8 v_arrayElimIndex_11))) (let ((.cse422 (select .cse427 .cse426)) (.cse424 (bvadd v_arrayElimCell_152 (_ bv4 32))) (.cse423 (select .cse427 .cse7)) (.cse425 (select |c_#length| .cse426))) (or (= (select .cse422 |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse423 (bvadd (_ bv4294967292 32) v_arrayElimIndex_11))) (not (bvule .cse424 .cse425)) (= (select .cse422 v_arrayElimCell_152) |c_ULTIMATE.start_main_~data~0#1|) (not (bvule v_arrayElimCell_152 .cse424)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse423 |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|)) (not (bvule (bvadd v_arrayElimCell_152 (_ bv8 32)) .cse425)))))))) .cse212)) .cse28) .cse196 .cse240 (or .cse14 .cse351) .cse241 .cse198 .cse118 .cse242 .cse243 (or .cse42 .cse341) (or .cse174 (let ((.cse439 (and .cse452 .cse453 .cse454)) (.cse438 (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimIndex_11 (_ BitVec 32)) (v_arrayElimCell_152 (_ BitVec 32))) (let ((.cse448 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593)) (.cse451 (select .cse8 v_arrayElimIndex_11))) (let ((.cse447 (select .cse448 .cse451)) (.cse449 (bvadd v_arrayElimCell_152 (_ bv4 32))) (.cse450 (select |c_#length| .cse451))) (or (= (select .cse447 |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse448 .cse7) (bvadd (_ bv4294967292 32) v_arrayElimIndex_11))) (not (bvule .cse449 .cse450)) (= v_arrayElimIndex_11 .cse0) (= (select .cse447 v_arrayElimCell_152) |c_ULTIMATE.start_main_~data~0#1|) (not (bvule v_arrayElimCell_152 .cse449)) (= v_arrayElimIndex_11 |c_ULTIMATE.start_sll_prepend_~head#1.offset|) (not (bvule (bvadd v_arrayElimCell_152 (_ bv8 32)) .cse450)))))))) (and .cse436 .cse352 (or .cse437 .cse28) (or .cse438 .cse28) (or .cse59 .cse439) .cse373 (forall ((v_arrayElimIndex_11 (_ BitVec 32))) (or (= v_arrayElimIndex_11 .cse0) (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_152 (_ BitVec 32))) (let ((.cse445 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593)) (.cse444 (select .cse8 v_arrayElimIndex_11))) (let ((.cse440 (select .cse445 .cse444)) (.cse442 (bvadd v_arrayElimCell_152 (_ bv4 32))) (.cse441 (select .cse445 .cse7)) (.cse443 (select |c_#length| .cse444))) (or (= (select .cse440 |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse441 (bvadd (_ bv4294967292 32) v_arrayElimIndex_11))) (not (bvule .cse442 .cse443)) (= (select .cse440 v_arrayElimCell_152) |c_ULTIMATE.start_main_~data~0#1|) (not (bvule v_arrayElimCell_152 .cse442)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse441 |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|)) (not (bvule (bvadd v_arrayElimCell_152 (_ bv8 32)) .cse443)))))) (= v_arrayElimIndex_11 |c_ULTIMATE.start_sll_prepend_~head#1.offset|))) .cse446 (or .cse42 .cse439) (or .cse14 .cse438)))) (or .cse319 .cse28) .cse244 (forall ((v_arrayElimIndex_11 (_ BitVec 32))) (or (= v_arrayElimIndex_11 .cse0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| v_arrayElimIndex_11) (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_152 (_ BitVec 32))) (let ((.cse460 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593)) (.cse459 (select .cse8 v_arrayElimIndex_11))) (let ((.cse455 (select .cse460 .cse459)) (.cse457 (bvadd v_arrayElimCell_152 (_ bv4 32))) (.cse456 (select .cse460 .cse7)) (.cse458 (select |c_#length| .cse459))) (or (= (select .cse455 |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse456 (bvadd (_ bv4294967292 32) v_arrayElimIndex_11))) (not (bvule .cse457 .cse458)) (= (select .cse455 v_arrayElimCell_152) |c_ULTIMATE.start_main_~data~0#1|) (not (bvule v_arrayElimCell_152 .cse457)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse456 |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|)) (not (bvule (bvadd v_arrayElimCell_152 (_ bv8 32)) .cse458)))))) (= v_arrayElimIndex_11 |c_ULTIMATE.start_sll_prepend_~head#1.offset|))))))) (or (let ((.cse509 (forall ((v_arrayElimIndex_11 (_ BitVec 32))) (or (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_152 (_ BitVec 32))) (let ((.cse526 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593)) (.cse527 (bvadd v_arrayElimCell_152 (_ bv4 32)))) (or (not (bvule (bvadd v_arrayElimCell_152 (_ bv8 32)) .cse82)) (= (select (select .cse526 (select .cse8 v_arrayElimIndex_11)) v_arrayElimCell_152) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse526 .cse7) v_arrayElimCell_152)) (not (bvule .cse527 .cse82)) (not (bvule v_arrayElimCell_152 .cse527))))) (= v_arrayElimIndex_11 |c_ULTIMATE.start_sll_prepend_~head#1.offset|)))) (.cse510 (forall ((v_arrayElimIndex_11 (_ BitVec 32))) (or (forall ((v_arrayElimCell_152 (_ BitVec 32))) (let ((.cse525 (bvadd v_arrayElimCell_152 (_ bv4 32)))) (or (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse523 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593))) (let ((.cse524 (select .cse523 .cse7))) (or (= (select (select .cse523 (select .cse8 v_arrayElimIndex_11)) v_arrayElimCell_152) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse524 v_arrayElimCell_152)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse524 |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|)))))) (not (bvule (bvadd v_arrayElimCell_152 (_ bv8 32)) .cse82)) (not (bvule .cse525 .cse82)) (not (bvule v_arrayElimCell_152 .cse525))))) (= v_arrayElimIndex_11 |c_ULTIMATE.start_sll_prepend_~head#1.offset|))))) (and (or (and (or (and .cse275 (forall ((v_arrayElimIndex_11 (_ BitVec 32)) (v_arrayElimCell_152 (_ BitVec 32))) (let ((.cse505 (bvadd v_arrayElimCell_152 (_ bv4 32)))) (or (not (bvule (bvadd v_arrayElimCell_152 (_ bv8 32)) .cse82)) (not (bvule .cse505 .cse82)) (not (bvule v_arrayElimCell_152 .cse505)) (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse508 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593))) (let ((.cse506 (select .cse508 (select .cse8 v_arrayElimIndex_11))) (.cse507 (select .cse508 .cse7))) (or (= (select .cse506 |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|) |c_ULTIMATE.start_main_~data~0#1|) (= (select .cse506 v_arrayElimCell_152) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse507 v_arrayElimCell_152)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse507 |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|))))))))) .cse509 .cse300 .cse510 .cse276 (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimIndex_11 (_ BitVec 32)) (v_arrayElimCell_152 (_ BitVec 32))) (let ((.cse511 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593)) (.cse512 (bvadd v_arrayElimCell_152 (_ bv4 32)))) (or (not (bvule (bvadd v_arrayElimCell_152 (_ bv8 32)) .cse82)) (= (select (select .cse511 (select .cse8 v_arrayElimIndex_11)) v_arrayElimCell_152) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse511 .cse7) v_arrayElimCell_152)) (not (bvule .cse512 .cse82)) (not (bvule v_arrayElimCell_152 .cse512)))))) .cse97 .cse98) (or .cse1 .cse204)) .cse28) (or (and (forall ((v_arrayElimIndex_11 (_ BitVec 32))) (or (forall ((v_arrayElimCell_152 (_ BitVec 32))) (let ((.cse513 (bvadd v_arrayElimCell_152 (_ bv4 32)))) (or (not (bvule (bvadd v_arrayElimCell_152 (_ bv8 32)) .cse82)) (not (bvule .cse513 .cse82)) (not (bvule v_arrayElimCell_152 .cse513)) (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse516 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593))) (let ((.cse514 (select .cse516 (select .cse8 v_arrayElimIndex_11))) (.cse515 (select .cse516 .cse7))) (or (= (select .cse514 |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|) |c_ULTIMATE.start_main_~data~0#1|) (= (select .cse514 v_arrayElimCell_152) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse515 v_arrayElimCell_152)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse515 |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|))))))))) (= v_arrayElimIndex_11 |c_ULTIMATE.start_sll_prepend_~head#1.offset|))) (forall ((v_arrayElimIndex_11 (_ BitVec 32))) (or (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_152 (_ BitVec 32))) (let ((.cse518 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593))) (let ((.cse517 (select .cse518 (select .cse8 v_arrayElimIndex_11))) (.cse519 (bvadd v_arrayElimCell_152 (_ bv4 32)))) (or (= (select .cse517 |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|) |c_ULTIMATE.start_main_~data~0#1|) (not (bvule (bvadd v_arrayElimCell_152 (_ bv8 32)) .cse82)) (= (select .cse517 v_arrayElimCell_152) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse518 .cse7) v_arrayElimCell_152)) (not (bvule .cse519 .cse82)) (not (bvule v_arrayElimCell_152 .cse519)))))) (= v_arrayElimIndex_11 |c_ULTIMATE.start_sll_prepend_~head#1.offset|))) (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_152 (_ BitVec 32))) (let ((.cse521 (bvadd v_arrayElimCell_152 (_ bv4 32))) (.cse520 (select (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593) .cse7))) (or (not (bvule (bvadd v_arrayElimCell_152 (_ bv8 32)) .cse82)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse520 v_arrayElimCell_152)) (not (bvule .cse521 .cse82)) (not (bvule v_arrayElimCell_152 .cse521)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse520 |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|))))) .cse509 .cse510 (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_152 (_ BitVec 32))) (let ((.cse522 (bvadd v_arrayElimCell_152 (_ bv4 32)))) (or (not (bvule (bvadd v_arrayElimCell_152 (_ bv8 32)) .cse82)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593) .cse7) v_arrayElimCell_152)) (not (bvule .cse522 .cse82)) (not (bvule v_arrayElimCell_152 .cse522)))))) .cse97 .cse98) (or .cse1 .cse239) (or .cse12 .cse13 .cse15 .cse230 .cse21) .cse172 .cse173)) .cse174) (or (let ((.cse580 (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimIndex_11 (_ BitVec 32))) (let ((.cse640 (bvadd (_ bv4294967292 32) v_arrayElimIndex_11))) (or (not (bvule .cse640 v_arrayElimIndex_11)) (not (bvule (bvadd (_ bv4 32) v_arrayElimIndex_11) .cse82)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593) .cse7) .cse640)) (not (bvule v_arrayElimIndex_11 .cse82)) (= v_arrayElimIndex_11 .cse0))))) (.cse541 (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593) .cse7) |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|)))) (.cse535 (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimIndex_11 (_ BitVec 32))) (let ((.cse639 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593))) (let ((.cse637 (select .cse639 (select .cse8 v_arrayElimIndex_11))) (.cse638 (bvadd (_ bv4294967292 32) v_arrayElimIndex_11))) (or (= (select .cse637 |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse637 .cse638)) (not (bvule .cse638 v_arrayElimIndex_11)) (not (bvule (bvadd (_ bv4 32) v_arrayElimIndex_11) .cse82)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse639 .cse7) .cse638)) (not (bvule v_arrayElimIndex_11 .cse82))))))) (.cse542 (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimIndex_11 (_ BitVec 32))) (let ((.cse636 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593))) (let ((.cse634 (select .cse636 (select .cse8 v_arrayElimIndex_11))) (.cse635 (bvadd (_ bv4294967292 32) v_arrayElimIndex_11))) (or (= (select .cse634 |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse634 .cse635)) (not (bvule .cse635 v_arrayElimIndex_11)) (not (bvule (bvadd (_ bv4 32) v_arrayElimIndex_11) .cse82)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse636 .cse7) .cse635)) (not (bvule v_arrayElimIndex_11 .cse82)) (= v_arrayElimIndex_11 .cse0)))))) (.cse530 (not (bvule .cse0 .cse82))) (.cse531 (not (bvule .cse633 .cse82))) (.cse536 (and .cse14 .cse28)) (.cse631 (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimIndex_11 (_ BitVec 32))) (let ((.cse632 (bvadd (_ bv4294967292 32) v_arrayElimIndex_11))) (or (not (bvule .cse632 v_arrayElimIndex_11)) (not (bvule (bvadd (_ bv4 32) v_arrayElimIndex_11) .cse82)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593) .cse7) .cse632)) (not (bvule v_arrayElimIndex_11 .cse82))))))) (and (or (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimIndex_11 (_ BitVec 32))) (let ((.cse529 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593))) (let ((.cse528 (select .cse529 (select .cse8 v_arrayElimIndex_11)))) (or (= (select .cse528 |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse528 (bvadd (_ bv4294967292 32) v_arrayElimIndex_11))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse529 .cse7) |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|)))))) .cse530 .cse531 .cse13 .cse112 .cse21) (or .cse530 .cse531 (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimIndex_11 (_ BitVec 32))) (let ((.cse532 (select (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593) .cse7))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse532 (bvadd (_ bv4294967292 32) v_arrayElimIndex_11))) (= v_arrayElimIndex_11 .cse0) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse532 |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|))))) .cse13 .cse112 .cse21) (or (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimIndex_11 (_ BitVec 32))) (let ((.cse533 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593)) (.cse534 (bvadd (_ bv4294967292 32) v_arrayElimIndex_11))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse533 (select .cse8 v_arrayElimIndex_11)) .cse534)) (not (bvule .cse534 v_arrayElimIndex_11)) (not (bvule (bvadd (_ bv4 32) v_arrayElimIndex_11) .cse82)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse533 .cse7) .cse534)) (not (bvule v_arrayElimIndex_11 .cse82)) (= v_arrayElimIndex_11 .cse0)))) .cse28) (or .cse535 .cse28) (or .cse536 (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimIndex_11 (_ BitVec 32))) (let ((.cse540 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593))) (let ((.cse537 (select .cse540 (select .cse8 v_arrayElimIndex_11))) (.cse538 (bvadd (_ bv4294967292 32) v_arrayElimIndex_11)) (.cse539 (select .cse540 .cse7))) (or (= (select .cse537 |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse537 .cse538)) (not (bvule .cse538 v_arrayElimIndex_11)) (not (bvule (bvadd (_ bv4 32) v_arrayElimIndex_11) .cse82)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse539 .cse538)) (not (bvule v_arrayElimIndex_11 .cse82)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse539 |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|))))))) (or .cse530 .cse531 .cse13 .cse112 .cse541 .cse21) (or .cse542 .cse14) (or .cse536 (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimIndex_11 (_ BitVec 32))) (let ((.cse546 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593))) (let ((.cse543 (select .cse546 (select .cse8 v_arrayElimIndex_11))) (.cse544 (bvadd (_ bv4294967292 32) v_arrayElimIndex_11)) (.cse545 (select .cse546 .cse7))) (or (= (select .cse543 |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse543 .cse544)) (not (bvule .cse544 v_arrayElimIndex_11)) (not (bvule (bvadd (_ bv4 32) v_arrayElimIndex_11) .cse82)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse545 .cse544)) (not (bvule v_arrayElimIndex_11 .cse82)) (= v_arrayElimIndex_11 .cse0) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse545 |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|))))))) (or (and .cse277 (or .cse531 .cse112)) (and .cse278 (or .cse13 .cse112)) (and (or .cse530 .cse112) .cse280) (and .cse328 .cse547 .cse331) .cse21) (or .cse530 .cse13 .cse112 (and (or .cse531 (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimIndex_11 (_ BitVec 32))) (let ((.cse548 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse548 (select .cse8 v_arrayElimIndex_11)) (bvadd (_ bv4294967292 32) v_arrayElimIndex_11))) (= v_arrayElimIndex_11 |c_ULTIMATE.start_sll_prepend_~head#1.offset|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse548 .cse7) |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|)))))) (or .cse531 (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimIndex_11 (_ BitVec 32))) (let ((.cse549 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593))) (let ((.cse550 (bvadd (_ bv4294967292 32) v_arrayElimIndex_11)) (.cse551 (select .cse549 .cse7))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse549 (select .cse8 v_arrayElimIndex_11)) .cse550)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse551 .cse550)) (= v_arrayElimIndex_11 |c_ULTIMATE.start_sll_prepend_~head#1.offset|) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse551 |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|)))))))) .cse21) (or .cse536 (let ((.cse552 (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimIndex_11 (_ BitVec 32)) (v_arrayElimCell_152 (_ BitVec 32))) (let ((.cse568 (bvadd (_ bv4294967292 32) v_arrayElimIndex_11)) (.cse569 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593))) (or (not (bvule .cse568 v_arrayElimIndex_11)) (not (bvule (bvadd (_ bv4 32) v_arrayElimIndex_11) .cse82)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse569 .cse7) .cse568)) (not (bvule v_arrayElimIndex_11 .cse82)) (= v_arrayElimIndex_11 .cse0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| v_arrayElimIndex_11) (= (select (select .cse569 (select .cse8 v_arrayElimIndex_11)) v_arrayElimCell_152) |c_ULTIMATE.start_main_~data~0#1|))))) (.cse558 (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimIndex_11 (_ BitVec 32))) (let ((.cse567 (bvadd (_ bv4294967292 32) v_arrayElimIndex_11))) (or (not (bvule .cse567 v_arrayElimIndex_11)) (not (bvule (bvadd (_ bv4 32) v_arrayElimIndex_11) .cse82)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593) .cse7) .cse567)) (not (bvule v_arrayElimIndex_11 .cse82)) (= v_arrayElimIndex_11 .cse0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| v_arrayElimIndex_11))))) (.cse553 (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimIndex_11 (_ BitVec 32)) (v_arrayElimCell_152 (_ BitVec 32))) (let ((.cse566 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593))) (let ((.cse565 (bvadd (_ bv4294967292 32) v_arrayElimIndex_11)) (.cse564 (select .cse566 (select .cse8 v_arrayElimIndex_11)))) (or (= (select .cse564 |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|) |c_ULTIMATE.start_main_~data~0#1|) (not (bvule .cse565 v_arrayElimIndex_11)) (not (bvule (bvadd (_ bv4 32) v_arrayElimIndex_11) .cse82)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse566 .cse7) .cse565)) (not (bvule v_arrayElimIndex_11 .cse82)) (= v_arrayElimIndex_11 .cse0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| v_arrayElimIndex_11) (= (select .cse564 v_arrayElimCell_152) |c_ULTIMATE.start_main_~data~0#1|))))))) (and (or .cse552 .cse14) (or .cse553 .cse28) (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimIndex_11 (_ BitVec 32)) (v_arrayElimCell_152 (_ BitVec 32))) (let ((.cse557 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593))) (let ((.cse555 (bvadd (_ bv4294967292 32) v_arrayElimIndex_11)) (.cse554 (select .cse557 (select .cse8 v_arrayElimIndex_11))) (.cse556 (select .cse557 .cse7))) (or (= (select .cse554 |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|) |c_ULTIMATE.start_main_~data~0#1|) (not (bvule .cse555 v_arrayElimIndex_11)) (not (bvule (bvadd (_ bv4 32) v_arrayElimIndex_11) .cse82)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse556 .cse555)) (not (bvule v_arrayElimIndex_11 .cse82)) (= v_arrayElimIndex_11 .cse0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| v_arrayElimIndex_11) (= (select .cse554 v_arrayElimCell_152) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse556 |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|)))))) (or .cse552 .cse28) (or .cse558 .cse28) (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimIndex_11 (_ BitVec 32))) (let ((.cse559 (bvadd (_ bv4294967292 32) v_arrayElimIndex_11)) (.cse560 (select (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593) .cse7))) (or (not (bvule .cse559 v_arrayElimIndex_11)) (not (bvule (bvadd (_ bv4 32) v_arrayElimIndex_11) .cse82)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse560 .cse559)) (not (bvule v_arrayElimIndex_11 .cse82)) (= v_arrayElimIndex_11 .cse0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| v_arrayElimIndex_11) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse560 |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|))))) (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimIndex_11 (_ BitVec 32)) (v_arrayElimCell_152 (_ BitVec 32))) (let ((.cse563 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593))) (let ((.cse561 (bvadd (_ bv4294967292 32) v_arrayElimIndex_11)) (.cse562 (select .cse563 .cse7))) (or (not (bvule .cse561 v_arrayElimIndex_11)) (not (bvule (bvadd (_ bv4 32) v_arrayElimIndex_11) .cse82)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse562 .cse561)) (not (bvule v_arrayElimIndex_11 .cse82)) (= v_arrayElimIndex_11 .cse0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| v_arrayElimIndex_11) (= (select (select .cse563 (select .cse8 v_arrayElimIndex_11)) v_arrayElimCell_152) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse562 |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|)))))) (or .cse14 .cse558) (or .cse14 .cse553)))) (or .cse530 .cse531 .cse13 (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimIndex_11 (_ BitVec 32))) (let ((.cse571 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593))) (let ((.cse570 (select .cse571 (select .cse8 v_arrayElimIndex_11)))) (or (= (select .cse570 |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse570 (bvadd (_ bv4294967292 32) v_arrayElimIndex_11))) (= v_arrayElimIndex_11 .cse0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse571 .cse7) |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|)))))) .cse112 .cse21) (or (let ((.cse572 (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimIndex_11 (_ BitVec 32))) (let ((.cse576 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593)) (.cse577 (bvadd (_ bv4294967292 32) v_arrayElimIndex_11))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse576 (select .cse8 v_arrayElimIndex_11)) .cse577)) (not (bvule .cse577 v_arrayElimIndex_11)) (not (bvule (bvadd (_ bv4 32) v_arrayElimIndex_11) .cse82)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse576 .cse7) .cse577)) (not (bvule v_arrayElimIndex_11 .cse82)) (= v_arrayElimIndex_11 |c_ULTIMATE.start_sll_prepend_~head#1.offset|)))))) (and (or .cse572 .cse14) (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimIndex_11 (_ BitVec 32))) (let ((.cse573 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593))) (let ((.cse574 (bvadd (_ bv4294967292 32) v_arrayElimIndex_11)) (.cse575 (select .cse573 .cse7))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse573 (select .cse8 v_arrayElimIndex_11)) .cse574)) (not (bvule .cse574 v_arrayElimIndex_11)) (not (bvule (bvadd (_ bv4 32) v_arrayElimIndex_11) .cse82)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse575 .cse574)) (not (bvule v_arrayElimIndex_11 .cse82)) (= v_arrayElimIndex_11 |c_ULTIMATE.start_sll_prepend_~head#1.offset|) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse575 |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|)))))) (or .cse572 .cse28))) .cse536) (or .cse536 (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimIndex_11 (_ BitVec 32))) (let ((.cse578 (bvadd (_ bv4294967292 32) v_arrayElimIndex_11)) (.cse579 (select (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593) .cse7))) (or (not (bvule .cse578 v_arrayElimIndex_11)) (not (bvule (bvadd (_ bv4 32) v_arrayElimIndex_11) .cse82)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse579 .cse578)) (not (bvule v_arrayElimIndex_11 .cse82)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse579 |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|)))))) (or .cse580 .cse28) (or .cse14 .cse580) (or (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimIndex_11 (_ BitVec 32))) (let ((.cse581 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593)) (.cse582 (bvadd (_ bv4294967292 32) v_arrayElimIndex_11))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse581 (select .cse8 v_arrayElimIndex_11)) .cse582)) (not (bvule .cse582 v_arrayElimIndex_11)) (not (bvule (bvadd (_ bv4 32) v_arrayElimIndex_11) .cse82)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse581 .cse7) .cse582)) (not (bvule v_arrayElimIndex_11 .cse82))))) .cse28) (or .cse277 .cse278 .cse14 .cse279 .cse280 .cse21) (or .cse13 .cse112 (and (or .cse530 .cse531 (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimIndex_11 (_ BitVec 32)) (v_arrayElimCell_152 (_ BitVec 32))) (let ((.cse585 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593))) (let ((.cse583 (select .cse585 (select .cse8 v_arrayElimIndex_11))) (.cse584 (select .cse585 .cse7))) (or (= (select .cse583 |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse584 (bvadd (_ bv4294967292 32) v_arrayElimIndex_11))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| v_arrayElimIndex_11) (= (select .cse583 v_arrayElimCell_152) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse584 |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|))))))) (or .cse530 .cse531 (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimIndex_11 (_ BitVec 32)) (v_arrayElimCell_152 (_ BitVec 32))) (let ((.cse586 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593))) (or (= |c_ULTIMATE.start_main_~#s~0#1.offset| v_arrayElimIndex_11) (= (select (select .cse586 (select .cse8 v_arrayElimIndex_11)) v_arrayElimCell_152) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse586 .cse7) |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|)))))) (or .cse530 .cse531 (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimIndex_11 (_ BitVec 32)) (v_arrayElimCell_152 (_ BitVec 32))) (let ((.cse588 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593))) (let ((.cse587 (select .cse588 (select .cse8 v_arrayElimIndex_11)))) (or (= (select .cse587 |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| v_arrayElimIndex_11) (= (select .cse587 v_arrayElimCell_152) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse588 .cse7) |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|))))))) (or .cse530 (and (or .cse531 .cse541) (or (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimIndex_11 (_ BitVec 32))) (let ((.cse589 (select (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593) .cse7))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse589 (bvadd (_ bv4294967292 32) v_arrayElimIndex_11))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| v_arrayElimIndex_11) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse589 |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|))))) .cse531))) (or .cse530 .cse531 (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimIndex_11 (_ BitVec 32)) (v_arrayElimCell_152 (_ BitVec 32))) (let ((.cse591 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593))) (let ((.cse590 (select .cse591 .cse7))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse590 (bvadd (_ bv4294967292 32) v_arrayElimIndex_11))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| v_arrayElimIndex_11) (= (select (select .cse591 (select .cse8 v_arrayElimIndex_11)) v_arrayElimCell_152) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse590 |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|)))))))) .cse21) (or .cse14 .cse535) (or .cse542 .cse28) (or .cse530 .cse531 .cse13 .cse112 (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimIndex_11 (_ BitVec 32))) (let ((.cse592 (select (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593) .cse7))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse592 (bvadd (_ bv4294967292 32) v_arrayElimIndex_11))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse592 |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|))))) .cse21) (or .cse530 .cse531 .cse13 (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimIndex_11 (_ BitVec 32))) (let ((.cse596 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593))) (let ((.cse593 (select .cse596 (select .cse8 v_arrayElimIndex_11))) (.cse594 (bvadd (_ bv4294967292 32) v_arrayElimIndex_11)) (.cse595 (select .cse596 .cse7))) (or (= (select .cse593 |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse593 .cse594)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse595 .cse594)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse595 |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|)))))) .cse112 .cse21) (or (let ((.cse597 (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimIndex_11 (_ BitVec 32))) (let ((.cse601 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593)) (.cse602 (bvadd (_ bv4294967292 32) v_arrayElimIndex_11))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse601 (select .cse8 v_arrayElimIndex_11)) .cse602)) (not (bvule .cse602 v_arrayElimIndex_11)) (not (bvule (bvadd (_ bv4 32) v_arrayElimIndex_11) .cse82)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse601 .cse7) .cse602)) (not (bvule v_arrayElimIndex_11 .cse82)) (= v_arrayElimIndex_11 .cse0) (= v_arrayElimIndex_11 |c_ULTIMATE.start_sll_prepend_~head#1.offset|)))))) (and (or .cse14 .cse597) (or .cse597 .cse28) (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimIndex_11 (_ BitVec 32))) (let ((.cse598 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593))) (let ((.cse599 (bvadd (_ bv4294967292 32) v_arrayElimIndex_11)) (.cse600 (select .cse598 .cse7))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse598 (select .cse8 v_arrayElimIndex_11)) .cse599)) (not (bvule .cse599 v_arrayElimIndex_11)) (not (bvule (bvadd (_ bv4 32) v_arrayElimIndex_11) .cse82)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse600 .cse599)) (not (bvule v_arrayElimIndex_11 .cse82)) (= v_arrayElimIndex_11 .cse0) (= v_arrayElimIndex_11 |c_ULTIMATE.start_sll_prepend_~head#1.offset|) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse600 |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|)))))))) .cse536) (or (and (forall ((v_arrayElimIndex_11 (_ BitVec 32))) (let ((.cse603 (bvadd (_ bv4294967292 32) v_arrayElimIndex_11))) (or (not (bvule .cse603 v_arrayElimIndex_11)) (not (bvule (bvadd (_ bv4 32) v_arrayElimIndex_11) .cse82)) (not (bvule v_arrayElimIndex_11 .cse82)) (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593) .cse7) .cse603))) (= v_arrayElimIndex_11 .cse0)))) (forall ((v_arrayElimIndex_11 (_ BitVec 32))) (let ((.cse604 (bvadd (_ bv4294967292 32) v_arrayElimIndex_11))) (or (not (bvule .cse604 v_arrayElimIndex_11)) (not (bvule (bvadd (_ bv4 32) v_arrayElimIndex_11) .cse82)) (not (bvule v_arrayElimIndex_11 .cse82)) (= v_arrayElimIndex_11 .cse0) (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_152 (_ BitVec 32))) (let ((.cse606 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593))) (let ((.cse605 (select .cse606 (select .cse8 v_arrayElimIndex_11)))) (or (= (select .cse605 |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse606 .cse7) .cse604)) (= (select .cse605 v_arrayElimCell_152) |c_ULTIMATE.start_main_~data~0#1|)))))))) (or (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimIndex_11 (_ BitVec 32)) (v_arrayElimCell_152 (_ BitVec 32))) (let ((.cse609 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593))) (let ((.cse608 (bvadd (_ bv4294967292 32) v_arrayElimIndex_11)) (.cse607 (select .cse609 (select .cse8 v_arrayElimIndex_11)))) (or (= (select .cse607 |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|) |c_ULTIMATE.start_main_~data~0#1|) (not (bvule .cse608 v_arrayElimIndex_11)) (not (bvule (bvadd (_ bv4 32) v_arrayElimIndex_11) .cse82)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse609 .cse7) .cse608)) (not (bvule v_arrayElimIndex_11 .cse82)) (= v_arrayElimIndex_11 .cse0) (= (select .cse607 v_arrayElimCell_152) |c_ULTIMATE.start_main_~data~0#1|))))) .cse14) (forall ((v_arrayElimIndex_11 (_ BitVec 32))) (let ((.cse612 (bvadd (_ bv4294967292 32) v_arrayElimIndex_11))) (or (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_152 (_ BitVec 32))) (let ((.cse613 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593))) (let ((.cse610 (select .cse613 (select .cse8 v_arrayElimIndex_11))) (.cse611 (select .cse613 .cse7))) (or (= (select .cse610 |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse611 .cse612)) (= (select .cse610 v_arrayElimCell_152) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse611 |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|)))))) (not (bvule .cse612 v_arrayElimIndex_11)) (not (bvule (bvadd (_ bv4 32) v_arrayElimIndex_11) .cse82)) (not (bvule v_arrayElimIndex_11 .cse82)) (= v_arrayElimIndex_11 .cse0)))) (forall ((v_arrayElimIndex_11 (_ BitVec 32))) (let ((.cse614 (bvadd (_ bv4294967292 32) v_arrayElimIndex_11))) (or (not (bvule .cse614 v_arrayElimIndex_11)) (not (bvule (bvadd (_ bv4 32) v_arrayElimIndex_11) .cse82)) (not (bvule v_arrayElimIndex_11 .cse82)) (= v_arrayElimIndex_11 .cse0) (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_152 (_ BitVec 32))) (let ((.cse615 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse615 .cse7) .cse614)) (= (select (select .cse615 (select .cse8 v_arrayElimIndex_11)) v_arrayElimCell_152) |c_ULTIMATE.start_main_~data~0#1|)))) (= v_arrayElimIndex_11 |c_ULTIMATE.start_sll_prepend_~head#1.offset|)))) (forall ((v_arrayElimIndex_11 (_ BitVec 32))) (let ((.cse616 (bvadd (_ bv4294967292 32) v_arrayElimIndex_11))) (or (not (bvule .cse616 v_arrayElimIndex_11)) (not (bvule (bvadd (_ bv4 32) v_arrayElimIndex_11) .cse82)) (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_152 (_ BitVec 32))) (let ((.cse618 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593))) (let ((.cse617 (select .cse618 .cse7))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse617 .cse616)) (= (select (select .cse618 (select .cse8 v_arrayElimIndex_11)) v_arrayElimCell_152) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse617 |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|)))))) (not (bvule v_arrayElimIndex_11 .cse82)) (= v_arrayElimIndex_11 .cse0) (= v_arrayElimIndex_11 |c_ULTIMATE.start_sll_prepend_~head#1.offset|)))) (forall ((v_arrayElimIndex_11 (_ BitVec 32))) (let ((.cse619 (bvadd (_ bv4294967292 32) v_arrayElimIndex_11))) (or (not (bvule .cse619 v_arrayElimIndex_11)) (not (bvule (bvadd (_ bv4 32) v_arrayElimIndex_11) .cse82)) (not (bvule v_arrayElimIndex_11 .cse82)) (= v_arrayElimIndex_11 .cse0) (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_152 (_ BitVec 32))) (let ((.cse620 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse620 .cse7) .cse619)) (= (select (select .cse620 (select .cse8 v_arrayElimIndex_11)) v_arrayElimCell_152) |c_ULTIMATE.start_main_~data~0#1|))))))) (forall ((v_arrayElimIndex_11 (_ BitVec 32))) (let ((.cse621 (bvadd (_ bv4294967292 32) v_arrayElimIndex_11))) (or (not (bvule .cse621 v_arrayElimIndex_11)) (not (bvule (bvadd (_ bv4 32) v_arrayElimIndex_11) .cse82)) (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse622 (select (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593) .cse7))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse622 .cse621)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse622 |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|))))) (not (bvule v_arrayElimIndex_11 .cse82)) (= v_arrayElimIndex_11 .cse0)))) (or .cse14 (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimIndex_11 (_ BitVec 32)) (v_arrayElimCell_152 (_ BitVec 32))) (let ((.cse623 (bvadd (_ bv4294967292 32) v_arrayElimIndex_11)) (.cse624 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593))) (or (not (bvule .cse623 v_arrayElimIndex_11)) (not (bvule (bvadd (_ bv4 32) v_arrayElimIndex_11) .cse82)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse624 .cse7) .cse623)) (not (bvule v_arrayElimIndex_11 .cse82)) (= v_arrayElimIndex_11 .cse0) (= (select (select .cse624 (select .cse8 v_arrayElimIndex_11)) v_arrayElimCell_152) |c_ULTIMATE.start_main_~data~0#1|) (= v_arrayElimIndex_11 |c_ULTIMATE.start_sll_prepend_~head#1.offset|)))))) .cse174) (or .cse530 .cse531 .cse13 .cse112 (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimIndex_11 (_ BitVec 32))) (let ((.cse628 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593))) (let ((.cse625 (select .cse628 (select .cse8 v_arrayElimIndex_11))) (.cse626 (bvadd (_ bv4294967292 32) v_arrayElimIndex_11)) (.cse627 (select .cse628 .cse7))) (or (= (select .cse625 |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse625 .cse626)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse627 .cse626)) (= v_arrayElimIndex_11 .cse0) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse627 |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|)))))) .cse21) (or .cse536 (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimIndex_11 (_ BitVec 32))) (let ((.cse629 (bvadd (_ bv4294967292 32) v_arrayElimIndex_11)) (.cse630 (select (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593) .cse7))) (or (not (bvule .cse629 v_arrayElimIndex_11)) (not (bvule (bvadd (_ bv4 32) v_arrayElimIndex_11) .cse82)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse630 .cse629)) (not (bvule v_arrayElimIndex_11 .cse82)) (= v_arrayElimIndex_11 .cse0) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse630 |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|)))))) (or .cse631 .cse28) (or .cse14 .cse631))) .cse97 .cse98))))))))))) is different from true