./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 e04fb08f Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccdeb345-a6bd-4eb4-8736-1936ccfa9ff5/bin/uautomizer-tPACEb0tL8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccdeb345-a6bd-4eb4-8736-1936ccfa9ff5/bin/uautomizer-tPACEb0tL8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccdeb345-a6bd-4eb4-8736-1936ccfa9ff5/bin/uautomizer-tPACEb0tL8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccdeb345-a6bd-4eb4-8736-1936ccfa9ff5/bin/uautomizer-tPACEb0tL8/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/sll2n_prepend_unequal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccdeb345-a6bd-4eb4-8736-1936ccfa9ff5/bin/uautomizer-tPACEb0tL8/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccdeb345-a6bd-4eb4-8736-1936ccfa9ff5/bin/uautomizer-tPACEb0tL8 --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-e04fb08 [2022-11-16 12:17:12,219 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-16 12:17:12,222 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-16 12:17:12,270 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-16 12:17:12,272 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-16 12:17:12,277 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-16 12:17:12,279 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-16 12:17:12,284 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-16 12:17:12,286 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-16 12:17:12,293 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-16 12:17:12,294 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-16 12:17:12,296 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-16 12:17:12,297 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-16 12:17:12,300 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-16 12:17:12,301 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-16 12:17:12,304 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-16 12:17:12,307 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-16 12:17:12,308 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-16 12:17:12,310 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-16 12:17:12,318 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-16 12:17:12,321 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-16 12:17:12,323 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-16 12:17:12,326 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-16 12:17:12,327 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-16 12:17:12,337 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-16 12:17:12,339 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-16 12:17:12,340 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-16 12:17:12,341 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-16 12:17:12,343 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-16 12:17:12,344 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-16 12:17:12,344 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-16 12:17:12,346 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-16 12:17:12,348 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-16 12:17:12,349 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-16 12:17:12,352 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-16 12:17:12,353 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-16 12:17:12,354 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-16 12:17:12,354 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-16 12:17:12,354 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-16 12:17:12,355 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-16 12:17:12,356 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-16 12:17:12,357 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccdeb345-a6bd-4eb4-8736-1936ccfa9ff5/bin/uautomizer-tPACEb0tL8/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-11-16 12:17:12,408 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-16 12:17:12,408 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-16 12:17:12,409 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-16 12:17:12,409 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-16 12:17:12,410 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-16 12:17:12,411 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-16 12:17:12,411 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-16 12:17:12,412 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-16 12:17:12,412 INFO L138 SettingsManager]: * Use SBE=true [2022-11-16 12:17:12,412 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-16 12:17:12,414 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-16 12:17:12,414 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-16 12:17:12,414 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-16 12:17:12,415 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-16 12:17:12,415 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-16 12:17:12,415 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-16 12:17:12,415 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-16 12:17:12,416 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-16 12:17:12,416 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-16 12:17:12,416 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-16 12:17:12,416 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-16 12:17:12,417 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-16 12:17:12,417 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-16 12:17:12,417 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-16 12:17:12,418 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-16 12:17:12,418 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 12:17:12,420 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-16 12:17:12,420 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-16 12:17:12,420 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-16 12:17:12,421 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-16 12:17:12,421 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_ccdeb345-a6bd-4eb4-8736-1936ccfa9ff5/bin/uautomizer-tPACEb0tL8/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_ccdeb345-a6bd-4eb4-8736-1936ccfa9ff5/bin/uautomizer-tPACEb0tL8 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-16 12:17:12,815 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-16 12:17:12,870 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-16 12:17:12,875 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-16 12:17:12,877 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-16 12:17:12,878 INFO L275 PluginConnector]: CDTParser initialized [2022-11-16 12:17:12,879 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccdeb345-a6bd-4eb4-8736-1936ccfa9ff5/bin/uautomizer-tPACEb0tL8/../../sv-benchmarks/c/list-simple/sll2n_prepend_unequal.i [2022-11-16 12:17:12,960 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccdeb345-a6bd-4eb4-8736-1936ccfa9ff5/bin/uautomizer-tPACEb0tL8/data/4c5a7f4a1/fc12c822d67e44ca98ddcb8015d70552/FLAG86196da4e [2022-11-16 12:17:13,649 INFO L306 CDTParser]: Found 1 translation units. [2022-11-16 12:17:13,655 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccdeb345-a6bd-4eb4-8736-1936ccfa9ff5/sv-benchmarks/c/list-simple/sll2n_prepend_unequal.i [2022-11-16 12:17:13,674 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccdeb345-a6bd-4eb4-8736-1936ccfa9ff5/bin/uautomizer-tPACEb0tL8/data/4c5a7f4a1/fc12c822d67e44ca98ddcb8015d70552/FLAG86196da4e [2022-11-16 12:17:13,900 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccdeb345-a6bd-4eb4-8736-1936ccfa9ff5/bin/uautomizer-tPACEb0tL8/data/4c5a7f4a1/fc12c822d67e44ca98ddcb8015d70552 [2022-11-16 12:17:13,907 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-16 12:17:13,911 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-16 12:17:13,914 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-16 12:17:13,914 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-16 12:17:13,919 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-16 12:17:13,920 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:17:13" (1/1) ... [2022-11-16 12:17:13,922 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@37c91900 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:17:13, skipping insertion in model container [2022-11-16 12:17:13,923 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:17:13" (1/1) ... [2022-11-16 12:17:13,931 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-16 12:17:14,000 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-16 12:17:14,431 WARN L229 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_ccdeb345-a6bd-4eb4-8736-1936ccfa9ff5/sv-benchmarks/c/list-simple/sll2n_prepend_unequal.i[24165,24178] [2022-11-16 12:17:14,434 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 12:17:14,444 INFO L203 MainTranslator]: Completed pre-run [2022-11-16 12:17:14,492 WARN L229 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_ccdeb345-a6bd-4eb4-8736-1936ccfa9ff5/sv-benchmarks/c/list-simple/sll2n_prepend_unequal.i[24165,24178] [2022-11-16 12:17:14,493 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 12:17:14,523 INFO L208 MainTranslator]: Completed translation [2022-11-16 12:17:14,524 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:17:14 WrapperNode [2022-11-16 12:17:14,524 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-16 12:17:14,525 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-16 12:17:14,526 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-16 12:17:14,526 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-16 12:17:14,537 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:17:14" (1/1) ... [2022-11-16 12:17:14,553 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:17:14" (1/1) ... [2022-11-16 12:17:14,579 INFO L138 Inliner]: procedures = 127, calls = 32, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 115 [2022-11-16 12:17:14,580 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-16 12:17:14,581 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-16 12:17:14,581 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-16 12:17:14,581 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-16 12:17:14,592 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:17:14" (1/1) ... [2022-11-16 12:17:14,592 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:17:14" (1/1) ... [2022-11-16 12:17:14,597 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:17:14" (1/1) ... [2022-11-16 12:17:14,597 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:17:14" (1/1) ... [2022-11-16 12:17:14,605 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:17:14" (1/1) ... [2022-11-16 12:17:14,623 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:17:14" (1/1) ... [2022-11-16 12:17:14,625 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:17:14" (1/1) ... [2022-11-16 12:17:14,626 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:17:14" (1/1) ... [2022-11-16 12:17:14,630 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-16 12:17:14,631 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-16 12:17:14,632 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-16 12:17:14,633 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-16 12:17:14,634 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:17:14" (1/1) ... [2022-11-16 12:17:14,658 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 12:17:14,673 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccdeb345-a6bd-4eb4-8736-1936ccfa9ff5/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:17:14,696 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccdeb345-a6bd-4eb4-8736-1936ccfa9ff5/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-16 12:17:14,715 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccdeb345-a6bd-4eb4-8736-1936ccfa9ff5/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-16 12:17:14,753 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-16 12:17:14,754 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-16 12:17:14,754 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2022-11-16 12:17:14,754 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2022-11-16 12:17:14,754 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-16 12:17:14,754 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-16 12:17:14,755 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-16 12:17:14,755 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-16 12:17:14,755 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-16 12:17:14,755 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-16 12:17:14,756 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-16 12:17:14,756 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-16 12:17:14,756 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-16 12:17:14,756 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-16 12:17:14,885 INFO L235 CfgBuilder]: Building ICFG [2022-11-16 12:17:14,888 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-16 12:17:15,325 INFO L276 CfgBuilder]: Performing block encoding [2022-11-16 12:17:15,334 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-16 12:17:15,334 INFO L300 CfgBuilder]: Removed 3 assume(true) statements. [2022-11-16 12:17:15,337 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:17:15 BoogieIcfgContainer [2022-11-16 12:17:15,337 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-16 12:17:15,340 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-16 12:17:15,340 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-16 12:17:15,356 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-16 12:17:15,356 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 12:17:13" (1/3) ... [2022-11-16 12:17:15,357 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@238969e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:17:15, skipping insertion in model container [2022-11-16 12:17:15,358 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:17:14" (2/3) ... [2022-11-16 12:17:15,358 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@238969e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:17:15, skipping insertion in model container [2022-11-16 12:17:15,358 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:17:15" (3/3) ... [2022-11-16 12:17:15,360 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2n_prepend_unequal.i [2022-11-16 12:17:15,383 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-16 12:17:15,383 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 31 error locations. [2022-11-16 12:17:15,447 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-16 12:17:15,456 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;@28f58f28, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-16 12:17:15,457 INFO L358 AbstractCegarLoop]: Starting to check reachability of 31 error locations. [2022-11-16 12:17:15,462 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-16 12:17:15,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-16 12:17:15,474 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:17:15,475 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:17:15,475 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-16 12:17:15,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:17:15,483 INFO L85 PathProgramCache]: Analyzing trace with hash 1813443002, now seen corresponding path program 1 times [2022-11-16 12:17:15,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:17:15,495 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063232396] [2022-11-16 12:17:15,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:17:15,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:17:15,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:16,002 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-16 12:17:16,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:17:16,006 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063232396] [2022-11-16 12:17:16,007 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1063232396] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:17:16,007 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:17:16,008 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 12:17:16,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812864306] [2022-11-16 12:17:16,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:17:16,017 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 12:17:16,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:17:16,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 12:17:16,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 12:17:16,066 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-16 12:17:16,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:17:16,241 INFO L93 Difference]: Finished difference Result 79 states and 85 transitions. [2022-11-16 12:17:16,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 12:17:16,245 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-16 12:17:16,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:17:16,257 INFO L225 Difference]: With dead ends: 79 [2022-11-16 12:17:16,257 INFO L226 Difference]: Without dead ends: 76 [2022-11-16 12:17:16,260 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-16 12:17:16,264 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-16 12:17:16,266 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-16 12:17:16,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-11-16 12:17:16,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2022-11-16 12:17:16,326 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-16 12:17:16,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 81 transitions. [2022-11-16 12:17:16,330 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 81 transitions. Word has length 7 [2022-11-16 12:17:16,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:17:16,330 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 81 transitions. [2022-11-16 12:17:16,330 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-16 12:17:16,331 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 81 transitions. [2022-11-16 12:17:16,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-16 12:17:16,331 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:17:16,331 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:17:16,332 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-16 12:17:16,332 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-16 12:17:16,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:17:16,333 INFO L85 PathProgramCache]: Analyzing trace with hash 1813443001, now seen corresponding path program 1 times [2022-11-16 12:17:16,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:17:16,334 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580769933] [2022-11-16 12:17:16,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:17:16,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:17:16,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:16,399 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-16 12:17:16,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:17:16,399 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580769933] [2022-11-16 12:17:16,400 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [580769933] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:17:16,400 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:17:16,400 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 12:17:16,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028943063] [2022-11-16 12:17:16,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:17:16,402 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 12:17:16,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:17:16,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 12:17:16,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 12:17:16,403 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-16 12:17:16,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:17:16,486 INFO L93 Difference]: Finished difference Result 74 states and 79 transitions. [2022-11-16 12:17:16,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 12:17:16,487 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-16 12:17:16,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:17:16,488 INFO L225 Difference]: With dead ends: 74 [2022-11-16 12:17:16,489 INFO L226 Difference]: Without dead ends: 74 [2022-11-16 12:17:16,489 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-16 12:17:16,491 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-16 12:17:16,492 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-16 12:17:16,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2022-11-16 12:17:16,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2022-11-16 12:17:16,499 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-16 12:17:16,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 79 transitions. [2022-11-16 12:17:16,501 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 79 transitions. Word has length 7 [2022-11-16 12:17:16,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:17:16,502 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 79 transitions. [2022-11-16 12:17:16,502 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-16 12:17:16,502 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 79 transitions. [2022-11-16 12:17:16,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-16 12:17:16,503 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:17:16,503 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:17:16,503 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-16 12:17:16,504 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-16 12:17:16,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:17:16,508 INFO L85 PathProgramCache]: Analyzing trace with hash 712803264, now seen corresponding path program 1 times [2022-11-16 12:17:16,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:17:16,508 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338806766] [2022-11-16 12:17:16,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:17:16,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:17:16,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:16,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 12:17:16,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:16,838 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-16 12:17:16,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:17:16,839 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338806766] [2022-11-16 12:17:16,839 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [338806766] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:17:16,839 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:17:16,839 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-16 12:17:16,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577884304] [2022-11-16 12:17:16,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:17:16,840 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 12:17:16,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:17:16,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 12:17:16,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-16 12:17:16,842 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-16 12:17:17,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:17:17,140 INFO L93 Difference]: Finished difference Result 78 states and 86 transitions. [2022-11-16 12:17:17,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 12:17:17,141 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-16 12:17:17,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:17:17,150 INFO L225 Difference]: With dead ends: 78 [2022-11-16 12:17:17,150 INFO L226 Difference]: Without dead ends: 78 [2022-11-16 12:17:17,153 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 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-16 12:17:17,161 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-16 12:17:17,163 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-16 12:17:17,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-11-16 12:17:17,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 73. [2022-11-16 12:17:17,178 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-16 12:17:17,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 78 transitions. [2022-11-16 12:17:17,186 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 78 transitions. Word has length 13 [2022-11-16 12:17:17,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:17:17,188 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 78 transitions. [2022-11-16 12:17:17,188 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-16 12:17:17,188 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 78 transitions. [2022-11-16 12:17:17,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-16 12:17:17,189 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:17:17,189 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:17:17,189 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-16 12:17:17,190 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-16 12:17:17,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:17:17,192 INFO L85 PathProgramCache]: Analyzing trace with hash 712803265, now seen corresponding path program 1 times [2022-11-16 12:17:17,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:17:17,193 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657715857] [2022-11-16 12:17:17,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:17:17,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:17:17,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:17,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 12:17:17,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:17,727 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-16 12:17:17,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:17:17,728 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657715857] [2022-11-16 12:17:17,728 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1657715857] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:17:17,729 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:17:17,729 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-16 12:17:17,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762817835] [2022-11-16 12:17:17,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:17:17,730 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 12:17:17,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:17:17,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 12:17:17,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-16 12:17:17,734 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-16 12:17:18,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:17:18,009 INFO L93 Difference]: Finished difference Result 77 states and 85 transitions. [2022-11-16 12:17:18,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 12:17:18,009 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-16 12:17:18,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:17:18,011 INFO L225 Difference]: With dead ends: 77 [2022-11-16 12:17:18,011 INFO L226 Difference]: Without dead ends: 77 [2022-11-16 12:17:18,011 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-16 12:17:18,012 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-16 12:17:18,013 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-16 12:17:18,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-11-16 12:17:18,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 72. [2022-11-16 12:17:18,019 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-16 12:17:18,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 77 transitions. [2022-11-16 12:17:18,020 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 77 transitions. Word has length 13 [2022-11-16 12:17:18,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:17:18,020 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 77 transitions. [2022-11-16 12:17:18,021 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-16 12:17:18,021 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 77 transitions. [2022-11-16 12:17:18,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-16 12:17:18,022 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:17:18,022 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:17:18,022 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-16 12:17:18,022 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-16 12:17:18,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:17:18,023 INFO L85 PathProgramCache]: Analyzing trace with hash 150600896, now seen corresponding path program 1 times [2022-11-16 12:17:18,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:17:18,024 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394015639] [2022-11-16 12:17:18,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:17:18,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:17:18,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:18,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-11-16 12:17:18,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:18,107 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-16 12:17:18,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:17:18,108 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394015639] [2022-11-16 12:17:18,108 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1394015639] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:17:18,108 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:17:18,109 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 12:17:18,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984926291] [2022-11-16 12:17:18,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:17:18,111 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 12:17:18,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:17:18,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 12:17:18,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 12:17:18,113 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-16 12:17:18,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:17:18,203 INFO L93 Difference]: Finished difference Result 78 states and 84 transitions. [2022-11-16 12:17:18,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 12:17:18,203 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-16 12:17:18,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:17:18,204 INFO L225 Difference]: With dead ends: 78 [2022-11-16 12:17:18,205 INFO L226 Difference]: Without dead ends: 78 [2022-11-16 12:17:18,205 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-16 12:17:18,206 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-16 12:17:18,206 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-16 12:17:18,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-11-16 12:17:18,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 73. [2022-11-16 12:17:18,212 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-16 12:17:18,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 78 transitions. [2022-11-16 12:17:18,213 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 78 transitions. Word has length 15 [2022-11-16 12:17:18,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:17:18,214 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 78 transitions. [2022-11-16 12:17:18,214 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-16 12:17:18,214 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 78 transitions. [2022-11-16 12:17:18,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-16 12:17:18,219 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:17:18,219 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-16 12:17:18,219 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-16 12:17:18,222 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-16 12:17:18,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:17:18,228 INFO L85 PathProgramCache]: Analyzing trace with hash -513998014, now seen corresponding path program 1 times [2022-11-16 12:17:18,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:17:18,228 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295133918] [2022-11-16 12:17:18,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:17:18,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:17:18,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:18,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 12:17:18,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:18,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-16 12:17:18,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:18,423 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-16 12:17:18,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:17:18,424 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295133918] [2022-11-16 12:17:18,424 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [295133918] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:17:18,425 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1585285303] [2022-11-16 12:17:18,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:17:18,426 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:17:18,426 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccdeb345-a6bd-4eb4-8736-1936ccfa9ff5/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:17:18,430 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccdeb345-a6bd-4eb4-8736-1936ccfa9ff5/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:17:18,458 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccdeb345-a6bd-4eb4-8736-1936ccfa9ff5/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-16 12:17:18,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:18,600 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-16 12:17:18,608 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:17:18,685 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-16 12:17:18,685 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:17:18,753 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-16 12:17:18,753 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1585285303] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 12:17:18,754 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 12:17:18,754 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 6 [2022-11-16 12:17:18,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197032959] [2022-11-16 12:17:18,755 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 12:17:18,755 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 12:17:18,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:17:18,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 12:17:18,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-16 12:17:18,757 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-16 12:17:18,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:17:18,884 INFO L93 Difference]: Finished difference Result 79 states and 85 transitions. [2022-11-16 12:17:18,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 12:17:18,887 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-16 12:17:18,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:17:18,888 INFO L225 Difference]: With dead ends: 79 [2022-11-16 12:17:18,888 INFO L226 Difference]: Without dead ends: 79 [2022-11-16 12:17:18,889 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-16 12:17:18,894 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-16 12:17:18,895 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-16 12:17:18,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-11-16 12:17:18,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2022-11-16 12:17:18,911 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-16 12:17:18,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 85 transitions. [2022-11-16 12:17:18,917 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 85 transitions. Word has length 28 [2022-11-16 12:17:18,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:17:18,917 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 85 transitions. [2022-11-16 12:17:18,918 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-16 12:17:18,918 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 85 transitions. [2022-11-16 12:17:18,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-11-16 12:17:18,920 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:17:18,920 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-16 12:17:18,929 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccdeb345-a6bd-4eb4-8736-1936ccfa9ff5/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-16 12:17:19,127 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccdeb345-a6bd-4eb4-8736-1936ccfa9ff5/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:17:19,128 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-16 12:17:19,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:17:19,128 INFO L85 PathProgramCache]: Analyzing trace with hash -416014336, now seen corresponding path program 2 times [2022-11-16 12:17:19,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:17:19,129 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225632874] [2022-11-16 12:17:19,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:17:19,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:17:19,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:19,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 12:17:19,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:19,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-16 12:17:19,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:19,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-16 12:17:19,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:19,797 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-16 12:17:19,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:17:19,798 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225632874] [2022-11-16 12:17:19,798 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1225632874] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:17:19,798 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:17:19,798 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-16 12:17:19,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102023463] [2022-11-16 12:17:19,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:17:19,799 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 12:17:19,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:17:19,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 12:17:19,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-16 12:17:19,803 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-16 12:17:20,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:17:20,036 INFO L93 Difference]: Finished difference Result 87 states and 94 transitions. [2022-11-16 12:17:20,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 12:17:20,036 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-16 12:17:20,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:17:20,038 INFO L225 Difference]: With dead ends: 87 [2022-11-16 12:17:20,038 INFO L226 Difference]: Without dead ends: 87 [2022-11-16 12:17:20,039 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-16 12:17:20,040 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 105 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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-16 12:17:20,041 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-16 12:17:20,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2022-11-16 12:17:20,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 75. [2022-11-16 12:17:20,056 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-16 12:17:20,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 81 transitions. [2022-11-16 12:17:20,057 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 81 transitions. Word has length 41 [2022-11-16 12:17:20,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:17:20,058 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 81 transitions. [2022-11-16 12:17:20,058 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-16 12:17:20,058 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 81 transitions. [2022-11-16 12:17:20,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-11-16 12:17:20,059 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:17:20,060 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-16 12:17:20,060 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-16 12:17:20,060 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-16 12:17:20,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:17:20,061 INFO L85 PathProgramCache]: Analyzing trace with hash -416014335, now seen corresponding path program 1 times [2022-11-16 12:17:20,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:17:20,061 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131583162] [2022-11-16 12:17:20,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:17:20,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:17:20,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:20,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 12:17:20,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:20,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-16 12:17:20,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:21,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-16 12:17:21,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:21,107 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-16 12:17:21,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:17:21,108 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131583162] [2022-11-16 12:17:21,108 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2131583162] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:17:21,109 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [119323990] [2022-11-16 12:17:21,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:17:21,109 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:17:21,109 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccdeb345-a6bd-4eb4-8736-1936ccfa9ff5/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:17:21,111 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccdeb345-a6bd-4eb4-8736-1936ccfa9ff5/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:17:21,134 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccdeb345-a6bd-4eb4-8736-1936ccfa9ff5/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-16 12:17:21,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:21,322 INFO L263 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 26 conjunts are in the unsatisfiable core [2022-11-16 12:17:21,328 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:17:21,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-16 12:17:21,443 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-16 12:17:21,499 WARN L855 $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-16 12:17:21,671 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:17:21,675 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-16 12:17:21,759 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-16 12:17:21,779 WARN L855 $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-16 12:17:21,866 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:17:21,867 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-16 12:17:21,962 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-16 12:17:21,977 WARN L855 $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-16 12:17:22,067 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:17:22,069 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-16 12:17:22,082 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-16 12:17:22,082 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:17:22,243 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [119323990] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:17:22,243 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 12:17:22,244 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 14 [2022-11-16 12:17:22,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080131449] [2022-11-16 12:17:22,244 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 12:17:22,245 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-16 12:17:22,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:17:22,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-16 12:17:22,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=145, Unknown=3, NotChecked=78, Total=272 [2022-11-16 12:17:22,246 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-16 12:17:22,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:17:22,732 INFO L93 Difference]: Finished difference Result 83 states and 90 transitions. [2022-11-16 12:17:22,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-16 12:17:22,733 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-16 12:17:22,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:17:22,734 INFO L225 Difference]: With dead ends: 83 [2022-11-16 12:17:22,734 INFO L226 Difference]: Without dead ends: 83 [2022-11-16 12:17:22,734 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 42 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=62, Invalid=187, Unknown=3, NotChecked=90, Total=342 [2022-11-16 12:17:22,735 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.4s IncrementalHoareTripleChecker+Time [2022-11-16 12:17:22,736 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.4s Time] [2022-11-16 12:17:22,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2022-11-16 12:17:22,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 71. [2022-11-16 12:17:22,739 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-16 12:17:22,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 77 transitions. [2022-11-16 12:17:22,740 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 77 transitions. Word has length 41 [2022-11-16 12:17:22,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:17:22,742 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 77 transitions. [2022-11-16 12:17:22,742 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-16 12:17:22,742 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 77 transitions. [2022-11-16 12:17:22,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-11-16 12:17:22,743 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:17:22,743 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-16 12:17:22,755 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccdeb345-a6bd-4eb4-8736-1936ccfa9ff5/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-11-16 12:17:22,950 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccdeb345-a6bd-4eb4-8736-1936ccfa9ff5/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:17:22,951 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-16 12:17:22,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:17:22,951 INFO L85 PathProgramCache]: Analyzing trace with hash -11542527, now seen corresponding path program 1 times [2022-11-16 12:17:22,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:17:22,952 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730087547] [2022-11-16 12:17:22,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:17:22,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:17:22,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:23,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 12:17:23,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:23,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-16 12:17:23,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:23,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-16 12:17:23,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:23,429 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-16 12:17:23,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:17:23,430 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730087547] [2022-11-16 12:17:23,430 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730087547] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:17:23,430 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:17:23,431 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-16 12:17:23,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975733106] [2022-11-16 12:17:23,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:17:23,432 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 12:17:23,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:17:23,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 12:17:23,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-16 12:17:23,433 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-16 12:17:23,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:17:23,607 INFO L93 Difference]: Finished difference Result 70 states and 76 transitions. [2022-11-16 12:17:23,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 12:17:23,608 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-16 12:17:23,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:17:23,609 INFO L225 Difference]: With dead ends: 70 [2022-11-16 12:17:23,609 INFO L226 Difference]: Without dead ends: 70 [2022-11-16 12:17:23,610 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-16 12:17:23,610 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-16 12:17:23,611 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-16 12:17:23,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-11-16 12:17:23,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2022-11-16 12:17:23,614 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-16 12:17:23,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 76 transitions. [2022-11-16 12:17:23,616 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 76 transitions. Word has length 42 [2022-11-16 12:17:23,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:17:23,617 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 76 transitions. [2022-11-16 12:17:23,617 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-16 12:17:23,617 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 76 transitions. [2022-11-16 12:17:23,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-11-16 12:17:23,618 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:17:23,619 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-16 12:17:23,619 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-16 12:17:23,619 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-16 12:17:23,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:17:23,620 INFO L85 PathProgramCache]: Analyzing trace with hash -11542528, now seen corresponding path program 1 times [2022-11-16 12:17:23,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:17:23,621 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131348104] [2022-11-16 12:17:23,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:17:23,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:17:23,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:23,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 12:17:23,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:23,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-16 12:17:23,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:23,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-16 12:17:23,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:23,815 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-16 12:17:23,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:17:23,816 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131348104] [2022-11-16 12:17:23,816 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [131348104] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:17:23,816 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:17:23,817 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-16 12:17:23,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959382103] [2022-11-16 12:17:23,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:17:23,818 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 12:17:23,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:17:23,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 12:17:23,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-16 12:17:23,819 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-16 12:17:23,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:17:23,981 INFO L93 Difference]: Finished difference Result 81 states and 88 transitions. [2022-11-16 12:17:23,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 12:17:23,982 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-16 12:17:23,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:17:23,982 INFO L225 Difference]: With dead ends: 81 [2022-11-16 12:17:23,982 INFO L226 Difference]: Without dead ends: 81 [2022-11-16 12:17:23,983 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-16 12:17:23,983 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-16 12:17:23,984 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-16 12:17:23,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-11-16 12:17:23,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 69. [2022-11-16 12:17:23,986 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-16 12:17:23,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 75 transitions. [2022-11-16 12:17:23,987 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 75 transitions. Word has length 42 [2022-11-16 12:17:23,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:17:23,987 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 75 transitions. [2022-11-16 12:17:23,988 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-16 12:17:23,988 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 75 transitions. [2022-11-16 12:17:23,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-11-16 12:17:23,988 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:17:23,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] [2022-11-16 12:17:23,989 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-16 12:17:23,989 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-16 12:17:23,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:17:23,989 INFO L85 PathProgramCache]: Analyzing trace with hash -2126344669, now seen corresponding path program 1 times [2022-11-16 12:17:23,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:17:23,990 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668571040] [2022-11-16 12:17:23,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:17:23,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:17:24,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:24,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 12:17:24,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:24,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-16 12:17:24,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:24,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-16 12:17:24,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:24,434 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-16 12:17:24,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:17:24,435 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668571040] [2022-11-16 12:17:24,435 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1668571040] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:17:24,435 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:17:24,435 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-16 12:17:24,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749475013] [2022-11-16 12:17:24,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:17:24,436 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-16 12:17:24,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:17:24,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-16 12:17:24,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-11-16 12:17:24,438 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-16 12:17:24,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:17:24,722 INFO L93 Difference]: Finished difference Result 80 states and 86 transitions. [2022-11-16 12:17:24,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-16 12:17:24,723 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-16 12:17:24,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:17:24,724 INFO L225 Difference]: With dead ends: 80 [2022-11-16 12:17:24,724 INFO L226 Difference]: Without dead ends: 80 [2022-11-16 12:17:24,724 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 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-16 12:17:24,725 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 143 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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-16 12:17:24,725 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-16 12:17:24,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-11-16 12:17:24,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 66. [2022-11-16 12:17:24,728 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-16 12:17:24,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 72 transitions. [2022-11-16 12:17:24,729 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 72 transitions. Word has length 48 [2022-11-16 12:17:24,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:17:24,729 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 72 transitions. [2022-11-16 12:17:24,730 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-16 12:17:24,730 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 72 transitions. [2022-11-16 12:17:24,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-11-16 12:17:24,738 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:17:24,739 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-16 12:17:24,740 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-16 12:17:24,740 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-16 12:17:24,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:17:24,741 INFO L85 PathProgramCache]: Analyzing trace with hash -2126344668, now seen corresponding path program 1 times [2022-11-16 12:17:24,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:17:24,741 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736180072] [2022-11-16 12:17:24,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:17:24,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:17:24,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:25,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 12:17:25,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:25,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-16 12:17:25,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:25,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-16 12:17:25,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:25,527 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-16 12:17:25,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:17:25,528 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736180072] [2022-11-16 12:17:25,528 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1736180072] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:17:25,528 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:17:25,528 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-16 12:17:25,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078288188] [2022-11-16 12:17:25,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:17:25,530 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-16 12:17:25,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:17:25,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-16 12:17:25,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-11-16 12:17:25,531 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-16 12:17:25,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:17:25,870 INFO L93 Difference]: Finished difference Result 66 states and 71 transitions. [2022-11-16 12:17:25,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-16 12:17:25,871 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-16 12:17:25,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:17:25,871 INFO L225 Difference]: With dead ends: 66 [2022-11-16 12:17:25,872 INFO L226 Difference]: Without dead ends: 66 [2022-11-16 12:17:25,872 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-16 12:17:25,873 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 83 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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-16 12:17:25,873 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-16 12:17:25,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-11-16 12:17:25,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 64. [2022-11-16 12:17:25,876 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-16 12:17:25,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 70 transitions. [2022-11-16 12:17:25,877 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 70 transitions. Word has length 48 [2022-11-16 12:17:25,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:17:25,878 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 70 transitions. [2022-11-16 12:17:25,878 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-16 12:17:25,878 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 70 transitions. [2022-11-16 12:17:25,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-11-16 12:17:25,879 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:17:25,879 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-16 12:17:25,880 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-16 12:17:25,880 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-16 12:17:25,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:17:25,881 INFO L85 PathProgramCache]: Analyzing trace with hash 987206626, now seen corresponding path program 1 times [2022-11-16 12:17:25,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:17:25,881 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070185547] [2022-11-16 12:17:25,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:17:25,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:17:25,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:26,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 12:17:26,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:26,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-16 12:17:26,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:26,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-16 12:17:26,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:26,975 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-16 12:17:26,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:17:26,975 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070185547] [2022-11-16 12:17:26,976 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1070185547] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:17:26,976 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:17:26,976 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-11-16 12:17:26,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909437003] [2022-11-16 12:17:26,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:17:26,977 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-16 12:17:26,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:17:26,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-16 12:17:26,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2022-11-16 12:17:26,977 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-16 12:17:27,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:17:27,500 INFO L93 Difference]: Finished difference Result 64 states and 69 transitions. [2022-11-16 12:17:27,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-16 12:17:27,501 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-16 12:17:27,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:17:27,502 INFO L225 Difference]: With dead ends: 64 [2022-11-16 12:17:27,502 INFO L226 Difference]: Without dead ends: 64 [2022-11-16 12:17:27,502 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=82, Invalid=380, Unknown=0, NotChecked=0, Total=462 [2022-11-16 12:17:27,503 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.3s IncrementalHoareTripleChecker+Time [2022-11-16 12:17:27,503 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.3s Time] [2022-11-16 12:17:27,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-11-16 12:17:27,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2022-11-16 12:17:27,506 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-16 12:17:27,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 69 transitions. [2022-11-16 12:17:27,507 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 69 transitions. Word has length 50 [2022-11-16 12:17:27,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:17:27,507 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 69 transitions. [2022-11-16 12:17:27,507 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-16 12:17:27,507 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 69 transitions. [2022-11-16 12:17:27,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-11-16 12:17:27,508 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:17:27,508 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-16 12:17:27,509 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-16 12:17:27,509 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-16 12:17:27,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:17:27,509 INFO L85 PathProgramCache]: Analyzing trace with hash -2063364139, now seen corresponding path program 1 times [2022-11-16 12:17:27,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:17:27,510 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106684802] [2022-11-16 12:17:27,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:17:27,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:17:27,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:29,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 12:17:29,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:29,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-16 12:17:29,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:29,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-16 12:17:29,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:29,735 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-16 12:17:29,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:17:29,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106684802] [2022-11-16 12:17:29,736 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [106684802] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:17:29,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1483881106] [2022-11-16 12:17:29,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:17:29,737 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:17:29,737 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccdeb345-a6bd-4eb4-8736-1936ccfa9ff5/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:17:29,739 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccdeb345-a6bd-4eb4-8736-1936ccfa9ff5/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:17:29,758 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccdeb345-a6bd-4eb4-8736-1936ccfa9ff5/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-16 12:17:29,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:29,996 INFO L263 TraceCheckSpWp]: Trace formula consists of 413 conjuncts, 69 conjunts are in the unsatisfiable core [2022-11-16 12:17:30,002 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:17:30,092 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-16 12:17:30,458 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-16 12:17:30,931 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:17:30,933 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-16 12:17:30,958 INFO L321 Elim1Store]: treesize reduction 30, result has 37.5 percent of original size [2022-11-16 12:17:30,959 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-16 12:17:31,273 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:17:31,275 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-16 12:17:31,442 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-16 12:17:31,452 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:17:31,454 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-16 12:17:31,586 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-16 12:17:31,840 INFO L321 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2022-11-16 12:17:31,841 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-16 12:17:31,850 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-16 12:17:31,850 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:17:32,015 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-16 12:17:38,405 WARN L233 SmtUtils]: Spent 6.06s on a formula simplification. DAG size of input: 34 DAG size of output: 30 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 12:18:16,283 WARN L233 SmtUtils]: Spent 14.40s on a formula simplification that was a NOOP. DAG size: 37 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 12:18:18,334 WARN L833 $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-16 12:18:20,389 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_prepend_#t~ret7#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_#t~ret7#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_#t~ret7#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 .cse0 (= |c_ULTIMATE.start_sll_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|)) (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_#t~ret7#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_#t~ret7#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)))))))) is different from false [2022-11-16 12:18:21,047 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1483881106] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:18:21,047 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 12:18:21,047 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22] total 40 [2022-11-16 12:18:21,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442326874] [2022-11-16 12:18:21,048 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 12:18:21,048 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-11-16 12:18:21,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:18:21,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-11-16 12:18:21,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=1932, Unknown=12, NotChecked=178, Total=2256 [2022-11-16 12:18:21,050 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-16 12:18:23,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:18:23,120 INFO L93 Difference]: Finished difference Result 84 states and 91 transitions. [2022-11-16 12:18:23,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-16 12:18:23,120 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-16 12:18:23,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:18:23,121 INFO L225 Difference]: With dead ends: 84 [2022-11-16 12:18:23,122 INFO L226 Difference]: Without dead ends: 84 [2022-11-16 12:18:23,124 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 634 ImplicationChecksByTransitivity, 51.9s TimeCoverageRelationStatistics Valid=245, Invalid=3173, Unknown=12, NotChecked=230, Total=3660 [2022-11-16 12:18:23,125 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 63 mSDsluCounter, 528 mSDsCounter, 0 mSdLazyCounter, 674 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s 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.8s IncrementalHoareTripleChecker+Time [2022-11-16 12:18:23,125 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.8s Time] [2022-11-16 12:18:23,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2022-11-16 12:18:23,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 66. [2022-11-16 12:18:23,128 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-16 12:18:23,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 73 transitions. [2022-11-16 12:18:23,129 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 73 transitions. Word has length 53 [2022-11-16 12:18:23,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:18:23,130 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 73 transitions. [2022-11-16 12:18:23,130 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-16 12:18:23,130 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 73 transitions. [2022-11-16 12:18:23,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-11-16 12:18:23,131 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:18:23,132 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-16 12:18:23,145 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccdeb345-a6bd-4eb4-8736-1936ccfa9ff5/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-11-16 12:18:23,338 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccdeb345-a6bd-4eb4-8736-1936ccfa9ff5/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-11-16 12:18:23,339 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-16 12:18:23,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:18:23,339 INFO L85 PathProgramCache]: Analyzing trace with hash -2063364138, now seen corresponding path program 1 times [2022-11-16 12:18:23,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:18:23,339 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522429535] [2022-11-16 12:18:23,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:18:23,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:18:23,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:18:25,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 12:18:25,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:18:25,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-16 12:18:25,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:18:25,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-16 12:18:25,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:18:26,484 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-16 12:18:26,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:18:26,484 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522429535] [2022-11-16 12:18:26,484 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [522429535] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:18:26,484 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [913049557] [2022-11-16 12:18:26,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:18:26,485 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:18:26,485 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccdeb345-a6bd-4eb4-8736-1936ccfa9ff5/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:18:26,486 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccdeb345-a6bd-4eb4-8736-1936ccfa9ff5/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:18:26,495 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccdeb345-a6bd-4eb4-8736-1936ccfa9ff5/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-16 12:18:26,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:18:26,749 INFO L263 TraceCheckSpWp]: Trace formula consists of 413 conjuncts, 110 conjunts are in the unsatisfiable core [2022-11-16 12:18:26,774 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:18:26,923 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-16 12:18:27,833 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-16 12:18:27,839 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-16 12:18:28,374 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:18:28,375 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-16 12:18:28,411 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:18:28,412 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-16 12:18:28,430 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-11-16 12:18:28,431 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-16 12:18:28,446 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-16 12:18:28,833 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:18:28,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 25 treesize of output 20 [2022-11-16 12:18:28,860 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:18:28,867 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-16 12:18:29,070 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:18:29,072 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-16 12:18:29,082 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:18:29,089 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-16 12:18:29,607 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 12:18:29,608 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:18:29,612 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:18:29,612 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-16 12:18:29,620 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:18:29,627 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-16 12:18:29,628 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-16 12:18:29,800 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-16 12:18:29,800 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:18:32,010 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [913049557] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:18:32,010 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 12:18:32,010 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 23] total 44 [2022-11-16 12:18:32,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116617035] [2022-11-16 12:18:32,011 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 12:18:32,011 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-11-16 12:18:32,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:18:32,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-11-16 12:18:32,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=2812, Unknown=0, NotChecked=0, Total=2970 [2022-11-16 12:18:32,014 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-16 12:18:35,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:18:35,747 INFO L93 Difference]: Finished difference Result 88 states and 95 transitions. [2022-11-16 12:18:35,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-16 12:18:35,748 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-16 12:18:35,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:18:35,749 INFO L225 Difference]: With dead ends: 88 [2022-11-16 12:18:35,749 INFO L226 Difference]: Without dead ends: 88 [2022-11-16 12:18:35,751 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 39 SyntacticMatches, 5 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1028 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=315, Invalid=4655, Unknown=0, NotChecked=0, Total=4970 [2022-11-16 12:18:35,752 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 83 mSDsluCounter, 752 mSDsCounter, 0 mSdLazyCounter, 957 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s 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.2s IncrementalHoareTripleChecker+Time [2022-11-16 12:18:35,752 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.2s Time] [2022-11-16 12:18:35,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2022-11-16 12:18:35,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 68. [2022-11-16 12:18:35,755 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-16 12:18:35,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 74 transitions. [2022-11-16 12:18:35,756 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 74 transitions. Word has length 53 [2022-11-16 12:18:35,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:18:35,757 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 74 transitions. [2022-11-16 12:18:35,757 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-16 12:18:35,758 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 74 transitions. [2022-11-16 12:18:35,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-11-16 12:18:35,759 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:18:35,759 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-16 12:18:35,766 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccdeb345-a6bd-4eb4-8736-1936ccfa9ff5/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-11-16 12:18:35,966 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccdeb345-a6bd-4eb4-8736-1936ccfa9ff5/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-11-16 12:18:35,966 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-16 12:18:35,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:18:35,967 INFO L85 PathProgramCache]: Analyzing trace with hash 460219817, now seen corresponding path program 1 times [2022-11-16 12:18:35,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:18:35,967 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940283115] [2022-11-16 12:18:35,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:18:35,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:18:36,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:18:37,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 12:18:37,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:18:37,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-16 12:18:37,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:18:37,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-16 12:18:37,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:18:37,608 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-16 12:18:37,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:18:37,608 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940283115] [2022-11-16 12:18:37,608 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1940283115] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:18:37,608 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1060939548] [2022-11-16 12:18:37,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:18:37,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:18:37,609 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccdeb345-a6bd-4eb4-8736-1936ccfa9ff5/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:18:37,610 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccdeb345-a6bd-4eb4-8736-1936ccfa9ff5/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:18:37,630 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccdeb345-a6bd-4eb4-8736-1936ccfa9ff5/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-16 12:18:37,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:18:37,894 INFO L263 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 65 conjunts are in the unsatisfiable core [2022-11-16 12:18:37,906 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:18:38,542 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-16 12:18:38,911 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:18:38,912 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-16 12:18:39,263 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:18:39,265 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-16 12:18:39,445 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:18:39,446 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-16 12:18:39,457 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-16 12:18:39,665 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-16 12:18:40,428 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:18:40,573 INFO L321 Elim1Store]: treesize reduction 12, result has 88.1 percent of original size [2022-11-16 12:18:40,573 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-16 12:18:41,498 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-16 12:18:41,499 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:18:41,928 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-16 12:18:43,515 WARN L833 $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-16 12:18:43,521 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1060939548] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:18:43,521 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 12:18:43,522 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 24] total 41 [2022-11-16 12:18:43,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858231790] [2022-11-16 12:18:43,522 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 12:18:43,522 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-11-16 12:18:43,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:18:43,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-11-16 12:18:43,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=2205, Unknown=2, NotChecked=94, Total=2450 [2022-11-16 12:18:43,524 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-16 12:18:45,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:18:45,365 INFO L93 Difference]: Finished difference Result 71 states and 76 transitions. [2022-11-16 12:18:45,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-16 12:18:45,367 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-16 12:18:45,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:18:45,368 INFO L225 Difference]: With dead ends: 71 [2022-11-16 12:18:45,368 INFO L226 Difference]: Without dead ends: 71 [2022-11-16 12:18:45,369 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 45 SyntacticMatches, 5 SemanticMatches, 61 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 758 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=259, Invalid=3525, Unknown=2, NotChecked=120, Total=3906 [2022-11-16 12:18:45,370 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 43 mSDsluCounter, 865 mSDsCounter, 0 mSdLazyCounter, 482 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.5s IncrementalHoareTripleChecker+Time [2022-11-16 12:18:45,370 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.5s Time] [2022-11-16 12:18:45,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-11-16 12:18:45,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 68. [2022-11-16 12:18:45,373 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-16 12:18:45,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 73 transitions. [2022-11-16 12:18:45,374 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 73 transitions. Word has length 54 [2022-11-16 12:18:45,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:18:45,374 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 73 transitions. [2022-11-16 12:18:45,375 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-16 12:18:45,375 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 73 transitions. [2022-11-16 12:18:45,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-11-16 12:18:45,376 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:18:45,376 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-16 12:18:45,383 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccdeb345-a6bd-4eb4-8736-1936ccfa9ff5/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-11-16 12:18:45,582 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccdeb345-a6bd-4eb4-8736-1936ccfa9ff5/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-11-16 12:18:45,583 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-16 12:18:45,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:18:45,584 INFO L85 PathProgramCache]: Analyzing trace with hash 913244988, now seen corresponding path program 1 times [2022-11-16 12:18:45,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:18:45,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549560431] [2022-11-16 12:18:45,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:18:45,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:18:45,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:18:47,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 12:18:47,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:18:47,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-16 12:18:47,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:18:48,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-16 12:18:48,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:18:48,942 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-16 12:18:48,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:18:48,942 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549560431] [2022-11-16 12:18:48,942 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549560431] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:18:48,942 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1682754582] [2022-11-16 12:18:48,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:18:48,943 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:18:48,943 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccdeb345-a6bd-4eb4-8736-1936ccfa9ff5/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:18:48,947 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccdeb345-a6bd-4eb4-8736-1936ccfa9ff5/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:18:48,984 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccdeb345-a6bd-4eb4-8736-1936ccfa9ff5/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-16 12:18:49,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:18:49,290 INFO L263 TraceCheckSpWp]: Trace formula consists of 432 conjuncts, 115 conjunts are in the unsatisfiable core [2022-11-16 12:18:49,297 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:18:49,468 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-16 12:18:49,552 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-16 12:18:49,859 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:18:49,861 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-16 12:18:50,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 30 treesize of output 18 [2022-11-16 12:18:50,341 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-16 12:18:50,349 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-16 12:18:50,355 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-16 12:18:51,023 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:18:51,024 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-16 12:18:51,046 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:18:51,047 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-16 12:18:51,076 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-11-16 12:18:51,076 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-16 12:18:51,089 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-16 12:18:51,111 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-11-16 12:18:51,111 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-16 12:18:51,665 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:18:51,667 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-16 12:18:51,690 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:18:51,691 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-16 12:18:51,712 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-16 12:18:51,983 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:18:51,986 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-16 12:18:52,004 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:18:52,007 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-16 12:18:52,017 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:18:52,019 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-16 12:18:52,720 INFO L321 Elim1Store]: treesize reduction 17, result has 5.6 percent of original size [2022-11-16 12:18:52,721 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-16 12:18:52,734 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:18:52,735 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-16 12:18:52,988 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 12:18:52,991 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:18:52,991 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-16 12:18:53,099 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-16 12:18:53,099 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:19:45,446 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1682754582] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:19:45,446 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 12:19:45,447 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 25] total 46 [2022-11-16 12:19:45,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474638899] [2022-11-16 12:19:45,447 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 12:19:45,448 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-11-16 12:19:45,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:19:45,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-11-16 12:19:45,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=2912, Unknown=25, NotChecked=0, Total=3080 [2022-11-16 12:19:45,450 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-16 12:19:50,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:19:50,210 INFO L93 Difference]: Finished difference Result 69 states and 74 transitions. [2022-11-16 12:19:50,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-16 12:19:50,211 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-16 12:19:50,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:19:50,211 INFO L225 Difference]: With dead ends: 69 [2022-11-16 12:19:50,211 INFO L226 Difference]: Without dead ends: 69 [2022-11-16 12:19:50,214 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 49 SyntacticMatches, 3 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 603 ImplicationChecksByTransitivity, 59.1s TimeCoverageRelationStatistics Valid=310, Invalid=5365, Unknown=25, NotChecked=0, Total=5700 [2022-11-16 12:19:50,214 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 42 mSDsluCounter, 1011 mSDsCounter, 0 mSdLazyCounter, 1050 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s 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.2s IncrementalHoareTripleChecker+Time [2022-11-16 12:19:50,215 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.2s Time] [2022-11-16 12:19:50,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-11-16 12:19:50,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2022-11-16 12:19:50,217 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-16 12:19:50,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 74 transitions. [2022-11-16 12:19:50,217 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 74 transitions. Word has length 57 [2022-11-16 12:19:50,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:19:50,217 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 74 transitions. [2022-11-16 12:19:50,218 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-16 12:19:50,218 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 74 transitions. [2022-11-16 12:19:50,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-16 12:19:50,218 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:19:50,218 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-16 12:19:50,237 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccdeb345-a6bd-4eb4-8736-1936ccfa9ff5/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-11-16 12:19:50,419 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccdeb345-a6bd-4eb4-8736-1936ccfa9ff5/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-11-16 12:19:50,419 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-16 12:19:50,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:19:50,420 INFO L85 PathProgramCache]: Analyzing trace with hash -1754175976, now seen corresponding path program 1 times [2022-11-16 12:19:50,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:19:50,420 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352261267] [2022-11-16 12:19:50,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:19:50,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:19:50,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:53,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 12:19:53,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:53,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-16 12:19:53,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:54,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-16 12:19:54,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:55,230 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-16 12:19:55,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:19:55,230 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352261267] [2022-11-16 12:19:55,230 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [352261267] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:19:55,230 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [244040014] [2022-11-16 12:19:55,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:19:55,230 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:19:55,231 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccdeb345-a6bd-4eb4-8736-1936ccfa9ff5/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:19:55,235 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccdeb345-a6bd-4eb4-8736-1936ccfa9ff5/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:19:55,259 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccdeb345-a6bd-4eb4-8736-1936ccfa9ff5/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-16 12:19:55,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:55,542 INFO L263 TraceCheckSpWp]: Trace formula consists of 440 conjuncts, 132 conjunts are in the unsatisfiable core [2022-11-16 12:19:55,549 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:19:55,650 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-16 12:19:56,396 INFO L321 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2022-11-16 12:19:56,397 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-16 12:19:56,642 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-16 12:19:57,311 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:19:57,311 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-16 12:19:57,317 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-16 12:19:57,323 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-16 12:19:57,985 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:19:58,000 INFO L321 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2022-11-16 12:19:58,001 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-16 12:19:58,057 INFO L321 Elim1Store]: treesize reduction 76, result has 36.1 percent of original size [2022-11-16 12:19:58,057 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-16 12:19:58,082 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:19:58,083 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-16 12:19:58,725 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:19:58,727 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:19:58,740 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-11-16 12:19:58,740 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-16 12:19:58,776 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:19:58,777 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-16 12:19:59,081 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:19:59,084 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-16 12:19:59,094 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:19:59,102 INFO L321 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-11-16 12:19:59,103 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-16 12:20:00,038 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:20:00,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 0 case distinctions, treesize of input 197 treesize of output 142 [2022-11-16 12:20:00,531 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:20:00,533 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 12:20:00,544 INFO L321 Elim1Store]: treesize reduction 39, result has 7.1 percent of original size [2022-11-16 12:20:00,544 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-16 12:20:01,235 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-16 12:20:01,235 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:20:04,053 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [244040014] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:20:04,053 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 12:20:04,054 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 33] total 64 [2022-11-16 12:20:04,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043368752] [2022-11-16 12:20:04,054 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 12:20:04,055 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 65 states [2022-11-16 12:20:04,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:20:04,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2022-11-16 12:20:04,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=232, Invalid=5170, Unknown=0, NotChecked=0, Total=5402 [2022-11-16 12:20:04,059 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-16 12:20:12,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:20:12,195 INFO L93 Difference]: Finished difference Result 75 states and 83 transitions. [2022-11-16 12:20:12,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-11-16 12:20:12,196 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-16 12:20:12,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:20:12,197 INFO L225 Difference]: With dead ends: 75 [2022-11-16 12:20:12,197 INFO L226 Difference]: Without dead ends: 75 [2022-11-16 12:20:12,202 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 39 SyntacticMatches, 5 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1790 ImplicationChecksByTransitivity, 14.5s TimeCoverageRelationStatistics Valid=677, Invalid=8635, Unknown=0, NotChecked=0, Total=9312 [2022-11-16 12:20:12,202 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 139 mSDsluCounter, 1015 mSDsCounter, 0 mSdLazyCounter, 1607 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s 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, 2.1s IncrementalHoareTripleChecker+Time [2022-11-16 12:20:12,203 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 1053 Invalid, 1785 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 1607 Invalid, 0 Unknown, 128 Unchecked, 2.1s Time] [2022-11-16 12:20:12,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-11-16 12:20:12,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 71. [2022-11-16 12:20:12,205 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-16 12:20:12,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 78 transitions. [2022-11-16 12:20:12,206 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 78 transitions. Word has length 58 [2022-11-16 12:20:12,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:20:12,206 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 78 transitions. [2022-11-16 12:20:12,207 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-16 12:20:12,207 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 78 transitions. [2022-11-16 12:20:12,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-16 12:20:12,207 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:20:12,208 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-16 12:20:12,219 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccdeb345-a6bd-4eb4-8736-1936ccfa9ff5/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-16 12:20:12,414 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccdeb345-a6bd-4eb4-8736-1936ccfa9ff5/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-11-16 12:20:12,415 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-16 12:20:12,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:20:12,415 INFO L85 PathProgramCache]: Analyzing trace with hash -1754175975, now seen corresponding path program 1 times [2022-11-16 12:20:12,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:20:12,416 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20301402] [2022-11-16 12:20:12,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:20:12,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:20:12,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:20:16,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 12:20:16,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:20:16,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-16 12:20:16,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:20:16,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-16 12:20:16,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:20:17,846 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-16 12:20:17,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:20:17,847 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20301402] [2022-11-16 12:20:17,847 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [20301402] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:20:17,847 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1458310983] [2022-11-16 12:20:17,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:20:17,848 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:20:17,848 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccdeb345-a6bd-4eb4-8736-1936ccfa9ff5/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:20:17,849 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccdeb345-a6bd-4eb4-8736-1936ccfa9ff5/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:20:17,851 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccdeb345-a6bd-4eb4-8736-1936ccfa9ff5/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-16 12:20:18,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:20:18,144 INFO L263 TraceCheckSpWp]: Trace formula consists of 440 conjuncts, 154 conjunts are in the unsatisfiable core [2022-11-16 12:20:18,154 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:20:19,264 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-16 12:20:19,264 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-16 12:20:19,294 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-16 12:20:19,294 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-16 12:20:19,595 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-16 12:20:19,610 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-16 12:20:20,402 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:20:20,402 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-16 12:20:20,411 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-16 12:20:20,420 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:20:20,421 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-16 12:20:21,295 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:20:21,311 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-16 12:20:21,311 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-16 12:20:21,320 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:20:21,323 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:20:21,338 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-11-16 12:20:21,339 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-16 12:20:21,381 INFO L321 Elim1Store]: treesize reduction 27, result has 48.1 percent of original size [2022-11-16 12:20:21,382 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-16 12:20:21,422 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-11-16 12:20:21,424 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-16 12:20:22,135 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:20:22,137 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:20:22,139 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-16 12:20:22,152 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:20:22,154 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 12:20:22,156 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:20:22,167 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-16 12:20:22,167 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-16 12:20:22,474 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:20:22,476 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:20:22,477 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:20:22,479 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-16 12:20:22,490 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:20:22,494 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-16 12:20:22,495 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-16 12:20:24,331 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 12:20:24,332 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:20:24,380 INFO L321 Elim1Store]: treesize reduction 59, result has 15.7 percent of original size [2022-11-16 12:20:24,381 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-16 12:20:24,395 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:20:24,396 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:20:24,413 INFO L321 Elim1Store]: treesize reduction 10, result has 41.2 percent of original size [2022-11-16 12:20:24,414 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-16 12:20:24,987 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-16 12:20:24,987 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:20:36,608 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1458310983] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:20:36,609 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 12:20:36,609 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 69 [2022-11-16 12:20:36,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493484161] [2022-11-16 12:20:36,609 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 12:20:36,610 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 70 states [2022-11-16 12:20:36,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:20:36,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2022-11-16 12:20:36,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=258, Invalid=6871, Unknown=11, NotChecked=0, Total=7140 [2022-11-16 12:20:36,614 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-16 12:20:45,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:20:45,438 INFO L93 Difference]: Finished difference Result 96 states and 103 transitions. [2022-11-16 12:20:45,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-11-16 12:20:45,439 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-16 12:20:45,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:20:45,440 INFO L225 Difference]: With dead ends: 96 [2022-11-16 12:20:45,441 INFO L226 Difference]: Without dead ends: 96 [2022-11-16 12:20:45,445 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2471 ImplicationChecksByTransitivity, 25.2s TimeCoverageRelationStatistics Valid=554, Invalid=12317, Unknown=11, NotChecked=0, Total=12882 [2022-11-16 12:20:45,445 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 170 mSDsluCounter, 1314 mSDsCounter, 0 mSdLazyCounter, 1416 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s 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.6s IncrementalHoareTripleChecker+Time [2022-11-16 12:20:45,446 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.6s Time] [2022-11-16 12:20:45,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-11-16 12:20:45,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 73. [2022-11-16 12:20:45,449 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-16 12:20:45,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 79 transitions. [2022-11-16 12:20:45,450 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 79 transitions. Word has length 58 [2022-11-16 12:20:45,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:20:45,451 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 79 transitions. [2022-11-16 12:20:45,451 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-16 12:20:45,451 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 79 transitions. [2022-11-16 12:20:45,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-11-16 12:20:45,452 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:20:45,452 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-16 12:20:45,459 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccdeb345-a6bd-4eb4-8736-1936ccfa9ff5/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-16 12:20:45,654 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccdeb345-a6bd-4eb4-8736-1936ccfa9ff5/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:20:45,655 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-16 12:20:45,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:20:45,655 INFO L85 PathProgramCache]: Analyzing trace with hash 1455118278, now seen corresponding path program 1 times [2022-11-16 12:20:45,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:20:45,655 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106706591] [2022-11-16 12:20:45,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:20:45,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:20:45,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:20:48,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 12:20:48,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:20:48,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-16 12:20:48,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:20:48,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-16 12:20:48,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:20:49,506 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-16 12:20:49,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:20:49,507 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106706591] [2022-11-16 12:20:49,507 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [106706591] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:20:49,507 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1499961044] [2022-11-16 12:20:49,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:20:49,507 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:20:49,508 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccdeb345-a6bd-4eb4-8736-1936ccfa9ff5/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:20:49,511 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccdeb345-a6bd-4eb4-8736-1936ccfa9ff5/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:20:49,538 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccdeb345-a6bd-4eb4-8736-1936ccfa9ff5/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-16 12:20:49,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:20:49,864 INFO L263 TraceCheckSpWp]: Trace formula consists of 444 conjuncts, 111 conjunts are in the unsatisfiable core [2022-11-16 12:20:49,870 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:20:50,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-16 12:20:50,429 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-16 12:20:50,926 INFO L321 Elim1Store]: treesize reduction 17, result has 5.6 percent of original size [2022-11-16 12:20:50,927 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-16 12:20:50,932 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-16 12:20:51,546 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:20:51,560 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-16 12:20:51,561 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-16 12:20:51,570 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:20:51,571 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-16 12:20:51,602 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-11-16 12:20:51,602 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-16 12:20:52,154 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:20:52,155 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-16 12:20:52,162 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:20:52,180 INFO L321 Elim1Store]: treesize reduction 57, result has 18.6 percent of original size [2022-11-16 12:20:52,181 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-16 12:20:52,430 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:20:52,431 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-16 12:20:52,439 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:20:52,459 INFO L321 Elim1Store]: treesize reduction 87, result has 14.7 percent of original size [2022-11-16 12:20:52,459 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-16 12:20:53,438 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:20:53,445 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-16 12:20:53,446 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-16 12:20:54,027 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 12:20:54,028 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:20:54,057 INFO L321 Elim1Store]: treesize reduction 81, result has 8.0 percent of original size [2022-11-16 12:20:54,057 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-16 12:20:54,172 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-16 12:20:54,172 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:20:57,112 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1499961044] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:20:57,112 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 12:20:57,112 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 33] total 58 [2022-11-16 12:20:57,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561000971] [2022-11-16 12:20:57,113 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 12:20:57,113 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2022-11-16 12:20:57,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:20:57,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2022-11-16 12:20:57,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=189, Invalid=4502, Unknown=1, NotChecked=0, Total=4692 [2022-11-16 12:20:57,116 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-16 12:21:01,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:21:01,752 INFO L93 Difference]: Finished difference Result 77 states and 83 transitions. [2022-11-16 12:21:01,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-11-16 12:21:01,753 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-16 12:21:01,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:21:01,753 INFO L225 Difference]: With dead ends: 77 [2022-11-16 12:21:01,754 INFO L226 Difference]: Without dead ends: 77 [2022-11-16 12:21:01,755 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 47 SyntacticMatches, 5 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1472 ImplicationChecksByTransitivity, 11.1s TimeCoverageRelationStatistics Valid=374, Invalid=7633, Unknown=3, NotChecked=0, Total=8010 [2022-11-16 12:21:01,756 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 63 mSDsluCounter, 1292 mSDsCounter, 0 mSdLazyCounter, 919 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s 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, 1.0s IncrementalHoareTripleChecker+Time [2022-11-16 12:21:01,756 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 1335 Invalid, 1106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 919 Invalid, 0 Unknown, 177 Unchecked, 1.0s Time] [2022-11-16 12:21:01,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-11-16 12:21:01,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 73. [2022-11-16 12:21:01,759 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-16 12:21:01,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 78 transitions. [2022-11-16 12:21:01,760 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 78 transitions. Word has length 59 [2022-11-16 12:21:01,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:21:01,760 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 78 transitions. [2022-11-16 12:21:01,760 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-16 12:21:01,760 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 78 transitions. [2022-11-16 12:21:01,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-11-16 12:21:01,761 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:21:01,761 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-16 12:21:01,774 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccdeb345-a6bd-4eb4-8736-1936ccfa9ff5/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-16 12:21:01,962 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccdeb345-a6bd-4eb4-8736-1936ccfa9ff5/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable19 [2022-11-16 12:21:01,962 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-16 12:21:01,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:21:01,963 INFO L85 PathProgramCache]: Analyzing trace with hash 363986943, now seen corresponding path program 1 times [2022-11-16 12:21:01,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:21:01,963 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307217187] [2022-11-16 12:21:01,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:21:01,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:21:02,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:21:05,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 12:21:05,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:21:05,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-16 12:21:06,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:21:06,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-16 12:21:06,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:21:07,746 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-16 12:21:07,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:21:07,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307217187] [2022-11-16 12:21:07,747 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1307217187] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:21:07,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [998765221] [2022-11-16 12:21:07,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:21:07,747 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:21:07,748 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccdeb345-a6bd-4eb4-8736-1936ccfa9ff5/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:21:07,749 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccdeb345-a6bd-4eb4-8736-1936ccfa9ff5/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:21:07,754 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccdeb345-a6bd-4eb4-8736-1936ccfa9ff5/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-16 12:21:08,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:21:08,099 INFO L263 TraceCheckSpWp]: Trace formula consists of 459 conjuncts, 177 conjunts are in the unsatisfiable core [2022-11-16 12:21:08,107 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:21:08,117 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-16 12:21:08,257 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-16 12:21:08,475 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-16 12:21:08,745 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-16 12:21:08,745 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-16 12:21:09,050 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:21:09,051 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-16 12:21:09,278 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-16 12:21:09,389 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-16 12:21:10,068 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:21:10,086 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-16 12:21:10,086 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-16 12:21:10,124 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-16 12:21:10,585 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-16 12:21:10,595 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-16 12:21:10,620 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-16 12:21:11,615 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:21:11,615 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-16 12:21:11,631 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:21:11,632 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-16 12:21:11,651 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-16 12:21:11,659 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-16 12:21:12,617 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:21:12,633 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-16 12:21:12,634 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-16 12:21:12,659 INFO L321 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-11-16 12:21:12,660 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-16 12:21:12,690 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-11-16 12:21:12,690 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-16 12:21:12,710 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:21:12,712 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:21:12,737 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-11-16 12:21:12,737 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-16 12:21:12,755 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-16 12:21:13,585 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:21:13,587 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:21:13,601 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-11-16 12:21:13,601 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-16 12:21:13,611 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-16 12:21:13,646 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-16 12:21:14,019 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:21:14,031 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-16 12:21:14,031 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-16 12:21:14,048 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-16 12:21:14,058 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:21:14,058 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-16 12:21:15,917 INFO L321 Elim1Store]: treesize reduction 65, result has 11.0 percent of original size [2022-11-16 12:21:15,918 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-16 12:21:15,936 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:21:15,936 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-16 12:21:15,943 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-16 12:21:16,810 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-16 12:21:16,955 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-16 12:21:16,955 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:21:25,842 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [998765221] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:21:25,843 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 12:21:25,843 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 38] total 72 [2022-11-16 12:21:25,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99247765] [2022-11-16 12:21:25,843 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 12:21:25,844 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 72 states [2022-11-16 12:21:25,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:21:25,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2022-11-16 12:21:25,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=221, Invalid=7049, Unknown=40, NotChecked=0, Total=7310 [2022-11-16 12:21:25,845 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-16 12:21:35,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:21:35,196 INFO L93 Difference]: Finished difference Result 105 states and 114 transitions. [2022-11-16 12:21:35,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-11-16 12:21:35,197 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-16 12:21:35,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:21:35,197 INFO L225 Difference]: With dead ends: 105 [2022-11-16 12:21:35,198 INFO L226 Difference]: Without dead ends: 105 [2022-11-16 12:21:35,199 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 41 SyntacticMatches, 3 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1587 ImplicationChecksByTransitivity, 24.8s TimeCoverageRelationStatistics Valid=404, Invalid=11325, Unknown=43, NotChecked=0, Total=11772 [2022-11-16 12:21:35,200 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 46 mSDsluCounter, 1510 mSDsCounter, 0 mSdLazyCounter, 1670 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s 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, 2.1s IncrementalHoareTripleChecker+Time [2022-11-16 12:21:35,200 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 1551 Invalid, 2026 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 1670 Invalid, 0 Unknown, 334 Unchecked, 2.1s Time] [2022-11-16 12:21:35,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2022-11-16 12:21:35,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 104. [2022-11-16 12:21:35,203 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-16 12:21:35,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 112 transitions. [2022-11-16 12:21:35,204 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 112 transitions. Word has length 62 [2022-11-16 12:21:35,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:21:35,205 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 112 transitions. [2022-11-16 12:21:35,205 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-16 12:21:35,205 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 112 transitions. [2022-11-16 12:21:35,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-11-16 12:21:35,206 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:21:35,206 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-16 12:21:35,211 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccdeb345-a6bd-4eb4-8736-1936ccfa9ff5/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-16 12:21:35,410 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccdeb345-a6bd-4eb4-8736-1936ccfa9ff5/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2022-11-16 12:21:35,410 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-16 12:21:35,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:21:35,411 INFO L85 PathProgramCache]: Analyzing trace with hash -1601306187, now seen corresponding path program 2 times [2022-11-16 12:21:35,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:21:35,411 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791984145] [2022-11-16 12:21:35,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:21:35,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:21:35,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:21:40,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 12:21:40,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:21:40,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-16 12:21:40,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:21:41,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-16 12:21:41,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:21:42,213 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-16 12:21:42,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:21:42,213 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791984145] [2022-11-16 12:21:42,214 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1791984145] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:21:42,214 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1711731930] [2022-11-16 12:21:42,214 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-16 12:21:42,214 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:21:42,214 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccdeb345-a6bd-4eb4-8736-1936ccfa9ff5/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:21:42,215 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccdeb345-a6bd-4eb4-8736-1936ccfa9ff5/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:21:42,218 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccdeb345-a6bd-4eb4-8736-1936ccfa9ff5/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-16 12:21:42,590 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-16 12:21:42,590 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 12:21:42,596 INFO L263 TraceCheckSpWp]: Trace formula consists of 467 conjuncts, 195 conjunts are in the unsatisfiable core [2022-11-16 12:21:42,606 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:21:42,618 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-16 12:21:42,752 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-16 12:21:42,969 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-16 12:21:43,102 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:21:43,103 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-16 12:21:43,270 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-16 12:21:43,271 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-16 12:21:43,623 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-16 12:21:43,640 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 12:21:43,641 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-16 12:21:44,052 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-16 12:21:44,888 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-16 12:21:44,889 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 22 [2022-11-16 12:21:44,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 7 treesize of output 3 [2022-11-16 12:21:44,938 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-16 12:21:44,939 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-16 12:21:44,949 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-16 12:21:44,996 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-11-16 12:21:44,996 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-16 12:21:45,463 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-16 12:21:45,472 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-16 12:21:46,586 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-16 12:21:46,586 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-16 12:21:46,596 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-16 12:21:46,606 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-16 12:21:47,205 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:21:47,241 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-11-16 12:21:47,241 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-16 12:21:47,393 WARN L833 $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-16 12:21:47,399 WARN L855 $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-16 12:21:48,100 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:21:48,101 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 12:21:48,103 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:21:48,127 INFO L321 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2022-11-16 12:21:48,127 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-16 12:21:48,141 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:21:48,145 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-16 12:21:48,555 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:21:48,565 INFO L321 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-11-16 12:21:48,565 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-16 12:21:48,589 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:21:48,590 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:21:48,591 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-16 12:21:51,716 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 12:21:51,717 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:21:51,779 INFO L321 Elim1Store]: treesize reduction 176, result has 7.4 percent of original size [2022-11-16 12:21:51,779 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-16 12:21:51,790 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:21:51,810 INFO L321 Elim1Store]: treesize reduction 15, result has 40.0 percent of original size [2022-11-16 12:21:51,810 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-16 12:21:52,258 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-16 12:21:52,258 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:21:57,267 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1711731930] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:21:57,268 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 12:21:57,268 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40] total 74 [2022-11-16 12:21:57,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108644892] [2022-11-16 12:21:57,268 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 12:21:57,269 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 74 states [2022-11-16 12:21:57,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:21:57,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2022-11-16 12:21:57,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=7423, Unknown=6, NotChecked=172, Total=7832 [2022-11-16 12:21:57,271 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-16 12:22:01,937 WARN L833 $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-16 12:22:01,942 WARN L855 $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-16 12:22:04,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:22:04,072 INFO L93 Difference]: Finished difference Result 127 states and 135 transitions. [2022-11-16 12:22:04,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-11-16 12:22:04,073 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-16 12:22:04,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:22:04,074 INFO L225 Difference]: With dead ends: 127 [2022-11-16 12:22:04,074 INFO L226 Difference]: Without dead ends: 127 [2022-11-16 12:22:04,076 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 41 SyntacticMatches, 5 SemanticMatches, 106 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1753 ImplicationChecksByTransitivity, 19.4s TimeCoverageRelationStatistics Valid=374, Invalid=10755, Unknown=9, NotChecked=418, Total=11556 [2022-11-16 12:22:04,077 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 126 mSDsluCounter, 1320 mSDsCounter, 0 mSdLazyCounter, 1430 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s 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.9s IncrementalHoareTripleChecker+Time [2022-11-16 12:22:04,078 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.9s Time] [2022-11-16 12:22:04,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2022-11-16 12:22:04,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 105. [2022-11-16 12:22:04,083 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-16 12:22:04,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 113 transitions. [2022-11-16 12:22:04,084 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 113 transitions. Word has length 63 [2022-11-16 12:22:04,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:22:04,084 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 113 transitions. [2022-11-16 12:22:04,085 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-16 12:22:04,085 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 113 transitions. [2022-11-16 12:22:04,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-11-16 12:22:04,086 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:22:04,086 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-16 12:22:04,100 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccdeb345-a6bd-4eb4-8736-1936ccfa9ff5/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-16 12:22:04,294 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccdeb345-a6bd-4eb4-8736-1936ccfa9ff5/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-11-16 12:22:04,294 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-16 12:22:04,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:22:04,295 INFO L85 PathProgramCache]: Analyzing trace with hash 1899114441, now seen corresponding path program 2 times [2022-11-16 12:22:04,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:22:04,295 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561847433] [2022-11-16 12:22:04,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:22:04,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:22:04,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:22:04,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 12:22:04,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:22:04,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-16 12:22:04,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:22:04,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-16 12:22:04,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:22:04,629 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-16 12:22:04,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:22:04,630 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561847433] [2022-11-16 12:22:04,630 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [561847433] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:22:04,630 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [154682210] [2022-11-16 12:22:04,630 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-16 12:22:04,631 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:22:04,631 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccdeb345-a6bd-4eb4-8736-1936ccfa9ff5/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:22:04,632 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccdeb345-a6bd-4eb4-8736-1936ccfa9ff5/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:22:04,639 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccdeb345-a6bd-4eb4-8736-1936ccfa9ff5/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-16 12:22:05,071 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-16 12:22:05,071 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 12:22:05,074 INFO L263 TraceCheckSpWp]: Trace formula consists of 471 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-16 12:22:05,075 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:22:05,298 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-16 12:22:05,299 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:22:05,506 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-16 12:22:05,506 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [154682210] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 12:22:05,506 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 12:22:05,507 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 11 [2022-11-16 12:22:05,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951341546] [2022-11-16 12:22:05,507 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 12:22:05,507 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-16 12:22:05,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:22:05,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-16 12:22:05,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-11-16 12:22:05,509 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-16 12:22:05,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:22:05,653 INFO L93 Difference]: Finished difference Result 119 states and 128 transitions. [2022-11-16 12:22:05,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-16 12:22:05,653 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-16 12:22:05,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:22:05,654 INFO L225 Difference]: With dead ends: 119 [2022-11-16 12:22:05,654 INFO L226 Difference]: Without dead ends: 119 [2022-11-16 12:22:05,655 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-16 12:22:05,655 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-16 12:22:05,655 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-16 12:22:05,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2022-11-16 12:22:05,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 108. [2022-11-16 12:22:05,660 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-16 12:22:05,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 118 transitions. [2022-11-16 12:22:05,661 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 118 transitions. Word has length 64 [2022-11-16 12:22:05,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:22:05,661 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 118 transitions. [2022-11-16 12:22:05,662 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-16 12:22:05,662 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 118 transitions. [2022-11-16 12:22:05,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-11-16 12:22:05,663 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:22:05,663 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-16 12:22:05,671 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccdeb345-a6bd-4eb4-8736-1936ccfa9ff5/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-11-16 12:22:05,871 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccdeb345-a6bd-4eb4-8736-1936ccfa9ff5/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-11-16 12:22:05,871 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-16 12:22:05,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:22:05,872 INFO L85 PathProgramCache]: Analyzing trace with hash -1084778802, now seen corresponding path program 1 times [2022-11-16 12:22:05,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:22:05,872 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170287308] [2022-11-16 12:22:05,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:22:05,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:22:05,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:22:06,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 12:22:06,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:22:06,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-16 12:22:06,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:22:06,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-16 12:22:06,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:22:06,277 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-16 12:22:06,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:22:06,278 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170287308] [2022-11-16 12:22:06,278 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1170287308] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:22:06,278 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:22:06,278 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-16 12:22:06,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726381092] [2022-11-16 12:22:06,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:22:06,279 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-16 12:22:06,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:22:06,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-16 12:22:06,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-11-16 12:22:06,281 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-16 12:22:06,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:22:06,605 INFO L93 Difference]: Finished difference Result 117 states and 128 transitions. [2022-11-16 12:22:06,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-16 12:22:06,606 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-16 12:22:06,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:22:06,607 INFO L225 Difference]: With dead ends: 117 [2022-11-16 12:22:06,607 INFO L226 Difference]: Without dead ends: 117 [2022-11-16 12:22:06,608 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2022-11-16 12:22:06,609 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 91 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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-16 12:22:06,609 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-16 12:22:06,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2022-11-16 12:22:06,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 109. [2022-11-16 12:22:06,613 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-16 12:22:06,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 121 transitions. [2022-11-16 12:22:06,614 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 121 transitions. Word has length 67 [2022-11-16 12:22:06,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:22:06,615 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 121 transitions. [2022-11-16 12:22:06,615 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-16 12:22:06,615 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 121 transitions. [2022-11-16 12:22:06,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-11-16 12:22:06,616 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:22:06,616 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-16 12:22:06,617 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-11-16 12:22:06,617 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-16 12:22:06,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:22:06,617 INFO L85 PathProgramCache]: Analyzing trace with hash -1084778801, now seen corresponding path program 1 times [2022-11-16 12:22:06,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:22:06,618 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202568026] [2022-11-16 12:22:06,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:22:06,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:22:06,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:22:07,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 12:22:07,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:22:07,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-16 12:22:07,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:22:07,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-16 12:22:07,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:22:07,205 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-16 12:22:07,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:22:07,205 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202568026] [2022-11-16 12:22:07,206 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [202568026] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:22:07,206 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:22:07,206 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-16 12:22:07,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081515805] [2022-11-16 12:22:07,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:22:07,207 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-16 12:22:07,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:22:07,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-16 12:22:07,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-11-16 12:22:07,208 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-16 12:22:07,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:22:07,565 INFO L93 Difference]: Finished difference Result 117 states and 127 transitions. [2022-11-16 12:22:07,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-16 12:22:07,566 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-16 12:22:07,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:22:07,567 INFO L225 Difference]: With dead ends: 117 [2022-11-16 12:22:07,567 INFO L226 Difference]: Without dead ends: 117 [2022-11-16 12:22:07,568 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-16 12:22:07,568 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-16 12:22:07,569 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-16 12:22:07,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2022-11-16 12:22:07,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 111. [2022-11-16 12:22:07,573 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-16 12:22:07,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 122 transitions. [2022-11-16 12:22:07,574 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 122 transitions. Word has length 67 [2022-11-16 12:22:07,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:22:07,575 INFO L495 AbstractCegarLoop]: Abstraction has 111 states and 122 transitions. [2022-11-16 12:22:07,575 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-16 12:22:07,575 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 122 transitions. [2022-11-16 12:22:07,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-11-16 12:22:07,576 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:22:07,576 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-16 12:22:07,576 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-11-16 12:22:07,577 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-16 12:22:07,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:22:07,577 INFO L85 PathProgramCache]: Analyzing trace with hash 731594071, now seen corresponding path program 1 times [2022-11-16 12:22:07,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:22:07,578 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451080272] [2022-11-16 12:22:07,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:22:07,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:22:07,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:22:07,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 12:22:07,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:22:07,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-16 12:22:07,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:22:07,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-16 12:22:07,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:22:07,891 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-16 12:22:07,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:22:07,892 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451080272] [2022-11-16 12:22:07,892 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [451080272] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:22:07,892 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:22:07,892 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-16 12:22:07,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058457913] [2022-11-16 12:22:07,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:22:07,893 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-16 12:22:07,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:22:07,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-16 12:22:07,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-11-16 12:22:07,894 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-16 12:22:08,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:22:08,171 INFO L93 Difference]: Finished difference Result 114 states and 124 transitions. [2022-11-16 12:22:08,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-16 12:22:08,172 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-16 12:22:08,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:22:08,173 INFO L225 Difference]: With dead ends: 114 [2022-11-16 12:22:08,174 INFO L226 Difference]: Without dead ends: 114 [2022-11-16 12:22:08,174 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-16 12:22:08,174 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.2s IncrementalHoareTripleChecker+Time [2022-11-16 12:22:08,174 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.2s Time] [2022-11-16 12:22:08,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2022-11-16 12:22:08,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 111. [2022-11-16 12:22:08,179 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-16 12:22:08,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 121 transitions. [2022-11-16 12:22:08,180 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 121 transitions. Word has length 68 [2022-11-16 12:22:08,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:22:08,181 INFO L495 AbstractCegarLoop]: Abstraction has 111 states and 121 transitions. [2022-11-16 12:22:08,181 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-16 12:22:08,181 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 121 transitions. [2022-11-16 12:22:08,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-11-16 12:22:08,182 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:22:08,182 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-16 12:22:08,183 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-11-16 12:22:08,183 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-16 12:22:08,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:22:08,183 INFO L85 PathProgramCache]: Analyzing trace with hash -1311285704, now seen corresponding path program 1 times [2022-11-16 12:22:08,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:22:08,184 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036461868] [2022-11-16 12:22:08,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:22:08,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:22:08,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:22:08,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 12:22:08,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:22:08,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-16 12:22:08,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:22:08,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-16 12:22:08,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:22:08,554 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-16 12:22:08,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:22:08,554 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036461868] [2022-11-16 12:22:08,554 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036461868] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:22:08,554 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:22:08,555 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-16 12:22:08,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210410812] [2022-11-16 12:22:08,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:22:08,555 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-16 12:22:08,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:22:08,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-16 12:22:08,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-11-16 12:22:08,556 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-16 12:22:08,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:22:08,878 INFO L93 Difference]: Finished difference Result 112 states and 122 transitions. [2022-11-16 12:22:08,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-16 12:22:08,879 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-16 12:22:08,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:22:08,880 INFO L225 Difference]: With dead ends: 112 [2022-11-16 12:22:08,880 INFO L226 Difference]: Without dead ends: 112 [2022-11-16 12:22:08,881 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-16 12:22:08,881 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 87 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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-16 12:22:08,881 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-16 12:22:08,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2022-11-16 12:22:08,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2022-11-16 12:22:08,885 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-16 12:22:08,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 122 transitions. [2022-11-16 12:22:08,898 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 122 transitions. Word has length 70 [2022-11-16 12:22:08,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:22:08,898 INFO L495 AbstractCegarLoop]: Abstraction has 112 states and 122 transitions. [2022-11-16 12:22:08,899 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-16 12:22:08,899 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 122 transitions. [2022-11-16 12:22:08,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-11-16 12:22:08,900 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:22:08,900 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-16 12:22:08,900 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-11-16 12:22:08,901 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-16 12:22:08,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:22:08,903 INFO L85 PathProgramCache]: Analyzing trace with hash -1784716013, now seen corresponding path program 1 times [2022-11-16 12:22:08,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:22:08,904 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290641917] [2022-11-16 12:22:08,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:22:08,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:22:08,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:22:10,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 12:22:10,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:22:10,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-16 12:22:10,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:22:10,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-16 12:22:10,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:22:10,901 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-16 12:22:10,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:22:10,901 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290641917] [2022-11-16 12:22:10,901 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1290641917] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:22:10,902 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1889000747] [2022-11-16 12:22:10,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:22:10,902 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:22:10,902 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccdeb345-a6bd-4eb4-8736-1936ccfa9ff5/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:22:10,907 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccdeb345-a6bd-4eb4-8736-1936ccfa9ff5/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:22:10,918 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccdeb345-a6bd-4eb4-8736-1936ccfa9ff5/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-11-16 12:22:11,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:22:11,338 INFO L263 TraceCheckSpWp]: Trace formula consists of 513 conjuncts, 68 conjunts are in the unsatisfiable core [2022-11-16 12:22:11,342 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:22:11,516 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-16 12:22:11,829 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-16 12:22:12,581 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:22:12,581 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-16 12:22:12,758 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:22:12,759 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-16 12:22:13,157 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-16 12:22:13,827 INFO L321 Elim1Store]: treesize reduction 42, result has 82.6 percent of original size [2022-11-16 12:22:13,827 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-16 12:22:14,436 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 12:22:14,436 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-16 12:22:14,446 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-16 12:22:14,446 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:22:15,252 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:22:15,252 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-16 12:22:15,978 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:22:15,979 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-16 12:22:16,443 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-16 12:22:16,626 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:22:16,626 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-16 12:22:21,848 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:22:21,848 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-16 12:22:25,540 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-16 12:22:25,540 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1889000747] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 12:22:25,540 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 12:22:25,541 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 23, 23] total 64 [2022-11-16 12:22:25,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585055381] [2022-11-16 12:22:25,541 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 12:22:25,541 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 65 states [2022-11-16 12:22:25,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:22:25,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2022-11-16 12:22:25,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=218, Invalid=3942, Unknown=0, NotChecked=0, Total=4160 [2022-11-16 12:22:25,543 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-16 12:22:31,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:22:31,609 INFO L93 Difference]: Finished difference Result 123 states and 134 transitions. [2022-11-16 12:22:31,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-11-16 12:22:31,610 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-16 12:22:31,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:22:31,611 INFO L225 Difference]: With dead ends: 123 [2022-11-16 12:22:31,611 INFO L226 Difference]: Without dead ends: 123 [2022-11-16 12:22:31,612 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 106 SyntacticMatches, 6 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1582 ImplicationChecksByTransitivity, 10.2s TimeCoverageRelationStatistics Valid=714, Invalid=7658, Unknown=0, NotChecked=0, Total=8372 [2022-11-16 12:22:31,613 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 364 mSDsluCounter, 643 mSDsCounter, 0 mSdLazyCounter, 1741 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s 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.7s IncrementalHoareTripleChecker+Time [2022-11-16 12:22:31,614 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.7s Time] [2022-11-16 12:22:31,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2022-11-16 12:22:31,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 115. [2022-11-16 12:22:31,618 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-16 12:22:31,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 127 transitions. [2022-11-16 12:22:31,619 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 127 transitions. Word has length 73 [2022-11-16 12:22:31,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:22:31,620 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 127 transitions. [2022-11-16 12:22:31,620 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-16 12:22:31,621 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 127 transitions. [2022-11-16 12:22:31,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-11-16 12:22:31,622 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:22:31,622 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-16 12:22:31,635 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccdeb345-a6bd-4eb4-8736-1936ccfa9ff5/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-11-16 12:22:31,834 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccdeb345-a6bd-4eb4-8736-1936ccfa9ff5/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-11-16 12:22:31,835 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-16 12:22:31,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:22:31,835 INFO L85 PathProgramCache]: Analyzing trace with hash -1784716012, now seen corresponding path program 1 times [2022-11-16 12:22:31,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:22:31,835 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701662979] [2022-11-16 12:22:31,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:22:31,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:22:31,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:22:33,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 12:22:33,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:22:33,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-16 12:22:33,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:22:33,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-16 12:22:33,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:22:34,043 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-16 12:22:34,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:22:34,043 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701662979] [2022-11-16 12:22:34,043 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [701662979] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:22:34,043 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [714413557] [2022-11-16 12:22:34,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:22:34,043 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:22:34,044 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccdeb345-a6bd-4eb4-8736-1936ccfa9ff5/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:22:34,045 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccdeb345-a6bd-4eb4-8736-1936ccfa9ff5/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:22:34,046 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccdeb345-a6bd-4eb4-8736-1936ccfa9ff5/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-11-16 12:22:34,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:22:34,425 INFO L263 TraceCheckSpWp]: Trace formula consists of 513 conjuncts, 114 conjunts are in the unsatisfiable core [2022-11-16 12:22:34,430 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:22:35,055 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-16 12:22:35,060 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-16 12:22:35,613 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:22:35,614 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-16 12:22:35,627 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:22:35,628 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-16 12:22:35,634 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:22:35,635 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-16 12:22:35,657 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-11-16 12:22:35,657 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-16 12:22:36,033 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:22:36,034 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-16 12:22:36,049 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:22:36,050 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-16 12:22:36,222 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:22:36,226 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-16 12:22:36,236 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:22:36,237 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-16 12:22:36,244 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-16 12:22:37,008 INFO L321 Elim1Store]: treesize reduction 15, result has 34.8 percent of original size [2022-11-16 12:22:37,009 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-16 12:22:37,022 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:22:37,022 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-16 12:22:37,287 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-16 12:22:37,288 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:22:38,407 WARN L833 $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 |c_ULTIMATE.start_sll_prepend_#t~mem8#1.base|)))) (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 |c_ULTIMATE.start_sll_prepend_#t~mem8#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-16 12:22:38,431 WARN L833 $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-16 12:22:38,472 WARN L833 $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-16 12:22:39,157 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [714413557] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:22:39,157 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 12:22:39,157 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 26] total 52 [2022-11-16 12:22:39,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697551022] [2022-11-16 12:22:39,158 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 12:22:39,158 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2022-11-16 12:22:39,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:22:39,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2022-11-16 12:22:39,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=200, Invalid=3561, Unknown=33, NotChecked=366, Total=4160 [2022-11-16 12:22:39,160 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-16 12:22:41,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:22:41,734 INFO L93 Difference]: Finished difference Result 123 states and 133 transitions. [2022-11-16 12:22:41,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-11-16 12:22:41,735 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-16 12:22:41,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:22:41,736 INFO L225 Difference]: With dead ends: 123 [2022-11-16 12:22:41,736 INFO L226 Difference]: Without dead ends: 123 [2022-11-16 12:22:41,737 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 78 SyntacticMatches, 1 SemanticMatches, 77 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1411 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=345, Invalid=5332, Unknown=35, NotChecked=450, Total=6162 [2022-11-16 12:22:41,738 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 132 mSDsluCounter, 720 mSDsCounter, 0 mSdLazyCounter, 1015 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s 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.9s IncrementalHoareTripleChecker+Time [2022-11-16 12:22:41,738 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.9s Time] [2022-11-16 12:22:41,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2022-11-16 12:22:41,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 117. [2022-11-16 12:22:41,743 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-16 12:22:41,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 128 transitions. [2022-11-16 12:22:41,744 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 128 transitions. Word has length 73 [2022-11-16 12:22:41,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:22:41,744 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 128 transitions. [2022-11-16 12:22:41,745 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-16 12:22:41,745 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 128 transitions. [2022-11-16 12:22:41,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-11-16 12:22:41,746 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:22:41,746 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-16 12:22:41,762 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccdeb345-a6bd-4eb4-8736-1936ccfa9ff5/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-11-16 12:22:41,954 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccdeb345-a6bd-4eb4-8736-1936ccfa9ff5/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-11-16 12:22:41,955 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-16 12:22:41,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:22:41,955 INFO L85 PathProgramCache]: Analyzing trace with hash 508377010, now seen corresponding path program 1 times [2022-11-16 12:22:41,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:22:41,956 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214746387] [2022-11-16 12:22:41,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:22:41,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:22:41,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:22:43,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 12:22:43,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:22:43,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-16 12:22:43,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:22:43,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-16 12:22:43,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:22:43,423 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-16 12:22:43,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:22:43,424 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214746387] [2022-11-16 12:22:43,424 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [214746387] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:22:43,424 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1013960404] [2022-11-16 12:22:43,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:22:43,424 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:22:43,424 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccdeb345-a6bd-4eb4-8736-1936ccfa9ff5/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:22:43,425 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccdeb345-a6bd-4eb4-8736-1936ccfa9ff5/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:22:43,429 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccdeb345-a6bd-4eb4-8736-1936ccfa9ff5/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-11-16 12:22:43,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:22:43,851 INFO L263 TraceCheckSpWp]: Trace formula consists of 521 conjuncts, 75 conjunts are in the unsatisfiable core [2022-11-16 12:22:43,855 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:22:44,309 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-16 12:22:44,599 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:22:44,600 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-16 12:22:44,900 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:22:44,901 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-16 12:22:45,007 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:22:45,008 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-16 12:22:45,559 INFO L321 Elim1Store]: treesize reduction 15, result has 34.8 percent of original size [2022-11-16 12:22:45,559 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-16 12:22:45,685 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-16 12:22:45,686 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:22:46,432 WARN L833 $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-16 12:22:46,435 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1013960404] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:22:46,435 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 12:22:46,435 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 44 [2022-11-16 12:22:46,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828368303] [2022-11-16 12:22:46,436 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 12:22:46,436 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2022-11-16 12:22:46,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:22:46,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2022-11-16 12:22:46,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=2399, Unknown=1, NotChecked=98, Total=2652 [2022-11-16 12:22:46,438 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-16 12:22:48,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:22:48,792 INFO L93 Difference]: Finished difference Result 120 states and 130 transitions. [2022-11-16 12:22:48,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-11-16 12:22:48,793 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-16 12:22:48,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:22:48,794 INFO L225 Difference]: With dead ends: 120 [2022-11-16 12:22:48,794 INFO L226 Difference]: Without dead ends: 120 [2022-11-16 12:22:48,795 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 87 SyntacticMatches, 3 SemanticMatches, 69 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 921 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=415, Invalid=4418, Unknown=1, NotChecked=136, Total=4970 [2022-11-16 12:22:48,796 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 224 mSDsluCounter, 818 mSDsCounter, 0 mSdLazyCounter, 906 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s 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.9s IncrementalHoareTripleChecker+Time [2022-11-16 12:22:48,796 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.9s Time] [2022-11-16 12:22:48,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2022-11-16 12:22:48,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 117. [2022-11-16 12:22:48,800 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-16 12:22:48,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 127 transitions. [2022-11-16 12:22:48,801 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 127 transitions. Word has length 74 [2022-11-16 12:22:48,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:22:48,802 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 127 transitions. [2022-11-16 12:22:48,802 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-16 12:22:48,803 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 127 transitions. [2022-11-16 12:22:48,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-11-16 12:22:48,804 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:22:48,804 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-16 12:22:48,815 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccdeb345-a6bd-4eb4-8736-1936ccfa9ff5/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2022-11-16 12:22:49,010 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccdeb345-a6bd-4eb4-8736-1936ccfa9ff5/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:22:49,011 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-16 12:22:49,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:22:49,011 INFO L85 PathProgramCache]: Analyzing trace with hash -274698947, now seen corresponding path program 2 times [2022-11-16 12:22:49,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:22:49,011 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729423633] [2022-11-16 12:22:49,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:22:49,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:22:49,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:22:49,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 12:22:49,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:22:49,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-16 12:22:49,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:22:49,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-11-16 12:22:49,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:22:49,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-11-16 12:22:49,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:22:49,206 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-16 12:22:49,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:22:49,207 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729423633] [2022-11-16 12:22:49,207 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1729423633] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:22:49,207 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1447014730] [2022-11-16 12:22:49,207 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-16 12:22:49,208 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:22:49,208 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccdeb345-a6bd-4eb4-8736-1936ccfa9ff5/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:22:49,209 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccdeb345-a6bd-4eb4-8736-1936ccfa9ff5/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:22:49,210 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccdeb345-a6bd-4eb4-8736-1936ccfa9ff5/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-11-16 12:22:49,655 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-16 12:22:49,655 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 12:22:49,659 INFO L263 TraceCheckSpWp]: Trace formula consists of 554 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-16 12:22:49,661 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:22:49,696 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-16 12:22:49,697 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 12:22:49,697 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1447014730] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:22:49,697 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-16 12:22:49,697 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2022-11-16 12:22:49,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444233677] [2022-11-16 12:22:49,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:22:49,698 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 12:22:49,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:22:49,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 12:22:49,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-16 12:22:49,700 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-16 12:22:49,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:22:49,722 INFO L93 Difference]: Finished difference Result 74 states and 76 transitions. [2022-11-16 12:22:49,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 12:22:49,723 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-16 12:22:49,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:22:49,724 INFO L225 Difference]: With dead ends: 74 [2022-11-16 12:22:49,724 INFO L226 Difference]: Without dead ends: 74 [2022-11-16 12:22:49,725 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-16 12:22:49,726 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-16 12:22:49,728 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-16 12:22:49,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2022-11-16 12:22:49,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2022-11-16 12:22:49,732 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-16 12:22:49,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 76 transitions. [2022-11-16 12:22:49,733 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 76 transitions. Word has length 75 [2022-11-16 12:22:49,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:22:49,734 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 76 transitions. [2022-11-16 12:22:49,734 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-16 12:22:49,734 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 76 transitions. [2022-11-16 12:22:49,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-11-16 12:22:49,735 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:22:49,735 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-16 12:22:49,747 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccdeb345-a6bd-4eb4-8736-1936ccfa9ff5/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-11-16 12:22:49,946 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccdeb345-a6bd-4eb4-8736-1936ccfa9ff5/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2022-11-16 12:22:49,947 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-16 12:22:49,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:22:49,947 INFO L85 PathProgramCache]: Analyzing trace with hash -1074516525, now seen corresponding path program 1 times [2022-11-16 12:22:49,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:22:49,947 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100112109] [2022-11-16 12:22:49,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:22:49,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:22:49,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:22:50,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 12:22:51,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:22:51,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-16 12:22:51,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:22:51,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-16 12:22:51,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:22:51,373 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-16 12:22:51,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:22:51,374 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100112109] [2022-11-16 12:22:51,374 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1100112109] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:22:51,374 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [200026731] [2022-11-16 12:22:51,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:22:51,374 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:22:51,374 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccdeb345-a6bd-4eb4-8736-1936ccfa9ff5/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:22:51,375 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccdeb345-a6bd-4eb4-8736-1936ccfa9ff5/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:22:51,378 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccdeb345-a6bd-4eb4-8736-1936ccfa9ff5/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-11-16 12:22:51,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:22:51,838 INFO L263 TraceCheckSpWp]: Trace formula consists of 527 conjuncts, 63 conjunts are in the unsatisfiable core [2022-11-16 12:22:51,841 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:22:52,279 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-16 12:22:52,559 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:22:52,559 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-16 12:22:52,885 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:22:52,887 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-16 12:22:53,017 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:22:53,018 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-16 12:22:53,678 INFO L321 Elim1Store]: treesize reduction 15, result has 34.8 percent of original size [2022-11-16 12:22:53,679 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-16 12:22:53,825 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-16 12:22:53,825 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:22:54,849 WARN L833 $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-16 12:22:54,851 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [200026731] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:22:54,852 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 12:22:54,852 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 25] total 44 [2022-11-16 12:22:54,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163648392] [2022-11-16 12:22:54,852 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 12:22:54,852 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-11-16 12:22:54,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:22:54,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-11-16 12:22:54,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=2471, Unknown=1, NotChecked=100, Total=2756 [2022-11-16 12:22:54,853 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-16 12:22:57,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:22:57,207 INFO L93 Difference]: Finished difference Result 75 states and 77 transitions. [2022-11-16 12:22:57,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-11-16 12:22:57,207 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-16 12:22:57,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:22:57,208 INFO L225 Difference]: With dead ends: 75 [2022-11-16 12:22:57,208 INFO L226 Difference]: Without dead ends: 75 [2022-11-16 12:22:57,209 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 86 SyntacticMatches, 7 SemanticMatches, 70 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1186 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=474, Invalid=4499, Unknown=1, NotChecked=138, Total=5112 [2022-11-16 12:22:57,210 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 204 mSDsluCounter, 542 mSDsCounter, 0 mSdLazyCounter, 1006 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s 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.9s IncrementalHoareTripleChecker+Time [2022-11-16 12:22:57,210 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.9s Time] [2022-11-16 12:22:57,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-11-16 12:22:57,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2022-11-16 12:22:57,214 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-16 12:22:57,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 77 transitions. [2022-11-16 12:22:57,214 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 77 transitions. Word has length 76 [2022-11-16 12:22:57,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:22:57,215 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 77 transitions. [2022-11-16 12:22:57,215 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-16 12:22:57,215 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 77 transitions. [2022-11-16 12:22:57,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-11-16 12:22:57,216 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:22:57,217 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-16 12:22:57,227 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccdeb345-a6bd-4eb4-8736-1936ccfa9ff5/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-11-16 12:22:57,424 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccdeb345-a6bd-4eb4-8736-1936ccfa9ff5/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2022-11-16 12:22:57,425 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-16 12:22:57,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:22:57,425 INFO L85 PathProgramCache]: Analyzing trace with hash -530404456, now seen corresponding path program 2 times [2022-11-16 12:22:57,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:22:57,425 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85453747] [2022-11-16 12:22:57,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:22:57,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:22:57,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:23:00,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 12:23:00,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:23:00,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-16 12:23:00,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:23:00,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-16 12:23:00,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:23:01,199 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-16 12:23:01,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:23:01,199 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85453747] [2022-11-16 12:23:01,200 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [85453747] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:23:01,200 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [758460567] [2022-11-16 12:23:01,200 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-16 12:23:01,200 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:23:01,200 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccdeb345-a6bd-4eb4-8736-1936ccfa9ff5/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:23:01,202 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccdeb345-a6bd-4eb4-8736-1936ccfa9ff5/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:23:01,204 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccdeb345-a6bd-4eb4-8736-1936ccfa9ff5/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-11-16 12:23:01,652 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-16 12:23:01,652 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 12:23:01,658 INFO L263 TraceCheckSpWp]: Trace formula consists of 537 conjuncts, 157 conjunts are in the unsatisfiable core [2022-11-16 12:23:01,663 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:23:01,733 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-16 12:23:02,249 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-16 12:23:02,346 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-16 12:23:02,537 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-16 12:23:02,537 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-16 12:23:02,765 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-16 12:23:02,765 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-16 12:23:03,223 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:23:03,224 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-16 12:23:03,303 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-16 12:23:03,806 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:23:03,821 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-11-16 12:23:03,822 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-16 12:23:03,835 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-11-16 12:23:04,382 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:23:04,383 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:23:04,396 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-16 12:23:04,396 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-16 12:23:04,623 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:23:04,626 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-16 12:23:04,627 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-16 12:23:06,801 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:23:06,802 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-16 12:23:10,244 INFO L321 Elim1Store]: treesize reduction 48, result has 69.4 percent of original size [2022-11-16 12:23:10,244 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-16 12:24:25,748 WARN L233 SmtUtils]: Spent 28.73s on a formula simplification. DAG size of input: 319 DAG size of output: 87 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 12:24:34,542 WARN L233 SmtUtils]: Spent 8.14s on a formula simplification that was a NOOP. DAG size: 87 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 12:24:41,246 WARN L233 SmtUtils]: Spent 6.10s on a formula simplification that was a NOOP. DAG size: 81 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 12:24:41,623 INFO L321 Elim1Store]: treesize reduction 114, result has 65.9 percent of original size [2022-11-16 12:24:41,623 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-16 12:26:01,174 WARN L230 Executor]: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccdeb345-a6bd-4eb4-8736-1936ccfa9ff5/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) stderr output: (error "out of memory") [2022-11-16 12:26:01,175 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccdeb345-a6bd-4eb4-8736-1936ccfa9ff5/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 101 [2022-11-16 12:26:01,176 WARN L319 FreeRefinementEngine]: Global settings require throwing the following exception [2022-11-16 12:26:01,182 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccdeb345-a6bd-4eb4-8736-1936ccfa9ff5/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-11-16 12:26:01,376 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccdeb345-a6bd-4eb4-8736-1936ccfa9ff5/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:26:01,377 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_ccdeb345-a6bd-4eb4-8736-1936ccfa9ff5/bin/uautomizer-tPACEb0tL8/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:360) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:305) 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-16 12:26:01,381 INFO L158 Benchmark]: Toolchain (without parser) took 527470.45ms. Allocated memory was 125.8MB in the beginning and 408.9MB in the end (delta: 283.1MB). Free memory was 89.0MB in the beginning and 261.5MB in the end (delta: -172.4MB). Peak memory consumption was 253.6MB. Max. memory is 16.1GB. [2022-11-16 12:26:01,381 INFO L158 Benchmark]: CDTParser took 0.35ms. Allocated memory is still 125.8MB. Free memory is still 106.6MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-16 12:26:01,381 INFO L158 Benchmark]: CACSL2BoogieTranslator took 610.61ms. Allocated memory is still 125.8MB. Free memory was 88.8MB in the beginning and 93.4MB in the end (delta: -4.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-16 12:26:01,381 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.66ms. Allocated memory is still 125.8MB. Free memory was 92.9MB in the beginning and 90.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-16 12:26:01,381 INFO L158 Benchmark]: Boogie Preprocessor took 49.14ms. Allocated memory is still 125.8MB. Free memory was 90.8MB in the beginning and 89.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-16 12:26:01,382 INFO L158 Benchmark]: RCFGBuilder took 706.38ms. Allocated memory is still 125.8MB. Free memory was 89.2MB in the beginning and 70.3MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2022-11-16 12:26:01,382 INFO L158 Benchmark]: TraceAbstraction took 526040.32ms. Allocated memory was 125.8MB in the beginning and 408.9MB in the end (delta: 283.1MB). Free memory was 69.8MB in the beginning and 261.5MB in the end (delta: -191.7MB). Peak memory consumption was 237.2MB. Max. memory is 16.1GB. [2022-11-16 12:26:01,383 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.35ms. Allocated memory is still 125.8MB. Free memory is still 106.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 610.61ms. Allocated memory is still 125.8MB. Free memory was 88.8MB in the beginning and 93.4MB in the end (delta: -4.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 54.66ms. Allocated memory is still 125.8MB. Free memory was 92.9MB in the beginning and 90.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 49.14ms. Allocated memory is still 125.8MB. Free memory was 90.8MB in the beginning and 89.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 706.38ms. Allocated memory is still 125.8MB. Free memory was 89.2MB in the beginning and 70.3MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 526040.32ms. Allocated memory was 125.8MB in the beginning and 408.9MB in the end (delta: 283.1MB). Free memory was 69.8MB in the beginning and 261.5MB in the end (delta: -191.7MB). Peak memory consumption was 237.2MB. 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_ccdeb345-a6bd-4eb4-8736-1936ccfa9ff5/bin/uautomizer-tPACEb0tL8/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_ccdeb345-a6bd-4eb4-8736-1936ccfa9ff5/bin/uautomizer-tPACEb0tL8/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-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccdeb345-a6bd-4eb4-8736-1936ccfa9ff5/bin/uautomizer-tPACEb0tL8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccdeb345-a6bd-4eb4-8736-1936ccfa9ff5/bin/uautomizer-tPACEb0tL8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccdeb345-a6bd-4eb4-8736-1936ccfa9ff5/bin/uautomizer-tPACEb0tL8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccdeb345-a6bd-4eb4-8736-1936ccfa9ff5/bin/uautomizer-tPACEb0tL8/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/sll2n_prepend_unequal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccdeb345-a6bd-4eb4-8736-1936ccfa9ff5/bin/uautomizer-tPACEb0tL8/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccdeb345-a6bd-4eb4-8736-1936ccfa9ff5/bin/uautomizer-tPACEb0tL8 --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-e04fb08 [2022-11-16 12:26:03,908 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-16 12:26:03,911 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-16 12:26:03,959 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-16 12:26:03,959 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-16 12:26:03,964 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-16 12:26:03,967 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-16 12:26:03,975 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-16 12:26:03,979 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-16 12:26:03,982 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-16 12:26:03,984 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-16 12:26:03,987 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-16 12:26:03,988 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-16 12:26:03,994 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-16 12:26:03,995 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-16 12:26:03,998 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-16 12:26:04,001 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-16 12:26:04,002 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-16 12:26:04,008 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-16 12:26:04,011 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-16 12:26:04,019 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-16 12:26:04,021 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-16 12:26:04,022 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-16 12:26:04,024 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-16 12:26:04,029 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-16 12:26:04,035 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-16 12:26:04,036 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-16 12:26:04,037 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-16 12:26:04,038 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-16 12:26:04,040 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-16 12:26:04,040 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-16 12:26:04,041 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-16 12:26:04,044 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-16 12:26:04,045 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-16 12:26:04,046 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-16 12:26:04,046 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-16 12:26:04,047 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-16 12:26:04,048 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-16 12:26:04,048 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-16 12:26:04,050 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-16 12:26:04,051 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-16 12:26:04,057 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccdeb345-a6bd-4eb4-8736-1936ccfa9ff5/bin/uautomizer-tPACEb0tL8/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2022-11-16 12:26:04,088 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-16 12:26:04,089 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-16 12:26:04,089 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-16 12:26:04,090 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-16 12:26:04,091 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-16 12:26:04,091 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-16 12:26:04,092 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-16 12:26:04,092 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-16 12:26:04,093 INFO L138 SettingsManager]: * Use SBE=true [2022-11-16 12:26:04,093 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-16 12:26:04,093 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-16 12:26:04,094 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-16 12:26:04,094 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-16 12:26:04,095 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-16 12:26:04,095 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-16 12:26:04,095 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-16 12:26:04,096 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-16 12:26:04,096 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-16 12:26:04,096 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-16 12:26:04,096 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-16 12:26:04,097 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-16 12:26:04,097 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-16 12:26:04,097 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-16 12:26:04,098 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-16 12:26:04,098 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-16 12:26:04,099 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-16 12:26:04,099 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-16 12:26:04,099 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 12:26:04,100 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-16 12:26:04,100 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-16 12:26:04,100 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-11-16 12:26:04,101 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-16 12:26:04,101 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-16 12:26:04,101 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_ccdeb345-a6bd-4eb4-8736-1936ccfa9ff5/bin/uautomizer-tPACEb0tL8/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_ccdeb345-a6bd-4eb4-8736-1936ccfa9ff5/bin/uautomizer-tPACEb0tL8 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-16 12:26:04,547 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-16 12:26:04,584 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-16 12:26:04,589 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-16 12:26:04,591 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-16 12:26:04,594 INFO L275 PluginConnector]: CDTParser initialized [2022-11-16 12:26:04,596 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccdeb345-a6bd-4eb4-8736-1936ccfa9ff5/bin/uautomizer-tPACEb0tL8/../../sv-benchmarks/c/list-simple/sll2n_prepend_unequal.i [2022-11-16 12:26:04,689 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccdeb345-a6bd-4eb4-8736-1936ccfa9ff5/bin/uautomizer-tPACEb0tL8/data/d9cc5e960/ef0f17daf1904ec18dfeadf918c97df9/FLAGc15cca496 [2022-11-16 12:26:05,307 INFO L306 CDTParser]: Found 1 translation units. [2022-11-16 12:26:05,308 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccdeb345-a6bd-4eb4-8736-1936ccfa9ff5/sv-benchmarks/c/list-simple/sll2n_prepend_unequal.i [2022-11-16 12:26:05,321 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccdeb345-a6bd-4eb4-8736-1936ccfa9ff5/bin/uautomizer-tPACEb0tL8/data/d9cc5e960/ef0f17daf1904ec18dfeadf918c97df9/FLAGc15cca496 [2022-11-16 12:26:05,611 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccdeb345-a6bd-4eb4-8736-1936ccfa9ff5/bin/uautomizer-tPACEb0tL8/data/d9cc5e960/ef0f17daf1904ec18dfeadf918c97df9 [2022-11-16 12:26:05,614 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-16 12:26:05,616 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-16 12:26:05,617 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-16 12:26:05,618 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-16 12:26:05,622 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-16 12:26:05,623 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:26:05" (1/1) ... [2022-11-16 12:26:05,625 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@86af16 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:26:05, skipping insertion in model container [2022-11-16 12:26:05,625 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:26:05" (1/1) ... [2022-11-16 12:26:05,634 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-16 12:26:05,691 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-16 12:26:06,052 WARN L229 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_ccdeb345-a6bd-4eb4-8736-1936ccfa9ff5/sv-benchmarks/c/list-simple/sll2n_prepend_unequal.i[24165,24178] [2022-11-16 12:26:06,055 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 12:26:06,069 INFO L203 MainTranslator]: Completed pre-run [2022-11-16 12:26:06,117 WARN L229 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_ccdeb345-a6bd-4eb4-8736-1936ccfa9ff5/sv-benchmarks/c/list-simple/sll2n_prepend_unequal.i[24165,24178] [2022-11-16 12:26:06,119 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 12:26:06,155 INFO L208 MainTranslator]: Completed translation [2022-11-16 12:26:06,156 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:26:06 WrapperNode [2022-11-16 12:26:06,156 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-16 12:26:06,158 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-16 12:26:06,158 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-16 12:26:06,158 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-16 12:26:06,167 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:26:06" (1/1) ... [2022-11-16 12:26:06,187 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:26:06" (1/1) ... [2022-11-16 12:26:06,214 INFO L138 Inliner]: procedures = 130, calls = 32, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 116 [2022-11-16 12:26:06,215 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-16 12:26:06,216 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-16 12:26:06,216 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-16 12:26:06,216 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-16 12:26:06,226 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:26:06" (1/1) ... [2022-11-16 12:26:06,227 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:26:06" (1/1) ... [2022-11-16 12:26:06,232 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:26:06" (1/1) ... [2022-11-16 12:26:06,232 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:26:06" (1/1) ... [2022-11-16 12:26:06,243 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:26:06" (1/1) ... [2022-11-16 12:26:06,248 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:26:06" (1/1) ... [2022-11-16 12:26:06,250 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:26:06" (1/1) ... [2022-11-16 12:26:06,252 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:26:06" (1/1) ... [2022-11-16 12:26:06,255 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-16 12:26:06,256 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-16 12:26:06,257 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-16 12:26:06,257 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-16 12:26:06,258 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:26:06" (1/1) ... [2022-11-16 12:26:06,265 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 12:26:06,278 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccdeb345-a6bd-4eb4-8736-1936ccfa9ff5/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:26:06,292 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccdeb345-a6bd-4eb4-8736-1936ccfa9ff5/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-16 12:26:06,322 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccdeb345-a6bd-4eb4-8736-1936ccfa9ff5/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-16 12:26:06,346 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-11-16 12:26:06,346 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2022-11-16 12:26:06,346 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2022-11-16 12:26:06,347 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-16 12:26:06,347 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-16 12:26:06,347 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-16 12:26:06,347 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-16 12:26:06,353 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-16 12:26:06,354 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-16 12:26:06,354 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-11-16 12:26:06,354 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-16 12:26:06,354 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-11-16 12:26:06,355 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-16 12:26:06,355 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-16 12:26:06,537 INFO L235 CfgBuilder]: Building ICFG [2022-11-16 12:26:06,539 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-16 12:26:07,207 INFO L276 CfgBuilder]: Performing block encoding [2022-11-16 12:26:07,215 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-16 12:26:07,216 INFO L300 CfgBuilder]: Removed 3 assume(true) statements. [2022-11-16 12:26:07,219 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:26:07 BoogieIcfgContainer [2022-11-16 12:26:07,219 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-16 12:26:07,222 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-16 12:26:07,222 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-16 12:26:07,226 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-16 12:26:07,227 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 12:26:05" (1/3) ... [2022-11-16 12:26:07,228 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ce41572 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:26:07, skipping insertion in model container [2022-11-16 12:26:07,228 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:26:06" (2/3) ... [2022-11-16 12:26:07,229 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ce41572 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:26:07, skipping insertion in model container [2022-11-16 12:26:07,229 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:26:07" (3/3) ... [2022-11-16 12:26:07,231 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2n_prepend_unequal.i [2022-11-16 12:26:07,254 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-16 12:26:07,255 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 31 error locations. [2022-11-16 12:26:07,313 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-16 12:26:07,321 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;@a75769f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-16 12:26:07,321 INFO L358 AbstractCegarLoop]: Starting to check reachability of 31 error locations. [2022-11-16 12:26:07,326 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-16 12:26:07,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-16 12:26:07,335 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:26:07,335 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:26:07,336 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-16 12:26:07,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:26:07,343 INFO L85 PathProgramCache]: Analyzing trace with hash 1813443002, now seen corresponding path program 1 times [2022-11-16 12:26:07,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 12:26:07,360 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [476454318] [2022-11-16 12:26:07,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:26:07,361 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-16 12:26:07,361 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccdeb345-a6bd-4eb4-8736-1936ccfa9ff5/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 12:26:07,368 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccdeb345-a6bd-4eb4-8736-1936ccfa9ff5/bin/uautomizer-tPACEb0tL8/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-16 12:26:07,431 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccdeb345-a6bd-4eb4-8736-1936ccfa9ff5/bin/uautomizer-tPACEb0tL8/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-16 12:26:07,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:26:07,560 INFO L263 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-16 12:26:07,568 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:26:07,683 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-16 12:26:07,733 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-16 12:26:07,734 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 12:26:07,735 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 12:26:07,735 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [476454318] [2022-11-16 12:26:07,736 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [476454318] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:26:07,736 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:26:07,736 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 12:26:07,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229224969] [2022-11-16 12:26:07,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:26:07,745 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 12:26:07,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 12:26:07,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 12:26:07,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 12:26:07,815 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-16 12:26:08,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:26:08,096 INFO L93 Difference]: Finished difference Result 79 states and 85 transitions. [2022-11-16 12:26:08,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 12:26:08,100 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-16 12:26:08,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:26:08,110 INFO L225 Difference]: With dead ends: 79 [2022-11-16 12:26:08,110 INFO L226 Difference]: Without dead ends: 76 [2022-11-16 12:26:08,113 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-16 12:26:08,117 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 8 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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-16 12:26:08,119 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-16 12:26:08,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-11-16 12:26:08,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2022-11-16 12:26:08,180 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-16 12:26:08,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 81 transitions. [2022-11-16 12:26:08,187 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 81 transitions. Word has length 7 [2022-11-16 12:26:08,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:26:08,188 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 81 transitions. [2022-11-16 12:26:08,189 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-16 12:26:08,189 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 81 transitions. [2022-11-16 12:26:08,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-16 12:26:08,190 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:26:08,190 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:26:08,210 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccdeb345-a6bd-4eb4-8736-1936ccfa9ff5/bin/uautomizer-tPACEb0tL8/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-16 12:26:08,409 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccdeb345-a6bd-4eb4-8736-1936ccfa9ff5/bin/uautomizer-tPACEb0tL8/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-16 12:26:08,410 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-16 12:26:08,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:26:08,411 INFO L85 PathProgramCache]: Analyzing trace with hash 1813443001, now seen corresponding path program 1 times [2022-11-16 12:26:08,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 12:26:08,415 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1897756324] [2022-11-16 12:26:08,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:26:08,416 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-16 12:26:08,416 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccdeb345-a6bd-4eb4-8736-1936ccfa9ff5/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 12:26:08,418 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccdeb345-a6bd-4eb4-8736-1936ccfa9ff5/bin/uautomizer-tPACEb0tL8/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-16 12:26:08,458 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccdeb345-a6bd-4eb4-8736-1936ccfa9ff5/bin/uautomizer-tPACEb0tL8/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-16 12:26:08,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:26:08,516 INFO L263 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-16 12:26:08,518 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:26:08,529 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-16 12:26:08,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-16 12:26:08,541 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 12:26:08,542 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 12:26:08,542 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1897756324] [2022-11-16 12:26:08,543 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1897756324] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:26:08,543 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:26:08,543 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 12:26:08,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419315278] [2022-11-16 12:26:08,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:26:08,546 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 12:26:08,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 12:26:08,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 12:26:08,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 12:26:08,553 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-16 12:26:08,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:26:08,742 INFO L93 Difference]: Finished difference Result 74 states and 79 transitions. [2022-11-16 12:26:08,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 12:26:08,743 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-16 12:26:08,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:26:08,745 INFO L225 Difference]: With dead ends: 74 [2022-11-16 12:26:08,745 INFO L226 Difference]: Without dead ends: 74 [2022-11-16 12:26:08,745 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-16 12:26:08,747 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.2s IncrementalHoareTripleChecker+Time [2022-11-16 12:26:08,748 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.2s Time] [2022-11-16 12:26:08,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2022-11-16 12:26:08,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2022-11-16 12:26:08,755 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-16 12:26:08,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 79 transitions. [2022-11-16 12:26:08,758 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 79 transitions. Word has length 7 [2022-11-16 12:26:08,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:26:08,758 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 79 transitions. [2022-11-16 12:26:08,759 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-16 12:26:08,759 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 79 transitions. [2022-11-16 12:26:08,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-16 12:26:08,760 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:26:08,760 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:26:08,781 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccdeb345-a6bd-4eb4-8736-1936ccfa9ff5/bin/uautomizer-tPACEb0tL8/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-16 12:26:08,974 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccdeb345-a6bd-4eb4-8736-1936ccfa9ff5/bin/uautomizer-tPACEb0tL8/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-16 12:26:08,974 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-16 12:26:08,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:26:08,975 INFO L85 PathProgramCache]: Analyzing trace with hash 712803264, now seen corresponding path program 1 times [2022-11-16 12:26:08,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 12:26:08,976 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1114674493] [2022-11-16 12:26:08,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:26:08,977 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-16 12:26:08,977 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccdeb345-a6bd-4eb4-8736-1936ccfa9ff5/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 12:26:08,980 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccdeb345-a6bd-4eb4-8736-1936ccfa9ff5/bin/uautomizer-tPACEb0tL8/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-16 12:26:09,030 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccdeb345-a6bd-4eb4-8736-1936ccfa9ff5/bin/uautomizer-tPACEb0tL8/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-16 12:26:09,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:26:09,106 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-16 12:26:09,110 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:26:09,122 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-16 12:26:09,218 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-16 12:26:09,218 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 12:26:09,219 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 12:26:09,219 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1114674493] [2022-11-16 12:26:09,219 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1114674493] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:26:09,219 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:26:09,221 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-16 12:26:09,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447843254] [2022-11-16 12:26:09,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:26:09,223 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 12:26:09,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 12:26:09,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 12:26:09,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-16 12:26:09,225 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-16 12:26:09,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:26:09,658 INFO L93 Difference]: Finished difference Result 78 states and 86 transitions. [2022-11-16 12:26:09,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 12:26:09,659 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-16 12:26:09,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:26:09,662 INFO L225 Difference]: With dead ends: 78 [2022-11-16 12:26:09,662 INFO L226 Difference]: Without dead ends: 78 [2022-11-16 12:26:09,663 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-16 12:26:09,664 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 10 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.4s IncrementalHoareTripleChecker+Time [2022-11-16 12:26:09,665 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.4s Time] [2022-11-16 12:26:09,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-11-16 12:26:09,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 73. [2022-11-16 12:26:09,673 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-16 12:26:09,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 78 transitions. [2022-11-16 12:26:09,682 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 78 transitions. Word has length 13 [2022-11-16 12:26:09,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:26:09,686 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 78 transitions. [2022-11-16 12:26:09,686 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-16 12:26:09,686 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 78 transitions. [2022-11-16 12:26:09,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-16 12:26:09,687 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:26:09,688 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:26:09,707 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccdeb345-a6bd-4eb4-8736-1936ccfa9ff5/bin/uautomizer-tPACEb0tL8/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-16 12:26:09,907 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccdeb345-a6bd-4eb4-8736-1936ccfa9ff5/bin/uautomizer-tPACEb0tL8/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-16 12:26:09,908 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-16 12:26:09,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:26:09,909 INFO L85 PathProgramCache]: Analyzing trace with hash 712803265, now seen corresponding path program 1 times [2022-11-16 12:26:09,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 12:26:09,910 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1846073437] [2022-11-16 12:26:09,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:26:09,910 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-16 12:26:09,910 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccdeb345-a6bd-4eb4-8736-1936ccfa9ff5/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 12:26:09,912 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccdeb345-a6bd-4eb4-8736-1936ccfa9ff5/bin/uautomizer-tPACEb0tL8/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-16 12:26:09,921 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccdeb345-a6bd-4eb4-8736-1936ccfa9ff5/bin/uautomizer-tPACEb0tL8/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-16 12:26:10,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:26:10,056 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-16 12:26:10,059 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:26:10,079 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-16 12:26:10,214 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-16 12:26:10,214 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 12:26:10,215 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 12:26:10,215 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1846073437] [2022-11-16 12:26:10,215 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1846073437] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:26:10,215 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:26:10,216 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-16 12:26:10,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062567465] [2022-11-16 12:26:10,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:26:10,217 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 12:26:10,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 12:26:10,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 12:26:10,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-16 12:26:10,218 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-16 12:26:10,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:26:10,656 INFO L93 Difference]: Finished difference Result 77 states and 85 transitions. [2022-11-16 12:26:10,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 12:26:10,659 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-16 12:26:10,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:26:10,660 INFO L225 Difference]: With dead ends: 77 [2022-11-16 12:26:10,660 INFO L226 Difference]: Without dead ends: 77 [2022-11-16 12:26:10,660 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-16 12:26:10,661 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-16 12:26:10,661 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-16 12:26:10,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-11-16 12:26:10,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 72. [2022-11-16 12:26:10,667 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-16 12:26:10,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 77 transitions. [2022-11-16 12:26:10,668 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 77 transitions. Word has length 13 [2022-11-16 12:26:10,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:26:10,668 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 77 transitions. [2022-11-16 12:26:10,669 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-16 12:26:10,669 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 77 transitions. [2022-11-16 12:26:10,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-16 12:26:10,669 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:26:10,670 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:26:10,688 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccdeb345-a6bd-4eb4-8736-1936ccfa9ff5/bin/uautomizer-tPACEb0tL8/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-16 12:26:10,883 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccdeb345-a6bd-4eb4-8736-1936ccfa9ff5/bin/uautomizer-tPACEb0tL8/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-16 12:26:10,883 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-16 12:26:10,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:26:10,884 INFO L85 PathProgramCache]: Analyzing trace with hash 150600896, now seen corresponding path program 1 times [2022-11-16 12:26:10,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 12:26:10,885 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1912587451] [2022-11-16 12:26:10,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:26:10,885 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-16 12:26:10,885 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccdeb345-a6bd-4eb4-8736-1936ccfa9ff5/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 12:26:10,887 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccdeb345-a6bd-4eb4-8736-1936ccfa9ff5/bin/uautomizer-tPACEb0tL8/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-16 12:26:10,892 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccdeb345-a6bd-4eb4-8736-1936ccfa9ff5/bin/uautomizer-tPACEb0tL8/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-16 12:26:10,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:26:10,978 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-16 12:26:10,980 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:26:11,000 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-16 12:26:11,001 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 12:26:11,001 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 12:26:11,001 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1912587451] [2022-11-16 12:26:11,001 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1912587451] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:26:11,001 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:26:11,002 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 12:26:11,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213295538] [2022-11-16 12:26:11,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:26:11,002 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 12:26:11,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 12:26:11,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 12:26:11,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 12:26:11,004 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-16 12:26:11,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:26:11,014 INFO L93 Difference]: Finished difference Result 78 states and 84 transitions. [2022-11-16 12:26:11,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 12:26:11,015 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-16 12:26:11,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:26:11,016 INFO L225 Difference]: With dead ends: 78 [2022-11-16 12:26:11,016 INFO L226 Difference]: Without dead ends: 78 [2022-11-16 12:26:11,016 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-16 12:26:11,017 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-16 12:26:11,018 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-16 12:26:11,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-11-16 12:26:11,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 73. [2022-11-16 12:26:11,035 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-16 12:26:11,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 78 transitions. [2022-11-16 12:26:11,037 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 78 transitions. Word has length 15 [2022-11-16 12:26:11,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:26:11,037 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 78 transitions. [2022-11-16 12:26:11,037 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-16 12:26:11,038 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 78 transitions. [2022-11-16 12:26:11,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-16 12:26:11,039 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:26:11,039 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-16 12:26:11,049 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccdeb345-a6bd-4eb4-8736-1936ccfa9ff5/bin/uautomizer-tPACEb0tL8/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)] Forceful destruction successful, exit code 0 [2022-11-16 12:26:11,245 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccdeb345-a6bd-4eb4-8736-1936ccfa9ff5/bin/uautomizer-tPACEb0tL8/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-16 12:26:11,246 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-16 12:26:11,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:26:11,247 INFO L85 PathProgramCache]: Analyzing trace with hash -513998014, now seen corresponding path program 1 times [2022-11-16 12:26:11,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 12:26:11,249 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1868223034] [2022-11-16 12:26:11,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:26:11,249 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-16 12:26:11,249 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccdeb345-a6bd-4eb4-8736-1936ccfa9ff5/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 12:26:11,251 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccdeb345-a6bd-4eb4-8736-1936ccfa9ff5/bin/uautomizer-tPACEb0tL8/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-16 12:26:11,256 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccdeb345-a6bd-4eb4-8736-1936ccfa9ff5/bin/uautomizer-tPACEb0tL8/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-16 12:26:11,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:26:11,419 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-16 12:26:11,421 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:26:11,458 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-16 12:26:11,459 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:26:11,536 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-16 12:26:11,541 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 12:26:11,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1868223034] [2022-11-16 12:26:11,541 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1868223034] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 12:26:11,542 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 12:26:11,542 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2022-11-16 12:26:11,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397258524] [2022-11-16 12:26:11,542 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 12:26:11,543 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 12:26:11,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 12:26:11,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 12:26:11,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-16 12:26:11,545 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-16 12:26:11,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:26:11,602 INFO L93 Difference]: Finished difference Result 84 states and 91 transitions. [2022-11-16 12:26:11,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 12:26:11,603 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-16 12:26:11,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:26:11,604 INFO L225 Difference]: With dead ends: 84 [2022-11-16 12:26:11,605 INFO L226 Difference]: Without dead ends: 84 [2022-11-16 12:26:11,605 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-16 12:26:11,608 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-16 12:26:11,608 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-16 12:26:11,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2022-11-16 12:26:11,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 79. [2022-11-16 12:26:11,628 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-16 12:26:11,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 85 transitions. [2022-11-16 12:26:11,634 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 85 transitions. Word has length 28 [2022-11-16 12:26:11,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:26:11,635 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 85 transitions. [2022-11-16 12:26:11,635 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-16 12:26:11,635 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 85 transitions. [2022-11-16 12:26:11,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-11-16 12:26:11,637 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:26:11,637 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-16 12:26:11,659 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccdeb345-a6bd-4eb4-8736-1936ccfa9ff5/bin/uautomizer-tPACEb0tL8/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-16 12:26:11,851 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccdeb345-a6bd-4eb4-8736-1936ccfa9ff5/bin/uautomizer-tPACEb0tL8/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-16 12:26:11,852 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-16 12:26:11,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:26:11,852 INFO L85 PathProgramCache]: Analyzing trace with hash -416014336, now seen corresponding path program 2 times [2022-11-16 12:26:11,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 12:26:11,853 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [48327461] [2022-11-16 12:26:11,853 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-16 12:26:11,853 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-16 12:26:11,853 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccdeb345-a6bd-4eb4-8736-1936ccfa9ff5/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 12:26:11,855 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccdeb345-a6bd-4eb4-8736-1936ccfa9ff5/bin/uautomizer-tPACEb0tL8/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-16 12:26:11,866 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccdeb345-a6bd-4eb4-8736-1936ccfa9ff5/bin/uautomizer-tPACEb0tL8/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-16 12:26:12,104 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-16 12:26:12,104 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 12:26:12,115 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 19 conjunts are in the unsatisfiable core [2022-11-16 12:26:12,136 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:26:12,171 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-16 12:26:12,227 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-16 12:26:12,317 WARN L855 $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-16 12:26:12,481 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-16 12:26:12,482 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-16 12:26:12,551 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2022-11-16 12:26:12,726 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:26:12,728 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-16 12:26:13,057 WARN L855 $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-16 12:26:13,145 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-16 12:26:13,146 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-16 12:26:13,231 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-16 12:26:13,231 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:26:13,621 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 12:26:13,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [48327461] [2022-11-16 12:26:13,622 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [48327461] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:26:13,622 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2021336471] [2022-11-16 12:26:13,622 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-16 12:26:13,622 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-16 12:26:13,622 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccdeb345-a6bd-4eb4-8736-1936ccfa9ff5/bin/uautomizer-tPACEb0tL8/cvc4 [2022-11-16 12:26:13,628 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccdeb345-a6bd-4eb4-8736-1936ccfa9ff5/bin/uautomizer-tPACEb0tL8/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-16 12:26:13,646 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccdeb345-a6bd-4eb4-8736-1936ccfa9ff5/bin/uautomizer-tPACEb0tL8/cvc4 --incremental --print-success --lang smt (9)] Waiting until timeout for monitored process [2022-11-16 12:26:14,002 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-16 12:26:14,003 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [440690373] [2022-11-16 12:26:14,003 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-16 12:26:14,003 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:26:14,003 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccdeb345-a6bd-4eb4-8736-1936ccfa9ff5/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:26:14,015 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccdeb345-a6bd-4eb4-8736-1936ccfa9ff5/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:26:14,022 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccdeb345-a6bd-4eb4-8736-1936ccfa9ff5/bin/uautomizer-tPACEb0tL8/cvc4 --incremental --print-success --lang smt (9)] Forceful destruction successful, exit code 1 [2022-11-16 12:26:14,056 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccdeb345-a6bd-4eb4-8736-1936ccfa9ff5/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-16 12:26:14,315 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-16 12:26:14,315 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 12:26:14,321 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 17 conjunts are in the unsatisfiable core [2022-11-16 12:26:14,327 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:26:14,340 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-16 12:26:14,373 WARN L855 $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-16 12:26:14,468 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-16 12:26:14,468 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-16 12:26:14,509 WARN L855 $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-16 12:26:14,630 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-16 12:26:14,630 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-16 12:26:14,702 WARN L855 $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-16 12:26:14,827 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-16 12:26:14,827 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-16 12:26:14,860 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-16 12:26:14,860 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:26:15,649 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-16 12:26:15,650 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [440690373] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 12:26:15,650 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 12:26:15,650 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 5] total 17 [2022-11-16 12:26:15,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49744949] [2022-11-16 12:26:15,651 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 12:26:15,651 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-11-16 12:26:15,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 12:26:15,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-11-16 12:26:15,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=150, Unknown=5, NotChecked=140, Total=342 [2022-11-16 12:26:15,654 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-16 12:26:28,099 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (exists ((v_ArrVal_275 (_ BitVec 1))) (= (store |c_old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_275) |c_#valid|)) (= (bvadd (select |c_#valid| |node_create_~temp~0#1.base|) (_ bv1 1)) (_ bv0 1)))) (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|)))) (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-16 12:26:28,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:26:28,362 INFO L93 Difference]: Finished difference Result 96 states and 102 transitions. [2022-11-16 12:26:28,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-16 12:26:28,363 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-16 12:26:28,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:26:28,364 INFO L225 Difference]: With dead ends: 96 [2022-11-16 12:26:28,364 INFO L226 Difference]: Without dead ends: 96 [2022-11-16 12:26:28,365 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 107 SyntacticMatches, 15 SemanticMatches, 23 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 13.3s TimeCoverageRelationStatistics Valid=78, Invalid=282, Unknown=6, NotChecked=234, Total=600 [2022-11-16 12:26:28,366 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 85 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 624 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 556 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 12:26:28,366 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 258 Invalid, 624 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 65 Invalid, 0 Unknown, 556 Unchecked, 0.2s Time] [2022-11-16 12:26:28,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-11-16 12:26:28,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 84. [2022-11-16 12:26:28,371 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-16 12:26:28,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 89 transitions. [2022-11-16 12:26:28,372 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 89 transitions. Word has length 41 [2022-11-16 12:26:28,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:26:28,373 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 89 transitions. [2022-11-16 12:26:28,373 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-16 12:26:28,373 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 89 transitions. [2022-11-16 12:26:28,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-11-16 12:26:28,379 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:26:28,379 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-16 12:26:28,388 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccdeb345-a6bd-4eb4-8736-1936ccfa9ff5/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-16 12:26:28,592 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccdeb345-a6bd-4eb4-8736-1936ccfa9ff5/bin/uautomizer-tPACEb0tL8/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)] Forceful destruction successful, exit code 0 [2022-11-16 12:26:28,781 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccdeb345-a6bd-4eb4-8736-1936ccfa9ff5/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccdeb345-a6bd-4eb4-8736-1936ccfa9ff5/bin/uautomizer-tPACEb0tL8/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-16 12:26:28,782 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-16 12:26:28,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:26:28,783 INFO L85 PathProgramCache]: Analyzing trace with hash -416014335, now seen corresponding path program 1 times [2022-11-16 12:26:28,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 12:26:28,784 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1494743693] [2022-11-16 12:26:28,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:26:28,784 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-16 12:26:28,784 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccdeb345-a6bd-4eb4-8736-1936ccfa9ff5/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 12:26:28,785 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccdeb345-a6bd-4eb4-8736-1936ccfa9ff5/bin/uautomizer-tPACEb0tL8/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-16 12:26:28,791 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccdeb345-a6bd-4eb4-8736-1936ccfa9ff5/bin/uautomizer-tPACEb0tL8/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-16 12:26:29,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:26:29,092 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 26 conjunts are in the unsatisfiable core [2022-11-16 12:26:29,097 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:26:29,110 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-16 12:26:29,125 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-16 12:26:29,200 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-16 12:26:29,207 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2022-11-16 12:26:29,262 WARN L855 $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-16 12:26:29,372 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:26:29,373 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-16 12:26:29,397 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-16 12:26:29,398 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-16 12:26:29,504 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-16 12:26:29,794 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:26:29,796 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-16 12:26:30,176 WARN L855 $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-16 12:26:30,246 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-16 12:26:30,246 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-16 12:26:30,396 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-16 12:26:30,397 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:26:30,757 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 12:26:30,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1494743693] [2022-11-16 12:26:30,758 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1494743693] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:26:30,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1120083022] [2022-11-16 12:26:30,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:26:30,759 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-16 12:26:30,759 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccdeb345-a6bd-4eb4-8736-1936ccfa9ff5/bin/uautomizer-tPACEb0tL8/cvc4 [2022-11-16 12:26:30,760 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccdeb345-a6bd-4eb4-8736-1936ccfa9ff5/bin/uautomizer-tPACEb0tL8/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-16 12:26:30,762 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccdeb345-a6bd-4eb4-8736-1936ccfa9ff5/bin/uautomizer-tPACEb0tL8/cvc4 --incremental --print-success --lang smt (12)] Waiting until timeout for monitored process [2022-11-16 12:26:31,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:26:31,274 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 24 conjunts are in the unsatisfiable core [2022-11-16 12:26:31,278 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:26:31,294 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-16 12:26:31,321 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-16 12:26:31,528 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:26:31,529 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-16 12:26:31,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-16 12:26:32,031 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:26:32,032 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-16 12:26:32,361 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-16 12:26:32,394 WARN L855 $PredicateComparison]: unable to prove that (and (not (= |c_#StackHeapBarrier| (_ bv0 32))) (exists ((v_ArrVal_407 (_ BitVec 32)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= |c_#length| (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_407)) (bvult |node_create_~temp~0#1.base| |c_#StackHeapBarrier|))) (not (= (bvadd |c_#StackHeapBarrier| (_ bv1 32)) (_ bv0 32)))) is different from true [2022-11-16 12:26:32,553 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:26:32,555 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-16 12:26:32,679 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 12 not checked. [2022-11-16 12:26:32,680 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:26:33,043 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1120083022] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:26:33,043 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 12:26:33,043 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 21 [2022-11-16 12:26:33,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994481221] [2022-11-16 12:26:33,044 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 12:26:33,044 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-11-16 12:26:33,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 12:26:33,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-11-16 12:26:33,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=386, Unknown=16, NotChecked=126, Total=600 [2022-11-16 12:26:33,045 INFO L87 Difference]: Start difference. First operand 84 states and 89 transitions. Second operand has 22 states, 19 states have (on average 3.4210526315789473) internal successors, (65), 17 states have internal predecessors, (65), 5 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-11-16 12:26:33,089 WARN L855 $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-16 12:26:33,210 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_406 (_ BitVec 32))) (= (store |c_old(#length)| |c_node_create_~temp~0#1.base| v_ArrVal_406) |c_#length|)) (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 ((|node_create_~temp~0#1.base| (_ BitVec 32))) (= (store |c_old(#length)| |node_create_~temp~0#1.base| (_ bv8 32)) |c_#length|)) (not (= |c_#StackHeapBarrier| (_ bv0 32))) (bvult |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_407 (_ BitVec 32)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= |c_#length| (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_407)) (bvult |node_create_~temp~0#1.base| |c_#StackHeapBarrier|))) (not (= (bvadd |c_#StackHeapBarrier| (_ bv1 32)) (_ bv0 32)))) is different from true [2022-11-16 12:26:34,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:26:34,027 INFO L93 Difference]: Finished difference Result 90 states and 94 transitions. [2022-11-16 12:26:34,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-16 12:26:34,028 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 19 states have (on average 3.4210526315789473) internal successors, (65), 17 states have internal predecessors, (65), 5 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 41 [2022-11-16 12:26:34,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:26:34,029 INFO L225 Difference]: With dead ends: 90 [2022-11-16 12:26:34,029 INFO L226 Difference]: Without dead ends: 90 [2022-11-16 12:26:34,030 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 63 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=108, Invalid=583, Unknown=31, NotChecked=270, Total=992 [2022-11-16 12:26:34,031 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 4 mSDsluCounter, 420 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 489 SdHoareTripleChecker+Invalid, 526 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 446 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-16 12:26:34,031 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 489 Invalid, 526 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 79 Invalid, 0 Unknown, 446 Unchecked, 0.3s Time] [2022-11-16 12:26:34,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2022-11-16 12:26:34,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2022-11-16 12:26:34,037 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-16 12:26:34,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 94 transitions. [2022-11-16 12:26:34,039 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 94 transitions. Word has length 41 [2022-11-16 12:26:34,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:26:34,040 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 94 transitions. [2022-11-16 12:26:34,040 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 19 states have (on average 3.4210526315789473) internal successors, (65), 17 states have internal predecessors, (65), 5 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-11-16 12:26:34,040 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 94 transitions. [2022-11-16 12:26:34,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-11-16 12:26:34,042 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:26:34,042 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-16 12:26:34,051 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccdeb345-a6bd-4eb4-8736-1936ccfa9ff5/bin/uautomizer-tPACEb0tL8/cvc4 --incremental --print-success --lang smt (12)] Ended with exit code 0 [2022-11-16 12:26:34,275 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccdeb345-a6bd-4eb4-8736-1936ccfa9ff5/bin/uautomizer-tPACEb0tL8/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-16 12:26:34,446 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccdeb345-a6bd-4eb4-8736-1936ccfa9ff5/bin/uautomizer-tPACEb0tL8/cvc4 --incremental --print-success --lang smt,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccdeb345-a6bd-4eb4-8736-1936ccfa9ff5/bin/uautomizer-tPACEb0tL8/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-16 12:26:34,447 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-16 12:26:34,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:26:34,447 INFO L85 PathProgramCache]: Analyzing trace with hash -11542527, now seen corresponding path program 1 times [2022-11-16 12:26:34,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 12:26:34,448 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1352481693] [2022-11-16 12:26:34,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:26:34,448 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-16 12:26:34,448 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccdeb345-a6bd-4eb4-8736-1936ccfa9ff5/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 12:26:34,449 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccdeb345-a6bd-4eb4-8736-1936ccfa9ff5/bin/uautomizer-tPACEb0tL8/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-16 12:26:34,455 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccdeb345-a6bd-4eb4-8736-1936ccfa9ff5/bin/uautomizer-tPACEb0tL8/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-16 12:26:34,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:26:34,700 INFO L263 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-16 12:26:34,702 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:26:34,710 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-16 12:26:34,807 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-16 12:26:34,807 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 12:26:34,807 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 12:26:34,807 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1352481693] [2022-11-16 12:26:34,808 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1352481693] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:26:34,808 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:26:34,808 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-16 12:26:34,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412293801] [2022-11-16 12:26:34,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:26:34,809 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 12:26:34,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 12:26:34,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 12:26:34,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-16 12:26:34,810 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-16 12:26:35,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:26:35,240 INFO L93 Difference]: Finished difference Result 89 states and 93 transitions. [2022-11-16 12:26:35,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 12:26:35,241 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-16 12:26:35,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:26:35,242 INFO L225 Difference]: With dead ends: 89 [2022-11-16 12:26:35,242 INFO L226 Difference]: Without dead ends: 89 [2022-11-16 12:26:35,242 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-16 12:26:35,243 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.4s IncrementalHoareTripleChecker+Time [2022-11-16 12:26:35,243 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.4s Time] [2022-11-16 12:26:35,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-11-16 12:26:35,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2022-11-16 12:26:35,248 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-16 12:26:35,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 93 transitions. [2022-11-16 12:26:35,249 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 93 transitions. Word has length 42 [2022-11-16 12:26:35,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:26:35,250 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 93 transitions. [2022-11-16 12:26:35,250 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-16 12:26:35,250 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 93 transitions. [2022-11-16 12:26:35,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-11-16 12:26:35,251 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:26:35,252 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-16 12:26:35,267 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccdeb345-a6bd-4eb4-8736-1936ccfa9ff5/bin/uautomizer-tPACEb0tL8/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-16 12:26:35,462 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccdeb345-a6bd-4eb4-8736-1936ccfa9ff5/bin/uautomizer-tPACEb0tL8/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-16 12:26:35,462 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-16 12:26:35,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:26:35,463 INFO L85 PathProgramCache]: Analyzing trace with hash -11542528, now seen corresponding path program 1 times [2022-11-16 12:26:35,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 12:26:35,463 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2075046517] [2022-11-16 12:26:35,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:26:35,464 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-16 12:26:35,464 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccdeb345-a6bd-4eb4-8736-1936ccfa9ff5/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 12:26:35,465 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccdeb345-a6bd-4eb4-8736-1936ccfa9ff5/bin/uautomizer-tPACEb0tL8/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-16 12:26:35,469 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccdeb345-a6bd-4eb4-8736-1936ccfa9ff5/bin/uautomizer-tPACEb0tL8/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-16 12:26:35,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:26:35,715 INFO L263 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-16 12:26:35,718 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:26:35,726 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-16 12:26:35,780 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-16 12:26:35,780 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 12:26:35,780 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 12:26:35,780 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2075046517] [2022-11-16 12:26:35,781 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2075046517] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:26:35,781 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:26:35,781 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-16 12:26:35,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199210857] [2022-11-16 12:26:35,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:26:35,782 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 12:26:35,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 12:26:35,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 12:26:35,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-16 12:26:35,783 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-16 12:26:36,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:26:36,162 INFO L93 Difference]: Finished difference Result 100 states and 105 transitions. [2022-11-16 12:26:36,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 12:26:36,163 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-16 12:26:36,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:26:36,164 INFO L225 Difference]: With dead ends: 100 [2022-11-16 12:26:36,164 INFO L226 Difference]: Without dead ends: 100 [2022-11-16 12:26:36,164 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-16 12:26:36,165 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.4s IncrementalHoareTripleChecker+Time [2022-11-16 12:26:36,165 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.4s Time] [2022-11-16 12:26:36,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-11-16 12:26:36,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 88. [2022-11-16 12:26:36,170 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-16 12:26:36,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 92 transitions. [2022-11-16 12:26:36,171 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 92 transitions. Word has length 42 [2022-11-16 12:26:36,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:26:36,171 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 92 transitions. [2022-11-16 12:26:36,171 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-16 12:26:36,171 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 92 transitions. [2022-11-16 12:26:36,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-11-16 12:26:36,172 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:26:36,173 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-16 12:26:36,194 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccdeb345-a6bd-4eb4-8736-1936ccfa9ff5/bin/uautomizer-tPACEb0tL8/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-16 12:26:36,389 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccdeb345-a6bd-4eb4-8736-1936ccfa9ff5/bin/uautomizer-tPACEb0tL8/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-16 12:26:36,389 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-16 12:26:36,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:26:36,390 INFO L85 PathProgramCache]: Analyzing trace with hash 1792532577, now seen corresponding path program 1 times [2022-11-16 12:26:36,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 12:26:36,390 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1915642291] [2022-11-16 12:26:36,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:26:36,391 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-16 12:26:36,391 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccdeb345-a6bd-4eb4-8736-1936ccfa9ff5/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 12:26:36,392 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccdeb345-a6bd-4eb4-8736-1936ccfa9ff5/bin/uautomizer-tPACEb0tL8/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-16 12:26:36,393 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccdeb345-a6bd-4eb4-8736-1936ccfa9ff5/bin/uautomizer-tPACEb0tL8/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-16 12:26:36,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:26:36,664 INFO L263 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-16 12:26:36,666 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:26:36,686 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-16 12:26:36,686 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 12:26:36,687 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 12:26:36,687 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1915642291] [2022-11-16 12:26:36,687 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1915642291] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:26:36,687 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:26:36,687 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 12:26:36,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266957284] [2022-11-16 12:26:36,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:26:36,688 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 12:26:36,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 12:26:36,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 12:26:36,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 12:26:36,690 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-16 12:26:36,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:26:36,818 INFO L93 Difference]: Finished difference Result 99 states and 104 transitions. [2022-11-16 12:26:36,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 12:26:36,818 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-16 12:26:36,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:26:36,820 INFO L225 Difference]: With dead ends: 99 [2022-11-16 12:26:36,820 INFO L226 Difference]: Without dead ends: 99 [2022-11-16 12:26:36,820 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-16 12:26:36,821 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-16 12:26:36,821 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-16 12:26:36,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2022-11-16 12:26:36,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 87. [2022-11-16 12:26:36,824 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-16 12:26:36,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 91 transitions. [2022-11-16 12:26:36,825 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 91 transitions. Word has length 44 [2022-11-16 12:26:36,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:26:36,825 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 91 transitions. [2022-11-16 12:26:36,825 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-16 12:26:36,825 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 91 transitions. [2022-11-16 12:26:36,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-11-16 12:26:36,830 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:26:36,830 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-16 12:26:36,853 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccdeb345-a6bd-4eb4-8736-1936ccfa9ff5/bin/uautomizer-tPACEb0tL8/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-16 12:26:37,030 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccdeb345-a6bd-4eb4-8736-1936ccfa9ff5/bin/uautomizer-tPACEb0tL8/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-16 12:26:37,031 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-16 12:26:37,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:26:37,031 INFO L85 PathProgramCache]: Analyzing trace with hash 1792532578, now seen corresponding path program 1 times [2022-11-16 12:26:37,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 12:26:37,032 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [549153332] [2022-11-16 12:26:37,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:26:37,032 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-16 12:26:37,032 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccdeb345-a6bd-4eb4-8736-1936ccfa9ff5/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 12:26:37,035 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccdeb345-a6bd-4eb4-8736-1936ccfa9ff5/bin/uautomizer-tPACEb0tL8/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-16 12:26:37,081 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccdeb345-a6bd-4eb4-8736-1936ccfa9ff5/bin/uautomizer-tPACEb0tL8/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-16 12:26:37,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:26:37,310 INFO L263 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-16 12:26:37,312 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:26:37,442 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-16 12:26:37,442 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 12:26:37,442 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 12:26:37,442 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [549153332] [2022-11-16 12:26:37,442 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [549153332] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:26:37,442 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:26:37,443 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 12:26:37,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884262443] [2022-11-16 12:26:37,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:26:37,443 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 12:26:37,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 12:26:37,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 12:26:37,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-16 12:26:37,444 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-16 12:26:37,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:26:37,626 INFO L93 Difference]: Finished difference Result 86 states and 90 transitions. [2022-11-16 12:26:37,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 12:26:37,627 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-16 12:26:37,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:26:37,628 INFO L225 Difference]: With dead ends: 86 [2022-11-16 12:26:37,628 INFO L226 Difference]: Without dead ends: 86 [2022-11-16 12:26:37,628 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-11-16 12:26:37,629 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.2s IncrementalHoareTripleChecker+Time [2022-11-16 12:26:37,629 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.2s Time] [2022-11-16 12:26:37,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2022-11-16 12:26:37,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2022-11-16 12:26:37,633 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-16 12:26:37,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 90 transitions. [2022-11-16 12:26:37,634 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 90 transitions. Word has length 44 [2022-11-16 12:26:37,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:26:37,635 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 90 transitions. [2022-11-16 12:26:37,635 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-16 12:26:37,635 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 90 transitions. [2022-11-16 12:26:37,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-11-16 12:26:37,636 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:26:37,637 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-16 12:26:37,658 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccdeb345-a6bd-4eb4-8736-1936ccfa9ff5/bin/uautomizer-tPACEb0tL8/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-16 12:26:37,851 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccdeb345-a6bd-4eb4-8736-1936ccfa9ff5/bin/uautomizer-tPACEb0tL8/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-16 12:26:37,851 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-16 12:26:37,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:26:37,852 INFO L85 PathProgramCache]: Analyzing trace with hash 341921058, now seen corresponding path program 1 times [2022-11-16 12:26:37,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 12:26:37,852 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [486103953] [2022-11-16 12:26:37,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:26:37,853 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-16 12:26:37,853 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccdeb345-a6bd-4eb4-8736-1936ccfa9ff5/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 12:26:37,854 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccdeb345-a6bd-4eb4-8736-1936ccfa9ff5/bin/uautomizer-tPACEb0tL8/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-16 12:26:37,864 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccdeb345-a6bd-4eb4-8736-1936ccfa9ff5/bin/uautomizer-tPACEb0tL8/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-16 12:26:38,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:26:38,077 INFO L263 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-16 12:26:38,079 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:26:38,110 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-16 12:26:38,110 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 12:26:38,110 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 12:26:38,110 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [486103953] [2022-11-16 12:26:38,111 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [486103953] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:26:38,111 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:26:38,111 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 12:26:38,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458322481] [2022-11-16 12:26:38,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:26:38,112 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 12:26:38,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 12:26:38,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 12:26:38,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 12:26:38,113 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-16 12:26:38,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:26:38,247 INFO L93 Difference]: Finished difference Result 97 states and 102 transitions. [2022-11-16 12:26:38,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 12:26:38,248 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-16 12:26:38,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:26:38,249 INFO L225 Difference]: With dead ends: 97 [2022-11-16 12:26:38,249 INFO L226 Difference]: Without dead ends: 97 [2022-11-16 12:26:38,249 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-16 12:26:38,250 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-16 12:26:38,250 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-16 12:26:38,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-11-16 12:26:38,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 85. [2022-11-16 12:26:38,259 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-16 12:26:38,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 89 transitions. [2022-11-16 12:26:38,260 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 89 transitions. Word has length 46 [2022-11-16 12:26:38,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:26:38,261 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 89 transitions. [2022-11-16 12:26:38,261 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-16 12:26:38,261 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 89 transitions. [2022-11-16 12:26:38,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-11-16 12:26:38,262 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:26:38,262 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-16 12:26:38,273 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccdeb345-a6bd-4eb4-8736-1936ccfa9ff5/bin/uautomizer-tPACEb0tL8/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)] Forceful destruction successful, exit code 0 [2022-11-16 12:26:38,470 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccdeb345-a6bd-4eb4-8736-1936ccfa9ff5/bin/uautomizer-tPACEb0tL8/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-16 12:26:38,470 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-16 12:26:38,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:26:38,471 INFO L85 PathProgramCache]: Analyzing trace with hash 341921059, now seen corresponding path program 1 times [2022-11-16 12:26:38,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 12:26:38,471 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1621911991] [2022-11-16 12:26:38,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:26:38,471 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-16 12:26:38,472 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccdeb345-a6bd-4eb4-8736-1936ccfa9ff5/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 12:26:38,473 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccdeb345-a6bd-4eb4-8736-1936ccfa9ff5/bin/uautomizer-tPACEb0tL8/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-16 12:26:38,475 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccdeb345-a6bd-4eb4-8736-1936ccfa9ff5/bin/uautomizer-tPACEb0tL8/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-16 12:26:38,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:26:38,686 INFO L263 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-16 12:26:38,688 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:26:38,829 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-16 12:26:38,829 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 12:26:38,830 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 12:26:38,830 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1621911991] [2022-11-16 12:26:38,830 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1621911991] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:26:38,830 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:26:38,831 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 12:26:38,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679506670] [2022-11-16 12:26:38,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:26:38,832 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 12:26:38,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 12:26:38,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 12:26:38,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-16 12:26:38,834 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-16 12:26:39,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:26:39,039 INFO L93 Difference]: Finished difference Result 83 states and 87 transitions. [2022-11-16 12:26:39,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 12:26:39,041 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-16 12:26:39,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:26:39,042 INFO L225 Difference]: With dead ends: 83 [2022-11-16 12:26:39,042 INFO L226 Difference]: Without dead ends: 83 [2022-11-16 12:26:39,042 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-11-16 12:26:39,043 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 91 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.2s IncrementalHoareTripleChecker+Time [2022-11-16 12:26:39,043 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.2s Time] [2022-11-16 12:26:39,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2022-11-16 12:26:39,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2022-11-16 12:26:39,047 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-16 12:26:39,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 87 transitions. [2022-11-16 12:26:39,048 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 87 transitions. Word has length 46 [2022-11-16 12:26:39,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:26:39,048 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 87 transitions. [2022-11-16 12:26:39,048 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-16 12:26:39,049 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 87 transitions. [2022-11-16 12:26:39,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-11-16 12:26:39,050 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:26:39,050 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-16 12:26:39,066 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccdeb345-a6bd-4eb4-8736-1936ccfa9ff5/bin/uautomizer-tPACEb0tL8/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-16 12:26:39,264 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccdeb345-a6bd-4eb4-8736-1936ccfa9ff5/bin/uautomizer-tPACEb0tL8/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-16 12:26:39,265 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-16 12:26:39,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:26:39,265 INFO L85 PathProgramCache]: Analyzing trace with hash -2126344669, now seen corresponding path program 1 times [2022-11-16 12:26:39,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 12:26:39,265 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2033086655] [2022-11-16 12:26:39,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:26:39,266 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-16 12:26:39,266 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccdeb345-a6bd-4eb4-8736-1936ccfa9ff5/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 12:26:39,267 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccdeb345-a6bd-4eb4-8736-1936ccfa9ff5/bin/uautomizer-tPACEb0tL8/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-16 12:26:39,268 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccdeb345-a6bd-4eb4-8736-1936ccfa9ff5/bin/uautomizer-tPACEb0tL8/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-16 12:26:39,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:26:39,557 INFO L263 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 15 conjunts are in the unsatisfiable core [2022-11-16 12:26:39,560 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:26:39,588 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-16 12:26:39,733 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-16 12:26:39,760 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-16 12:26:39,797 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-16 12:26:39,798 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 12:26:39,798 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 12:26:39,798 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2033086655] [2022-11-16 12:26:39,798 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2033086655] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:26:39,798 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:26:39,798 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-16 12:26:39,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695379137] [2022-11-16 12:26:39,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:26:39,799 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-16 12:26:39,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 12:26:39,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-16 12:26:39,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-11-16 12:26:39,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-16 12:26:40,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:26:40,452 INFO L93 Difference]: Finished difference Result 94 states and 98 transitions. [2022-11-16 12:26:40,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-16 12:26:40,453 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-16 12:26:40,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:26:40,454 INFO L225 Difference]: With dead ends: 94 [2022-11-16 12:26:40,454 INFO L226 Difference]: Without dead ends: 94 [2022-11-16 12:26:40,454 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-16 12:26:40,455 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 104 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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.6s IncrementalHoareTripleChecker+Time [2022-11-16 12:26:40,455 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.6s Time] [2022-11-16 12:26:40,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-11-16 12:26:40,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 80. [2022-11-16 12:26:40,458 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-16 12:26:40,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 84 transitions. [2022-11-16 12:26:40,459 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 84 transitions. Word has length 48 [2022-11-16 12:26:40,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:26:40,459 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 84 transitions. [2022-11-16 12:26:40,459 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-16 12:26:40,460 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 84 transitions. [2022-11-16 12:26:40,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-11-16 12:26:40,460 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:26:40,461 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-16 12:26:40,484 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccdeb345-a6bd-4eb4-8736-1936ccfa9ff5/bin/uautomizer-tPACEb0tL8/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-16 12:26:40,671 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccdeb345-a6bd-4eb4-8736-1936ccfa9ff5/bin/uautomizer-tPACEb0tL8/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-16 12:26:40,671 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-16 12:26:40,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:26:40,672 INFO L85 PathProgramCache]: Analyzing trace with hash -2126344668, now seen corresponding path program 1 times [2022-11-16 12:26:40,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 12:26:40,672 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [169567385] [2022-11-16 12:26:40,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:26:40,672 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-16 12:26:40,672 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccdeb345-a6bd-4eb4-8736-1936ccfa9ff5/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 12:26:40,673 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccdeb345-a6bd-4eb4-8736-1936ccfa9ff5/bin/uautomizer-tPACEb0tL8/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-16 12:26:40,681 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccdeb345-a6bd-4eb4-8736-1936ccfa9ff5/bin/uautomizer-tPACEb0tL8/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-16 12:26:40,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:26:40,900 INFO L263 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 24 conjunts are in the unsatisfiable core [2022-11-16 12:26:40,902 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:26:40,929 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-16 12:26:41,164 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-16 12:26:41,173 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-16 12:26:41,227 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-16 12:26:41,230 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-16 12:26:41,292 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-16 12:26:41,292 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 12:26:41,292 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 12:26:41,292 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [169567385] [2022-11-16 12:26:41,292 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [169567385] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:26:41,293 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:26:41,293 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-16 12:26:41,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668714758] [2022-11-16 12:26:41,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:26:41,293 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-16 12:26:41,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 12:26:41,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-16 12:26:41,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-11-16 12:26:41,294 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-16 12:26:41,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:26:41,994 INFO L93 Difference]: Finished difference Result 80 states and 83 transitions. [2022-11-16 12:26:41,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-16 12:26:41,995 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-16 12:26:41,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:26:41,996 INFO L225 Difference]: With dead ends: 80 [2022-11-16 12:26:41,996 INFO L226 Difference]: Without dead ends: 80 [2022-11-16 12:26:41,996 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-16 12:26:41,997 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 83 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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-16 12:26:41,997 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-16 12:26:41,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-11-16 12:26:42,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 78. [2022-11-16 12:26:42,000 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-16 12:26:42,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 82 transitions. [2022-11-16 12:26:42,001 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 82 transitions. Word has length 48 [2022-11-16 12:26:42,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:26:42,001 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 82 transitions. [2022-11-16 12:26:42,002 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-16 12:26:42,002 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 82 transitions. [2022-11-16 12:26:42,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-11-16 12:26:42,002 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:26:42,002 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-16 12:26:42,014 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccdeb345-a6bd-4eb4-8736-1936ccfa9ff5/bin/uautomizer-tPACEb0tL8/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)] Ended with exit code 0 [2022-11-16 12:26:42,203 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccdeb345-a6bd-4eb4-8736-1936ccfa9ff5/bin/uautomizer-tPACEb0tL8/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-16 12:26:42,203 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-16 12:26:42,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:26:42,204 INFO L85 PathProgramCache]: Analyzing trace with hash 987206626, now seen corresponding path program 1 times [2022-11-16 12:26:42,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 12:26:42,204 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1282727299] [2022-11-16 12:26:42,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:26:42,204 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-16 12:26:42,204 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccdeb345-a6bd-4eb4-8736-1936ccfa9ff5/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 12:26:42,205 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccdeb345-a6bd-4eb4-8736-1936ccfa9ff5/bin/uautomizer-tPACEb0tL8/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-16 12:26:42,210 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccdeb345-a6bd-4eb4-8736-1936ccfa9ff5/bin/uautomizer-tPACEb0tL8/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-16 12:26:42,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:26:42,604 INFO L263 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 36 conjunts are in the unsatisfiable core [2022-11-16 12:26:42,607 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:26:42,843 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-16 12:26:43,237 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:26:43,239 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-16 12:26:43,298 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-16 12:26:43,309 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-16 12:26:43,338 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-11-16 12:26:43,338 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-16 12:26:43,350 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-16 12:26:43,516 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-16 12:26:43,526 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-16 12:26:43,721 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-16 12:26:43,773 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-16 12:26:43,774 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 12:26:43,774 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 12:26:43,774 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1282727299] [2022-11-16 12:26:43,774 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1282727299] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:26:43,774 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:26:43,774 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-11-16 12:26:43,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271826241] [2022-11-16 12:26:43,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:26:43,775 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-16 12:26:43,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 12:26:43,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-16 12:26:43,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2022-11-16 12:26:43,776 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-16 12:26:44,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:26:44,234 INFO L93 Difference]: Finished difference Result 78 states and 81 transitions. [2022-11-16 12:26:44,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-16 12:26:44,235 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-16 12:26:44,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:26:44,235 INFO L225 Difference]: With dead ends: 78 [2022-11-16 12:26:44,236 INFO L226 Difference]: Without dead ends: 78 [2022-11-16 12:26:44,236 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2022-11-16 12:26:44,237 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-16 12:26:44,237 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-16 12:26:44,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-11-16 12:26:44,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2022-11-16 12:26:44,240 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-16 12:26:44,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 81 transitions. [2022-11-16 12:26:44,241 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 81 transitions. Word has length 50 [2022-11-16 12:26:44,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:26:44,242 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 81 transitions. [2022-11-16 12:26:44,242 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-16 12:26:44,242 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 81 transitions. [2022-11-16 12:26:44,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-11-16 12:26:44,243 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:26:44,243 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-16 12:26:44,263 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccdeb345-a6bd-4eb4-8736-1936ccfa9ff5/bin/uautomizer-tPACEb0tL8/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-16 12:26:44,460 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccdeb345-a6bd-4eb4-8736-1936ccfa9ff5/bin/uautomizer-tPACEb0tL8/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-16 12:26:44,460 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-16 12:26:44,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:26:44,460 INFO L85 PathProgramCache]: Analyzing trace with hash -2063364139, now seen corresponding path program 1 times [2022-11-16 12:26:44,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 12:26:44,461 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [997924535] [2022-11-16 12:26:44,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:26:44,461 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-16 12:26:44,461 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccdeb345-a6bd-4eb4-8736-1936ccfa9ff5/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 12:26:44,462 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccdeb345-a6bd-4eb4-8736-1936ccfa9ff5/bin/uautomizer-tPACEb0tL8/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-16 12:26:44,468 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccdeb345-a6bd-4eb4-8736-1936ccfa9ff5/bin/uautomizer-tPACEb0tL8/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-16 12:26:44,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:26:44,908 INFO L263 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 47 conjunts are in the unsatisfiable core [2022-11-16 12:26:44,912 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:26:44,991 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-16 12:26:45,307 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-16 12:26:45,758 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-16 12:26:45,758 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-16 12:26:45,790 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-11-16 12:26:45,790 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-16 12:26:45,812 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-16 12:26:46,395 INFO L321 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2022-11-16 12:26:46,395 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-16 12:26:46,608 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-16 12:26:46,637 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:26:46,640 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-16 12:26:46,793 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-16 12:26:47,167 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-16 12:26:47,168 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-16 12:26:47,574 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-16 12:26:47,575 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 12:26:47,575 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 12:26:47,575 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [997924535] [2022-11-16 12:26:47,575 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [997924535] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:26:47,576 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:26:47,576 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2022-11-16 12:26:47,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379201766] [2022-11-16 12:26:47,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:26:47,577 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-11-16 12:26:47,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 12:26:47,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-11-16 12:26:47,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=483, Unknown=1, NotChecked=0, Total=552 [2022-11-16 12:26:47,578 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-16 12:26:48,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:26:48,202 INFO L93 Difference]: Finished difference Result 80 states and 85 transitions. [2022-11-16 12:26:48,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-16 12:26:48,203 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-16 12:26:48,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:26:48,204 INFO L225 Difference]: With dead ends: 80 [2022-11-16 12:26:48,204 INFO L226 Difference]: Without dead ends: 80 [2022-11-16 12:26:48,205 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-16 12:26:48,206 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 15 mSDsluCounter, 397 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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-16 12:26:48,206 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-16 12:26:48,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-11-16 12:26:48,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2022-11-16 12:26:48,213 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-16 12:26:48,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 85 transitions. [2022-11-16 12:26:48,214 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 85 transitions. Word has length 53 [2022-11-16 12:26:48,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:26:48,214 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 85 transitions. [2022-11-16 12:26:48,215 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-16 12:26:48,215 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 85 transitions. [2022-11-16 12:26:48,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-11-16 12:26:48,216 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:26:48,216 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-16 12:26:48,234 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccdeb345-a6bd-4eb4-8736-1936ccfa9ff5/bin/uautomizer-tPACEb0tL8/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-16 12:26:48,434 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccdeb345-a6bd-4eb4-8736-1936ccfa9ff5/bin/uautomizer-tPACEb0tL8/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-16 12:26:48,434 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-16 12:26:48,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:26:48,435 INFO L85 PathProgramCache]: Analyzing trace with hash -2063364138, now seen corresponding path program 1 times [2022-11-16 12:26:48,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 12:26:48,435 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [196498502] [2022-11-16 12:26:48,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:26:48,436 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-16 12:26:48,436 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccdeb345-a6bd-4eb4-8736-1936ccfa9ff5/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 12:26:48,437 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccdeb345-a6bd-4eb4-8736-1936ccfa9ff5/bin/uautomizer-tPACEb0tL8/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-16 12:26:48,474 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccdeb345-a6bd-4eb4-8736-1936ccfa9ff5/bin/uautomizer-tPACEb0tL8/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-16 12:26:48,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:26:48,910 INFO L263 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 66 conjunts are in the unsatisfiable core [2022-11-16 12:26:48,917 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:26:48,989 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-16 12:26:49,197 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-16 12:26:49,208 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-16 12:26:49,467 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-16 12:26:49,475 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-16 12:26:50,045 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-16 12:26:50,046 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-16 12:26:50,074 INFO L321 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-11-16 12:26:50,074 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-16 12:26:50,105 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2022-11-16 12:26:50,163 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-16 12:26:50,164 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-16 12:26:50,176 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-16 12:26:50,729 INFO L321 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2022-11-16 12:26:50,730 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-16 12:26:50,772 INFO L321 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2022-11-16 12:26:50,772 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-16 12:26:50,999 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:26:51,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 32 treesize of output 23 [2022-11-16 12:26:51,031 INFO L321 Elim1Store]: treesize reduction 53, result has 17.2 percent of original size [2022-11-16 12:26:51,032 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-16 12:26:51,596 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 12:26:51,624 INFO L321 Elim1Store]: treesize reduction 31, result has 8.8 percent of original size [2022-11-16 12:26:51,624 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-16 12:26:51,645 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:26:51,656 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-16 12:26:51,656 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-16 12:26:52,279 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-16 12:26:52,280 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 12:26:52,280 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 12:26:52,280 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [196498502] [2022-11-16 12:26:52,280 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [196498502] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:26:52,280 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:26:52,281 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2022-11-16 12:26:52,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834620908] [2022-11-16 12:26:52,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:26:52,281 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-11-16 12:26:52,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 12:26:52,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-11-16 12:26:52,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=483, Unknown=1, NotChecked=0, Total=552 [2022-11-16 12:26:52,283 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-16 12:26:52,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:26:52,863 INFO L93 Difference]: Finished difference Result 80 states and 84 transitions. [2022-11-16 12:26:52,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-16 12:26:52,864 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-16 12:26:52,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:26:52,864 INFO L225 Difference]: With dead ends: 80 [2022-11-16 12:26:52,864 INFO L226 Difference]: Without dead ends: 80 [2022-11-16 12:26:52,865 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=92, Invalid=609, Unknown=1, NotChecked=0, Total=702 [2022-11-16 12:26:52,866 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 20 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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-16 12:26:52,866 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-16 12:26:52,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-11-16 12:26:52,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2022-11-16 12:26:52,869 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-16 12:26:52,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 84 transitions. [2022-11-16 12:26:52,870 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 84 transitions. Word has length 53 [2022-11-16 12:26:52,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:26:52,871 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 84 transitions. [2022-11-16 12:26:52,871 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-16 12:26:52,871 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 84 transitions. [2022-11-16 12:26:52,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-11-16 12:26:52,872 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:26:52,872 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-16 12:26:52,889 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccdeb345-a6bd-4eb4-8736-1936ccfa9ff5/bin/uautomizer-tPACEb0tL8/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)] Ended with exit code 0 [2022-11-16 12:26:53,089 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccdeb345-a6bd-4eb4-8736-1936ccfa9ff5/bin/uautomizer-tPACEb0tL8/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-16 12:26:53,089 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-16 12:26:53,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:26:53,089 INFO L85 PathProgramCache]: Analyzing trace with hash 460219817, now seen corresponding path program 1 times [2022-11-16 12:26:53,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 12:26:53,090 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [284809280] [2022-11-16 12:26:53,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:26:53,090 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-16 12:26:53,090 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccdeb345-a6bd-4eb4-8736-1936ccfa9ff5/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 12:26:53,091 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccdeb345-a6bd-4eb4-8736-1936ccfa9ff5/bin/uautomizer-tPACEb0tL8/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-16 12:26:53,092 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccdeb345-a6bd-4eb4-8736-1936ccfa9ff5/bin/uautomizer-tPACEb0tL8/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-16 12:26:53,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:26:53,467 INFO L263 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 43 conjunts are in the unsatisfiable core [2022-11-16 12:26:53,471 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:26:53,671 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-16 12:26:53,824 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-16 12:26:54,202 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-16 12:26:54,202 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-16 12:26:54,213 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-16 12:26:54,646 INFO L321 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2022-11-16 12:26:54,647 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-16 12:26:54,828 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-16 12:26:54,845 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:26:54,847 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-16 12:26:54,986 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-16 12:26:55,328 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-16 12:26:55,329 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-16 12:26:55,435 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-16 12:26:55,436 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:26:55,714 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-16 12:27:16,446 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset| (_ bv4 32)))) (let ((.cse0 (let ((.cse2 (let ((.cse3 (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|) .cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_prepend_~head#1.base|) |c_ULTIMATE.start_sll_prepend_~head#1.offset|))))) (store .cse3 |c_ULTIMATE.start_sll_prepend_~head#1.base| (store (select .cse3 |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 .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (and (not (= (select .cse0 .cse1) (_ bv0 32))) (or (and (= |c_ULTIMATE.start_main_~#s~0#1.base| |c_ULTIMATE.start_sll_prepend_~head#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| |c_ULTIMATE.start_sll_prepend_~head#1.offset|)) (forall ((v_arrayElimCell_72 (_ BitVec 32))) (not (= (select .cse0 (bvadd (_ bv4 32) v_arrayElimCell_72)) (_ bv0 32)))))))) is different from false [2022-11-16 12:27:18,508 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_prepend_#t~ret7#1.offset|))) (let ((.cse0 (let ((.cse2 (let ((.cse3 (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|) .cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_prepend_~head#1.base|) |c_ULTIMATE.start_sll_prepend_~head#1.offset|))))) (store .cse3 |c_ULTIMATE.start_sll_prepend_~head#1.base| (store (select .cse3 |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|))))) (select .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (and (not (= (select .cse0 .cse1) (_ bv0 32))) (or (and (= |c_ULTIMATE.start_main_~#s~0#1.base| |c_ULTIMATE.start_sll_prepend_~head#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| |c_ULTIMATE.start_sll_prepend_~head#1.offset|)) (forall ((v_arrayElimCell_72 (_ BitVec 32))) (not (= (select .cse0 (bvadd (_ bv4 32) v_arrayElimCell_72)) (_ bv0 32)))))))) is different from false [2022-11-16 12:27:19,832 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 12:27:19,832 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [284809280] [2022-11-16 12:27:19,832 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [284809280] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:27:19,833 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [985685559] [2022-11-16 12:27:19,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:27:19,833 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-16 12:27:19,833 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccdeb345-a6bd-4eb4-8736-1936ccfa9ff5/bin/uautomizer-tPACEb0tL8/cvc4 [2022-11-16 12:27:19,834 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccdeb345-a6bd-4eb4-8736-1936ccfa9ff5/bin/uautomizer-tPACEb0tL8/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-16 12:27:19,836 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccdeb345-a6bd-4eb4-8736-1936ccfa9ff5/bin/uautomizer-tPACEb0tL8/cvc4 --incremental --print-success --lang smt (25)] Waiting until timeout for monitored process [2022-11-16 12:27:20,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:20,383 INFO L263 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 42 conjunts are in the unsatisfiable core [2022-11-16 12:27:20,387 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:27:21,435 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-16 12:27:21,691 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-16 12:27:21,692 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-16 12:27:21,704 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-11-16 12:27:22,565 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:27:22,566 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-16 12:27:22,877 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:27:22,878 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-16 12:27:22,894 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-16 12:27:23,109 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-16 12:27:25,724 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:27:25,724 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-16 12:27:25,743 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-16 12:27:25,743 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:27:25,780 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-16 12:27:27,773 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [985685559] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:27:27,773 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 12:27:27,773 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 37 [2022-11-16 12:27:27,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511412717] [2022-11-16 12:27:27,774 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 12:27:27,775 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-11-16 12:27:27,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 12:27:27,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-11-16 12:27:27,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=1652, Unknown=11, NotChecked=166, Total=1980 [2022-11-16 12:27:27,776 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-16 12:27:31,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:27:31,136 INFO L93 Difference]: Finished difference Result 86 states and 89 transitions. [2022-11-16 12:27:31,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-16 12:27:31,136 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-16 12:27:31,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:27:31,137 INFO L225 Difference]: With dead ends: 86 [2022-11-16 12:27:31,138 INFO L226 Difference]: Without dead ends: 86 [2022-11-16 12:27:31,139 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 90 SyntacticMatches, 5 SemanticMatches, 50 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 755 ImplicationChecksByTransitivity, 34.1s TimeCoverageRelationStatistics Valid=209, Invalid=2235, Unknown=14, NotChecked=194, Total=2652 [2022-11-16 12:27:31,139 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 38 mSDsluCounter, 521 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 559 SdHoareTripleChecker+Invalid, 364 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 231 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-16 12:27:31,140 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 559 Invalid, 364 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 130 Invalid, 0 Unknown, 231 Unchecked, 0.4s Time] [2022-11-16 12:27:31,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2022-11-16 12:27:31,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 80. [2022-11-16 12:27:31,143 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-16 12:27:31,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 83 transitions. [2022-11-16 12:27:31,144 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 83 transitions. Word has length 54 [2022-11-16 12:27:31,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:27:31,144 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 83 transitions. [2022-11-16 12:27:31,145 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-16 12:27:31,145 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 83 transitions. [2022-11-16 12:27:31,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-11-16 12:27:31,146 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:27:31,146 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-16 12:27:31,161 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccdeb345-a6bd-4eb4-8736-1936ccfa9ff5/bin/uautomizer-tPACEb0tL8/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)] Ended with exit code 0 [2022-11-16 12:27:31,362 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccdeb345-a6bd-4eb4-8736-1936ccfa9ff5/bin/uautomizer-tPACEb0tL8/cvc4 --incremental --print-success --lang smt (25)] Ended with exit code 0 [2022-11-16 12:27:31,558 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccdeb345-a6bd-4eb4-8736-1936ccfa9ff5/bin/uautomizer-tPACEb0tL8/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,25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccdeb345-a6bd-4eb4-8736-1936ccfa9ff5/bin/uautomizer-tPACEb0tL8/cvc4 --incremental --print-success --lang smt [2022-11-16 12:27:31,559 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-16 12:27:31,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:27:31,559 INFO L85 PathProgramCache]: Analyzing trace with hash 1381954359, now seen corresponding path program 1 times [2022-11-16 12:27:31,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 12:27:31,559 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1642729816] [2022-11-16 12:27:31,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:27:31,560 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-16 12:27:31,560 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccdeb345-a6bd-4eb4-8736-1936ccfa9ff5/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 12:27:31,561 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccdeb345-a6bd-4eb4-8736-1936ccfa9ff5/bin/uautomizer-tPACEb0tL8/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-16 12:27:31,569 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccdeb345-a6bd-4eb4-8736-1936ccfa9ff5/bin/uautomizer-tPACEb0tL8/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-16 12:27:31,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:31,977 INFO L263 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 44 conjunts are in the unsatisfiable core [2022-11-16 12:27:31,981 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:27:32,162 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-16 12:27:32,311 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-16 12:27:32,653 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-16 12:27:32,653 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-16 12:27:32,664 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-16 12:27:33,078 INFO L321 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2022-11-16 12:27:33,078 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-16 12:27:33,241 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-16 12:27:33,267 INFO L321 Elim1Store]: treesize reduction 53, result has 17.2 percent of original size [2022-11-16 12:27:33,268 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-16 12:27:33,412 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-16 12:27:33,719 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:27:33,730 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-16 12:27:33,731 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-16 12:27:33,931 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-16 12:27:33,932 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 12:27:33,932 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 12:27:33,932 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1642729816] [2022-11-16 12:27:33,932 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1642729816] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:27:33,932 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:27:33,932 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2022-11-16 12:27:33,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299362642] [2022-11-16 12:27:33,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:27:33,933 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-11-16 12:27:33,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 12:27:33,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-11-16 12:27:33,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=527, Unknown=1, NotChecked=0, Total=600 [2022-11-16 12:27:33,934 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-16 12:27:34,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:27:34,487 INFO L93 Difference]: Finished difference Result 87 states and 89 transitions. [2022-11-16 12:27:34,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-16 12:27:34,488 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-16 12:27:34,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:27:34,489 INFO L225 Difference]: With dead ends: 87 [2022-11-16 12:27:34,489 INFO L226 Difference]: Without dead ends: 87 [2022-11-16 12:27:34,490 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 200 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=96, Invalid=659, Unknown=1, NotChecked=0, Total=756 [2022-11-16 12:27:34,490 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 49 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 380 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 94 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-16 12:27:34,490 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 380 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 141 Invalid, 0 Unknown, 94 Unchecked, 0.4s Time] [2022-11-16 12:27:34,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2022-11-16 12:27:34,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 82. [2022-11-16 12:27:34,493 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-16 12:27:34,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 85 transitions. [2022-11-16 12:27:34,494 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 85 transitions. Word has length 55 [2022-11-16 12:27:34,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:27:34,494 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 85 transitions. [2022-11-16 12:27:34,494 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-16 12:27:34,495 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 85 transitions. [2022-11-16 12:27:34,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-11-16 12:27:34,495 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:27:34,496 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-16 12:27:34,511 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccdeb345-a6bd-4eb4-8736-1936ccfa9ff5/bin/uautomizer-tPACEb0tL8/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-16 12:27:34,698 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccdeb345-a6bd-4eb4-8736-1936ccfa9ff5/bin/uautomizer-tPACEb0tL8/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-16 12:27:34,698 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-16 12:27:34,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:27:34,699 INFO L85 PathProgramCache]: Analyzing trace with hash 913244988, now seen corresponding path program 1 times [2022-11-16 12:27:34,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 12:27:34,699 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [119165916] [2022-11-16 12:27:34,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:27:34,699 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-16 12:27:34,700 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccdeb345-a6bd-4eb4-8736-1936ccfa9ff5/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 12:27:34,700 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccdeb345-a6bd-4eb4-8736-1936ccfa9ff5/bin/uautomizer-tPACEb0tL8/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-16 12:27:34,702 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccdeb345-a6bd-4eb4-8736-1936ccfa9ff5/bin/uautomizer-tPACEb0tL8/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-16 12:27:35,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:35,165 INFO L263 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 93 conjunts are in the unsatisfiable core [2022-11-16 12:27:35,172 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:27:35,197 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:27:35,198 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-16 12:27:35,288 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1475 (_ BitVec 1)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (store |c_old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_1475) |c_#valid|) (= (_ bv0 1) (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) (bvult (_ bv0 32) |c_#StackHeapBarrier|) (not (= (bvadd |c_#StackHeapBarrier| (_ bv1 32)) (_ bv0 32)))) is different from true [2022-11-16 12:27:35,402 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-16 12:27:35,403 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-16 12:27:35,624 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-16 12:27:35,836 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-16 12:27:35,837 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-16 12:27:36,093 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-16 12:27:36,120 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:27:36,121 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-16 12:27:36,653 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-16 12:27:36,663 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-16 12:27:36,670 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-16 12:27:36,689 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-16 12:27:37,436 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-16 12:27:37,437 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-16 12:27:37,453 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-16 12:27:37,487 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:27:37,488 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-16 12:27:37,554 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-11-16 12:27:37,554 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-16 12:27:37,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-16 12:27:37,617 INFO L321 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2022-11-16 12:27:37,617 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-16 12:27:38,496 INFO L321 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2022-11-16 12:27:38,496 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-16 12:27:38,529 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:27:38,531 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-16 12:27:38,545 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-16 12:27:39,163 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:27:39,164 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-16 12:27:39,202 INFO L321 Elim1Store]: treesize reduction 27, result has 48.1 percent of original size [2022-11-16 12:27:39,203 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-16 12:27:39,211 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-16 12:27:39,294 INFO L321 Elim1Store]: treesize reduction 53, result has 17.2 percent of original size [2022-11-16 12:27:39,295 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-16 12:27:40,456 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 12:27:40,488 INFO L321 Elim1Store]: treesize reduction 31, result has 8.8 percent of original size [2022-11-16 12:27:40,488 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-16 12:27:40,525 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:27:40,538 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-16 12:27:40,539 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-16 12:27:41,207 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-16 12:27:41,351 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 12 not checked. [2022-11-16 12:27:41,351 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:27:42,743 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1491 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1497 (Array (_ BitVec 32) (_ BitVec 32)))) (= (let ((.cse5 (bvadd |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset| (_ bv4 32)))) (let ((.cse3 (let ((.cse6 (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|) .cse5 |c_ULTIMATE.start_sll_prepend_#t~mem8#1.offset|)))) (store .cse6 |c_ULTIMATE.start_sll_prepend_~head#1.base| (store (select .cse6 |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.offset|)))) (.cse0 (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|) .cse5 |c_ULTIMATE.start_sll_prepend_#t~mem8#1.base|)))) (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 ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (bvadd (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) (_ bv4 32)))) (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~new_head~1#1.base| v_ArrVal_1491) |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1497) (select (select .cse0 .cse1) .cse2)) (select (select .cse3 .cse1) .cse2))))) |c_ULTIMATE.start_main_~data~0#1|)) is different from false [2022-11-16 12:27:52,505 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 12:27:52,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [119165916] [2022-11-16 12:27:52,505 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [119165916] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:27:52,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1143343403] [2022-11-16 12:27:52,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:27:52,506 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-16 12:27:52,506 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccdeb345-a6bd-4eb4-8736-1936ccfa9ff5/bin/uautomizer-tPACEb0tL8/cvc4 [2022-11-16 12:27:52,507 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccdeb345-a6bd-4eb4-8736-1936ccfa9ff5/bin/uautomizer-tPACEb0tL8/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-16 12:27:52,509 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccdeb345-a6bd-4eb4-8736-1936ccfa9ff5/bin/uautomizer-tPACEb0tL8/cvc4 --incremental --print-success --lang smt (28)] Waiting until timeout for monitored process [2022-11-16 12:27:53,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:53,178 INFO L263 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 78 conjunts are in the unsatisfiable core [2022-11-16 12:27:53,184 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:27:53,923 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-16 12:27:53,934 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-16 12:27:54,316 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-16 12:27:55,707 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-16 12:27:57,321 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-16 12:27:57,332 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-16 12:27:57,344 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-16 12:27:57,350 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-16 12:27:59,527 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:27:59,529 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-16 12:27:59,568 INFO L321 Elim1Store]: treesize reduction 6, result has 57.1 percent of original size [2022-11-16 12:27:59,568 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-16 12:27:59,580 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-16 12:27:59,597 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-16 12:28:01,116 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:28:01,118 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-16 12:28:01,150 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-16 12:28:02,004 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:28:02,005 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-16 12:28:02,072 INFO L321 Elim1Store]: treesize reduction 27, result has 48.1 percent of original size [2022-11-16 12:28:02,073 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-16 12:28:02,085 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-16 12:28:02,101 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-16 12:28:04,008 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 12:28:04,023 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:28:04,024 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-16 12:28:04,050 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:28:04,051 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-16 12:28:05,680 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 12:28:05,682 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-16 12:28:05,695 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-16 12:28:05,695 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:28:09,737 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:28:09,738 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-16 12:30:11,770 WARN L855 $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 ((.cse26 (select .cse930 .cse641))) (let ((.cse142 (select .cse26 |c_ULTIMATE.start_sll_prepend_~head#1.offset|))) (let ((.cse922 (select |c_#length| .cse142)) (.cse25 (bvadd |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset| (_ bv4 32)))) (let ((.cse1 (= |c_ULTIMATE.start_sll_prepend_~head#1.offset| .cse25)) (.cse143 (bvadd (_ bv4294967292 32) |c_ULTIMATE.start_sll_prepend_~head#1.offset|)) (.cse5 (= .cse641 |c_ULTIMATE.start_sll_prepend_~head#1.base|)) (.cse633 (bvadd |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset| (_ bv8 32))) (.cse501 (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) .cse142))) (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|)))))) (.cse124 (not (bvule .cse25 .cse922))) (.cse123 (not (bvule |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset| .cse25))) (.cse129 (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) .cse142) |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|)))) (.cse23 (select .cse26 .cse25))) (let ((.cse232 (select |c_#length| .cse23)) (.cse376 (and (or .cse124 .cse123 .cse501) (or .cse124 .cse123 .cse129))) (.cse175 (forall ((v_arrayElimIndex_11 (_ BitVec 32))) (or (= v_arrayElimIndex_11 .cse25) (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_152 (_ BitVec 32))) (let ((.cse928 (select .cse26 v_arrayElimIndex_11))) (let ((.cse926 (bvadd v_arrayElimCell_152 (_ bv4 32))) (.cse927 (select |c_#length| .cse928))) (or (not (bvule .cse926 .cse927)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593) .cse928) v_arrayElimCell_152) |c_ULTIMATE.start_main_~data~0#1|) (not (bvule v_arrayElimCell_152 .cse926)) (not (bvule (bvadd v_arrayElimCell_152 (_ bv8 32)) .cse927)))))) (= v_arrayElimIndex_11 |c_ULTIMATE.start_sll_prepend_~head#1.offset|)))) (.cse365 (and (or (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_151 (_ BitVec 32))) (let ((.cse923 (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 .cse923 .cse23) v_arrayElimCell_151)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse923 .cse142) |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|))))) .cse123) (or .cse123 (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_151 (_ BitVec 32))) (let ((.cse925 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593))) (let ((.cse924 (select .cse925 .cse23))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse924 v_arrayElimCell_151)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse925 .cse142) |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse924 |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|))))))))) (.cse125 (not (bvule .cse633 .cse922))) (.cse10 (= |c_ULTIMATE.start_main_~#s~0#1.base| |c_ULTIMATE.start_sll_prepend_~head#1.base|)) (.cse12 (= |c_ULTIMATE.start_main_~#s~0#1.offset| |c_ULTIMATE.start_sll_prepend_~head#1.offset|)) (.cse666 (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimIndex_11 (_ BitVec 32)) (v_arrayElimCell_152 (_ BitVec 32))) (let ((.cse921 (select .cse26 v_arrayElimIndex_11))) (let ((.cse920 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593)) (.cse918 (bvadd v_arrayElimCell_152 (_ bv4 32))) (.cse919 (select |c_#length| .cse921))) (or (not (bvule .cse918 .cse919)) (= (select (select .cse920 .cse921) v_arrayElimCell_152) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse920 .cse23) v_arrayElimCell_152)) (not (bvule v_arrayElimCell_152 .cse918)) (= v_arrayElimIndex_11 |c_ULTIMATE.start_sll_prepend_~head#1.offset|) (not (bvule (bvadd v_arrayElimCell_152 (_ bv8 32)) .cse919))))))) (.cse865 (forall ((v_arrayElimIndex_11 (_ BitVec 32))) (let ((.cse917 (select .cse26 v_arrayElimIndex_11))) (let ((.cse915 (select |c_#length| .cse917)) (.cse916 (bvadd (_ bv4294967292 32) v_arrayElimIndex_11))) (or (not (bvule v_arrayElimIndex_11 .cse915)) (not (bvule .cse916 v_arrayElimIndex_11)) (not (bvule (bvadd (_ bv4 32) v_arrayElimIndex_11) .cse915)) (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) .cse917) .cse916))) (= v_arrayElimIndex_11 |c_ULTIMATE.start_sll_prepend_~head#1.offset|)))))) (.cse151 (not .cse5)) (.cse133 (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse914 (select (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593) .cse142))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse914 .cse143)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse914 |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|)))))) (.cse144 (not .cse1))) (let ((.cse128 (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse913 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593))) (let ((.cse912 (select .cse913 .cse23))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse912 .cse143)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse913 .cse142) |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse912 |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|))))))) (.cse642 (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse911 (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 .cse911 .cse23) .cse143)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse911 .cse142) |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|)))))) (.cse136 (and .cse129 .cse501)) (.cse499 (or .cse1 (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ 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 .cse142))) (or (= |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 (select .cse910 .cse23) v_arrayElimCell_152)))))))) (.cse500 (or (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_152 (_ BitVec 32))) (let ((.cse908 (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 .cse908 .cse142) |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse908 .cse23) v_arrayElimCell_152))))) .cse1)) (.cse502 (or (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_152 (_ BitVec 32))) (let ((.cse907 (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 .cse907 .cse142) v_arrayElimCell_152)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse907 .cse23) |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|))))) .cse144)) (.cse503 (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_152 (_ BitVec 32))) (let ((.cse906 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593))) (let ((.cse904 (select .cse906 .cse142)) (.cse905 (select .cse906 .cse23))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse904 v_arrayElimCell_152)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse904 |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse905 v_arrayElimCell_152)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse905 |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|))))))) (.cse504 (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_152 (_ BitVec 32))) (let ((.cse902 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593))) (let ((.cse903 (select .cse902 .cse23))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse902 .cse142) |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse903 v_arrayElimCell_152)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse903 |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|))))))) (.cse320 (and .cse129 .cse133)) (.cse542 (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) .cse23) |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|)))) (.cse654 (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimIndex_11 (_ BitVec 32))) (let ((.cse900 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593)) (.cse901 (select .cse26 v_arrayElimIndex_11))) (let ((.cse898 (select .cse900 .cse901)) (.cse899 (bvadd (_ bv4294967292 32) v_arrayElimIndex_11)) (.cse897 (select |c_#length| .cse901))) (or (not (bvule v_arrayElimIndex_11 .cse897)) (= (select .cse898 |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 .cse898 .cse899)) (not (bvule .cse899 v_arrayElimIndex_11)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse900 .cse23) .cse899)) (not (bvule (bvadd (_ bv4 32) v_arrayElimIndex_11) .cse897)) (= v_arrayElimIndex_11 |c_ULTIMATE.start_sll_prepend_~head#1.offset|)))))) (.cse664 (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimIndex_11 (_ BitVec 32))) (let ((.cse895 (select .cse26 v_arrayElimIndex_11))) (let ((.cse894 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593)) (.cse896 (bvadd (_ bv4294967292 32) v_arrayElimIndex_11)) (.cse893 (select |c_#length| .cse895))) (or (not (bvule v_arrayElimIndex_11 .cse893)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse894 .cse895) .cse896)) (not (bvule .cse896 v_arrayElimIndex_11)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse894 .cse23) .cse896)) (not (bvule (bvadd (_ bv4 32) v_arrayElimIndex_11) .cse893)) (= v_arrayElimIndex_11 |c_ULTIMATE.start_sll_prepend_~head#1.offset|)))))) (.cse167 (or (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimIndex_11 (_ BitVec 32)) (v_arrayElimCell_152 (_ BitVec 32))) (let ((.cse891 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593)) (.cse892 (select .cse26 v_arrayElimIndex_11))) (let ((.cse888 (select .cse891 .cse892)) (.cse889 (bvadd v_arrayElimCell_152 (_ bv4 32))) (.cse890 (select |c_#length| .cse892))) (or (= (select .cse888 |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|) |c_ULTIMATE.start_main_~data~0#1|) (not (bvule .cse889 .cse890)) (= (select .cse888 v_arrayElimCell_152) |c_ULTIMATE.start_main_~data~0#1|) (not (bvule v_arrayElimCell_152 .cse889)) (= v_arrayElimIndex_11 |c_ULTIMATE.start_sll_prepend_~head#1.offset|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse891 .cse23) |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|)) (not (bvule (bvadd v_arrayElimCell_152 (_ bv8 32)) .cse890)))))) .cse144 .cse151)) (.cse648 (and .cse865 (forall ((v_arrayElimIndex_11 (_ BitVec 32))) (let ((.cse884 (select .cse26 v_arrayElimIndex_11))) (let ((.cse882 (bvadd (_ bv4294967292 32) v_arrayElimIndex_11)) (.cse881 (select |c_#length| .cse884))) (or (not (bvule v_arrayElimIndex_11 .cse881)) (not (bvule .cse882 v_arrayElimIndex_11)) (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse883 (select (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593) .cse884))) (or (= (select .cse883 |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 .cse883 .cse882))))) (not (bvule (bvadd (_ bv4 32) v_arrayElimIndex_11) .cse881)) (= 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 ((.cse886 (select .cse26 v_arrayElimIndex_11))) (let ((.cse887 (bvadd (_ bv4294967292 32) v_arrayElimIndex_11)) (.cse885 (select |c_#length| .cse886))) (or (not (bvule v_arrayElimIndex_11 .cse885)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593) .cse886) .cse887)) (not (bvule .cse887 v_arrayElimIndex_11)) (not (bvule (bvadd (_ bv4 32) v_arrayElimIndex_11) .cse885)) (= v_arrayElimIndex_11 |c_ULTIMATE.start_sll_prepend_~head#1.offset|))))) .cse5))) (.cse668 (forall ((v_arrayElimIndex_11 (_ BitVec 32))) (or (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_152 (_ BitVec 32))) (let ((.cse879 (select .cse26 v_arrayElimIndex_11)) (.cse878 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593))) (let ((.cse876 (bvadd v_arrayElimCell_152 (_ bv4 32))) (.cse880 (select .cse878 .cse23)) (.cse877 (select |c_#length| .cse879))) (or (not (bvule .cse876 .cse877)) (= (select (select .cse878 .cse879) v_arrayElimCell_152) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse880 v_arrayElimCell_152)) (not (bvule v_arrayElimCell_152 .cse876)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse880 |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|)) (not (bvule (bvadd v_arrayElimCell_152 (_ bv8 32)) .cse877)))))) (= v_arrayElimIndex_11 |c_ULTIMATE.start_sll_prepend_~head#1.offset|)))) (.cse675 (or .cse666 .cse1)) (.cse684 (forall ((v_arrayElimIndex_11 (_ BitVec 32))) (or (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_152 (_ BitVec 32))) (let ((.cse875 (select .cse26 v_arrayElimIndex_11))) (let ((.cse873 (bvadd v_arrayElimCell_152 (_ bv4 32))) (.cse874 (select |c_#length| .cse875))) (or (not (bvule .cse873 .cse874)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593) .cse875) v_arrayElimCell_152) |c_ULTIMATE.start_main_~data~0#1|) (not (bvule v_arrayElimCell_152 .cse873)) (not (bvule (bvadd v_arrayElimCell_152 (_ bv8 32)) .cse874)))))) (= v_arrayElimIndex_11 |c_ULTIMATE.start_sll_prepend_~head#1.offset|)))) (.cse710 (and .cse865 (forall ((v_arrayElimIndex_11 (_ BitVec 32))) (let ((.cse868 (select .cse26 v_arrayElimIndex_11))) (let ((.cse866 (select |c_#length| .cse868)) (.cse867 (bvadd (_ bv4294967292 32) v_arrayElimIndex_11))) (or (not (bvule v_arrayElimIndex_11 .cse866)) (not (bvule .cse867 v_arrayElimIndex_11)) (not (bvule (bvadd (_ bv4 32) v_arrayElimIndex_11) .cse866)) (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) .cse868) .cse867))))))) (forall ((v_arrayElimIndex_11 (_ BitVec 32))) (let ((.cse872 (select .cse26 v_arrayElimIndex_11))) (let ((.cse870 (bvadd (_ bv4294967292 32) v_arrayElimIndex_11)) (.cse869 (select |c_#length| .cse872))) (or (not (bvule v_arrayElimIndex_11 .cse869)) (not (bvule .cse870 v_arrayElimIndex_11)) (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse871 (select (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593) .cse872))) (or (= (select .cse871 |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 .cse871 .cse870))))) (not (bvule (bvadd (_ bv4 32) v_arrayElimIndex_11) .cse869)))))))) (.cse0 (and .cse10 .cse12)) (.cse270 (or .cse365 .cse124 .cse1 .cse125 .cse151)) (.cse157 (or .cse144 (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimIndex_11 (_ BitVec 32)) (v_arrayElimCell_152 (_ BitVec 32))) (let ((.cse864 (select .cse26 v_arrayElimIndex_11))) (let ((.cse861 (bvadd v_arrayElimCell_152 (_ bv4 32))) (.cse863 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593)) (.cse862 (select |c_#length| .cse864))) (or (not (bvule .cse861 .cse862)) (= (select (select .cse863 .cse864) v_arrayElimCell_152) |c_ULTIMATE.start_main_~data~0#1|) (not (bvule v_arrayElimCell_152 .cse861)) (= v_arrayElimIndex_11 |c_ULTIMATE.start_sll_prepend_~head#1.offset|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse863 .cse23) |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|)) (not (bvule (bvadd v_arrayElimCell_152 (_ bv8 32)) .cse862)))))) .cse151)) (.cse377 (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_151 (_ BitVec 32)) (v_arrayElimCell_152 (_ BitVec 32))) (let ((.cse859 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593))) (let ((.cse860 (select .cse859 .cse142))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse859 .cse23) v_arrayElimCell_151)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse860 v_arrayElimCell_152)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse860 |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|))))))) (.cse353 (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_151 (_ BitVec 32)) (v_arrayElimCell_152 (_ BitVec 32))) (let ((.cse858 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593))) (let ((.cse857 (select .cse858 .cse142)) (.cse856 (select .cse858 .cse23))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse856 v_arrayElimCell_151)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse857 v_arrayElimCell_152)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse857 |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse856 |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|))))))) (.cse48 (and (forall ((v_arrayElimIndex_11 (_ BitVec 32))) (or (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_152 (_ BitVec 32))) (let ((.cse852 (select .cse26 v_arrayElimIndex_11))) (let ((.cse849 (select (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593) .cse852)) (.cse850 (bvadd v_arrayElimCell_152 (_ bv4 32))) (.cse851 (select |c_#length| .cse852))) (or (= (select .cse849 |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|) |c_ULTIMATE.start_main_~data~0#1|) (not (bvule .cse850 .cse851)) (= (select .cse849 v_arrayElimCell_152) |c_ULTIMATE.start_main_~data~0#1|) (not (bvule v_arrayElimCell_152 .cse850)) (not (bvule (bvadd v_arrayElimCell_152 (_ bv8 32)) .cse851)))))) (= v_arrayElimIndex_11 .cse25))) (forall ((v_arrayElimIndex_11 (_ BitVec 32))) (or (= v_arrayElimIndex_11 .cse25) (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_152 (_ BitVec 32))) (let ((.cse855 (select .cse26 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)))))))) .cse175)) (.cse345 (or .cse1 .cse125 .cse151 .cse376)) (.cse173 (forall ((v_arrayElimIndex_11 (_ BitVec 32))) (or (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_152 (_ BitVec 32))) (let ((.cse848 (select .cse26 v_arrayElimIndex_11))) (let ((.cse845 (select (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593) .cse848)) (.cse846 (bvadd v_arrayElimCell_152 (_ bv4 32))) (.cse847 (select |c_#length| .cse848))) (or (= (select .cse845 |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|) |c_ULTIMATE.start_main_~data~0#1|) (not (bvule .cse846 .cse847)) (= (select .cse845 v_arrayElimCell_152) |c_ULTIMATE.start_main_~data~0#1|) (not (bvule v_arrayElimCell_152 .cse846)) (not (bvule (bvadd v_arrayElimCell_152 (_ bv8 32)) .cse847)))))) (= v_arrayElimIndex_11 .cse25) (= v_arrayElimIndex_11 |c_ULTIMATE.start_sll_prepend_~head#1.offset|)))) (.cse174 (or (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimIndex_11 (_ BitVec 32)) (v_arrayElimCell_152 (_ BitVec 32))) (let ((.cse844 (select .cse26 v_arrayElimIndex_11))) (let ((.cse842 (bvadd v_arrayElimCell_152 (_ bv4 32))) (.cse843 (select |c_#length| .cse844))) (or (not (bvule .cse842 .cse843)) (= v_arrayElimIndex_11 .cse25) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593) .cse844) v_arrayElimCell_152) |c_ULTIMATE.start_main_~data~0#1|) (not (bvule v_arrayElimCell_152 .cse842)) (= v_arrayElimIndex_11 |c_ULTIMATE.start_sll_prepend_~head#1.offset|) (not (bvule (bvadd v_arrayElimCell_152 (_ bv8 32)) .cse843)))))) .cse5)) (.cse243 (not .cse10)) (.cse332 (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_151 (_ BitVec 32))) (let ((.cse841 (bvadd v_arrayElimCell_151 (_ bv4 32)))) (or (not (bvule (bvadd v_arrayElimCell_151 (_ bv8 32)) .cse232)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593) .cse23) v_arrayElimCell_151)) (not (bvule v_arrayElimCell_151 .cse841)) (not (bvule .cse841 .cse232)))))) (.cse333 (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_151 (_ BitVec 32))) (let ((.cse840 (bvadd v_arrayElimCell_151 (_ bv4 32))) (.cse839 (select (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593) .cse23))) (or (not (bvule (bvadd v_arrayElimCell_151 (_ bv8 32)) .cse232)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse839 v_arrayElimCell_151)) (not (bvule v_arrayElimCell_151 .cse840)) (not (bvule .cse840 .cse232)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse839 |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|)))))) (.cse244 (not .cse12)) (.cse214 (forall ((v_arrayElimIndex_11 (_ BitVec 32))) (or (= v_arrayElimIndex_11 .cse25) (= |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 ((.cse838 (select .cse26 v_arrayElimIndex_11))) (let ((.cse836 (bvadd v_arrayElimCell_152 (_ bv4 32))) (.cse837 (select |c_#length| .cse838))) (or (not (bvule .cse836 .cse837)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593) .cse838) v_arrayElimCell_152) |c_ULTIMATE.start_main_~data~0#1|) (not (bvule v_arrayElimCell_152 .cse836)) (not (bvule (bvadd v_arrayElimCell_152 (_ bv8 32)) .cse837)))))) (= v_arrayElimIndex_11 |c_ULTIMATE.start_sll_prepend_~head#1.offset|))))) (let ((.cse193 (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimIndex_11 (_ BitVec 32))) (let ((.cse834 (select .cse26 v_arrayElimIndex_11))) (let ((.cse835 (bvadd (_ bv4294967292 32) v_arrayElimIndex_11)) (.cse833 (select |c_#length| .cse834))) (or (not (bvule v_arrayElimIndex_11 .cse833)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593) .cse834) .cse835)) (not (bvule .cse835 v_arrayElimIndex_11)) (not (bvule (bvadd (_ bv4 32) v_arrayElimIndex_11) .cse833)) (= v_arrayElimIndex_11 .cse25) (= v_arrayElimIndex_11 |c_ULTIMATE.start_sll_prepend_~head#1.offset|)))))) (.cse213 (forall ((v_arrayElimIndex_11 (_ BitVec 32))) (or (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_152 (_ BitVec 32))) (let ((.cse832 (select .cse26 v_arrayElimIndex_11))) (let ((.cse829 (select (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593) .cse832)) (.cse830 (bvadd v_arrayElimCell_152 (_ bv4 32))) (.cse831 (select |c_#length| .cse832))) (or (= (select .cse829 |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|) |c_ULTIMATE.start_main_~data~0#1|) (not (bvule .cse830 .cse831)) (= (select .cse829 v_arrayElimCell_152) |c_ULTIMATE.start_main_~data~0#1|) (not (bvule v_arrayElimCell_152 .cse830)) (not (bvule (bvadd v_arrayElimCell_152 (_ bv8 32)) .cse831)))))) (= v_arrayElimIndex_11 .cse25) (= |c_ULTIMATE.start_main_~#s~0#1.offset| v_arrayElimIndex_11) (= v_arrayElimIndex_11 |c_ULTIMATE.start_sll_prepend_~head#1.offset|)))) (.cse215 (or (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimIndex_11 (_ BitVec 32)) (v_arrayElimCell_152 (_ BitVec 32))) (let ((.cse828 (select .cse26 v_arrayElimIndex_11))) (let ((.cse826 (bvadd v_arrayElimCell_152 (_ bv4 32))) (.cse827 (select |c_#length| .cse828))) (or (not (bvule .cse826 .cse827)) (= v_arrayElimIndex_11 .cse25) (= |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) .cse828) v_arrayElimCell_152) |c_ULTIMATE.start_main_~data~0#1|) (not (bvule v_arrayElimCell_152 .cse826)) (= v_arrayElimIndex_11 |c_ULTIMATE.start_sll_prepend_~head#1.offset|) (not (bvule (bvadd v_arrayElimCell_152 (_ bv8 32)) .cse827)))))) .cse5)) (.cse67 (and .cse214 (forall ((v_arrayElimIndex_11 (_ BitVec 32))) (or (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_152 (_ BitVec 32))) (let ((.cse822 (select .cse26 v_arrayElimIndex_11))) (let ((.cse819 (select (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593) .cse822)) (.cse820 (bvadd v_arrayElimCell_152 (_ bv4 32))) (.cse821 (select |c_#length| .cse822))) (or (= (select .cse819 |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|) |c_ULTIMATE.start_main_~data~0#1|) (not (bvule .cse820 .cse821)) (= (select .cse819 v_arrayElimCell_152) |c_ULTIMATE.start_main_~data~0#1|) (not (bvule v_arrayElimCell_152 .cse820)) (not (bvule (bvadd v_arrayElimCell_152 (_ bv8 32)) .cse821)))))) (= v_arrayElimIndex_11 .cse25) (= |c_ULTIMATE.start_main_~#s~0#1.offset| v_arrayElimIndex_11))) (forall ((v_arrayElimIndex_11 (_ BitVec 32))) (or (= v_arrayElimIndex_11 .cse25) (= |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 ((.cse825 (select .cse26 v_arrayElimIndex_11))) (let ((.cse823 (bvadd v_arrayElimCell_152 (_ bv4 32))) (.cse824 (select |c_#length| .cse825))) (or (not (bvule .cse823 .cse824)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593) .cse825) v_arrayElimCell_152) |c_ULTIMATE.start_main_~data~0#1|) (not (bvule v_arrayElimCell_152 .cse823)) (not (bvule (bvadd v_arrayElimCell_152 (_ bv8 32)) .cse824)))))))))) (.cse258 (or .cse243 (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 ((.cse808 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593))) (let ((.cse807 (bvadd v_arrayElimCell_151 (_ bv4 32))) (.cse805 (select .cse808 (select .cse26 v_arrayElimIndex_11))) (.cse806 (select .cse808 .cse23))) (or (not (bvule (bvadd v_arrayElimCell_151 (_ bv8 32)) .cse232)) (= (select .cse805 |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 .cse806 v_arrayElimCell_151)) (not (bvule v_arrayElimCell_151 .cse807)) (not (bvule .cse807 .cse232)) (= (select .cse805 v_arrayElimCell_152) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse806 |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|)))))) (= v_arrayElimIndex_11 .cse25))) .cse332 (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 ((.cse810 (bvadd v_arrayElimCell_151 (_ bv4 32))) (.cse809 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593))) (or (not (bvule (bvadd v_arrayElimCell_151 (_ bv8 32)) .cse232)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse809 .cse23) v_arrayElimCell_151)) (not (bvule v_arrayElimCell_151 .cse810)) (not (bvule .cse810 .cse232)) (= (select (select .cse809 (select .cse26 v_arrayElimIndex_11)) v_arrayElimCell_152) |c_ULTIMATE.start_main_~data~0#1|)))) (= v_arrayElimIndex_11 .cse25))) (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 ((.cse812 (bvadd v_arrayElimCell_151 (_ bv4 32))) (.cse811 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593))) (or (not (bvule (bvadd v_arrayElimCell_151 (_ bv8 32)) .cse232)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse811 .cse23) v_arrayElimCell_151)) (not (bvule v_arrayElimCell_151 .cse812)) (not (bvule .cse812 .cse232)) (= (select (select .cse811 (select .cse26 v_arrayElimIndex_11)) v_arrayElimCell_152) |c_ULTIMATE.start_main_~data~0#1|)))) (= v_arrayElimIndex_11 .cse25) (= v_arrayElimIndex_11 |c_ULTIMATE.start_sll_prepend_~head#1.offset|))) .cse333 (forall ((v_arrayElimIndex_11 (_ BitVec 32))) (or (= v_arrayElimIndex_11 .cse25) (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_151 (_ BitVec 32)) (v_arrayElimCell_152 (_ BitVec 32))) (let ((.cse814 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593))) (let ((.cse815 (bvadd v_arrayElimCell_151 (_ bv4 32))) (.cse813 (select .cse814 (select .cse26 v_arrayElimIndex_11)))) (or (not (bvule (bvadd v_arrayElimCell_151 (_ bv8 32)) .cse232)) (= (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 (select .cse814 .cse23) v_arrayElimCell_151)) (not (bvule v_arrayElimCell_151 .cse815)) (not (bvule .cse815 .cse232)) (= (select .cse813 v_arrayElimCell_152) |c_ULTIMATE.start_main_~data~0#1|))))))) (forall ((v_arrayElimIndex_11 (_ BitVec 32))) (or (= v_arrayElimIndex_11 .cse25) (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_151 (_ BitVec 32)) (v_arrayElimCell_152 (_ BitVec 32))) (let ((.cse818 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593))) (let ((.cse817 (bvadd v_arrayElimCell_151 (_ bv4 32))) (.cse816 (select .cse818 .cse23))) (or (not (bvule (bvadd v_arrayElimCell_151 (_ bv8 32)) .cse232)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse816 v_arrayElimCell_151)) (not (bvule v_arrayElimCell_151 .cse817)) (not (bvule .cse817 .cse232)) (= (select (select .cse818 (select .cse26 v_arrayElimIndex_11)) v_arrayElimCell_152) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse816 |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|)))))) (= v_arrayElimIndex_11 |c_ULTIMATE.start_sll_prepend_~head#1.offset|)))) .cse244)) (.cse259 (or .cse0 (let ((.cse782 (and (or .cse48 .cse5) .cse345 .cse173 .cse174 .cse175)) (.cse795 (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 ((.cse804 (select .cse26 v_arrayElimIndex_11))) (let ((.cse801 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593)) (.cse802 (bvadd v_arrayElimCell_152 (_ bv4 32))) (.cse803 (select |c_#length| .cse804))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse801 .cse23) v_arrayElimCell_151)) (not (bvule .cse802 .cse803)) (= v_arrayElimIndex_11 .cse25) (= (select (select .cse801 .cse804) v_arrayElimCell_152) |c_ULTIMATE.start_main_~data~0#1|) (not (bvule v_arrayElimCell_152 .cse802)) (= v_arrayElimIndex_11 |c_ULTIMATE.start_sll_prepend_~head#1.offset|) (not (bvule (bvadd v_arrayElimCell_152 (_ bv8 32)) .cse803))))))) (.cse794 (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 ((.cse797 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593)) (.cse800 (select .cse26 v_arrayElimIndex_11))) (let ((.cse796 (select .cse797 .cse800)) (.cse798 (bvadd v_arrayElimCell_152 (_ bv4 32))) (.cse799 (select |c_#length| .cse800))) (or (= (select .cse796 |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 .cse797 .cse23) v_arrayElimCell_151)) (not (bvule .cse798 .cse799)) (= v_arrayElimIndex_11 .cse25) (= (select .cse796 v_arrayElimCell_152) |c_ULTIMATE.start_main_~data~0#1|) (not (bvule v_arrayElimCell_152 .cse798)) (not (bvule (bvadd v_arrayElimCell_152 (_ bv8 32)) .cse799)))))) .cse5))) (and (forall ((v_arrayElimCell_152 (_ BitVec 32))) (let ((.cse764 (bvadd v_arrayElimCell_152 (_ bv4 32)))) (or (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_151 (_ BitVec 32))) (let ((.cse767 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593))) (let ((.cse762 (select .cse767 .cse23))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse762 v_arrayElimCell_151)) (forall ((v_arrayElimIndex_11 (_ BitVec 32))) (let ((.cse766 (select .cse26 v_arrayElimIndex_11))) (let ((.cse763 (select .cse767 .cse766)) (.cse765 (select |c_#length| .cse766))) (or (= (select .cse763 |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|) |c_ULTIMATE.start_main_~data~0#1|) (not (bvule .cse764 .cse765)) (= v_arrayElimIndex_11 .cse25) (= (select .cse763 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)) .cse765)))))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse762 |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|)))))) (not (bvule v_arrayElimCell_152 .cse764))))) .cse270 (or .cse144 (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 .cse26 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)) (= v_arrayElimIndex_11 .cse25) (= (select .cse768 v_arrayElimCell_152) |c_ULTIMATE.start_main_~data~0#1|) (not (bvule v_arrayElimCell_152 .cse769)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse771 .cse23) |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|)) (not (bvule (bvadd v_arrayElimCell_152 (_ bv8 32)) .cse770)))))) .cse151) .cse157 (forall ((v_arrayElimIndex_11 (_ BitVec 32))) (or (= v_arrayElimIndex_11 .cse25) (forall ((v_arrayElimCell_152 (_ BitVec 32))) (let ((.cse777 (select .cse26 v_arrayElimIndex_11))) (let ((.cse773 (bvadd v_arrayElimCell_152 (_ bv4 32))) (.cse774 (select |c_#length| .cse777))) (or (not (bvule .cse773 .cse774)) (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_151 (_ BitVec 32))) (let ((.cse776 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593))) (let ((.cse775 (select .cse776 .cse23))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse775 v_arrayElimCell_151)) (= (select (select .cse776 .cse777) v_arrayElimCell_152) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse775 |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|)))))) (not (bvule v_arrayElimCell_152 .cse773)) (not (bvule (bvadd v_arrayElimCell_152 (_ bv8 32)) .cse774)))))) (= 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 ((.cse781 (select .cse26 v_arrayElimIndex_11))) (let ((.cse778 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593)) (.cse779 (bvadd v_arrayElimCell_152 (_ bv4 32))) (.cse780 (select |c_#length| .cse781))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse778 .cse23) v_arrayElimCell_151)) (not (bvule .cse779 .cse780)) (= v_arrayElimIndex_11 .cse25) (= (select (select .cse778 .cse781) v_arrayElimCell_152) |c_ULTIMATE.start_main_~data~0#1|) (not (bvule v_arrayElimCell_152 .cse779)) (not (bvule (bvadd v_arrayElimCell_152 (_ bv8 32)) .cse780)))))) .cse5) (or .cse12 .cse782) (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 ((.cse788 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593)) (.cse787 (select .cse26 v_arrayElimIndex_11))) (let ((.cse783 (select .cse788 .cse787)) (.cse785 (bvadd v_arrayElimCell_152 (_ bv4 32))) (.cse784 (select .cse788 .cse23)) (.cse786 (select |c_#length| .cse787))) (or (= (select .cse783 |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 .cse784 v_arrayElimCell_151)) (not (bvule .cse785 .cse786)) (= v_arrayElimIndex_11 .cse25) (= (select .cse783 v_arrayElimCell_152) |c_ULTIMATE.start_main_~data~0#1|) (not (bvule v_arrayElimCell_152 .cse785)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse784 |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|)) (not (bvule (bvadd v_arrayElimCell_152 (_ bv8 32)) .cse786)))))) .cse5) (or .cse10 .cse782) (or (and (forall ((v_arrayElimCell_152 (_ BitVec 32))) (let ((.cse791 (bvadd v_arrayElimCell_152 (_ bv4 32)))) (or (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_151 (_ BitVec 32))) (let ((.cse789 (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 .cse789 .cse23) v_arrayElimCell_151)) (forall ((v_arrayElimIndex_11 (_ BitVec 32))) (let ((.cse793 (select .cse26 v_arrayElimIndex_11))) (let ((.cse790 (select .cse789 .cse793)) (.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)) (= v_arrayElimIndex_11 .cse25) (= (select .cse790 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)) .cse792))))))))) (not (bvule v_arrayElimCell_152 .cse791))))) (or .cse124 .cse123 .cse125 .cse151 .cse377) .cse794) .cse1) (or .cse1 .cse795) (or .cse795 .cse5) (or .cse353 .cse124 .cse123 .cse1 .cse125 .cse151) .cse794)))) (.cse231 (forall ((v_arrayElimCell_152 (_ BitVec 32))) (let ((.cse761 (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) .cse23) v_arrayElimCell_152))) (not (bvule (bvadd v_arrayElimCell_152 (_ bv8 32)) .cse232)) (not (bvule .cse761 .cse232)) (not (bvule v_arrayElimCell_152 .cse761)))))) (.cse240 (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimIndex_11 (_ BitVec 32)) (v_arrayElimCell_152 (_ BitVec 32))) (let ((.cse759 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593))) (let ((.cse758 (select .cse759 (select .cse26 v_arrayElimIndex_11))) (.cse760 (bvadd v_arrayElimCell_152 (_ bv4 32)))) (or (= (select .cse758 |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)) .cse232)) (= (select .cse758 v_arrayElimCell_152) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse759 .cse23) v_arrayElimCell_152)) (not (bvule .cse760 .cse232)) (not (bvule v_arrayElimCell_152 .cse760))))))) (.cse238 (forall ((v_arrayElimCell_152 (_ BitVec 32))) (let ((.cse756 (bvadd v_arrayElimCell_152 (_ bv4 32)))) (or (not (bvule (bvadd v_arrayElimCell_152 (_ bv8 32)) .cse232)) (not (bvule .cse756 .cse232)) (not (bvule v_arrayElimCell_152 .cse756)) (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse757 (select (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593) .cse23))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse757 v_arrayElimCell_152)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse757 |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|))))))))) (.cse56 (forall ((v_arrayElimIndex_11 (_ BitVec 32))) (let ((.cse755 (select .cse26 v_arrayElimIndex_11))) (let ((.cse751 (select |c_#length| .cse755)) (.cse752 (bvadd (_ bv4294967292 32) v_arrayElimIndex_11))) (or (not (bvule v_arrayElimIndex_11 .cse751)) (not (bvule .cse752 v_arrayElimIndex_11)) (not (bvule (bvadd (_ bv4 32) v_arrayElimIndex_11) .cse751)) (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse754 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593))) (let ((.cse753 (select .cse754 .cse755))) (or (= (select .cse753 |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 .cse753 .cse752)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse754 .cse23) .cse752))))))))))) (.cse57 (forall ((v_arrayElimIndex_11 (_ BitVec 32))) (let ((.cse749 (select .cse26 v_arrayElimIndex_11))) (let ((.cse750 (bvadd (_ bv4294967292 32) v_arrayElimIndex_11)) (.cse747 (select |c_#length| .cse749))) (or (not (bvule v_arrayElimIndex_11 .cse747)) (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse748 (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 .cse748 .cse749) .cse750)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse748 .cse23) .cse750))))) (not (bvule .cse750 v_arrayElimIndex_11)) (not (bvule (bvadd (_ bv4 32) v_arrayElimIndex_11) .cse747))))))) (.cse82 (or .cse12 .cse710)) (.cse83 (or .cse1 (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimIndex_11 (_ BitVec 32))) (let ((.cse745 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593)) (.cse746 (select .cse26 v_arrayElimIndex_11))) (let ((.cse743 (select .cse745 .cse746)) (.cse744 (bvadd (_ bv4294967292 32) v_arrayElimIndex_11)) (.cse742 (select |c_#length| .cse746))) (or (not (bvule v_arrayElimIndex_11 .cse742)) (= (select .cse743 |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 .cse743 .cse744)) (not (bvule .cse744 v_arrayElimIndex_11)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse745 .cse23) .cse744)) (not (bvule (bvadd (_ bv4 32) v_arrayElimIndex_11) .cse742)))))))) (.cse90 (forall ((v_arrayElimIndex_11 (_ BitVec 32))) (let ((.cse740 (select .cse26 v_arrayElimIndex_11))) (let ((.cse741 (bvadd (_ bv4294967292 32) v_arrayElimIndex_11)) (.cse738 (select |c_#length| .cse740))) (or (not (bvule v_arrayElimIndex_11 .cse738)) (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse739 (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 .cse739 .cse740) .cse741)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse739 .cse23) .cse741))))) (not (bvule .cse741 v_arrayElimIndex_11)) (not (bvule (bvadd (_ bv4 32) v_arrayElimIndex_11) .cse738)) (= v_arrayElimIndex_11 |c_ULTIMATE.start_sll_prepend_~head#1.offset|)))))) (.cse245 (let ((.cse711 (and (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimIndex_11 (_ BitVec 32)) (v_arrayElimCell_152 (_ BitVec 32))) (let ((.cse733 (select .cse26 v_arrayElimIndex_11))) (let ((.cse731 (bvadd v_arrayElimCell_152 (_ bv4 32))) (.cse732 (select |c_#length| .cse733))) (or (not (bvule .cse731 .cse732)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593) .cse733) v_arrayElimCell_152) |c_ULTIMATE.start_main_~data~0#1|) (not (bvule v_arrayElimCell_152 .cse731)) (not (bvule (bvadd v_arrayElimCell_152 (_ bv8 32)) .cse732)))))) .cse684 (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimIndex_11 (_ BitVec 32)) (v_arrayElimCell_152 (_ BitVec 32))) (let ((.cse737 (select .cse26 v_arrayElimIndex_11))) (let ((.cse734 (select (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593) .cse737)) (.cse735 (bvadd v_arrayElimCell_152 (_ bv4 32))) (.cse736 (select |c_#length| .cse737))) (or (= (select .cse734 |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|) |c_ULTIMATE.start_main_~data~0#1|) (not (bvule .cse735 .cse736)) (= (select .cse734 v_arrayElimCell_152) |c_ULTIMATE.start_main_~data~0#1|) (not (bvule v_arrayElimCell_152 .cse735)) (not (bvule (bvadd v_arrayElimCell_152 (_ bv8 32)) .cse736))))))))) (and (or .cse12 .cse711) (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimIndex_11 (_ BitVec 32)) (v_arrayElimCell_152 (_ BitVec 32))) (let ((.cse715 (select .cse26 v_arrayElimIndex_11))) (let ((.cse714 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593)) (.cse712 (bvadd v_arrayElimCell_152 (_ bv4 32))) (.cse713 (select |c_#length| .cse715))) (or (not (bvule .cse712 .cse713)) (= (select (select .cse714 .cse715) v_arrayElimCell_152) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse714 .cse23) v_arrayElimCell_152)) (not (bvule v_arrayElimCell_152 .cse712)) (not (bvule (bvadd v_arrayElimCell_152 (_ bv8 32)) .cse713)))))) (forall ((v_arrayElimIndex_11 (_ BitVec 32))) (or (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_152 (_ BitVec 32))) (let ((.cse719 (select .cse26 v_arrayElimIndex_11))) (let ((.cse718 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593)) (.cse716 (bvadd v_arrayElimCell_152 (_ bv4 32))) (.cse717 (select |c_#length| .cse719))) (or (not (bvule .cse716 .cse717)) (= (select (select .cse718 .cse719) v_arrayElimCell_152) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse718 .cse23) v_arrayElimCell_152)) (not (bvule v_arrayElimCell_152 .cse716)) (not (bvule (bvadd v_arrayElimCell_152 (_ bv8 32)) .cse717)))))) (= v_arrayElimIndex_11 |c_ULTIMATE.start_sll_prepend_~head#1.offset|))) .cse668 (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimIndex_11 (_ BitVec 32)) (v_arrayElimCell_152 (_ BitVec 32))) (let ((.cse725 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593)) (.cse724 (select .cse26 v_arrayElimIndex_11))) (let ((.cse720 (select .cse725 .cse724)) (.cse721 (bvadd v_arrayElimCell_152 (_ bv4 32))) (.cse723 (select .cse725 .cse23)) (.cse722 (select |c_#length| .cse724))) (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|) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse723 v_arrayElimCell_152)) (not (bvule v_arrayElimCell_152 .cse721)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse723 |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|)) (not (bvule (bvadd v_arrayElimCell_152 (_ bv8 32)) .cse722)))))) (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimIndex_11 (_ BitVec 32)) (v_arrayElimCell_152 (_ BitVec 32))) (let ((.cse729 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593)) (.cse730 (select .cse26 v_arrayElimIndex_11))) (let ((.cse726 (select .cse729 .cse730)) (.cse727 (bvadd v_arrayElimCell_152 (_ bv4 32))) (.cse728 (select |c_#length| .cse730))) (or (= (select .cse726 |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|) |c_ULTIMATE.start_main_~data~0#1|) (not (bvule .cse727 .cse728)) (= (select .cse726 v_arrayElimCell_152) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse729 .cse23) v_arrayElimCell_152)) (not (bvule v_arrayElimCell_152 .cse727)) (not (bvule (bvadd v_arrayElimCell_152 (_ bv8 32)) .cse728)))))) (or .cse10 .cse711) .cse675))) (.cse103 (or .cse10 .cse710)) (.cse114 (forall ((v_arrayElimIndex_11 (_ BitVec 32))) (let ((.cse709 (select .cse26 v_arrayElimIndex_11))) (let ((.cse705 (bvadd (_ bv4294967292 32) v_arrayElimIndex_11)) (.cse704 (select |c_#length| .cse709))) (or (not (bvule v_arrayElimIndex_11 .cse704)) (not (bvule .cse705 v_arrayElimIndex_11)) (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse708 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593))) (let ((.cse706 (select .cse708 .cse709)) (.cse707 (select .cse708 .cse23))) (or (= (select .cse706 |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 .cse706 .cse705)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse707 .cse705)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse707 |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|)))))) (not (bvule (bvadd (_ bv4 32) v_arrayElimIndex_11) .cse704))))))) (.cse6 (or .cse144 (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimIndex_11 (_ BitVec 32))) (let ((.cse702 (select .cse26 v_arrayElimIndex_11))) (let ((.cse703 (bvadd (_ bv4294967292 32) v_arrayElimIndex_11)) (.cse700 (select |c_#length| .cse702)) (.cse701 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593))) (or (not (bvule v_arrayElimIndex_11 .cse700)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse701 .cse702) .cse703)) (not (bvule .cse703 v_arrayElimIndex_11)) (not (bvule (bvadd (_ bv4 32) v_arrayElimIndex_11) .cse700)) (= v_arrayElimIndex_11 |c_ULTIMATE.start_sll_prepend_~head#1.offset|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse701 .cse23) |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|)))))) .cse151)) (.cse8 (or .cse144 (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimIndex_11 (_ BitVec 32))) (let ((.cse698 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593)) (.cse699 (select .cse26 v_arrayElimIndex_11))) (let ((.cse696 (select .cse698 .cse699)) (.cse697 (bvadd (_ bv4294967292 32) v_arrayElimIndex_11)) (.cse695 (select |c_#length| .cse699))) (or (not (bvule v_arrayElimIndex_11 .cse695)) (= (select .cse696 |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 .cse696 .cse697)) (not (bvule .cse697 v_arrayElimIndex_11)) (not (bvule (bvadd (_ bv4 32) v_arrayElimIndex_11) .cse695)) (= v_arrayElimIndex_11 |c_ULTIMATE.start_sll_prepend_~head#1.offset|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse698 .cse23) |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|)))))) .cse151)) (.cse9 (forall ((v_arrayElimIndex_11 (_ BitVec 32))) (let ((.cse694 (select .cse26 v_arrayElimIndex_11))) (let ((.cse690 (bvadd (_ bv4294967292 32) v_arrayElimIndex_11)) (.cse689 (select |c_#length| .cse694))) (or (not (bvule v_arrayElimIndex_11 .cse689)) (not (bvule .cse690 v_arrayElimIndex_11)) (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse693 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593))) (let ((.cse691 (select .cse693 .cse694)) (.cse692 (select .cse693 .cse23))) (or (= (select .cse691 |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 .cse691 .cse690)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse692 .cse690)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse692 |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|)))))) (not (bvule (bvadd (_ bv4 32) v_arrayElimIndex_11) .cse689)) (= v_arrayElimIndex_11 |c_ULTIMATE.start_sll_prepend_~head#1.offset|)))))) (.cse16 (or .cse648 .cse12)) (.cse256 (let ((.cse665 (and (or (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimIndex_11 (_ BitVec 32)) (v_arrayElimCell_152 (_ BitVec 32))) (let ((.cse683 (select .cse26 v_arrayElimIndex_11))) (let ((.cse681 (bvadd v_arrayElimCell_152 (_ bv4 32))) (.cse682 (select |c_#length| .cse683))) (or (not (bvule .cse681 .cse682)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593) .cse683) v_arrayElimCell_152) |c_ULTIMATE.start_main_~data~0#1|) (not (bvule v_arrayElimCell_152 .cse681)) (= v_arrayElimIndex_11 |c_ULTIMATE.start_sll_prepend_~head#1.offset|) (not (bvule (bvadd v_arrayElimCell_152 (_ bv8 32)) .cse682)))))) .cse5) .cse684 (forall ((v_arrayElimIndex_11 (_ BitVec 32))) (or (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_152 (_ BitVec 32))) (let ((.cse688 (select .cse26 v_arrayElimIndex_11))) (let ((.cse685 (select (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593) .cse688)) (.cse686 (bvadd v_arrayElimCell_152 (_ bv4 32))) (.cse687 (select |c_#length| .cse688))) (or (= (select .cse685 |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|) |c_ULTIMATE.start_main_~data~0#1|) (not (bvule .cse686 .cse687)) (= (select .cse685 v_arrayElimCell_152) |c_ULTIMATE.start_main_~data~0#1|) (not (bvule v_arrayElimCell_152 .cse686)) (not (bvule (bvadd v_arrayElimCell_152 (_ bv8 32)) .cse687)))))) (= v_arrayElimIndex_11 |c_ULTIMATE.start_sll_prepend_~head#1.offset|))))) (.cse667 (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimIndex_11 (_ BitVec 32)) (v_arrayElimCell_152 (_ BitVec 32))) (let ((.cse679 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593)) (.cse680 (select .cse26 v_arrayElimIndex_11))) (let ((.cse676 (select .cse679 .cse680)) (.cse677 (bvadd v_arrayElimCell_152 (_ bv4 32))) (.cse678 (select |c_#length| .cse680))) (or (= (select .cse676 |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|) |c_ULTIMATE.start_main_~data~0#1|) (not (bvule .cse677 .cse678)) (= (select .cse676 v_arrayElimCell_152) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse679 .cse23) v_arrayElimCell_152)) (not (bvule v_arrayElimCell_152 .cse677)) (= v_arrayElimIndex_11 |c_ULTIMATE.start_sll_prepend_~head#1.offset|) (not (bvule (bvadd v_arrayElimCell_152 (_ bv8 32)) .cse678)))))))) (and (or .cse10 .cse665) (or .cse666 .cse5) (or .cse12 .cse665) (or .cse1 .cse667) .cse668 .cse157 (forall ((v_arrayElimIndex_11 (_ BitVec 32))) (or (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_152 (_ BitVec 32))) (let ((.cse674 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593)) (.cse673 (select .cse26 v_arrayElimIndex_11))) (let ((.cse669 (select .cse674 .cse673)) (.cse670 (bvadd v_arrayElimCell_152 (_ bv4 32))) (.cse672 (select .cse674 .cse23)) (.cse671 (select |c_#length| .cse673))) (or (= (select .cse669 |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|) |c_ULTIMATE.start_main_~data~0#1|) (not (bvule .cse670 .cse671)) (= (select .cse669 v_arrayElimCell_152) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse672 v_arrayElimCell_152)) (not (bvule v_arrayElimCell_152 .cse670)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse672 |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|)) (not (bvule (bvadd v_arrayElimCell_152 (_ bv8 32)) .cse671)))))) (= v_arrayElimIndex_11 |c_ULTIMATE.start_sll_prepend_~head#1.offset|))) .cse167 (or .cse667 .cse5) .cse675))) (.cse89 (or .cse1 .cse664)) (.cse152 (or .cse664 .cse5)) (.cse153 (or .cse654 .cse5)) (.cse92 (forall ((v_arrayElimIndex_11 (_ BitVec 32))) (let ((.cse662 (select .cse26 v_arrayElimIndex_11))) (let ((.cse660 (bvadd (_ bv4294967292 32) v_arrayElimIndex_11)) (.cse659 (select |c_#length| .cse662))) (or (not (bvule v_arrayElimIndex_11 .cse659)) (not (bvule .cse660 v_arrayElimIndex_11)) (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse661 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593))) (let ((.cse663 (select .cse661 .cse23))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse661 .cse662) .cse660)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse663 .cse660)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse663 |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|)))))) (not (bvule (bvadd (_ bv4 32) v_arrayElimIndex_11) .cse659)) (= v_arrayElimIndex_11 |c_ULTIMATE.start_sll_prepend_~head#1.offset|)))))) (.cse154 (or .cse144 (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimIndex_11 (_ BitVec 32)) (v_arrayElimCell_152 (_ BitVec 32))) (let ((.cse658 (select .cse26 v_arrayElimIndex_11))) (let ((.cse655 (bvadd v_arrayElimCell_152 (_ bv4 32))) (.cse657 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593)) (.cse656 (select |c_#length| .cse658))) (or (not (bvule .cse655 .cse656)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| v_arrayElimIndex_11) (= (select (select .cse657 .cse658) v_arrayElimCell_152) |c_ULTIMATE.start_main_~data~0#1|) (not (bvule v_arrayElimCell_152 .cse655)) (= v_arrayElimIndex_11 |c_ULTIMATE.start_sll_prepend_~head#1.offset|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse657 .cse23) |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|)) (not (bvule (bvadd v_arrayElimCell_152 (_ bv8 32)) .cse656)))))) .cse151)) (.cse155 (or .cse1 .cse654)) (.cse156 (or .cse144 (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 .cse26 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)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| v_arrayElimIndex_11) (= (select .cse649 v_arrayElimCell_152) |c_ULTIMATE.start_main_~data~0#1|) (not (bvule v_arrayElimCell_152 .cse650)) (= v_arrayElimIndex_11 |c_ULTIMATE.start_sll_prepend_~head#1.offset|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse652 .cse23) |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|)) (not (bvule (bvadd v_arrayElimCell_152 (_ bv8 32)) .cse651)))))) .cse151)) (.cse176 (or .cse10 .cse648)) (.cse126 (or .cse1 (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse647 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593))) (let ((.cse646 (select .cse647 .cse142))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse646 .cse143)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse647 .cse23) .cse143)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse646 |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|)))))))) (.cse127 (or .cse144 .cse542)) (.cse130 (or .cse320 .cse12)) (.cse131 (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse645 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593))) (let ((.cse643 (select .cse645 .cse142)) (.cse644 (select .cse645 .cse23))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse643 .cse143)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse644 .cse143)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse643 |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse644 |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|))))))) (.cse140 (or .cse10 .cse320)) (.cse257 (and (or .cse12 .cse136) .cse129 .cse499 .cse500 .cse501 .cse502 .cse503 .cse504)) (.cse139 (or .cse129 .cse144)) (.cse132 (or .cse1 .cse642)) (.cse415 (not (bvule (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_prepend_~head#1.offset|) .cse232))) (.cse416 (not (bvule .cse143 |c_ULTIMATE.start_sll_prepend_~head#1.offset|))) (.cse145 (and .cse128 .cse642)) (.cse417 (not (bvule |c_ULTIMATE.start_sll_prepend_~head#1.offset| .cse232))) (.cse55 (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse641))) (and (or .cse0 (let ((.cse158 (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimIndex_11 (_ BitVec 32)) (v_arrayElimCell_152 (_ BitVec 32))) (let ((.cse230 (select .cse26 v_arrayElimIndex_11))) (let ((.cse227 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593)) (.cse228 (bvadd v_arrayElimCell_152 (_ bv4 32))) (.cse229 (select |c_#length| .cse230))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse227 .cse23) (bvadd (_ bv4294967292 32) v_arrayElimIndex_11))) (not (bvule .cse228 .cse229)) (= v_arrayElimIndex_11 .cse25) (= (select (select .cse227 .cse230) v_arrayElimCell_152) |c_ULTIMATE.start_main_~data~0#1|) (not (bvule v_arrayElimCell_152 .cse228)) (= v_arrayElimIndex_11 |c_ULTIMATE.start_sll_prepend_~head#1.offset|) (not (bvule (bvadd v_arrayElimCell_152 (_ bv8 32)) .cse229))))))) (.cse115 (forall ((v_arrayElimIndex_11 (_ BitVec 32))) (let ((.cse226 (select .cse26 v_arrayElimIndex_11))) (let ((.cse224 (select |c_#length| .cse226)) (.cse225 (bvadd (_ bv4294967292 32) v_arrayElimIndex_11))) (or (not (bvule v_arrayElimIndex_11 .cse224)) (not (bvule .cse225 v_arrayElimIndex_11)) (not (bvule (bvadd (_ bv4 32) v_arrayElimIndex_11) .cse224)) (= v_arrayElimIndex_11 .cse25) (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) .cse226) .cse225))) (= v_arrayElimIndex_11 |c_ULTIMATE.start_sll_prepend_~head#1.offset|)))))) (.cse7 (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimIndex_11 (_ BitVec 32)) (v_arrayElimCell_152 (_ BitVec 32))) (let ((.cse223 (select .cse26 v_arrayElimIndex_11))) (let ((.cse220 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593)) (.cse221 (bvadd v_arrayElimCell_152 (_ bv4 32))) (.cse222 (select |c_#length| .cse223))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse220 .cse23) (bvadd (_ bv4294967292 32) v_arrayElimIndex_11))) (not (bvule .cse221 .cse222)) (= v_arrayElimIndex_11 .cse25) (= |c_ULTIMATE.start_main_~#s~0#1.offset| v_arrayElimIndex_11) (= (select (select .cse220 .cse223) v_arrayElimCell_152) |c_ULTIMATE.start_main_~data~0#1|) (not (bvule v_arrayElimCell_152 .cse221)) (= v_arrayElimIndex_11 |c_ULTIMATE.start_sll_prepend_~head#1.offset|) (not (bvule (bvadd v_arrayElimCell_152 (_ bv8 32)) .cse222))))))) (.cse4 (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimIndex_11 (_ BitVec 32))) (let ((.cse218 (select .cse26 v_arrayElimIndex_11))) (let ((.cse217 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593)) (.cse219 (bvadd (_ bv4294967292 32) v_arrayElimIndex_11)) (.cse216 (select |c_#length| .cse218))) (or (not (bvule v_arrayElimIndex_11 .cse216)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse217 .cse218) .cse219)) (not (bvule .cse219 v_arrayElimIndex_11)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse217 .cse23) .cse219)) (not (bvule (bvadd (_ bv4 32) v_arrayElimIndex_11) .cse216)) (= v_arrayElimIndex_11 .cse25) (= v_arrayElimIndex_11 |c_ULTIMATE.start_sll_prepend_~head#1.offset|))))))) (let ((.cse11 (and .cse213 .cse214 .cse215)) (.cse3 (forall ((v_arrayElimIndex_11 (_ BitVec 32))) (let ((.cse211 (select .cse26 v_arrayElimIndex_11))) (let ((.cse209 (bvadd (_ bv4294967292 32) v_arrayElimIndex_11)) (.cse208 (select |c_#length| .cse211))) (or (not (bvule v_arrayElimIndex_11 .cse208)) (not (bvule .cse209 v_arrayElimIndex_11)) (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse210 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593))) (let ((.cse212 (select .cse210 .cse23))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse210 .cse211) .cse209)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse212 .cse209)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse212 |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|)))))) (not (bvule (bvadd (_ bv4 32) v_arrayElimIndex_11) .cse208)) (= v_arrayElimIndex_11 .cse25) (= v_arrayElimIndex_11 |c_ULTIMATE.start_sll_prepend_~head#1.offset|)))))) (.cse14 (or .cse1 .cse4)) (.cse15 (or .cse1 .cse7)) (.cse17 (forall ((v_arrayElimIndex_11 (_ BitVec 32))) (or (= v_arrayElimIndex_11 .cse25) (= |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 ((.cse207 (select .cse26 v_arrayElimIndex_11)) (.cse206 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593))) (let ((.cse204 (bvadd v_arrayElimCell_152 (_ bv4 32))) (.cse203 (select .cse206 .cse23)) (.cse205 (select |c_#length| .cse207))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse203 (bvadd (_ bv4294967292 32) v_arrayElimIndex_11))) (not (bvule .cse204 .cse205)) (= (select (select .cse206 .cse207) v_arrayElimCell_152) |c_ULTIMATE.start_main_~data~0#1|) (not (bvule v_arrayElimCell_152 .cse204)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse203 |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|)) (not (bvule (bvadd v_arrayElimCell_152 (_ bv8 32)) .cse205)))))) (= v_arrayElimIndex_11 |c_ULTIMATE.start_sll_prepend_~head#1.offset|)))) (.cse27 (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimIndex_11 (_ BitVec 32)) (v_arrayElimCell_152 (_ BitVec 32))) (let ((.cse199 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593)) (.cse202 (select .cse26 v_arrayElimIndex_11))) (let ((.cse198 (select .cse199 .cse202)) (.cse200 (bvadd v_arrayElimCell_152 (_ bv4 32))) (.cse201 (select |c_#length| .cse202))) (or (= (select .cse198 |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 .cse199 .cse23) (bvadd (_ bv4294967292 32) v_arrayElimIndex_11))) (not (bvule .cse200 .cse201)) (= v_arrayElimIndex_11 .cse25) (= |c_ULTIMATE.start_main_~#s~0#1.offset| v_arrayElimIndex_11) (= (select .cse198 v_arrayElimCell_152) |c_ULTIMATE.start_main_~data~0#1|) (not (bvule v_arrayElimCell_152 .cse200)) (= v_arrayElimIndex_11 |c_ULTIMATE.start_sll_prepend_~head#1.offset|) (not (bvule (bvadd v_arrayElimCell_152 (_ bv8 32)) .cse201))))))) (.cse13 (and (or .cse193 .cse5) .cse115 (forall ((v_arrayElimIndex_11 (_ BitVec 32))) (let ((.cse197 (select .cse26 v_arrayElimIndex_11))) (let ((.cse195 (bvadd (_ bv4294967292 32) v_arrayElimIndex_11)) (.cse194 (select |c_#length| .cse197))) (or (not (bvule v_arrayElimIndex_11 .cse194)) (not (bvule .cse195 v_arrayElimIndex_11)) (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse196 (select (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593) .cse197))) (or (= (select .cse196 |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 .cse196 .cse195))))) (not (bvule (bvadd (_ bv4 32) v_arrayElimIndex_11) .cse194)) (= v_arrayElimIndex_11 .cse25) (= v_arrayElimIndex_11 |c_ULTIMATE.start_sll_prepend_~head#1.offset|))))))) (.cse28 (forall ((v_arrayElimIndex_11 (_ BitVec 32))) (or (= v_arrayElimIndex_11 .cse25) (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_152 (_ BitVec 32))) (let ((.cse192 (select .cse26 v_arrayElimIndex_11)) (.cse191 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593))) (let ((.cse189 (bvadd v_arrayElimCell_152 (_ bv4 32))) (.cse188 (select .cse191 .cse23)) (.cse190 (select |c_#length| .cse192))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse188 (bvadd (_ bv4294967292 32) v_arrayElimIndex_11))) (not (bvule .cse189 .cse190)) (= (select (select .cse191 .cse192) v_arrayElimCell_152) |c_ULTIMATE.start_main_~data~0#1|) (not (bvule v_arrayElimCell_152 .cse189)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse188 |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|)) (not (bvule (bvadd v_arrayElimCell_152 (_ bv8 32)) .cse190)))))) (= v_arrayElimIndex_11 |c_ULTIMATE.start_sll_prepend_~head#1.offset|)))) (.cse49 (or .cse158 .cse1)) (.cse2 (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimIndex_11 (_ BitVec 32))) (let ((.cse186 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593)) (.cse187 (select .cse26 v_arrayElimIndex_11))) (let ((.cse184 (select .cse186 .cse187)) (.cse185 (bvadd (_ bv4294967292 32) v_arrayElimIndex_11)) (.cse183 (select |c_#length| .cse187))) (or (not (bvule v_arrayElimIndex_11 .cse183)) (= (select .cse184 |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 .cse184 .cse185)) (not (bvule .cse185 v_arrayElimIndex_11)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse186 .cse23) .cse185)) (not (bvule (bvadd (_ bv4 32) v_arrayElimIndex_11) .cse183)) (= v_arrayElimIndex_11 .cse25) (= v_arrayElimIndex_11 |c_ULTIMATE.start_sll_prepend_~head#1.offset|))))))) (and (or .cse1 .cse2) .cse3 (or .cse4 .cse5) .cse6 (or .cse7 .cse5) .cse8 .cse9 (or .cse10 .cse11) (or .cse12 .cse13) .cse14 .cse15 .cse16 (or .cse12 .cse11) .cse17 (forall ((v_arrayElimIndex_11 (_ BitVec 32))) (let ((.cse24 (select .cse26 v_arrayElimIndex_11))) (let ((.cse19 (bvadd (_ bv4294967292 32) v_arrayElimIndex_11)) (.cse18 (select |c_#length| .cse24))) (or (not (bvule v_arrayElimIndex_11 .cse18)) (not (bvule .cse19 v_arrayElimIndex_11)) (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse22 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593))) (let ((.cse20 (select .cse22 .cse24)) (.cse21 (select .cse22 .cse23))) (or (= (select .cse20 |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 .cse20 .cse19)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse21 .cse19)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse21 |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|)))))) (not (bvule (bvadd (_ bv4 32) v_arrayElimIndex_11) .cse18)) (= v_arrayElimIndex_11 .cse25) (= v_arrayElimIndex_11 |c_ULTIMATE.start_sll_prepend_~head#1.offset|))))) (or .cse27 .cse5) (or (let ((.cse91 (and .cse115 (forall ((v_arrayElimIndex_11 (_ BitVec 32))) (let ((.cse118 (select .cse26 v_arrayElimIndex_11))) (let ((.cse116 (select |c_#length| .cse118)) (.cse117 (bvadd (_ bv4294967292 32) v_arrayElimIndex_11))) (or (not (bvule v_arrayElimIndex_11 .cse116)) (not (bvule .cse117 v_arrayElimIndex_11)) (not (bvule (bvadd (_ bv4 32) v_arrayElimIndex_11) .cse116)) (= v_arrayElimIndex_11 .cse25) (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) .cse118) .cse117))))))) (forall ((v_arrayElimIndex_11 (_ BitVec 32))) (let ((.cse122 (select .cse26 v_arrayElimIndex_11))) (let ((.cse120 (bvadd (_ bv4294967292 32) v_arrayElimIndex_11)) (.cse119 (select |c_#length| .cse122))) (or (not (bvule v_arrayElimIndex_11 .cse119)) (not (bvule .cse120 v_arrayElimIndex_11)) (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse121 (select (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593) .cse122))) (or (= (select .cse121 |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 .cse121 .cse120))))) (not (bvule (bvadd (_ bv4 32) v_arrayElimIndex_11) .cse119)) (= v_arrayElimIndex_11 .cse25)))))))) (and (or (and .cse28 (forall ((v_arrayElimIndex_11 (_ BitVec 32))) (or (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_152 (_ BitVec 32))) (let ((.cse32 (select .cse26 v_arrayElimIndex_11))) (let ((.cse29 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593)) (.cse30 (bvadd v_arrayElimCell_152 (_ bv4 32))) (.cse31 (select |c_#length| .cse32))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse29 .cse23) (bvadd (_ bv4294967292 32) v_arrayElimIndex_11))) (not (bvule .cse30 .cse31)) (= (select (select .cse29 .cse32) v_arrayElimCell_152) |c_ULTIMATE.start_main_~data~0#1|) (not (bvule v_arrayElimCell_152 .cse30)) (not (bvule (bvadd v_arrayElimCell_152 (_ bv8 32)) .cse31)))))) (= v_arrayElimIndex_11 .cse25))) (forall ((v_arrayElimIndex_11 (_ BitVec 32))) (or (= v_arrayElimIndex_11 .cse25) (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_152 (_ BitVec 32))) (let ((.cse38 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593)) (.cse37 (select .cse26 v_arrayElimIndex_11))) (let ((.cse33 (select .cse38 .cse37)) (.cse35 (bvadd v_arrayElimCell_152 (_ bv4 32))) (.cse34 (select .cse38 .cse23)) (.cse36 (select |c_#length| .cse37))) (or (= (select .cse33 |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 .cse34 (bvadd (_ bv4294967292 32) v_arrayElimIndex_11))) (not (bvule .cse35 .cse36)) (= (select .cse33 v_arrayElimCell_152) |c_ULTIMATE.start_main_~data~0#1|) (not (bvule v_arrayElimCell_152 .cse35)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse34 |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|)) (not (bvule (bvadd v_arrayElimCell_152 (_ bv8 32)) .cse36)))))))) (forall ((v_arrayElimIndex_11 (_ BitVec 32))) (or (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_152 (_ BitVec 32))) (let ((.cse42 (select .cse26 v_arrayElimIndex_11))) (let ((.cse39 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593)) (.cse40 (bvadd v_arrayElimCell_152 (_ bv4 32))) (.cse41 (select |c_#length| .cse42))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse39 .cse23) (bvadd (_ bv4294967292 32) v_arrayElimIndex_11))) (not (bvule .cse40 .cse41)) (= (select (select .cse39 .cse42) v_arrayElimCell_152) |c_ULTIMATE.start_main_~data~0#1|) (not (bvule v_arrayElimCell_152 .cse40)) (not (bvule (bvadd v_arrayElimCell_152 (_ bv8 32)) .cse41)))))) (= v_arrayElimIndex_11 .cse25) (= v_arrayElimIndex_11 |c_ULTIMATE.start_sll_prepend_~head#1.offset|))) (forall ((v_arrayElimIndex_11 (_ BitVec 32))) (or (= v_arrayElimIndex_11 .cse25) (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_152 (_ BitVec 32))) (let ((.cse44 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593)) (.cse47 (select .cse26 v_arrayElimIndex_11))) (let ((.cse43 (select .cse44 .cse47)) (.cse45 (bvadd v_arrayElimCell_152 (_ bv4 32))) (.cse46 (select |c_#length| .cse47))) (or (= (select .cse43 |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 .cse44 .cse23) (bvadd (_ bv4294967292 32) v_arrayElimIndex_11))) (not (bvule .cse45 .cse46)) (= (select .cse43 v_arrayElimCell_152) |c_ULTIMATE.start_main_~data~0#1|) (not (bvule v_arrayElimCell_152 .cse45)) (not (bvule (bvadd v_arrayElimCell_152 (_ bv8 32)) .cse46)))))))) (or .cse48 .cse12) (or .cse10 .cse48) .cse49 (or .cse1 (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimIndex_11 (_ BitVec 32)) (v_arrayElimCell_152 (_ BitVec 32))) (let ((.cse51 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593)) (.cse54 (select .cse26 v_arrayElimIndex_11))) (let ((.cse50 (select .cse51 .cse54)) (.cse52 (bvadd v_arrayElimCell_152 (_ bv4 32))) (.cse53 (select |c_#length| .cse54))) (or (= (select .cse50 |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 .cse51 .cse23) (bvadd (_ bv4294967292 32) v_arrayElimIndex_11))) (not (bvule .cse52 .cse53)) (= v_arrayElimIndex_11 .cse25) (= (select .cse50 v_arrayElimCell_152) |c_ULTIMATE.start_main_~data~0#1|) (not (bvule v_arrayElimCell_152 .cse52)) (not (bvule (bvadd v_arrayElimCell_152 (_ bv8 32)) .cse53)))))))) .cse55) .cse56 .cse3 .cse57 (forall ((v_arrayElimIndex_11 (_ BitVec 32))) (or (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_152 (_ BitVec 32))) (let ((.cse61 (select .cse26 v_arrayElimIndex_11))) (let ((.cse58 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593)) (.cse59 (bvadd v_arrayElimCell_152 (_ bv4 32))) (.cse60 (select |c_#length| .cse61))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse58 .cse23) (bvadd (_ bv4294967292 32) v_arrayElimIndex_11))) (not (bvule .cse59 .cse60)) (= (select (select .cse58 .cse61) v_arrayElimCell_152) |c_ULTIMATE.start_main_~data~0#1|) (not (bvule v_arrayElimCell_152 .cse59)) (not (bvule (bvadd v_arrayElimCell_152 (_ bv8 32)) .cse60)))))) (= v_arrayElimIndex_11 .cse25) (= |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 ((.cse65 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593)) (.cse66 (select .cse26 v_arrayElimIndex_11))) (let ((.cse63 (select .cse65 .cse66)) (.cse64 (bvadd (_ bv4294967292 32) v_arrayElimIndex_11)) (.cse62 (select |c_#length| .cse66))) (or (not (bvule v_arrayElimIndex_11 .cse62)) (= (select .cse63 |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 .cse63 .cse64)) (not (bvule .cse64 v_arrayElimIndex_11)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse65 .cse23) .cse64)) (not (bvule (bvadd (_ bv4 32) v_arrayElimIndex_11) .cse62)) (= v_arrayElimIndex_11 .cse25))))) .cse1) (or .cse12 .cse67) (or .cse1 (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimIndex_11 (_ BitVec 32)) (v_arrayElimCell_152 (_ BitVec 32))) (let ((.cse69 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593)) (.cse72 (select .cse26 v_arrayElimIndex_11))) (let ((.cse68 (select .cse69 .cse72)) (.cse70 (bvadd v_arrayElimCell_152 (_ bv4 32))) (.cse71 (select |c_#length| .cse72))) (or (= (select .cse68 |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 .cse69 .cse23) (bvadd (_ bv4294967292 32) v_arrayElimIndex_11))) (not (bvule .cse70 .cse71)) (= v_arrayElimIndex_11 .cse25) (= |c_ULTIMATE.start_main_~#s~0#1.offset| v_arrayElimIndex_11) (= (select .cse68 v_arrayElimCell_152) |c_ULTIMATE.start_main_~data~0#1|) (not (bvule v_arrayElimCell_152 .cse70)) (not (bvule (bvadd v_arrayElimCell_152 (_ bv8 32)) .cse71))))))) .cse14 (forall ((v_arrayElimIndex_11 (_ BitVec 32))) (let ((.cse77 (select .cse26 v_arrayElimIndex_11))) (let ((.cse73 (select |c_#length| .cse77)) (.cse74 (bvadd (_ bv4294967292 32) v_arrayElimIndex_11))) (or (not (bvule v_arrayElimIndex_11 .cse73)) (not (bvule .cse74 v_arrayElimIndex_11)) (not (bvule (bvadd (_ bv4 32) v_arrayElimIndex_11) .cse73)) (= v_arrayElimIndex_11 .cse25) (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse76 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593))) (let ((.cse75 (select .cse76 .cse77))) (or (= (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 .cse74)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse76 .cse23) .cse74)))))))))) (forall ((v_arrayElimIndex_11 (_ BitVec 32))) (let ((.cse80 (select .cse26 v_arrayElimIndex_11))) (let ((.cse81 (bvadd (_ bv4294967292 32) v_arrayElimIndex_11)) (.cse78 (select |c_#length| .cse80))) (or (not (bvule v_arrayElimIndex_11 .cse78)) (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse79 (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 .cse79 .cse80) .cse81)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse79 .cse23) .cse81))))) (not (bvule .cse81 v_arrayElimIndex_11)) (not (bvule (bvadd (_ bv4 32) v_arrayElimIndex_11) .cse78)) (= v_arrayElimIndex_11 .cse25) (= v_arrayElimIndex_11 |c_ULTIMATE.start_sll_prepend_~head#1.offset|))))) .cse82 .cse15 .cse83 .cse17 (forall ((v_arrayElimIndex_11 (_ BitVec 32))) (or (= v_arrayElimIndex_11 .cse25) (= |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 ((.cse85 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593)) (.cse88 (select .cse26 v_arrayElimIndex_11))) (let ((.cse84 (select .cse85 .cse88)) (.cse86 (bvadd v_arrayElimCell_152 (_ bv4 32))) (.cse87 (select |c_#length| .cse88))) (or (= (select .cse84 |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 .cse85 .cse23) (bvadd (_ bv4294967292 32) v_arrayElimIndex_11))) (not (bvule .cse86 .cse87)) (= (select .cse84 v_arrayElimCell_152) |c_ULTIMATE.start_main_~data~0#1|) (not (bvule v_arrayElimCell_152 .cse86)) (not (bvule (bvadd v_arrayElimCell_152 (_ bv8 32)) .cse87)))))))) .cse89 .cse90 (or .cse10 .cse91) .cse92 (or .cse91 .cse12) (forall ((v_arrayElimIndex_11 (_ BitVec 32))) (let ((.cse98 (select .cse26 v_arrayElimIndex_11))) (let ((.cse94 (bvadd (_ bv4294967292 32) v_arrayElimIndex_11)) (.cse93 (select |c_#length| .cse98))) (or (not (bvule v_arrayElimIndex_11 .cse93)) (not (bvule .cse94 v_arrayElimIndex_11)) (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse97 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593))) (let ((.cse95 (select .cse97 .cse98)) (.cse96 (select .cse97 .cse23))) (or (= (select .cse95 |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 .cse95 .cse94)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse96 .cse94)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse96 |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|)))))) (not (bvule (bvadd (_ bv4 32) v_arrayElimIndex_11) .cse93)) (= v_arrayElimIndex_11 .cse25))))) (forall ((v_arrayElimIndex_11 (_ BitVec 32))) (let ((.cse101 (select .cse26 v_arrayElimIndex_11))) (let ((.cse102 (bvadd (_ bv4294967292 32) v_arrayElimIndex_11)) (.cse99 (select |c_#length| .cse101))) (or (not (bvule v_arrayElimIndex_11 .cse99)) (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse100 (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 .cse100 .cse101) .cse102)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse100 .cse23) .cse102))))) (not (bvule .cse102 v_arrayElimIndex_11)) (not (bvule (bvadd (_ bv4 32) v_arrayElimIndex_11) .cse99)) (= v_arrayElimIndex_11 .cse25))))) .cse103 (forall ((v_arrayElimIndex_11 (_ BitVec 32))) (or (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_152 (_ BitVec 32))) (let ((.cse107 (select .cse26 v_arrayElimIndex_11))) (let ((.cse104 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593)) (.cse105 (bvadd v_arrayElimCell_152 (_ bv4 32))) (.cse106 (select |c_#length| .cse107))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse104 .cse23) (bvadd (_ bv4294967292 32) v_arrayElimIndex_11))) (not (bvule .cse105 .cse106)) (= (select (select .cse104 .cse107) v_arrayElimCell_152) |c_ULTIMATE.start_main_~data~0#1|) (not (bvule v_arrayElimCell_152 .cse105)) (not (bvule (bvadd v_arrayElimCell_152 (_ bv8 32)) .cse106)))))) (= v_arrayElimIndex_11 .cse25) (= |c_ULTIMATE.start_main_~#s~0#1.offset| v_arrayElimIndex_11))) (or .cse10 .cse67) (forall ((v_arrayElimIndex_11 (_ BitVec 32))) (or (= v_arrayElimIndex_11 .cse25) (= |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 ((.cse113 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593)) (.cse112 (select .cse26 v_arrayElimIndex_11))) (let ((.cse108 (select .cse113 .cse112)) (.cse110 (bvadd v_arrayElimCell_152 (_ bv4 32))) (.cse109 (select .cse113 .cse23)) (.cse111 (select |c_#length| .cse112))) (or (= (select .cse108 |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 .cse109 (bvadd (_ bv4294967292 32) v_arrayElimIndex_11))) (not (bvule .cse110 .cse111)) (= (select .cse108 v_arrayElimCell_152) |c_ULTIMATE.start_main_~data~0#1|) (not (bvule v_arrayElimCell_152 .cse110)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse109 |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|)) (not (bvule (bvadd v_arrayElimCell_152 (_ bv8 32)) .cse111)))))))) .cse114)) .cse5) .cse89 (or .cse123 (let ((.cse134 (or .cse124 (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_152 (_ BitVec 32))) (let ((.cse150 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593))) (let ((.cse149 (select .cse150 .cse142))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse149 v_arrayElimCell_152)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse150 .cse23) .cse143)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse149 |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|)))))))) (.cse135 (or .cse124 .cse136)) (.cse137 (or .cse124 (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_152 (_ BitVec 32))) (let ((.cse148 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593))) (let ((.cse146 (select .cse148 .cse142)) (.cse147 (select .cse148 .cse23))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse146 v_arrayElimCell_152)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse147 .cse143)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse146 |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse147 |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|)))))))) (.cse138 (or .cse124 .cse145)) (.cse141 (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) .cse142) .cse143))) .cse144))) (and (or (and (or .cse124 .cse125 (and .cse126 .cse127 .cse128 .cse129 .cse130 .cse131 .cse132 .cse133)) (or (and .cse134 .cse135 (or .cse124 .cse12 .cse136) .cse137 .cse138) .cse1 .cse125)) .cse55) (or (and .cse126 .cse128 .cse139 .cse130 .cse131 .cse140 .cse132 .cse141) .cse124 .cse125) (or (and (or .cse1 .cse125 (and .cse134 (or .cse10 .cse124 .cse136) .cse135 .cse137 .cse138)) (or (and .cse126 .cse128 .cse129 .cse131 .cse140 .cse132 .cse141 .cse133) .cse124 .cse125)) .cse12))) .cse151) .cse152 (or .cse1 .cse27) .cse153 .cse92 .cse154 .cse155 .cse156 (or .cse10 .cse13) (or .cse55 (let ((.cse160 (and .cse173 .cse174 .cse175)) (.cse159 (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimIndex_11 (_ BitVec 32)) (v_arrayElimCell_152 (_ BitVec 32))) (let ((.cse169 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593)) (.cse172 (select .cse26 v_arrayElimIndex_11))) (let ((.cse168 (select .cse169 .cse172)) (.cse170 (bvadd v_arrayElimCell_152 (_ bv4 32))) (.cse171 (select |c_#length| .cse172))) (or (= (select .cse168 |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 .cse169 .cse23) (bvadd (_ bv4294967292 32) v_arrayElimIndex_11))) (not (bvule .cse170 .cse171)) (= v_arrayElimIndex_11 .cse25) (= (select .cse168 v_arrayElimCell_152) |c_ULTIMATE.start_main_~data~0#1|) (not (bvule v_arrayElimCell_152 .cse170)) (= v_arrayElimIndex_11 |c_ULTIMATE.start_sll_prepend_~head#1.offset|) (not (bvule (bvadd v_arrayElimCell_152 (_ bv8 32)) .cse171)))))))) (and .cse157 .cse28 (or .cse158 .cse5) (or .cse159 .cse5) (or .cse12 .cse160) .cse49 (forall ((v_arrayElimIndex_11 (_ BitVec 32))) (or (= v_arrayElimIndex_11 .cse25) (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_152 (_ BitVec 32))) (let ((.cse166 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593)) (.cse165 (select .cse26 v_arrayElimIndex_11))) (let ((.cse161 (select .cse166 .cse165)) (.cse163 (bvadd v_arrayElimCell_152 (_ bv4 32))) (.cse162 (select .cse166 .cse23)) (.cse164 (select |c_#length| .cse165))) (or (= (select .cse161 |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 .cse162 (bvadd (_ bv4294967292 32) v_arrayElimIndex_11))) (not (bvule .cse163 .cse164)) (= (select .cse161 v_arrayElimCell_152) |c_ULTIMATE.start_main_~data~0#1|) (not (bvule v_arrayElimCell_152 .cse163)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse162 |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|)) (not (bvule (bvadd v_arrayElimCell_152 (_ bv8 32)) .cse164)))))) (= v_arrayElimIndex_11 |c_ULTIMATE.start_sll_prepend_~head#1.offset|))) .cse167 (or .cse10 .cse160) (or .cse1 .cse159)))) (or .cse2 .cse5) .cse176 (forall ((v_arrayElimIndex_11 (_ BitVec 32))) (or (= v_arrayElimIndex_11 .cse25) (= |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 ((.cse182 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593)) (.cse181 (select .cse26 v_arrayElimIndex_11))) (let ((.cse177 (select .cse182 .cse181)) (.cse179 (bvadd v_arrayElimCell_152 (_ bv4 32))) (.cse178 (select .cse182 .cse23)) (.cse180 (select |c_#length| .cse181))) (or (= (select .cse177 |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 .cse178 (bvadd (_ bv4294967292 32) v_arrayElimIndex_11))) (not (bvule .cse179 .cse180)) (= (select .cse177 v_arrayElimCell_152) |c_ULTIMATE.start_main_~data~0#1|) (not (bvule v_arrayElimCell_152 .cse179)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse178 |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|)) (not (bvule (bvadd v_arrayElimCell_152 (_ bv8 32)) .cse180)))))) (= v_arrayElimIndex_11 |c_ULTIMATE.start_sll_prepend_~head#1.offset|))))))) (or (let ((.cse237 (forall ((v_arrayElimIndex_11 (_ BitVec 32))) (or (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_152 (_ BitVec 32))) (let ((.cse263 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593)) (.cse264 (bvadd v_arrayElimCell_152 (_ bv4 32)))) (or (not (bvule (bvadd v_arrayElimCell_152 (_ bv8 32)) .cse232)) (= (select (select .cse263 (select .cse26 v_arrayElimIndex_11)) v_arrayElimCell_152) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse263 .cse23) v_arrayElimCell_152)) (not (bvule .cse264 .cse232)) (not (bvule v_arrayElimCell_152 .cse264))))) (= v_arrayElimIndex_11 |c_ULTIMATE.start_sll_prepend_~head#1.offset|)))) (.cse239 (forall ((v_arrayElimIndex_11 (_ BitVec 32))) (or (forall ((v_arrayElimCell_152 (_ BitVec 32))) (let ((.cse262 (bvadd v_arrayElimCell_152 (_ bv4 32)))) (or (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse260 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593))) (let ((.cse261 (select .cse260 .cse23))) (or (= (select (select .cse260 (select .cse26 v_arrayElimIndex_11)) v_arrayElimCell_152) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse261 v_arrayElimCell_152)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse261 |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|)))))) (not (bvule (bvadd v_arrayElimCell_152 (_ bv8 32)) .cse232)) (not (bvule .cse262 .cse232)) (not (bvule v_arrayElimCell_152 .cse262))))) (= v_arrayElimIndex_11 |c_ULTIMATE.start_sll_prepend_~head#1.offset|))))) (and (or (and (or (and .cse231 (forall ((v_arrayElimIndex_11 (_ BitVec 32)) (v_arrayElimCell_152 (_ BitVec 32))) (let ((.cse233 (bvadd v_arrayElimCell_152 (_ bv4 32)))) (or (not (bvule (bvadd v_arrayElimCell_152 (_ bv8 32)) .cse232)) (not (bvule .cse233 .cse232)) (not (bvule v_arrayElimCell_152 .cse233)) (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse236 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593))) (let ((.cse234 (select .cse236 (select .cse26 v_arrayElimIndex_11))) (.cse235 (select .cse236 .cse23))) (or (= (select .cse234 |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|) |c_ULTIMATE.start_main_~data~0#1|) (= (select .cse234 v_arrayElimCell_152) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse235 v_arrayElimCell_152)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse235 |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|))))))))) .cse237 .cse238 .cse239 .cse240 (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimIndex_11 (_ BitVec 32)) (v_arrayElimCell_152 (_ BitVec 32))) (let ((.cse241 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593)) (.cse242 (bvadd v_arrayElimCell_152 (_ bv4 32)))) (or (not (bvule (bvadd v_arrayElimCell_152 (_ bv8 32)) .cse232)) (= (select (select .cse241 (select .cse26 v_arrayElimIndex_11)) v_arrayElimCell_152) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse241 .cse23) v_arrayElimCell_152)) (not (bvule .cse242 .cse232)) (not (bvule v_arrayElimCell_152 .cse242)))))) .cse243 .cse244) (or .cse0 .cse245)) .cse5) (or (and (forall ((v_arrayElimIndex_11 (_ BitVec 32))) (or (forall ((v_arrayElimCell_152 (_ BitVec 32))) (let ((.cse246 (bvadd v_arrayElimCell_152 (_ bv4 32)))) (or (not (bvule (bvadd v_arrayElimCell_152 (_ bv8 32)) .cse232)) (not (bvule .cse246 .cse232)) (not (bvule v_arrayElimCell_152 .cse246)) (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse249 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593))) (let ((.cse247 (select .cse249 (select .cse26 v_arrayElimIndex_11))) (.cse248 (select .cse249 .cse23))) (or (= (select .cse247 |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|) |c_ULTIMATE.start_main_~data~0#1|) (= (select .cse247 v_arrayElimCell_152) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse248 v_arrayElimCell_152)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse248 |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 ((.cse251 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593))) (let ((.cse250 (select .cse251 (select .cse26 v_arrayElimIndex_11))) (.cse252 (bvadd v_arrayElimCell_152 (_ bv4 32)))) (or (= (select .cse250 |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)) .cse232)) (= (select .cse250 v_arrayElimCell_152) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse251 .cse23) v_arrayElimCell_152)) (not (bvule .cse252 .cse232)) (not (bvule v_arrayElimCell_152 .cse252)))))) (= 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 ((.cse254 (bvadd v_arrayElimCell_152 (_ bv4 32))) (.cse253 (select (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593) .cse23))) (or (not (bvule (bvadd v_arrayElimCell_152 (_ bv8 32)) .cse232)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse253 v_arrayElimCell_152)) (not (bvule .cse254 .cse232)) (not (bvule v_arrayElimCell_152 .cse254)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse253 |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|))))) .cse237 .cse239 (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_152 (_ BitVec 32))) (let ((.cse255 (bvadd v_arrayElimCell_152 (_ bv4 32)))) (or (not (bvule (bvadd v_arrayElimCell_152 (_ bv8 32)) .cse232)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593) .cse23) v_arrayElimCell_152)) (not (bvule .cse255 .cse232)) (not (bvule v_arrayElimCell_152 .cse255)))))) .cse243 .cse244) (or .cse0 .cse256) (or .cse124 .cse123 .cse125 .cse257 .cse151) .cse258 .cse259)) .cse55) (or (and (or .cse0 (let ((.cse286 (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimIndex_11 (_ BitVec 32)) (v_arrayElimCell_151 (_ BitVec 32))) (let ((.cse328 (select .cse26 v_arrayElimIndex_11))) (let ((.cse327 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593)) (.cse329 (bvadd (_ bv4294967292 32) v_arrayElimIndex_11)) (.cse326 (select |c_#length| .cse328))) (or (not (bvule v_arrayElimIndex_11 .cse326)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse327 .cse23) v_arrayElimCell_151)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse327 .cse328) .cse329)) (not (bvule .cse329 v_arrayElimIndex_11)) (not (bvule (bvadd (_ bv4 32) v_arrayElimIndex_11) .cse326)) (= v_arrayElimIndex_11 .cse25) (= v_arrayElimIndex_11 |c_ULTIMATE.start_sll_prepend_~head#1.offset|)))))) (.cse287 (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_151 (_ BitVec 32))) (let ((.cse321 (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 .cse321 .cse23) v_arrayElimCell_151)) (forall ((v_arrayElimIndex_11 (_ BitVec 32))) (let ((.cse325 (select .cse26 v_arrayElimIndex_11))) (let ((.cse323 (select .cse321 .cse325)) (.cse324 (bvadd (_ bv4294967292 32) v_arrayElimIndex_11)) (.cse322 (select |c_#length| .cse325))) (or (not (bvule v_arrayElimIndex_11 .cse322)) (= (select .cse323 |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 .cse323 .cse324)) (not (bvule .cse324 v_arrayElimIndex_11)) (not (bvule (bvadd (_ bv4 32) v_arrayElimIndex_11) .cse322)) (= v_arrayElimIndex_11 .cse25) (= v_arrayElimIndex_11 |c_ULTIMATE.start_sll_prepend_~head#1.offset|))))))))) (.cse293 (and (or (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimIndex_11 (_ BitVec 32))) (let ((.cse312 (select .cse26 v_arrayElimIndex_11))) (let ((.cse310 (select (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593) .cse312)) (.cse311 (bvadd (_ bv4294967292 32) v_arrayElimIndex_11)) (.cse309 (select |c_#length| .cse312))) (or (not (bvule v_arrayElimIndex_11 .cse309)) (= (select .cse310 |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 .cse310 .cse311)) (not (bvule .cse311 v_arrayElimIndex_11)) (not (bvule (bvadd (_ bv4 32) v_arrayElimIndex_11) .cse309)) (= v_arrayElimIndex_11 .cse25))))) .cse5) .cse193 (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimIndex_11 (_ BitVec 32))) (let ((.cse316 (select .cse26 v_arrayElimIndex_11))) (let ((.cse314 (select (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593) .cse316)) (.cse315 (bvadd (_ bv4294967292 32) v_arrayElimIndex_11)) (.cse313 (select |c_#length| .cse316))) (or (not (bvule v_arrayElimIndex_11 .cse313)) (= (select .cse314 |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 .cse314 .cse315)) (not (bvule .cse315 v_arrayElimIndex_11)) (not (bvule (bvadd (_ bv4 32) v_arrayElimIndex_11) .cse313)) (= v_arrayElimIndex_11 .cse25) (= v_arrayElimIndex_11 |c_ULTIMATE.start_sll_prepend_~head#1.offset|))))) (or (and .cse193 (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimIndex_11 (_ BitVec 32))) (let ((.cse318 (select .cse26 v_arrayElimIndex_11))) (let ((.cse319 (bvadd (_ bv4294967292 32) v_arrayElimIndex_11)) (.cse317 (select |c_#length| .cse318))) (or (not (bvule v_arrayElimIndex_11 .cse317)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593) .cse318) .cse319)) (not (bvule .cse319 v_arrayElimIndex_11)) (not (bvule (bvadd (_ bv4 32) v_arrayElimIndex_11) .cse317)) (= v_arrayElimIndex_11 .cse25)))))) .cse5) (or .cse124 .cse123 .cse1 .cse320 .cse125 .cse151)))) (and (forall ((v_arrayElimIndex_11 (_ BitVec 32))) (let ((.cse269 (select .cse26 v_arrayElimIndex_11))) (let ((.cse265 (select |c_#length| .cse269)) (.cse266 (bvadd (_ bv4294967292 32) v_arrayElimIndex_11))) (or (not (bvule v_arrayElimIndex_11 .cse265)) (not (bvule .cse266 v_arrayElimIndex_11)) (not (bvule (bvadd (_ bv4 32) v_arrayElimIndex_11) .cse265)) (= v_arrayElimIndex_11 .cse25) (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_151 (_ BitVec 32))) (let ((.cse268 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593))) (let ((.cse267 (select .cse268 .cse23))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse267 v_arrayElimCell_151)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse268 .cse269) .cse266)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse267 |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|)))))) (= v_arrayElimIndex_11 |c_ULTIMATE.start_sll_prepend_~head#1.offset|))))) .cse6 .cse270 .cse8 (or .cse124 .cse123 .cse1 .cse125 (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_151 (_ BitVec 32))) (let ((.cse273 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593))) (let ((.cse272 (select .cse273 .cse142)) (.cse271 (select .cse273 .cse23))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse271 v_arrayElimCell_151)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse272 .cse143)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse272 |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse271 |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|)))))) .cse151) (or (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimIndex_11 (_ BitVec 32)) (v_arrayElimCell_151 (_ BitVec 32))) (let ((.cse278 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593)) (.cse279 (select .cse26 v_arrayElimIndex_11))) (let ((.cse275 (select .cse278 .cse279)) (.cse277 (bvadd (_ bv4294967292 32) v_arrayElimIndex_11)) (.cse274 (select |c_#length| .cse279)) (.cse276 (select .cse278 .cse23))) (or (not (bvule v_arrayElimIndex_11 .cse274)) (= (select .cse275 |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 .cse276 v_arrayElimCell_151)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse275 .cse277)) (not (bvule .cse277 v_arrayElimIndex_11)) (not (bvule (bvadd (_ bv4 32) v_arrayElimIndex_11) .cse274)) (= v_arrayElimIndex_11 .cse25) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse276 |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|)))))) .cse5) (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_151 (_ BitVec 32))) (let ((.cse285 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593))) (let ((.cse280 (select .cse285 .cse23))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse280 v_arrayElimCell_151)) (forall ((v_arrayElimIndex_11 (_ BitVec 32))) (let ((.cse284 (select .cse26 v_arrayElimIndex_11))) (let ((.cse282 (select .cse285 .cse284)) (.cse283 (bvadd (_ bv4294967292 32) v_arrayElimIndex_11)) (.cse281 (select |c_#length| .cse284))) (or (not (bvule v_arrayElimIndex_11 .cse281)) (= (select .cse282 |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 .cse282 .cse283)) (not (bvule .cse283 v_arrayElimIndex_11)) (not (bvule (bvadd (_ bv4 32) v_arrayElimIndex_11) .cse281)) (= v_arrayElimIndex_11 .cse25) (= v_arrayElimIndex_11 |c_ULTIMATE.start_sll_prepend_~head#1.offset|))))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse280 |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|)))))) (or .cse1 .cse286) (or (and .cse287 (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_151 (_ BitVec 32))) (let ((.cse288 (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 .cse288 .cse23) v_arrayElimCell_151)) (forall ((v_arrayElimIndex_11 (_ BitVec 32))) (let ((.cse292 (select .cse26 v_arrayElimIndex_11))) (let ((.cse290 (select .cse288 .cse292)) (.cse291 (bvadd (_ bv4294967292 32) v_arrayElimIndex_11)) (.cse289 (select |c_#length| .cse292))) (or (not (bvule v_arrayElimIndex_11 .cse289)) (= (select .cse290 |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 .cse290 .cse291)) (not (bvule .cse291 v_arrayElimIndex_11)) (not (bvule (bvadd (_ bv4 32) v_arrayElimIndex_11) .cse289)) (= v_arrayElimIndex_11 .cse25))))))))) .cse5) (or .cse10 .cse293) (or (and (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_151 (_ BitVec 32))) (let ((.cse294 (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 .cse294 .cse23) v_arrayElimCell_151)) (forall ((v_arrayElimIndex_11 (_ BitVec 32))) (let ((.cse296 (select .cse26 v_arrayElimIndex_11))) (let ((.cse297 (bvadd (_ bv4294967292 32) v_arrayElimIndex_11)) (.cse295 (select |c_#length| .cse296))) (or (not (bvule v_arrayElimIndex_11 .cse295)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse294 .cse296) .cse297)) (not (bvule .cse297 v_arrayElimIndex_11)) (not (bvule (bvadd (_ bv4 32) v_arrayElimIndex_11) .cse295)) (= v_arrayElimIndex_11 .cse25)))))))) (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_151 (_ 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 .cse23) v_arrayElimCell_151)) (forall ((v_arrayElimIndex_11 (_ BitVec 32))) (let ((.cse300 (select .cse26 v_arrayElimIndex_11))) (let ((.cse301 (bvadd (_ bv4294967292 32) v_arrayElimIndex_11)) (.cse299 (select |c_#length| .cse300))) (or (not (bvule v_arrayElimIndex_11 .cse299)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse298 .cse300) .cse301)) (not (bvule .cse301 v_arrayElimIndex_11)) (not (bvule (bvadd (_ bv4 32) v_arrayElimIndex_11) .cse299)) (= v_arrayElimIndex_11 .cse25) (= v_arrayElimIndex_11 |c_ULTIMATE.start_sll_prepend_~head#1.offset|))))))))) .cse5) (or .cse286 .cse5) (or (and .cse287 (or (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimIndex_11 (_ BitVec 32)) (v_arrayElimCell_151 (_ BitVec 32))) (let ((.cse304 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593)) (.cse306 (select .cse26 v_arrayElimIndex_11))) (let ((.cse303 (select .cse304 .cse306)) (.cse305 (bvadd (_ bv4294967292 32) v_arrayElimIndex_11)) (.cse302 (select |c_#length| .cse306))) (or (not (bvule v_arrayElimIndex_11 .cse302)) (= (select .cse303 |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 .cse304 .cse23) v_arrayElimCell_151)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse303 .cse305)) (not (bvule .cse305 v_arrayElimIndex_11)) (not (bvule (bvadd (_ bv4 32) v_arrayElimIndex_11) .cse302)) (= v_arrayElimIndex_11 .cse25))))) .cse5) (or .cse124 .cse123 .cse125 (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_151 (_ BitVec 32))) (let ((.cse307 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593))) (let ((.cse308 (select .cse307 .cse142))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse307 .cse23) v_arrayElimCell_151)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse308 .cse143)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse308 |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|)))))) .cse151)) .cse1) (or .cse12 .cse293)))) (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 ((.cse331 (bvadd v_arrayElimCell_151 (_ bv4 32))) (.cse330 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593))) (or (not (bvule (bvadd v_arrayElimCell_151 (_ bv8 32)) .cse232)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse330 .cse23) v_arrayElimCell_151)) (not (bvule v_arrayElimCell_151 .cse331)) (not (bvule .cse331 .cse232)) (= (select (select .cse330 (select .cse26 v_arrayElimIndex_11)) v_arrayElimCell_152) |c_ULTIMATE.start_main_~data~0#1|)))) (= v_arrayElimIndex_11 .cse25) (= |c_ULTIMATE.start_main_~#s~0#1.offset| v_arrayElimIndex_11))) .cse332 .cse333 (forall ((v_arrayElimIndex_11 (_ BitVec 32))) (or (= v_arrayElimIndex_11 .cse25) (= |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 ((.cse335 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593))) (let ((.cse336 (bvadd v_arrayElimCell_151 (_ bv4 32))) (.cse334 (select .cse335 (select .cse26 v_arrayElimIndex_11)))) (or (not (bvule (bvadd v_arrayElimCell_151 (_ bv8 32)) .cse232)) (= (select .cse334 |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 .cse335 .cse23) v_arrayElimCell_151)) (not (bvule v_arrayElimCell_151 .cse336)) (not (bvule .cse336 .cse232)) (= (select .cse334 v_arrayElimCell_152) |c_ULTIMATE.start_main_~data~0#1|))))))) (forall ((v_arrayElimIndex_11 (_ BitVec 32))) (or (= v_arrayElimIndex_11 .cse25) (= |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 ((.cse339 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593))) (let ((.cse338 (bvadd v_arrayElimCell_151 (_ bv4 32))) (.cse337 (select .cse339 .cse23))) (or (not (bvule (bvadd v_arrayElimCell_151 (_ bv8 32)) .cse232)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse337 v_arrayElimCell_151)) (not (bvule v_arrayElimCell_151 .cse338)) (not (bvule .cse338 .cse232)) (= (select (select .cse339 (select .cse26 v_arrayElimIndex_11)) v_arrayElimCell_152) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse337 |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 ((.cse343 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593))) (let ((.cse342 (bvadd v_arrayElimCell_151 (_ bv4 32))) (.cse340 (select .cse343 (select .cse26 v_arrayElimIndex_11))) (.cse341 (select .cse343 .cse23))) (or (not (bvule (bvadd v_arrayElimCell_151 (_ bv8 32)) .cse232)) (= (select .cse340 |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 .cse341 v_arrayElimCell_151)) (not (bvule v_arrayElimCell_151 .cse342)) (not (bvule .cse342 .cse232)) (= (select .cse340 v_arrayElimCell_152) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse341 |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|)))))) (= v_arrayElimIndex_11 .cse25) (= |c_ULTIMATE.start_main_~#s~0#1.offset| v_arrayElimIndex_11)))) .cse243 .cse244) (or .cse0 (let ((.cse351 (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 ((.cse391 (select .cse26 v_arrayElimIndex_11))) (let ((.cse388 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593)) (.cse389 (bvadd v_arrayElimCell_152 (_ bv4 32))) (.cse390 (select |c_#length| .cse391))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse388 .cse23) v_arrayElimCell_151)) (not (bvule .cse389 .cse390)) (= v_arrayElimIndex_11 .cse25) (= |c_ULTIMATE.start_main_~#s~0#1.offset| v_arrayElimIndex_11) (= (select (select .cse388 .cse391) v_arrayElimCell_152) |c_ULTIMATE.start_main_~data~0#1|) (not (bvule v_arrayElimCell_152 .cse389)) (= v_arrayElimIndex_11 |c_ULTIMATE.start_sll_prepend_~head#1.offset|) (not (bvule (bvadd v_arrayElimCell_152 (_ bv8 32)) .cse390))))))) (.cse344 (or .cse67 .cse5)) (.cse352 (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 ((.cse384 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593)) (.cse387 (select .cse26 v_arrayElimIndex_11))) (let ((.cse383 (select .cse384 .cse387)) (.cse385 (bvadd v_arrayElimCell_152 (_ bv4 32))) (.cse386 (select |c_#length| .cse387))) (or (= (select .cse383 |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 .cse384 .cse23) v_arrayElimCell_151)) (not (bvule .cse385 .cse386)) (= v_arrayElimIndex_11 .cse25) (= |c_ULTIMATE.start_main_~#s~0#1.offset| v_arrayElimIndex_11) (= (select .cse383 v_arrayElimCell_152) |c_ULTIMATE.start_main_~data~0#1|) (not (bvule v_arrayElimCell_152 .cse385)) (not (bvule (bvadd v_arrayElimCell_152 (_ bv8 32)) .cse386)))))) .cse5))) (and (or .cse12 (and .cse213 .cse214 .cse344 .cse345 .cse215)) (forall ((v_arrayElimIndex_11 (_ BitVec 32))) (or (= v_arrayElimIndex_11 .cse25) (= |c_ULTIMATE.start_main_~#s~0#1.offset| v_arrayElimIndex_11) (forall ((v_arrayElimCell_152 (_ BitVec 32))) (let ((.cse350 (select .cse26 v_arrayElimIndex_11))) (let ((.cse346 (bvadd v_arrayElimCell_152 (_ bv4 32))) (.cse347 (select |c_#length| .cse350))) (or (not (bvule .cse346 .cse347)) (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_151 (_ BitVec 32))) (let ((.cse349 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593))) (let ((.cse348 (select .cse349 .cse23))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse348 v_arrayElimCell_151)) (= (select (select .cse349 .cse350) v_arrayElimCell_152) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse348 |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|)))))) (not (bvule v_arrayElimCell_152 .cse346)) (not (bvule (bvadd v_arrayElimCell_152 (_ bv8 32)) .cse347)))))) (= v_arrayElimIndex_11 |c_ULTIMATE.start_sll_prepend_~head#1.offset|))) (or .cse351 .cse5) .cse352 (or .cse353 .cse124 .cse123 .cse1 .cse12 .cse125 .cse151) (or .cse144 (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimIndex_11 (_ BitVec 32)) (v_arrayElimCell_152 (_ BitVec 32))) (let ((.cse357 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593)) (.cse358 (select .cse26 v_arrayElimIndex_11))) (let ((.cse354 (select .cse357 .cse358)) (.cse355 (bvadd v_arrayElimCell_152 (_ bv4 32))) (.cse356 (select |c_#length| .cse358))) (or (= (select .cse354 |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|) |c_ULTIMATE.start_main_~data~0#1|) (not (bvule .cse355 .cse356)) (= v_arrayElimIndex_11 .cse25) (= |c_ULTIMATE.start_main_~#s~0#1.offset| v_arrayElimIndex_11) (= (select .cse354 v_arrayElimCell_152) |c_ULTIMATE.start_main_~data~0#1|) (not (bvule v_arrayElimCell_152 .cse355)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse357 .cse23) |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|)) (not (bvule (bvadd v_arrayElimCell_152 (_ bv8 32)) .cse356)))))) .cse151) .cse154 (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 ((.cse364 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593)) (.cse363 (select .cse26 v_arrayElimIndex_11))) (let ((.cse359 (select .cse364 .cse363)) (.cse361 (bvadd v_arrayElimCell_152 (_ bv4 32))) (.cse360 (select .cse364 .cse23)) (.cse362 (select |c_#length| .cse363))) (or (= (select .cse359 |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 .cse360 v_arrayElimCell_151)) (not (bvule .cse361 .cse362)) (= v_arrayElimIndex_11 .cse25) (= |c_ULTIMATE.start_main_~#s~0#1.offset| v_arrayElimIndex_11) (= (select .cse359 v_arrayElimCell_152) |c_ULTIMATE.start_main_~data~0#1|) (not (bvule v_arrayElimCell_152 .cse361)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse360 |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|)) (not (bvule (bvadd v_arrayElimCell_152 (_ bv8 32)) .cse362)))))) .cse5) (or .cse365 .cse124 .cse1 .cse12 .cse125 .cse151) (forall ((v_arrayElimCell_152 (_ BitVec 32))) (let ((.cse367 (bvadd v_arrayElimCell_152 (_ bv4 32)))) (or (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_151 (_ BitVec 32))) (let ((.cse370 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593))) (let ((.cse371 (select .cse370 .cse23))) (or (forall ((v_arrayElimIndex_11 (_ BitVec 32))) (let ((.cse369 (select .cse26 v_arrayElimIndex_11))) (let ((.cse366 (select .cse370 .cse369)) (.cse368 (select |c_#length| .cse369))) (or (= (select .cse366 |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|) |c_ULTIMATE.start_main_~data~0#1|) (not (bvule .cse367 .cse368)) (= v_arrayElimIndex_11 .cse25) (= |c_ULTIMATE.start_main_~#s~0#1.offset| v_arrayElimIndex_11) (= (select .cse366 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)) .cse368)))))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse371 v_arrayElimCell_151)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse371 |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|)))))) (not (bvule v_arrayElimCell_152 .cse367))))) (or .cse351 .cse1) (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 ((.cse375 (select .cse26 v_arrayElimIndex_11))) (let ((.cse372 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593)) (.cse373 (bvadd v_arrayElimCell_152 (_ bv4 32))) (.cse374 (select |c_#length| .cse375))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse372 .cse23) v_arrayElimCell_151)) (not (bvule .cse373 .cse374)) (= v_arrayElimIndex_11 .cse25) (= |c_ULTIMATE.start_main_~#s~0#1.offset| v_arrayElimIndex_11) (= (select (select .cse372 .cse375) v_arrayElimCell_152) |c_ULTIMATE.start_main_~data~0#1|) (not (bvule v_arrayElimCell_152 .cse373)) (not (bvule (bvadd v_arrayElimCell_152 (_ bv8 32)) .cse374)))))) .cse5) (or .cse10 (and .cse213 .cse214 .cse344 .cse215 (or .cse1 .cse12 .cse125 .cse151 .cse376))) (or (and (or .cse124 .cse123 .cse12 .cse125 .cse151 .cse377) (forall ((v_arrayElimCell_152 (_ BitVec 32))) (let ((.cse379 (bvadd v_arrayElimCell_152 (_ bv4 32)))) (or (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_151 (_ BitVec 32))) (let ((.cse382 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593))) (or (forall ((v_arrayElimIndex_11 (_ BitVec 32))) (let ((.cse381 (select .cse26 v_arrayElimIndex_11))) (let ((.cse378 (select .cse382 .cse381)) (.cse380 (select |c_#length| .cse381))) (or (= (select .cse378 |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|) |c_ULTIMATE.start_main_~data~0#1|) (not (bvule .cse379 .cse380)) (= v_arrayElimIndex_11 .cse25) (= |c_ULTIMATE.start_main_~#s~0#1.offset| v_arrayElimIndex_11) (= (select .cse378 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)) .cse380)))))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse382 .cse23) v_arrayElimCell_151))))) (not (bvule v_arrayElimCell_152 .cse379))))) .cse352) .cse1)))) (or (and .cse332 (forall ((v_arrayElimIndex_11 (_ BitVec 32))) (or (= v_arrayElimIndex_11 .cse25) (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_151 (_ BitVec 32))) (let ((.cse395 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593))) (let ((.cse392 (select .cse395 (select .cse26 v_arrayElimIndex_11))) (.cse394 (bvadd v_arrayElimCell_151 (_ bv4 32))) (.cse393 (select .cse395 .cse23))) (or (not (bvule (bvadd v_arrayElimCell_151 (_ bv8 32)) .cse232)) (= (select .cse392 |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 .cse393 v_arrayElimCell_151)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse392 (bvadd (_ bv4294967292 32) v_arrayElimIndex_11))) (not (bvule v_arrayElimCell_151 .cse394)) (not (bvule .cse394 .cse232)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse393 |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 ((.cse397 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593))) (let ((.cse398 (bvadd v_arrayElimCell_151 (_ bv4 32))) (.cse396 (select .cse397 .cse23))) (or (not (bvule (bvadd v_arrayElimCell_151 (_ bv8 32)) .cse232)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse396 v_arrayElimCell_151)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse397 (select .cse26 v_arrayElimIndex_11)) (bvadd (_ bv4294967292 32) v_arrayElimIndex_11))) (not (bvule v_arrayElimCell_151 .cse398)) (not (bvule .cse398 .cse232)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse396 |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|)))))) (= v_arrayElimIndex_11 .cse25) (= 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 ((.cse401 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593))) (let ((.cse400 (bvadd v_arrayElimCell_151 (_ bv4 32))) (.cse399 (select .cse401 .cse23))) (or (not (bvule (bvadd v_arrayElimCell_151 (_ bv8 32)) .cse232)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse399 v_arrayElimCell_151)) (not (bvule v_arrayElimCell_151 .cse400)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse401 .cse142) |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|)) (not (bvule .cse400 .cse232)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse399 |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 ((.cse402 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593)) (.cse403 (bvadd v_arrayElimCell_151 (_ bv4 32)))) (or (not (bvule (bvadd v_arrayElimCell_151 (_ bv8 32)) .cse232)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse402 .cse23) v_arrayElimCell_151)) (not (bvule v_arrayElimCell_151 .cse403)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse402 .cse142) |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|)) (not (bvule .cse403 .cse232)))))) .cse151) .cse333 (forall ((v_arrayElimIndex_11 (_ BitVec 32))) (or (= v_arrayElimIndex_11 .cse25) (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_151 (_ BitVec 32))) (let ((.cse404 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593)) (.cse405 (bvadd v_arrayElimCell_151 (_ bv4 32)))) (or (not (bvule (bvadd v_arrayElimCell_151 (_ bv8 32)) .cse232)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse404 .cse23) v_arrayElimCell_151)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse404 (select .cse26 v_arrayElimIndex_11)) (bvadd (_ bv4294967292 32) v_arrayElimIndex_11))) (not (bvule v_arrayElimCell_151 .cse405)) (not (bvule .cse405 .cse232))))) (= 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 ((.cse406 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593)) (.cse407 (bvadd v_arrayElimCell_151 (_ bv4 32)))) (or (not (bvule (bvadd v_arrayElimCell_151 (_ bv8 32)) .cse232)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse406 .cse23) v_arrayElimCell_151)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse406 (select .cse26 v_arrayElimIndex_11)) (bvadd (_ bv4294967292 32) v_arrayElimIndex_11))) (not (bvule v_arrayElimCell_151 .cse407)) (not (bvule .cse407 .cse232)) (= v_arrayElimIndex_11 .cse25)))) .cse5) (forall ((v_arrayElimIndex_11 (_ BitVec 32))) (or (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_151 (_ BitVec 32))) (let ((.cse409 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593))) (let ((.cse408 (select .cse409 (select .cse26 v_arrayElimIndex_11))) (.cse410 (bvadd v_arrayElimCell_151 (_ bv4 32)))) (or (not (bvule (bvadd v_arrayElimCell_151 (_ bv8 32)) .cse232)) (= (select .cse408 |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 .cse409 .cse23) v_arrayElimCell_151)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse408 (bvadd (_ bv4294967292 32) v_arrayElimIndex_11))) (not (bvule v_arrayElimCell_151 .cse410)) (not (bvule .cse410 .cse232)))))) (= v_arrayElimIndex_11 .cse25)))) .cse243 .cse244) (or (and .cse258 .cse259) .cse55) (or (let ((.cse420 (forall ((v_arrayElimCell_152 (_ BitVec 32))) (let ((.cse454 (bvadd v_arrayElimCell_152 (_ bv4 32)))) (or (not (bvule (bvadd v_arrayElimCell_152 (_ bv8 32)) .cse232)) (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse453 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593))) (let ((.cse452 (select .cse453 (select .cse26 .cse454)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse452 |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse453 .cse23) v_arrayElimCell_152)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse452 v_arrayElimCell_152)))))) (not (bvule .cse454 .cse232)) (not (bvule v_arrayElimCell_152 .cse454)))))) (.cse440 (forall ((v_arrayElimCell_152 (_ BitVec 32))) (let ((.cse449 (bvadd v_arrayElimCell_152 (_ bv4 32)))) (or (not (bvule (bvadd v_arrayElimCell_152 (_ bv8 32)) .cse232)) (not (bvule .cse449 .cse232)) (not (bvule v_arrayElimCell_152 .cse449)) (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse451 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593))) (or (forall ((v_arrayElimIndex_11 (_ BitVec 32))) (let ((.cse450 (select .cse451 (select .cse26 v_arrayElimIndex_11)))) (or (= (select .cse450 |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 .cse450 v_arrayElimCell_152) |c_ULTIMATE.start_main_~data~0#1|)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse451 .cse23) v_arrayElimCell_152))))))))) (.cse418 (forall ((v_arrayElimCell_152 (_ BitVec 32))) (let ((.cse447 (bvadd v_arrayElimCell_152 (_ bv4 32)))) (or (not (bvule (bvadd v_arrayElimCell_152 (_ bv8 32)) .cse232)) (not (bvule .cse447 .cse232)) (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimIndex_11 (_ BitVec 32))) (let ((.cse448 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593))) (or (= (select (select .cse448 (select .cse26 v_arrayElimIndex_11)) v_arrayElimCell_152) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse448 .cse23) v_arrayElimCell_152)) (= v_arrayElimIndex_11 |c_ULTIMATE.start_sll_prepend_~head#1.offset|)))) (not (bvule v_arrayElimCell_152 .cse447)))))) (.cse419 (forall ((v_arrayElimCell_152 (_ BitVec 32))) (let ((.cse446 (bvadd v_arrayElimCell_152 (_ bv4 32)))) (or (forall ((v_arrayElimIndex_11 (_ BitVec 32))) (or (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse444 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593))) (let ((.cse445 (select .cse444 .cse23))) (or (= (select (select .cse444 (select .cse26 v_arrayElimIndex_11)) v_arrayElimCell_152) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse445 v_arrayElimCell_152)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse445 |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)) .cse232)) (not (bvule .cse446 .cse232)) (not (bvule v_arrayElimCell_152 .cse446))))))) (and (or .cse55 (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimIndex_11 (_ BitVec 32)) (v_arrayElimCell_152 (_ BitVec 32))) (let ((.cse414 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593))) (let ((.cse411 (select .cse414 (select .cse26 v_arrayElimIndex_11))) (.cse413 (bvadd v_arrayElimCell_152 (_ bv4 32))) (.cse412 (select .cse414 .cse23))) (or (= (select .cse411 |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)) .cse232)) (= (select .cse411 v_arrayElimCell_152) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse412 v_arrayElimCell_152)) (not (bvule .cse413 .cse232)) (not (bvule v_arrayElimCell_152 .cse413)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse412 |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|))))))) .cse231 (or .cse55 .cse240) (or .cse415 .cse416 .cse145 .cse417 .cse151) .cse418 .cse419 .cse420 (forall ((v_arrayElimCell_152 (_ BitVec 32))) (let ((.cse424 (bvadd v_arrayElimCell_152 (_ bv4 32)))) (or (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse423 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593))) (let ((.cse421 (select .cse423 (select .cse26 .cse424))) (.cse422 (select .cse423 .cse23))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse421 |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse422 v_arrayElimCell_152)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse421 v_arrayElimCell_152)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse422 |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|)))))) (not (bvule (bvadd v_arrayElimCell_152 (_ bv8 32)) .cse232)) (not (bvule .cse424 .cse232)) (not (bvule v_arrayElimCell_152 .cse424))))) (forall ((v_arrayElimCell_152 (_ BitVec 32))) (let ((.cse428 (bvadd v_arrayElimCell_152 (_ bv4 32)))) (or (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse426 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593))) (let ((.cse427 (select .cse426 .cse23))) (or (forall ((v_arrayElimIndex_11 (_ BitVec 32))) (let ((.cse425 (select .cse426 (select .cse26 v_arrayElimIndex_11)))) (or (= (select .cse425 |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 .cse425 v_arrayElimCell_152) |c_ULTIMATE.start_main_~data~0#1|)))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse427 v_arrayElimCell_152)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse427 |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|)))))) (not (bvule (bvadd v_arrayElimCell_152 (_ bv8 32)) .cse232)) (not (bvule .cse428 .cse232)) (not (bvule v_arrayElimCell_152 .cse428))))) (forall ((v_arrayElimCell_152 (_ BitVec 32))) (let ((.cse429 (bvadd v_arrayElimCell_152 (_ bv4 32)))) (or (= |c_ULTIMATE.start_sll_prepend_~head#1.offset| .cse429) (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse430 (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 .cse430 .cse23) v_arrayElimCell_152)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse430 (select .cse26 .cse429)) v_arrayElimCell_152))))) (not (bvule (bvadd v_arrayElimCell_152 (_ bv8 32)) .cse232)) (not (bvule .cse429 .cse232)) (not (bvule v_arrayElimCell_152 .cse429))))) (or (and (forall ((v_arrayElimCell_152 (_ BitVec 32))) (let ((.cse432 (bvadd v_arrayElimCell_152 (_ bv4 32)))) (or (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse431 (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 .cse431 (select .cse26 v_arrayElimIndex_11)) v_arrayElimCell_152) |c_ULTIMATE.start_main_~data~0#1|))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse431 .cse23) v_arrayElimCell_152))))) (not (bvule (bvadd v_arrayElimCell_152 (_ bv8 32)) .cse232)) (not (bvule .cse432 .cse232)) (not (bvule v_arrayElimCell_152 .cse432))))) (forall ((v_arrayElimCell_152 (_ BitVec 32))) (let ((.cse434 (bvadd v_arrayElimCell_152 (_ bv4 32)))) (or (not (bvule (bvadd v_arrayElimCell_152 (_ bv8 32)) .cse232)) (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse433 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593))) (or (forall ((v_arrayElimIndex_11 (_ BitVec 32))) (= (select (select .cse433 (select .cse26 v_arrayElimIndex_11)) v_arrayElimCell_152) |c_ULTIMATE.start_main_~data~0#1|)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse433 .cse23) v_arrayElimCell_152))))) (not (bvule .cse434 .cse232)) (not (bvule v_arrayElimCell_152 .cse434))))) (forall ((v_arrayElimCell_152 (_ BitVec 32))) (let ((.cse436 (bvadd v_arrayElimCell_152 (_ bv4 32)))) (or (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse435 (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 .cse435 .cse23) v_arrayElimCell_152)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse435 (select .cse26 .cse436)) v_arrayElimCell_152))))) (not (bvule (bvadd v_arrayElimCell_152 (_ bv8 32)) .cse232)) (not (bvule .cse436 .cse232)) (not (bvule v_arrayElimCell_152 .cse436)))))) .cse5) .cse238 (forall ((v_arrayElimCell_152 (_ BitVec 32))) (let ((.cse437 (bvadd v_arrayElimCell_152 (_ bv4 32)))) (or (= |c_ULTIMATE.start_sll_prepend_~head#1.offset| .cse437) (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse439 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593))) (let ((.cse438 (select .cse439 .cse23))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse438 v_arrayElimCell_152)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse439 (select .cse26 .cse437)) v_arrayElimCell_152)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse438 |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|)))))) (not (bvule (bvadd v_arrayElimCell_152 (_ bv8 32)) .cse232)) (not (bvule .cse437 .cse232)) (not (bvule v_arrayElimCell_152 .cse437))))) .cse440 (or (and .cse420 .cse440 (forall ((v_arrayElimCell_152 (_ BitVec 32))) (let ((.cse443 (bvadd v_arrayElimCell_152 (_ bv4 32)))) (or (not (bvule (bvadd v_arrayElimCell_152 (_ bv8 32)) .cse232)) (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse441 (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 .cse441 .cse23) v_arrayElimCell_152)) (forall ((v_arrayElimIndex_11 (_ BitVec 32))) (let ((.cse442 (select .cse441 (select .cse26 v_arrayElimIndex_11)))) (or (= (select .cse442 |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|) |c_ULTIMATE.start_main_~data~0#1|) (= (select .cse442 v_arrayElimCell_152) |c_ULTIMATE.start_main_~data~0#1|))))))) (not (bvule .cse443 .cse232)) (not (bvule v_arrayElimCell_152 .cse443)))))) .cse5) (or (and .cse418 .cse419) .cse55))) .cse243 .cse244) (or .cse0 (let ((.cse483 (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 ((.cse528 (select .cse26 v_arrayElimIndex_11))) (let ((.cse526 (bvadd v_arrayElimCell_152 (_ bv4 32))) (.cse527 (select |c_#length| .cse528))) (or (not (bvule .cse526 .cse527)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593) .cse528) v_arrayElimCell_152) |c_ULTIMATE.start_main_~data~0#1|) (not (bvule v_arrayElimCell_152 .cse526)) (not (bvule (bvadd v_arrayElimCell_152 (_ bv8 32)) .cse527)))))) (= v_arrayElimIndex_11 |c_ULTIMATE.start_sll_prepend_~head#1.offset|)))) (.cse498 (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimIndex_11 (_ BitVec 32)) (v_arrayElimCell_152 (_ BitVec 32))) (let ((.cse525 (select .cse26 v_arrayElimIndex_11))) (let ((.cse524 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593)) (.cse522 (bvadd v_arrayElimCell_152 (_ bv4 32))) (.cse523 (select |c_#length| .cse525))) (or (not (bvule .cse522 .cse523)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| v_arrayElimIndex_11) (= (select (select .cse524 .cse525) v_arrayElimCell_152) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse524 .cse23) v_arrayElimCell_152)) (not (bvule v_arrayElimCell_152 .cse522)) (= v_arrayElimIndex_11 |c_ULTIMATE.start_sll_prepend_~head#1.offset|) (not (bvule (bvadd v_arrayElimCell_152 (_ bv8 32)) .cse523)))))))) (let ((.cse456 (forall ((v_arrayElimIndex_11 (_ BitVec 32))) (or (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_152 (_ BitVec 32))) (let ((.cse520 (select .cse26 v_arrayElimIndex_11)) (.cse519 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593))) (let ((.cse517 (bvadd v_arrayElimCell_152 (_ bv4 32))) (.cse521 (select .cse519 .cse23)) (.cse518 (select |c_#length| .cse520))) (or (not (bvule .cse517 .cse518)) (= (select (select .cse519 .cse520) v_arrayElimCell_152) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse521 v_arrayElimCell_152)) (not (bvule v_arrayElimCell_152 .cse517)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse521 |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|)) (not (bvule (bvadd v_arrayElimCell_152 (_ bv8 32)) .cse518)))))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| v_arrayElimIndex_11) (= v_arrayElimIndex_11 |c_ULTIMATE.start_sll_prepend_~head#1.offset|)))) (.cse472 (or .cse498 .cse1)) (.cse455 (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimIndex_11 (_ BitVec 32)) (v_arrayElimCell_152 (_ BitVec 32))) (let ((.cse515 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593)) (.cse516 (select .cse26 v_arrayElimIndex_11))) (let ((.cse512 (select .cse515 .cse516)) (.cse513 (bvadd v_arrayElimCell_152 (_ bv4 32))) (.cse514 (select |c_#length| .cse516))) (or (= (select .cse512 |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|) |c_ULTIMATE.start_main_~data~0#1|) (not (bvule .cse513 .cse514)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| v_arrayElimIndex_11) (= (select .cse512 v_arrayElimCell_152) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse515 .cse23) v_arrayElimCell_152)) (not (bvule v_arrayElimCell_152 .cse513)) (= v_arrayElimIndex_11 |c_ULTIMATE.start_sll_prepend_~head#1.offset|) (not (bvule (bvadd v_arrayElimCell_152 (_ bv8 32)) .cse514))))))) (.cse497 (and (forall ((v_arrayElimIndex_11 (_ BitVec 32))) (or (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_152 (_ BitVec 32))) (let ((.cse508 (select .cse26 v_arrayElimIndex_11))) (let ((.cse505 (select (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593) .cse508)) (.cse506 (bvadd v_arrayElimCell_152 (_ bv4 32))) (.cse507 (select |c_#length| .cse508))) (or (= (select .cse505 |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|) |c_ULTIMATE.start_main_~data~0#1|) (not (bvule .cse506 .cse507)) (= (select .cse505 v_arrayElimCell_152) |c_ULTIMATE.start_main_~data~0#1|) (not (bvule v_arrayElimCell_152 .cse506)) (not (bvule (bvadd v_arrayElimCell_152 (_ bv8 32)) .cse507)))))) (= |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 ((.cse511 (select .cse26 v_arrayElimIndex_11))) (let ((.cse509 (bvadd v_arrayElimCell_152 (_ bv4 32))) (.cse510 (select |c_#length| .cse511))) (or (not (bvule .cse509 .cse510)) (= |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) .cse511) v_arrayElimCell_152) |c_ULTIMATE.start_main_~data~0#1|) (not (bvule v_arrayElimCell_152 .cse509)) (= v_arrayElimIndex_11 |c_ULTIMATE.start_sll_prepend_~head#1.offset|) (not (bvule (bvadd v_arrayElimCell_152 (_ bv8 32)) .cse510)))))) .cse5) .cse483))) (and (or .cse455 .cse5) .cse456 (or (let ((.cse462 (and .cse483 (forall ((v_arrayElimIndex_11 (_ BitVec 32))) (or (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_152 (_ BitVec 32))) (let ((.cse487 (select .cse26 v_arrayElimIndex_11))) (let ((.cse484 (select (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593) .cse487)) (.cse485 (bvadd v_arrayElimCell_152 (_ bv4 32))) (.cse486 (select |c_#length| .cse487))) (or (= (select .cse484 |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|) |c_ULTIMATE.start_main_~data~0#1|) (not (bvule .cse485 .cse486)) (= (select .cse484 v_arrayElimCell_152) |c_ULTIMATE.start_main_~data~0#1|) (not (bvule v_arrayElimCell_152 .cse485)) (not (bvule (bvadd v_arrayElimCell_152 (_ bv8 32)) .cse486)))))) (= |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 ((.cse490 (select .cse26 v_arrayElimIndex_11))) (let ((.cse488 (bvadd v_arrayElimCell_152 (_ bv4 32))) (.cse489 (select |c_#length| .cse490))) (or (not (bvule .cse488 .cse489)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593) .cse490) v_arrayElimCell_152) |c_ULTIMATE.start_main_~data~0#1|) (not (bvule v_arrayElimCell_152 .cse488)) (not (bvule (bvadd v_arrayElimCell_152 (_ bv8 32)) .cse489))))))))))) (and .cse56 .cse456 .cse57 (or .cse1 (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimIndex_11 (_ BitVec 32)) (v_arrayElimCell_152 (_ BitVec 32))) (let ((.cse460 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593)) (.cse461 (select .cse26 v_arrayElimIndex_11))) (let ((.cse457 (select .cse460 .cse461)) (.cse458 (bvadd v_arrayElimCell_152 (_ bv4 32))) (.cse459 (select |c_#length| .cse461))) (or (= (select .cse457 |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|) |c_ULTIMATE.start_main_~data~0#1|) (not (bvule .cse458 .cse459)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| v_arrayElimIndex_11) (= (select .cse457 v_arrayElimCell_152) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse460 .cse23) v_arrayElimCell_152)) (not (bvule v_arrayElimCell_152 .cse458)) (not (bvule (bvadd v_arrayElimCell_152 (_ bv8 32)) .cse459))))))) .cse82 (or .cse12 .cse462) (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 ((.cse466 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593)) (.cse467 (select .cse26 v_arrayElimIndex_11))) (let ((.cse463 (select .cse466 .cse467)) (.cse464 (bvadd v_arrayElimCell_152 (_ bv4 32))) (.cse465 (select |c_#length| .cse467))) (or (= (select .cse463 |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|) |c_ULTIMATE.start_main_~data~0#1|) (not (bvule .cse464 .cse465)) (= (select .cse463 v_arrayElimCell_152) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse466 .cse23) v_arrayElimCell_152)) (not (bvule v_arrayElimCell_152 .cse464)) (not (bvule (bvadd v_arrayElimCell_152 (_ bv8 32)) .cse465)))))))) (or .cse10 .cse462) .cse83 (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 ((.cse471 (select .cse26 v_arrayElimIndex_11))) (let ((.cse470 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593)) (.cse468 (bvadd v_arrayElimCell_152 (_ bv4 32))) (.cse469 (select |c_#length| .cse471))) (or (not (bvule .cse468 .cse469)) (= (select (select .cse470 .cse471) v_arrayElimCell_152) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse470 .cse23) v_arrayElimCell_152)) (not (bvule v_arrayElimCell_152 .cse468)) (not (bvule (bvadd v_arrayElimCell_152 (_ bv8 32)) .cse469)))))) (= v_arrayElimIndex_11 |c_ULTIMATE.start_sll_prepend_~head#1.offset|))) .cse89 .cse90 .cse92 .cse472 (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 ((.cse476 (select .cse26 v_arrayElimIndex_11))) (let ((.cse475 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593)) (.cse473 (bvadd v_arrayElimCell_152 (_ bv4 32))) (.cse474 (select |c_#length| .cse476))) (or (not (bvule .cse473 .cse474)) (= (select (select .cse475 .cse476) v_arrayElimCell_152) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse475 .cse23) v_arrayElimCell_152)) (not (bvule v_arrayElimCell_152 .cse473)) (not (bvule (bvadd v_arrayElimCell_152 (_ bv8 32)) .cse474)))))))) (or .cse245 .cse55) .cse103 (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 ((.cse482 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593)) (.cse481 (select .cse26 v_arrayElimIndex_11))) (let ((.cse477 (select .cse482 .cse481)) (.cse478 (bvadd v_arrayElimCell_152 (_ bv4 32))) (.cse480 (select .cse482 .cse23)) (.cse479 (select |c_#length| .cse481))) (or (= (select .cse477 |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|) |c_ULTIMATE.start_main_~data~0#1|) (not (bvule .cse478 .cse479)) (= (select .cse477 v_arrayElimCell_152) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse480 v_arrayElimCell_152)) (not (bvule v_arrayElimCell_152 .cse478)) (= |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)) .cse479)))))))) .cse114)) .cse5) .cse6 .cse8 .cse9 (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 ((.cse496 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593)) (.cse495 (select .cse26 v_arrayElimIndex_11))) (let ((.cse491 (select .cse496 .cse495)) (.cse492 (bvadd v_arrayElimCell_152 (_ bv4 32))) (.cse494 (select .cse496 .cse23)) (.cse493 (select |c_#length| .cse495))) (or (= (select .cse491 |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|) |c_ULTIMATE.start_main_~data~0#1|) (not (bvule .cse492 .cse493)) (= (select .cse491 v_arrayElimCell_152) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse494 v_arrayElimCell_152)) (not (bvule v_arrayElimCell_152 .cse492)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse494 |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|)) (not (bvule (bvadd v_arrayElimCell_152 (_ bv8 32)) .cse493)))))) (= v_arrayElimIndex_11 |c_ULTIMATE.start_sll_prepend_~head#1.offset|))) .cse16 (or .cse256 .cse55) .cse89 .cse152 .cse153 .cse92 .cse154 .cse155 .cse472 .cse156 (or .cse1 .cse455) .cse176 (or .cse10 .cse497) (or .cse12 .cse497) (or .cse498 .cse5) (or .cse123 (and (or .cse124 .cse12 .cse125 (and (or .cse10 .cse136) .cse129 .cse499 .cse500 .cse501 .cse502 .cse503 .cse504)) (or .cse124 (and .cse126 .cse127 .cse128 .cse139 .cse130 .cse131 .cse140 .cse132) .cse125) (or .cse124 .cse125 .cse257 .cse55)) .cse151)))))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| .cse25)) (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) .cse232)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593) .cse23) .cse640)) (not (bvule v_arrayElimIndex_11 .cse232)) (= v_arrayElimIndex_11 .cse25))))) (.cse536 (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 .cse26 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) .cse232)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse639 .cse23) .cse638)) (not (bvule v_arrayElimIndex_11 .cse232))))))) (.cse543 (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 .cse26 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) .cse232)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse636 .cse23) .cse635)) (not (bvule v_arrayElimIndex_11 .cse232)) (= v_arrayElimIndex_11 .cse25)))))) (.cse531 (not (bvule .cse25 .cse232))) (.cse532 (not (bvule .cse633 .cse232))) (.cse537 (and .cse1 .cse5)) (.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) .cse232)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593) .cse23) .cse632)) (not (bvule v_arrayElimIndex_11 .cse232))))))) (and (or (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimIndex_11 (_ BitVec 32))) (let ((.cse530 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593))) (let ((.cse529 (select .cse530 (select .cse26 v_arrayElimIndex_11)))) (or (= (select .cse529 |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 .cse529 (bvadd (_ bv4294967292 32) v_arrayElimIndex_11))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse530 .cse23) |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|)))))) .cse531 .cse532 .cse123 .cse144 .cse151) (or .cse531 .cse532 (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimIndex_11 (_ BitVec 32))) (let ((.cse533 (select (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593) .cse23))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse533 (bvadd (_ bv4294967292 32) v_arrayElimIndex_11))) (= v_arrayElimIndex_11 .cse25) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse533 |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|))))) .cse123 .cse144 .cse151) (or (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimIndex_11 (_ BitVec 32))) (let ((.cse534 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593)) (.cse535 (bvadd (_ bv4294967292 32) v_arrayElimIndex_11))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse534 (select .cse26 v_arrayElimIndex_11)) .cse535)) (not (bvule .cse535 v_arrayElimIndex_11)) (not (bvule (bvadd (_ bv4 32) v_arrayElimIndex_11) .cse232)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse534 .cse23) .cse535)) (not (bvule v_arrayElimIndex_11 .cse232)) (= v_arrayElimIndex_11 .cse25)))) .cse5) (or .cse536 .cse5) (or .cse537 (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimIndex_11 (_ BitVec 32))) (let ((.cse541 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593))) (let ((.cse538 (select .cse541 (select .cse26 v_arrayElimIndex_11))) (.cse539 (bvadd (_ bv4294967292 32) v_arrayElimIndex_11)) (.cse540 (select .cse541 .cse23))) (or (= (select .cse538 |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 .cse538 .cse539)) (not (bvule .cse539 v_arrayElimIndex_11)) (not (bvule (bvadd (_ bv4 32) v_arrayElimIndex_11) .cse232)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse540 .cse539)) (not (bvule v_arrayElimIndex_11 .cse232)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse540 |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|))))))) (or .cse531 .cse532 .cse123 .cse144 .cse542 .cse151) (or .cse543 .cse1) (or .cse537 (forall ((v_ArrVal_1593 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimIndex_11 (_ BitVec 32))) (let ((.cse547 (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593))) (let ((.cse544 (select .cse547 (select .cse26 v_arrayElimIndex_11))) (.cse545 (bvadd (_ bv4294967292 32) v_arrayElimIndex_11)) (.cse546 (select .cse547 .cse23))) (or (= (select .cse544 |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 .cse544 .cse545)) (not (bvule .cse545 v_arrayElimIndex_11)) (not (bvule (bvadd (_ bv4 32) v_arrayElimIndex_11) .cse232)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse546 .cse545)) (not (bvule v_arrayElimIndex_11 .cse232)) (= v_arrayElimIndex_11 .cse25) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse546 |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|))))))) (or (and .cse415 (or .cse532 .cse144)) (and .cse416 (or .cse123 .cse144)) (and (or .cse531 .cse144) .cse417) (and .cse128 .cse139 .cse132) .cse151) (or .cse531 .cse123 .cse144 (and (or .cse532 (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 .cse26 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 .cse23) |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|)))))) (or .cse532 (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 .cse23))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse549 (select .cse26 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|)))))))) .cse151) (or .cse537 (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) .cse232)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse569 .cse23) .cse568)) (not (bvule v_arrayElimIndex_11 .cse232)) (= v_arrayElimIndex_11 .cse25) (= |c_ULTIMATE.start_main_~#s~0#1.offset| v_arrayElimIndex_11) (= (select (select .cse569 (select .cse26 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) .cse232)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1593) .cse23) .cse567)) (not (bvule v_arrayElimIndex_11 .cse232)) (= v_arrayElimIndex_11 .cse25) (= |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 .cse26 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) .cse232)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse566 .cse23) .cse565)) (not (bvule v_arrayElimIndex_11 .cse232)) (= v_arrayElimIndex_11 .cse25) (= |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 .cse1) (or .cse553 .cse5) (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 .cse26 v_arrayElimIndex_11))) (.cse556 (select .cse557 .cse23))) (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) .cse232)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse556 .cse555)) (not (bvule v_arrayElimIndex_11 .cse232)) (= v_arrayElimIndex_11 .cse25) (= |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 .cse5) (or .cse558 .cse5) (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) .cse23))) (or (not (bvule .cse559 v_arrayElimIndex_11)) (not (bvule (bvadd (_ bv4 32) v_arrayElimIndex_11) .cse232)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse560 .cse559)) (not (bvule v_arrayElimIndex_11 .cse232)) (= v_arrayElimIndex_11 .cse25) (= |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 .cse23))) (or (not (bvule .cse561 v_arrayElimIndex_11)) (not (bvule (bvadd (_ bv4 32) v_arrayElimIndex_11) .cse232)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse562 .cse561)) (not (bvule v_arrayElimIndex_11 .cse232)) (= v_arrayElimIndex_11 .cse25) (= |c_ULTIMATE.start_main_~#s~0#1.offset| v_arrayElimIndex_11) (= (select (select .cse563 (select .cse26 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 .cse1 .cse558) (or .cse1 .cse553)))) (or .cse531 .cse532 .cse123 (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 .cse26 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 .cse25) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse571 .cse23) |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|)))))) .cse144 .cse151) (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 .cse26 v_arrayElimIndex_11)) .cse577)) (not (bvule .cse577 v_arrayElimIndex_11)) (not (bvule (bvadd (_ bv4 32) v_arrayElimIndex_11) .cse232)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse576 .cse23) .cse577)) (not (bvule v_arrayElimIndex_11 .cse232)) (= v_arrayElimIndex_11 |c_ULTIMATE.start_sll_prepend_~head#1.offset|)))))) (and (or .cse572 .cse1) (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 .cse23))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse573 (select .cse26 v_arrayElimIndex_11)) .cse574)) (not (bvule .cse574 v_arrayElimIndex_11)) (not (bvule (bvadd (_ bv4 32) v_arrayElimIndex_11) .cse232)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse575 .cse574)) (not (bvule v_arrayElimIndex_11 .cse232)) (= 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 .cse5))) .cse537) (or .cse537 (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) .cse23))) (or (not (bvule .cse578 v_arrayElimIndex_11)) (not (bvule (bvadd (_ bv4 32) v_arrayElimIndex_11) .cse232)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse579 .cse578)) (not (bvule v_arrayElimIndex_11 .cse232)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse579 |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|)))))) (or .cse580 .cse5) (or .cse1 .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 .cse26 v_arrayElimIndex_11)) .cse582)) (not (bvule .cse582 v_arrayElimIndex_11)) (not (bvule (bvadd (_ bv4 32) v_arrayElimIndex_11) .cse232)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse581 .cse23) .cse582)) (not (bvule v_arrayElimIndex_11 .cse232))))) .cse5) (or .cse415 .cse416 .cse1 .cse145 .cse417 .cse151) (or .cse123 .cse144 (and (or .cse531 .cse532 (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 .cse26 v_arrayElimIndex_11))) (.cse584 (select .cse585 .cse23))) (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 .cse531 .cse532 (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 .cse26 v_arrayElimIndex_11)) v_arrayElimCell_152) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse586 .cse23) |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|)))))) (or .cse531 .cse532 (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 .cse26 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 .cse23) |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|))))))) (or .cse531 (and (or .cse532 .cse542) (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) .cse23))) (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|))))) .cse532))) (or .cse531 .cse532 (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 .cse23))) (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 .cse26 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|)))))))) .cse151) (or .cse1 .cse536) (or .cse543 .cse5) (or .cse531 .cse532 .cse123 .cse144 (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) .cse23))) (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|))))) .cse151) (or .cse531 .cse532 .cse123 (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 .cse26 v_arrayElimIndex_11))) (.cse594 (bvadd (_ bv4294967292 32) v_arrayElimIndex_11)) (.cse595 (select .cse596 .cse23))) (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|)))))) .cse144 .cse151) (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 .cse26 v_arrayElimIndex_11)) .cse602)) (not (bvule .cse602 v_arrayElimIndex_11)) (not (bvule (bvadd (_ bv4 32) v_arrayElimIndex_11) .cse232)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse601 .cse23) .cse602)) (not (bvule v_arrayElimIndex_11 .cse232)) (= v_arrayElimIndex_11 .cse25) (= v_arrayElimIndex_11 |c_ULTIMATE.start_sll_prepend_~head#1.offset|)))))) (and (or .cse1 .cse597) (or .cse597 .cse5) (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 .cse23))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse598 (select .cse26 v_arrayElimIndex_11)) .cse599)) (not (bvule .cse599 v_arrayElimIndex_11)) (not (bvule (bvadd (_ bv4 32) v_arrayElimIndex_11) .cse232)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse600 .cse599)) (not (bvule v_arrayElimIndex_11 .cse232)) (= v_arrayElimIndex_11 .cse25) (= 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|)))))))) .cse537) (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) .cse232)) (not (bvule v_arrayElimIndex_11 .cse232)) (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) .cse23) .cse603))) (= v_arrayElimIndex_11 .cse25)))) (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) .cse232)) (not (bvule v_arrayElimIndex_11 .cse232)) (= v_arrayElimIndex_11 .cse25) (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 .cse26 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 .cse23) .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 .cse26 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) .cse232)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse609 .cse23) .cse608)) (not (bvule v_arrayElimIndex_11 .cse232)) (= v_arrayElimIndex_11 .cse25) (= (select .cse607 v_arrayElimCell_152) |c_ULTIMATE.start_main_~data~0#1|))))) .cse1) (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 .cse26 v_arrayElimIndex_11))) (.cse611 (select .cse613 .cse23))) (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) .cse232)) (not (bvule v_arrayElimIndex_11 .cse232)) (= v_arrayElimIndex_11 .cse25)))) (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) .cse232)) (not (bvule v_arrayElimIndex_11 .cse232)) (= v_arrayElimIndex_11 .cse25) (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 .cse23) .cse614)) (= (select (select .cse615 (select .cse26 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) .cse232)) (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 .cse23))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse617 .cse616)) (= (select (select .cse618 (select .cse26 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 .cse232)) (= v_arrayElimIndex_11 .cse25) (= 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) .cse232)) (not (bvule v_arrayElimIndex_11 .cse232)) (= v_arrayElimIndex_11 .cse25) (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 .cse23) .cse619)) (= (select (select .cse620 (select .cse26 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) .cse232)) (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) .cse23))) (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 .cse232)) (= v_arrayElimIndex_11 .cse25)))) (or .cse1 (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) .cse232)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse624 .cse23) .cse623)) (not (bvule v_arrayElimIndex_11 .cse232)) (= v_arrayElimIndex_11 .cse25) (= (select (select .cse624 (select .cse26 v_arrayElimIndex_11)) v_arrayElimCell_152) |c_ULTIMATE.start_main_~data~0#1|) (= v_arrayElimIndex_11 |c_ULTIMATE.start_sll_prepend_~head#1.offset|)))))) .cse55) (or .cse531 .cse532 .cse123 .cse144 (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 .cse26 v_arrayElimIndex_11))) (.cse626 (bvadd (_ bv4294967292 32) v_arrayElimIndex_11)) (.cse627 (select .cse628 .cse23))) (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 .cse25) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse627 |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|)))))) .cse151) (or .cse537 (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) .cse23))) (or (not (bvule .cse629 v_arrayElimIndex_11)) (not (bvule (bvadd (_ bv4 32) v_arrayElimIndex_11) .cse232)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse630 .cse629)) (not (bvule v_arrayElimIndex_11 .cse232)) (= v_arrayElimIndex_11 .cse25) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse630 |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|)))))) (or .cse631 .cse5) (or .cse1 .cse631))) .cse243 .cse244))))))))))) is different from true