./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-simple/dll2n_append_equal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ee4424a-8107-47bf-b6a4-11ede3e4c4d9/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ee4424a-8107-47bf-b6a4-11ede3e4c4d9/bin/uautomizer-uyxdKDjOR8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ee4424a-8107-47bf-b6a4-11ede3e4c4d9/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ee4424a-8107-47bf-b6a4-11ede3e4c4d9/bin/uautomizer-uyxdKDjOR8/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/dll2n_append_equal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ee4424a-8107-47bf-b6a4-11ede3e4c4d9/bin/uautomizer-uyxdKDjOR8/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ee4424a-8107-47bf-b6a4-11ede3e4c4d9/bin/uautomizer-uyxdKDjOR8 --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3a59620f668b7c0725f940bc66e10441fbb56ee9b9fb687de4bd19a3f12eaeda --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-2329fc7 [2022-12-13 17:14:38,341 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 17:14:38,343 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 17:14:38,361 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 17:14:38,361 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 17:14:38,362 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 17:14:38,364 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 17:14:38,365 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 17:14:38,367 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 17:14:38,367 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 17:14:38,368 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 17:14:38,369 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 17:14:38,370 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 17:14:38,371 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 17:14:38,372 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 17:14:38,373 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 17:14:38,374 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 17:14:38,374 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 17:14:38,376 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 17:14:38,378 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 17:14:38,379 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 17:14:38,380 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 17:14:38,381 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 17:14:38,382 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 17:14:38,385 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 17:14:38,386 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 17:14:38,386 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 17:14:38,387 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 17:14:38,387 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 17:14:38,388 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 17:14:38,388 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 17:14:38,389 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 17:14:38,390 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 17:14:38,390 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 17:14:38,391 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 17:14:38,391 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 17:14:38,392 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 17:14:38,392 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 17:14:38,392 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 17:14:38,393 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 17:14:38,393 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 17:14:38,394 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ee4424a-8107-47bf-b6a4-11ede3e4c4d9/bin/uautomizer-uyxdKDjOR8/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-12-13 17:14:38,416 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 17:14:38,416 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 17:14:38,416 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 17:14:38,416 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 17:14:38,422 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 17:14:38,422 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 17:14:38,423 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 17:14:38,423 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 17:14:38,423 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 17:14:38,423 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 17:14:38,423 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 17:14:38,424 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-12-13 17:14:38,424 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 17:14:38,424 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 17:14:38,424 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 17:14:38,424 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-12-13 17:14:38,424 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-12-13 17:14:38,424 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-12-13 17:14:38,424 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 17:14:38,425 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-12-13 17:14:38,425 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 17:14:38,425 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 17:14:38,425 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 17:14:38,425 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 17:14:38,425 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 17:14:38,425 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 17:14:38,426 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 17:14:38,426 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 17:14:38,426 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 17:14:38,426 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 17:14:38,426 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 17:14:38,426 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 17:14:38,427 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 17:14:38,427 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 17:14:38,427 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ee4424a-8107-47bf-b6a4-11ede3e4c4d9/bin/uautomizer-uyxdKDjOR8/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ee4424a-8107-47bf-b6a4-11ede3e4c4d9/bin/uautomizer-uyxdKDjOR8 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 3a59620f668b7c0725f940bc66e10441fbb56ee9b9fb687de4bd19a3f12eaeda [2022-12-13 17:14:38,612 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 17:14:38,632 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 17:14:38,634 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 17:14:38,635 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 17:14:38,635 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 17:14:38,636 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ee4424a-8107-47bf-b6a4-11ede3e4c4d9/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/list-simple/dll2n_append_equal.i [2022-12-13 17:14:41,198 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 17:14:41,374 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 17:14:41,374 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ee4424a-8107-47bf-b6a4-11ede3e4c4d9/sv-benchmarks/c/list-simple/dll2n_append_equal.i [2022-12-13 17:14:41,382 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ee4424a-8107-47bf-b6a4-11ede3e4c4d9/bin/uautomizer-uyxdKDjOR8/data/7ff899fd1/384a66c372ca4387b7739d67cde12c7e/FLAG24c7ee42b [2022-12-13 17:14:41,392 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ee4424a-8107-47bf-b6a4-11ede3e4c4d9/bin/uautomizer-uyxdKDjOR8/data/7ff899fd1/384a66c372ca4387b7739d67cde12c7e [2022-12-13 17:14:41,394 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 17:14:41,395 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 17:14:41,396 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 17:14:41,396 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 17:14:41,398 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 17:14:41,399 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 05:14:41" (1/1) ... [2022-12-13 17:14:41,399 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5460c6dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:14:41, skipping insertion in model container [2022-12-13 17:14:41,399 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 05:14:41" (1/1) ... [2022-12-13 17:14:41,404 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 17:14:41,432 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 17:14:41,646 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ee4424a-8107-47bf-b6a4-11ede3e4c4d9/sv-benchmarks/c/list-simple/dll2n_append_equal.i[24333,24346] [2022-12-13 17:14:41,648 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 17:14:41,655 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 17:14:41,689 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ee4424a-8107-47bf-b6a4-11ede3e4c4d9/sv-benchmarks/c/list-simple/dll2n_append_equal.i[24333,24346] [2022-12-13 17:14:41,690 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 17:14:41,716 INFO L208 MainTranslator]: Completed translation [2022-12-13 17:14:41,716 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:14:41 WrapperNode [2022-12-13 17:14:41,716 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 17:14:41,717 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 17:14:41,717 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 17:14:41,717 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 17:14:41,725 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:14:41" (1/1) ... [2022-12-13 17:14:41,738 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:14:41" (1/1) ... [2022-12-13 17:14:41,760 INFO L138 Inliner]: procedures = 127, calls = 37, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 125 [2022-12-13 17:14:41,760 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 17:14:41,761 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 17:14:41,761 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 17:14:41,761 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 17:14:41,770 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:14:41" (1/1) ... [2022-12-13 17:14:41,771 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:14:41" (1/1) ... [2022-12-13 17:14:41,774 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:14:41" (1/1) ... [2022-12-13 17:14:41,774 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:14:41" (1/1) ... [2022-12-13 17:14:41,782 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:14:41" (1/1) ... [2022-12-13 17:14:41,786 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:14:41" (1/1) ... [2022-12-13 17:14:41,788 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:14:41" (1/1) ... [2022-12-13 17:14:41,789 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:14:41" (1/1) ... [2022-12-13 17:14:41,792 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 17:14:41,792 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 17:14:41,793 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 17:14:41,793 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 17:14:41,794 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:14:41" (1/1) ... [2022-12-13 17:14:41,800 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 17:14:41,811 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ee4424a-8107-47bf-b6a4-11ede3e4c4d9/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:14:41,823 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ee4424a-8107-47bf-b6a4-11ede3e4c4d9/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 17:14:41,825 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ee4424a-8107-47bf-b6a4-11ede3e4c4d9/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 17:14:41,851 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-13 17:14:41,851 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 17:14:41,851 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2022-12-13 17:14:41,851 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2022-12-13 17:14:41,851 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-13 17:14:41,851 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 17:14:41,851 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 17:14:41,851 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-12-13 17:14:41,852 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-12-13 17:14:41,852 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 17:14:41,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-12-13 17:14:41,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 17:14:41,852 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 17:14:41,852 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 17:14:41,942 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 17:14:41,944 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 17:14:42,224 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 17:14:42,230 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 17:14:42,231 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2022-12-13 17:14:42,232 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 05:14:42 BoogieIcfgContainer [2022-12-13 17:14:42,233 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 17:14:42,235 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 17:14:42,235 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 17:14:42,238 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 17:14:42,239 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 05:14:41" (1/3) ... [2022-12-13 17:14:42,239 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4efe2d37 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 05:14:42, skipping insertion in model container [2022-12-13 17:14:42,240 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:14:41" (2/3) ... [2022-12-13 17:14:42,240 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4efe2d37 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 05:14:42, skipping insertion in model container [2022-12-13 17:14:42,240 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 05:14:42" (3/3) ... [2022-12-13 17:14:42,241 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2n_append_equal.i [2022-12-13 17:14:42,260 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 17:14:42,261 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 41 error locations. [2022-12-13 17:14:42,306 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 17:14:42,312 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@5d0e30e2, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 17:14:42,312 INFO L358 AbstractCegarLoop]: Starting to check reachability of 41 error locations. [2022-12-13 17:14:42,317 INFO L276 IsEmpty]: Start isEmpty. Operand has 97 states, 52 states have (on average 2.0384615384615383) internal successors, (106), 93 states have internal predecessors, (106), 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-12-13 17:14:42,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-12-13 17:14:42,324 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:14:42,324 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:14:42,325 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-12-13 17:14:42,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:14:42,330 INFO L85 PathProgramCache]: Analyzing trace with hash 1815348631, now seen corresponding path program 1 times [2022-12-13 17:14:42,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:14:42,340 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856569563] [2022-12-13 17:14:42,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:14:42,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:14:42,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:14:42,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 17:14:42,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:14:42,548 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856569563] [2022-12-13 17:14:42,548 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [856569563] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:14:42,548 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:14:42,549 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 17:14:42,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813751305] [2022-12-13 17:14:42,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:14:42,554 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 17:14:42,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:14:42,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 17:14:42,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 17:14:42,585 INFO L87 Difference]: Start difference. First operand has 97 states, 52 states have (on average 2.0384615384615383) internal successors, (106), 93 states have internal predecessors, (106), 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-12-13 17:14:42,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:14:42,675 INFO L93 Difference]: Finished difference Result 94 states and 102 transitions. [2022-12-13 17:14:42,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 17:14:42,677 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-12-13 17:14:42,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:14:42,682 INFO L225 Difference]: With dead ends: 94 [2022-12-13 17:14:42,682 INFO L226 Difference]: Without dead ends: 91 [2022-12-13 17:14:42,684 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 17:14:42,686 INFO L413 NwaCegarLoop]: 93 mSDtfsCounter, 10 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 17:14:42,687 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 144 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 17:14:42,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-12-13 17:14:42,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2022-12-13 17:14:42,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 50 states have (on average 1.88) internal successors, (94), 87 states have internal predecessors, (94), 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-12-13 17:14:42,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 98 transitions. [2022-12-13 17:14:42,713 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 98 transitions. Word has length 7 [2022-12-13 17:14:42,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:14:42,713 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 98 transitions. [2022-12-13 17:14:42,713 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-12-13 17:14:42,713 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 98 transitions. [2022-12-13 17:14:42,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-12-13 17:14:42,714 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:14:42,714 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:14:42,714 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 17:14:42,714 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-12-13 17:14:42,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:14:42,715 INFO L85 PathProgramCache]: Analyzing trace with hash 1815348632, now seen corresponding path program 1 times [2022-12-13 17:14:42,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:14:42,715 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034062841] [2022-12-13 17:14:42,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:14:42,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:14:42,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:14:42,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 17:14:42,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:14:42,794 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034062841] [2022-12-13 17:14:42,794 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1034062841] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:14:42,795 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:14:42,795 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 17:14:42,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001384281] [2022-12-13 17:14:42,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:14:42,796 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 17:14:42,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:14:42,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 17:14:42,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 17:14:42,797 INFO L87 Difference]: Start difference. First operand 91 states and 98 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-12-13 17:14:42,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:14:42,853 INFO L93 Difference]: Finished difference Result 88 states and 95 transitions. [2022-12-13 17:14:42,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 17:14:42,853 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-12-13 17:14:42,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:14:42,854 INFO L225 Difference]: With dead ends: 88 [2022-12-13 17:14:42,854 INFO L226 Difference]: Without dead ends: 88 [2022-12-13 17:14:42,855 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 17:14:42,856 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 5 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 17:14:42,857 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 144 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 17:14:42,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2022-12-13 17:14:42,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2022-12-13 17:14:42,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 50 states have (on average 1.82) internal successors, (91), 84 states have internal predecessors, (91), 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-12-13 17:14:42,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 95 transitions. [2022-12-13 17:14:42,863 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 95 transitions. Word has length 7 [2022-12-13 17:14:42,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:14:42,863 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 95 transitions. [2022-12-13 17:14:42,863 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-12-13 17:14:42,863 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 95 transitions. [2022-12-13 17:14:42,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-12-13 17:14:42,864 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:14:42,864 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:14:42,864 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 17:14:42,864 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-12-13 17:14:42,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:14:42,865 INFO L85 PathProgramCache]: Analyzing trace with hash 927333361, now seen corresponding path program 1 times [2022-12-13 17:14:42,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:14:42,865 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301426810] [2022-12-13 17:14:42,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:14:42,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:14:42,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:14:43,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:14:43,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:14:43,197 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 17:14:43,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:14:43,198 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301426810] [2022-12-13 17:14:43,198 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [301426810] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:14:43,198 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:14:43,198 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 17:14:43,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336401228] [2022-12-13 17:14:43,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:14:43,199 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 17:14:43,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:14:43,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 17:14:43,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-12-13 17:14:43,201 INFO L87 Difference]: Start difference. First operand 88 states and 95 transitions. Second operand has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-13 17:14:43,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:14:43,374 INFO L93 Difference]: Finished difference Result 91 states and 101 transitions. [2022-12-13 17:14:43,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 17:14:43,375 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 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 14 [2022-12-13 17:14:43,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:14:43,377 INFO L225 Difference]: With dead ends: 91 [2022-12-13 17:14:43,378 INFO L226 Difference]: Without dead ends: 91 [2022-12-13 17:14:43,378 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-12-13 17:14:43,379 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 20 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 17:14:43,379 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 364 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 17:14:43,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-12-13 17:14:43,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 86. [2022-12-13 17:14:43,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 50 states have (on average 1.78) internal successors, (89), 82 states have internal predecessors, (89), 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-12-13 17:14:43,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 93 transitions. [2022-12-13 17:14:43,385 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 93 transitions. Word has length 14 [2022-12-13 17:14:43,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:14:43,386 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 93 transitions. [2022-12-13 17:14:43,386 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-13 17:14:43,386 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 93 transitions. [2022-12-13 17:14:43,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-12-13 17:14:43,387 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:14:43,387 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:14:43,387 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 17:14:43,387 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-12-13 17:14:43,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:14:43,388 INFO L85 PathProgramCache]: Analyzing trace with hash 927333360, now seen corresponding path program 1 times [2022-12-13 17:14:43,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:14:43,388 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861222453] [2022-12-13 17:14:43,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:14:43,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:14:43,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:14:43,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:14:43,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:14:43,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 17:14:43,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:14:43,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861222453] [2022-12-13 17:14:43,482 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861222453] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:14:43,482 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:14:43,483 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 17:14:43,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681868898] [2022-12-13 17:14:43,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:14:43,483 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 17:14:43,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:14:43,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 17:14:43,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-13 17:14:43,484 INFO L87 Difference]: Start difference. First operand 86 states and 93 transitions. Second operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-13 17:14:43,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:14:43,636 INFO L93 Difference]: Finished difference Result 89 states and 99 transitions. [2022-12-13 17:14:43,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 17:14:43,636 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 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 14 [2022-12-13 17:14:43,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:14:43,637 INFO L225 Difference]: With dead ends: 89 [2022-12-13 17:14:43,637 INFO L226 Difference]: Without dead ends: 89 [2022-12-13 17:14:43,637 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-12-13 17:14:43,638 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 15 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 17:14:43,638 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 316 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 17:14:43,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-12-13 17:14:43,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 84. [2022-12-13 17:14:43,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 50 states have (on average 1.74) internal successors, (87), 80 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-12-13 17:14:43,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 91 transitions. [2022-12-13 17:14:43,642 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 91 transitions. Word has length 14 [2022-12-13 17:14:43,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:14:43,642 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 91 transitions. [2022-12-13 17:14:43,642 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-13 17:14:43,642 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 91 transitions. [2022-12-13 17:14:43,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-12-13 17:14:43,643 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:14:43,643 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:14:43,643 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 17:14:43,643 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-12-13 17:14:43,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:14:43,644 INFO L85 PathProgramCache]: Analyzing trace with hash -1763306156, now seen corresponding path program 1 times [2022-12-13 17:14:43,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:14:43,644 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953213507] [2022-12-13 17:14:43,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:14:43,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:14:43,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:14:43,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-12-13 17:14:43,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:14:43,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 17:14:43,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:14:43,704 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953213507] [2022-12-13 17:14:43,704 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [953213507] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:14:43,705 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:14:43,705 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 17:14:43,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493362720] [2022-12-13 17:14:43,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:14:43,705 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 17:14:43,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:14:43,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 17:14:43,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 17:14:43,706 INFO L87 Difference]: Start difference. First operand 84 states and 91 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-13 17:14:43,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:14:43,778 INFO L93 Difference]: Finished difference Result 94 states and 103 transitions. [2022-12-13 17:14:43,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 17:14:43,778 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 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 16 [2022-12-13 17:14:43,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:14:43,779 INFO L225 Difference]: With dead ends: 94 [2022-12-13 17:14:43,779 INFO L226 Difference]: Without dead ends: 94 [2022-12-13 17:14:43,780 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 17:14:43,780 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 9 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 17:14:43,781 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 211 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 17:14:43,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-12-13 17:14:43,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 85. [2022-12-13 17:14:43,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 51 states have (on average 1.7254901960784315) internal successors, (88), 81 states have internal predecessors, (88), 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-12-13 17:14:43,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 92 transitions. [2022-12-13 17:14:43,784 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 92 transitions. Word has length 16 [2022-12-13 17:14:43,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:14:43,784 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 92 transitions. [2022-12-13 17:14:43,785 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-13 17:14:43,785 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 92 transitions. [2022-12-13 17:14:43,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-12-13 17:14:43,785 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:14:43,785 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:14:43,785 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 17:14:43,785 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-12-13 17:14:43,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:14:43,786 INFO L85 PathProgramCache]: Analyzing trace with hash 958467140, now seen corresponding path program 1 times [2022-12-13 17:14:43,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:14:43,786 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17099811] [2022-12-13 17:14:43,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:14:43,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:14:43,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:14:43,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:14:43,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:14:43,841 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 17:14:43,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:14:43,841 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17099811] [2022-12-13 17:14:43,842 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [17099811] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:14:43,842 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:14:43,842 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 17:14:43,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204963358] [2022-12-13 17:14:43,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:14:43,842 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 17:14:43,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:14:43,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 17:14:43,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 17:14:43,843 INFO L87 Difference]: Start difference. First operand 85 states and 92 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-13 17:14:43,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:14:43,909 INFO L93 Difference]: Finished difference Result 91 states and 99 transitions. [2022-12-13 17:14:43,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 17:14:43,910 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 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 17 [2022-12-13 17:14:43,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:14:43,911 INFO L225 Difference]: With dead ends: 91 [2022-12-13 17:14:43,911 INFO L226 Difference]: Without dead ends: 91 [2022-12-13 17:14:43,911 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 17:14:43,912 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 1 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 17:14:43,912 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 207 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 17:14:43,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-12-13 17:14:43,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 90. [2022-12-13 17:14:43,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 55 states have (on average 1.6727272727272726) internal successors, (92), 85 states have internal predecessors, (92), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-13 17:14:43,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 98 transitions. [2022-12-13 17:14:43,918 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 98 transitions. Word has length 17 [2022-12-13 17:14:43,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:14:43,918 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 98 transitions. [2022-12-13 17:14:43,918 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-13 17:14:43,919 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 98 transitions. [2022-12-13 17:14:43,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-12-13 17:14:43,919 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:14:43,919 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:14:43,920 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 17:14:43,920 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-12-13 17:14:43,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:14:43,920 INFO L85 PathProgramCache]: Analyzing trace with hash 239866037, now seen corresponding path program 1 times [2022-12-13 17:14:43,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:14:43,920 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715950329] [2022-12-13 17:14:43,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:14:43,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:14:43,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:14:44,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:14:44,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:14:44,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-12-13 17:14:44,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:14:44,036 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-12-13 17:14:44,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:14:44,036 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715950329] [2022-12-13 17:14:44,037 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1715950329] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 17:14:44,037 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1652339903] [2022-12-13 17:14:44,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:14:44,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 17:14:44,037 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ee4424a-8107-47bf-b6a4-11ede3e4c4d9/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:14:44,038 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ee4424a-8107-47bf-b6a4-11ede3e4c4d9/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 17:14:44,039 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ee4424a-8107-47bf-b6a4-11ede3e4c4d9/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-13 17:14:44,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:14:44,132 INFO L263 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-13 17:14:44,136 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 17:14:44,178 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 17:14:44,178 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 17:14:44,211 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-12-13 17:14:44,211 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1652339903] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 17:14:44,211 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 17:14:44,211 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 6 [2022-12-13 17:14:44,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497892028] [2022-12-13 17:14:44,211 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 17:14:44,211 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 17:14:44,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:14:44,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 17:14:44,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-13 17:14:44,212 INFO L87 Difference]: Start difference. First operand 90 states and 98 transitions. Second operand has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 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-12-13 17:14:44,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:14:44,292 INFO L93 Difference]: Finished difference Result 92 states and 100 transitions. [2022-12-13 17:14:44,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 17:14:44,292 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 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 31 [2022-12-13 17:14:44,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:14:44,293 INFO L225 Difference]: With dead ends: 92 [2022-12-13 17:14:44,293 INFO L226 Difference]: Without dead ends: 92 [2022-12-13 17:14:44,293 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 62 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-12-13 17:14:44,294 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 9 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 17:14:44,294 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 218 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 17:14:44,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-12-13 17:14:44,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2022-12-13 17:14:44,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 57 states have (on average 1.6491228070175439) internal successors, (94), 87 states have internal predecessors, (94), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-13 17:14:44,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 100 transitions. [2022-12-13 17:14:44,299 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 100 transitions. Word has length 31 [2022-12-13 17:14:44,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:14:44,300 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 100 transitions. [2022-12-13 17:14:44,300 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 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-12-13 17:14:44,300 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 100 transitions. [2022-12-13 17:14:44,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-12-13 17:14:44,301 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:14:44,301 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-12-13 17:14:44,307 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ee4424a-8107-47bf-b6a4-11ede3e4c4d9/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-13 17:14:44,502 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ee4424a-8107-47bf-b6a4-11ede3e4c4d9/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2022-12-13 17:14:44,503 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-12-13 17:14:44,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:14:44,504 INFO L85 PathProgramCache]: Analyzing trace with hash -1367704317, now seen corresponding path program 1 times [2022-12-13 17:14:44,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:14:44,505 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767791089] [2022-12-13 17:14:44,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:14:44,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:14:44,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:14:44,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:14:44,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:14:44,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-12-13 17:14:44,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:14:44,845 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 17:14:44,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:14:44,845 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767791089] [2022-12-13 17:14:44,845 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [767791089] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 17:14:44,846 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1340754388] [2022-12-13 17:14:44,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:14:44,846 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 17:14:44,846 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ee4424a-8107-47bf-b6a4-11ede3e4c4d9/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:14:44,847 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ee4424a-8107-47bf-b6a4-11ede3e4c4d9/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 17:14:44,847 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ee4424a-8107-47bf-b6a4-11ede3e4c4d9/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-13 17:14:44,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:14:44,932 INFO L263 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 17 conjunts are in the unsatisfiable core [2022-12-13 17:14:44,934 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 17:14:44,962 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 17:14:45,021 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_510 Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_510))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2022-12-13 17:14:45,092 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-12-13 17:14:45,092 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-12-13 17:14:45,102 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2022-12-13 17:14:45,102 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 17:14:45,150 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1340754388] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 17:14:45,150 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 17:14:45,150 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 11 [2022-12-13 17:14:45,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861980645] [2022-12-13 17:14:45,150 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 17:14:45,151 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-13 17:14:45,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:14:45,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-13 17:14:45,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=107, Unknown=1, NotChecked=20, Total=156 [2022-12-13 17:14:45,152 INFO L87 Difference]: Start difference. First operand 92 states and 100 transitions. Second operand has 12 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 9 states have internal predecessors, (38), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-12-13 17:14:45,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:14:45,418 INFO L93 Difference]: Finished difference Result 103 states and 112 transitions. [2022-12-13 17:14:45,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 17:14:45,419 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 9 states have internal predecessors, (38), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 32 [2022-12-13 17:14:45,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:14:45,420 INFO L225 Difference]: With dead ends: 103 [2022-12-13 17:14:45,420 INFO L226 Difference]: Without dead ends: 103 [2022-12-13 17:14:45,420 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=191, Unknown=1, NotChecked=28, Total=272 [2022-12-13 17:14:45,420 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 142 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 359 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 454 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 359 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 91 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 17:14:45,421 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 275 Invalid, 454 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 359 Invalid, 0 Unknown, 91 Unchecked, 0.2s Time] [2022-12-13 17:14:45,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2022-12-13 17:14:45,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 91. [2022-12-13 17:14:45,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 57 states have (on average 1.631578947368421) internal successors, (93), 86 states have internal predecessors, (93), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-13 17:14:45,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 99 transitions. [2022-12-13 17:14:45,424 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 99 transitions. Word has length 32 [2022-12-13 17:14:45,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:14:45,424 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 99 transitions. [2022-12-13 17:14:45,425 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 9 states have internal predecessors, (38), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-12-13 17:14:45,425 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 99 transitions. [2022-12-13 17:14:45,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-12-13 17:14:45,426 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:14:45,426 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-12-13 17:14:45,430 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ee4424a-8107-47bf-b6a4-11ede3e4c4d9/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-12-13 17:14:45,626 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ee4424a-8107-47bf-b6a4-11ede3e4c4d9/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 17:14:45,627 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-12-13 17:14:45,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:14:45,627 INFO L85 PathProgramCache]: Analyzing trace with hash -1367704316, now seen corresponding path program 1 times [2022-12-13 17:14:45,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:14:45,627 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309470560] [2022-12-13 17:14:45,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:14:45,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:14:45,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:14:45,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:14:45,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:14:45,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-12-13 17:14:45,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:14:46,064 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 17:14:46,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:14:46,065 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309470560] [2022-12-13 17:14:46,065 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [309470560] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 17:14:46,065 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [653636703] [2022-12-13 17:14:46,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:14:46,065 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 17:14:46,065 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ee4424a-8107-47bf-b6a4-11ede3e4c4d9/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:14:46,066 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ee4424a-8107-47bf-b6a4-11ede3e4c4d9/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 17:14:46,067 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ee4424a-8107-47bf-b6a4-11ede3e4c4d9/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-13 17:14:46,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:14:46,175 INFO L263 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 37 conjunts are in the unsatisfiable core [2022-12-13 17:14:46,177 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 17:14:46,181 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 17:14:46,379 INFO L321 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2022-12-13 17:14:46,379 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 13 [2022-12-13 17:14:46,393 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-13 17:14:46,393 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-12-13 17:14:46,423 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 17:14:46,423 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 17:14:52,598 WARN L233 SmtUtils]: Spent 6.08s on a formula simplification that was a NOOP. DAG size: 24 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 17:14:52,600 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [653636703] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 17:14:52,600 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 17:14:52,600 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 17 [2022-12-13 17:14:52,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255542607] [2022-12-13 17:14:52,600 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 17:14:52,600 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-12-13 17:14:52,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:14:52,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-12-13 17:14:52,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=327, Unknown=0, NotChecked=0, Total=380 [2022-12-13 17:14:52,601 INFO L87 Difference]: Start difference. First operand 91 states and 99 transitions. Second operand has 18 states, 17 states have (on average 2.2941176470588234) internal successors, (39), 14 states have internal predecessors, (39), 2 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-12-13 17:14:53,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:14:53,079 INFO L93 Difference]: Finished difference Result 91 states and 99 transitions. [2022-12-13 17:14:53,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 17:14:53,080 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 2.2941176470588234) internal successors, (39), 14 states have internal predecessors, (39), 2 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 32 [2022-12-13 17:14:53,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:14:53,080 INFO L225 Difference]: With dead ends: 91 [2022-12-13 17:14:53,080 INFO L226 Difference]: Without dead ends: 91 [2022-12-13 17:14:53,081 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=92, Invalid=508, Unknown=0, NotChecked=0, Total=600 [2022-12-13 17:14:53,081 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 81 mSDsluCounter, 462 mSDsCounter, 0 mSdLazyCounter, 802 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 515 SdHoareTripleChecker+Invalid, 806 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 802 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-13 17:14:53,081 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 515 Invalid, 806 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 802 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-13 17:14:53,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-12-13 17:14:53,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 90. [2022-12-13 17:14:53,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 57 states have (on average 1.6140350877192982) internal successors, (92), 85 states have internal predecessors, (92), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-13 17:14:53,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 98 transitions. [2022-12-13 17:14:53,085 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 98 transitions. Word has length 32 [2022-12-13 17:14:53,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:14:53,085 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 98 transitions. [2022-12-13 17:14:53,085 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 2.2941176470588234) internal successors, (39), 14 states have internal predecessors, (39), 2 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-12-13 17:14:53,085 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 98 transitions. [2022-12-13 17:14:53,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-12-13 17:14:53,086 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:14:53,086 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:14:53,091 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ee4424a-8107-47bf-b6a4-11ede3e4c4d9/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-12-13 17:14:53,286 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ee4424a-8107-47bf-b6a4-11ede3e4c4d9/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-12-13 17:14:53,286 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-12-13 17:14:53,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:14:53,287 INFO L85 PathProgramCache]: Analyzing trace with hash -1122646220, now seen corresponding path program 2 times [2022-12-13 17:14:53,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:14:53,287 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414099367] [2022-12-13 17:14:53,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:14:53,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:14:53,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:14:53,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:14:53,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:14:53,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-12-13 17:14:53,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:14:53,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-12-13 17:14:53,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:14:53,412 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 5 proven. 18 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-12-13 17:14:53,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:14:53,412 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414099367] [2022-12-13 17:14:53,412 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1414099367] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 17:14:53,412 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1836468247] [2022-12-13 17:14:53,412 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 17:14:53,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 17:14:53,413 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ee4424a-8107-47bf-b6a4-11ede3e4c4d9/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:14:53,413 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ee4424a-8107-47bf-b6a4-11ede3e4c4d9/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 17:14:53,414 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ee4424a-8107-47bf-b6a4-11ede3e4c4d9/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-13 17:14:53,543 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 17:14:53,543 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 17:14:53,545 INFO L263 TraceCheckSpWp]: Trace formula consists of 422 conjuncts, 11 conjunts are in the unsatisfiable core [2022-12-13 17:14:53,548 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 17:14:53,575 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 21 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 17:14:53,575 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 17:14:53,619 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 5 proven. 18 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-12-13 17:14:53,619 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1836468247] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 17:14:53,619 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 17:14:53,619 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 8 [2022-12-13 17:14:53,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013914946] [2022-12-13 17:14:53,620 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 17:14:53,620 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 17:14:53,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:14:53,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 17:14:53,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-13 17:14:53,621 INFO L87 Difference]: Start difference. First operand 90 states and 98 transitions. Second operand has 8 states, 8 states have (on average 5.25) internal successors, (42), 6 states have internal predecessors, (42), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-12-13 17:14:53,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:14:53,758 INFO L93 Difference]: Finished difference Result 90 states and 97 transitions. [2022-12-13 17:14:53,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 17:14:53,758 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 6 states have internal predecessors, (42), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 46 [2022-12-13 17:14:53,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:14:53,759 INFO L225 Difference]: With dead ends: 90 [2022-12-13 17:14:53,759 INFO L226 Difference]: Without dead ends: 90 [2022-12-13 17:14:53,759 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-12-13 17:14:53,760 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 144 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 17:14:53,760 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 355 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 17:14:53,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2022-12-13 17:14:53,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2022-12-13 17:14:53,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 57 states have (on average 1.5964912280701755) internal successors, (91), 85 states have internal predecessors, (91), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-13 17:14:53,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 97 transitions. [2022-12-13 17:14:53,763 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 97 transitions. Word has length 46 [2022-12-13 17:14:53,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:14:53,763 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 97 transitions. [2022-12-13 17:14:53,763 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 6 states have internal predecessors, (42), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-12-13 17:14:53,763 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 97 transitions. [2022-12-13 17:14:53,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-12-13 17:14:53,764 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:14:53,764 INFO L195 NwaCegarLoop]: trace histogram [3, 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-12-13 17:14:53,769 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ee4424a-8107-47bf-b6a4-11ede3e4c4d9/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-12-13 17:14:53,964 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ee4424a-8107-47bf-b6a4-11ede3e4c4d9/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 17:14:53,966 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-12-13 17:14:53,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:14:53,967 INFO L85 PathProgramCache]: Analyzing trace with hash 186649324, now seen corresponding path program 1 times [2022-12-13 17:14:53,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:14:53,967 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586110631] [2022-12-13 17:14:53,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:14:53,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:14:54,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:14:54,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:14:54,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:14:54,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-12-13 17:14:54,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:14:54,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-12-13 17:14:54,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:14:54,441 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-12-13 17:14:54,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:14:54,442 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586110631] [2022-12-13 17:14:54,442 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1586110631] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 17:14:54,442 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1429574484] [2022-12-13 17:14:54,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:14:54,442 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 17:14:54,442 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ee4424a-8107-47bf-b6a4-11ede3e4c4d9/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:14:54,443 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ee4424a-8107-47bf-b6a4-11ede3e4c4d9/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 17:14:54,453 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ee4424a-8107-47bf-b6a4-11ede3e4c4d9/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-13 17:14:54,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:14:54,564 INFO L263 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 33 conjunts are in the unsatisfiable core [2022-12-13 17:14:54,567 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 17:14:54,572 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 17:14:54,585 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-12-13 17:14:54,599 WARN L859 $PredicateComparison]: unable to prove that (and (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_1168 Int)) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| v_ArrVal_1168)))) is different from true [2022-12-13 17:14:54,621 WARN L859 $PredicateComparison]: unable to prove that (and (< |c_node_create_#res#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_1168 Int)) (= |c_#valid| (store |c_old(#valid)| |c_node_create_#res#1.base| v_ArrVal_1168)))) is different from true [2022-12-13 17:14:54,631 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:14:54,632 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-12-13 17:14:54,694 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| 1))) is different from true [2022-12-13 17:14:54,717 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 17:14:54,717 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2022-12-13 17:14:54,852 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:14:54,865 INFO L321 Elim1Store]: treesize reduction 28, result has 28.2 percent of original size [2022-12-13 17:14:54,865 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 22 [2022-12-13 17:14:54,896 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 10 trivial. 14 not checked. [2022-12-13 17:14:54,896 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 17:14:55,069 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1429574484] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 17:14:55,070 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 17:14:55,070 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 18 [2022-12-13 17:14:55,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435760555] [2022-12-13 17:14:55,070 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 17:14:55,070 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-12-13 17:14:55,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:14:55,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-12-13 17:14:55,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=280, Unknown=3, NotChecked=108, Total=462 [2022-12-13 17:14:55,072 INFO L87 Difference]: Start difference. First operand 90 states and 97 transitions. Second operand has 19 states, 18 states have (on average 3.5555555555555554) internal successors, (64), 16 states have internal predecessors, (64), 4 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-12-13 17:14:55,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:14:55,521 INFO L93 Difference]: Finished difference Result 97 states and 105 transitions. [2022-12-13 17:14:55,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-13 17:14:55,522 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 3.5555555555555554) internal successors, (64), 16 states have internal predecessors, (64), 4 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 47 [2022-12-13 17:14:55,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:14:55,523 INFO L225 Difference]: With dead ends: 97 [2022-12-13 17:14:55,523 INFO L226 Difference]: Without dead ends: 97 [2022-12-13 17:14:55,524 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 57 SyntacticMatches, 5 SemanticMatches, 28 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=148, Invalid=563, Unknown=3, NotChecked=156, Total=870 [2022-12-13 17:14:55,524 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 310 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 394 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 310 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 703 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 298 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-13 17:14:55,524 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [310 Valid, 242 Invalid, 703 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 394 Invalid, 0 Unknown, 298 Unchecked, 0.3s Time] [2022-12-13 17:14:55,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-12-13 17:14:55,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 85. [2022-12-13 17:14:55,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 57 states have (on average 1.5087719298245614) internal successors, (86), 80 states have internal predecessors, (86), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-13 17:14:55,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 92 transitions. [2022-12-13 17:14:55,528 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 92 transitions. Word has length 47 [2022-12-13 17:14:55,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:14:55,529 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 92 transitions. [2022-12-13 17:14:55,529 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 3.5555555555555554) internal successors, (64), 16 states have internal predecessors, (64), 4 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-12-13 17:14:55,529 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 92 transitions. [2022-12-13 17:14:55,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-12-13 17:14:55,529 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:14:55,529 INFO L195 NwaCegarLoop]: trace histogram [3, 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-12-13 17:14:55,535 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ee4424a-8107-47bf-b6a4-11ede3e4c4d9/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-12-13 17:14:55,730 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ee4424a-8107-47bf-b6a4-11ede3e4c4d9/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 17:14:55,731 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-12-13 17:14:55,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:14:55,733 INFO L85 PathProgramCache]: Analyzing trace with hash 186649325, now seen corresponding path program 1 times [2022-12-13 17:14:55,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:14:55,733 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051916431] [2022-12-13 17:14:55,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:14:55,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:14:55,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:14:56,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:14:56,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:14:56,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-12-13 17:14:56,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:14:56,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-12-13 17:14:56,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:14:56,251 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-13 17:14:56,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:14:56,252 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051916431] [2022-12-13 17:14:56,252 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051916431] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 17:14:56,252 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1069417653] [2022-12-13 17:14:56,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:14:56,252 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 17:14:56,252 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ee4424a-8107-47bf-b6a4-11ede3e4c4d9/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:14:56,253 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ee4424a-8107-47bf-b6a4-11ede3e4c4d9/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 17:14:56,254 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ee4424a-8107-47bf-b6a4-11ede3e4c4d9/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-13 17:14:56,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:14:56,385 INFO L263 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 26 conjunts are in the unsatisfiable core [2022-12-13 17:14:56,388 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 17:14:56,395 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 17:14:56,414 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-12-13 17:14:56,427 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_1418 Int)) (= (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_1418) |c_#length|)))) is different from true [2022-12-13 17:14:56,461 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:14:56,461 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-12-13 17:14:56,491 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-12-13 17:14:56,498 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_1419 Int)) (= (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_1419) |c_#length|)))) is different from true [2022-12-13 17:14:56,533 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:14:56,534 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-12-13 17:14:56,595 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-12-13 17:14:56,603 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_1420 Int)) (= (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_1420) |c_#length|)))) is different from true [2022-12-13 17:14:56,639 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:14:56,640 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-12-13 17:14:56,655 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 21 not checked. [2022-12-13 17:14:56,655 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 17:14:56,884 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1069417653] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 17:14:56,884 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 17:14:56,884 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2022-12-13 17:14:56,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561857764] [2022-12-13 17:14:56,884 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 17:14:56,885 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-13 17:14:56,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:14:56,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-13 17:14:56,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=167, Unknown=3, NotChecked=84, Total=306 [2022-12-13 17:14:56,885 INFO L87 Difference]: Start difference. First operand 85 states and 92 transitions. Second operand has 16 states, 13 states have (on average 4.461538461538462) internal successors, (58), 14 states have internal predecessors, (58), 5 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2022-12-13 17:14:57,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:14:57,116 INFO L93 Difference]: Finished difference Result 92 states and 100 transitions. [2022-12-13 17:14:57,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 17:14:57,116 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 13 states have (on average 4.461538461538462) internal successors, (58), 14 states have internal predecessors, (58), 5 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) Word has length 47 [2022-12-13 17:14:57,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:14:57,116 INFO L225 Difference]: With dead ends: 92 [2022-12-13 17:14:57,116 INFO L226 Difference]: Without dead ends: 92 [2022-12-13 17:14:57,117 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=74, Invalid=207, Unknown=3, NotChecked=96, Total=380 [2022-12-13 17:14:57,117 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 202 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 293 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 564 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 264 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 17:14:57,117 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 218 Invalid, 564 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 293 Invalid, 0 Unknown, 264 Unchecked, 0.2s Time] [2022-12-13 17:14:57,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-12-13 17:14:57,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 80. [2022-12-13 17:14:57,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 57 states have (on average 1.4210526315789473) internal successors, (81), 75 states have internal predecessors, (81), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-13 17:14:57,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 87 transitions. [2022-12-13 17:14:57,120 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 87 transitions. Word has length 47 [2022-12-13 17:14:57,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:14:57,120 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 87 transitions. [2022-12-13 17:14:57,120 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 13 states have (on average 4.461538461538462) internal successors, (58), 14 states have internal predecessors, (58), 5 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2022-12-13 17:14:57,120 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 87 transitions. [2022-12-13 17:14:57,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-12-13 17:14:57,121 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:14:57,121 INFO L195 NwaCegarLoop]: trace histogram [3, 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-12-13 17:14:57,126 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ee4424a-8107-47bf-b6a4-11ede3e4c4d9/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-12-13 17:14:57,321 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ee4424a-8107-47bf-b6a4-11ede3e4c4d9/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 17:14:57,323 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-12-13 17:14:57,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:14:57,324 INFO L85 PathProgramCache]: Analyzing trace with hash 353447346, now seen corresponding path program 1 times [2022-12-13 17:14:57,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:14:57,324 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452389725] [2022-12-13 17:14:57,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:14:57,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:14:57,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:14:57,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:14:57,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:14:57,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-12-13 17:14:57,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:14:57,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-12-13 17:14:57,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:14:57,863 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 21 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-12-13 17:14:57,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:14:57,863 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452389725] [2022-12-13 17:14:57,863 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1452389725] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 17:14:57,863 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1106837988] [2022-12-13 17:14:57,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:14:57,863 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 17:14:57,863 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ee4424a-8107-47bf-b6a4-11ede3e4c4d9/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:14:57,864 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ee4424a-8107-47bf-b6a4-11ede3e4c4d9/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 17:14:57,865 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ee4424a-8107-47bf-b6a4-11ede3e4c4d9/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-13 17:14:58,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:14:58,005 INFO L263 TraceCheckSpWp]: Trace formula consists of 456 conjuncts, 44 conjunts are in the unsatisfiable core [2022-12-13 17:14:58,008 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 17:14:58,046 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 17:14:58,202 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2022-12-13 17:14:58,310 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int) (v_ArrVal_1672 (Array Int Int))) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_1672)))) is different from true [2022-12-13 17:14:58,334 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:14:58,335 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-12-13 17:14:58,346 INFO L321 Elim1Store]: treesize reduction 32, result has 36.0 percent of original size [2022-12-13 17:14:58,346 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 24 [2022-12-13 17:14:58,375 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-12-13 17:14:58,378 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 23 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 3 not checked. [2022-12-13 17:14:58,378 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 17:14:58,461 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1106837988] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 17:14:58,461 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 17:14:58,461 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 25 [2022-12-13 17:14:58,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216988805] [2022-12-13 17:14:58,461 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 17:14:58,461 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-12-13 17:14:58,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:14:58,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-12-13 17:14:58,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=572, Unknown=1, NotChecked=48, Total=702 [2022-12-13 17:14:58,462 INFO L87 Difference]: Start difference. First operand 80 states and 87 transitions. Second operand has 26 states, 23 states have (on average 3.0434782608695654) internal successors, (70), 22 states have internal predecessors, (70), 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-12-13 17:14:59,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:14:59,056 INFO L93 Difference]: Finished difference Result 121 states and 132 transitions. [2022-12-13 17:14:59,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-13 17:14:59,057 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 23 states have (on average 3.0434782608695654) internal successors, (70), 22 states have internal predecessors, (70), 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 51 [2022-12-13 17:14:59,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:14:59,058 INFO L225 Difference]: With dead ends: 121 [2022-12-13 17:14:59,058 INFO L226 Difference]: Without dead ends: 121 [2022-12-13 17:14:59,058 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 51 SyntacticMatches, 4 SemanticMatches, 35 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 272 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=199, Invalid=1064, Unknown=1, NotChecked=68, Total=1332 [2022-12-13 17:14:59,059 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 344 mSDsluCounter, 464 mSDsCounter, 0 mSdLazyCounter, 765 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 344 SdHoareTripleChecker+Valid, 520 SdHoareTripleChecker+Invalid, 889 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 765 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 113 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-13 17:14:59,059 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [344 Valid, 520 Invalid, 889 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 765 Invalid, 0 Unknown, 113 Unchecked, 0.4s Time] [2022-12-13 17:14:59,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2022-12-13 17:14:59,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 79. [2022-12-13 17:14:59,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 58 states have (on average 1.396551724137931) internal successors, (81), 74 states have internal predecessors, (81), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-13 17:14:59,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 87 transitions. [2022-12-13 17:14:59,062 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 87 transitions. Word has length 51 [2022-12-13 17:14:59,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:14:59,062 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 87 transitions. [2022-12-13 17:14:59,062 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 23 states have (on average 3.0434782608695654) internal successors, (70), 22 states have internal predecessors, (70), 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-12-13 17:14:59,063 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 87 transitions. [2022-12-13 17:14:59,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-12-13 17:14:59,063 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:14:59,064 INFO L195 NwaCegarLoop]: trace histogram [3, 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-12-13 17:14:59,068 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ee4424a-8107-47bf-b6a4-11ede3e4c4d9/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-12-13 17:14:59,264 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ee4424a-8107-47bf-b6a4-11ede3e4c4d9/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-12-13 17:14:59,265 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-12-13 17:14:59,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:14:59,266 INFO L85 PathProgramCache]: Analyzing trace with hash 353447347, now seen corresponding path program 1 times [2022-12-13 17:14:59,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:14:59,267 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217130933] [2022-12-13 17:14:59,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:14:59,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:14:59,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:14:59,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:14:59,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:14:59,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-12-13 17:14:59,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:14:59,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-12-13 17:14:59,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:15:00,406 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 21 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-13 17:15:00,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:15:00,406 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217130933] [2022-12-13 17:15:00,406 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [217130933] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 17:15:00,406 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [957406444] [2022-12-13 17:15:00,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:15:00,406 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 17:15:00,406 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ee4424a-8107-47bf-b6a4-11ede3e4c4d9/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:15:00,407 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ee4424a-8107-47bf-b6a4-11ede3e4c4d9/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 17:15:00,408 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ee4424a-8107-47bf-b6a4-11ede3e4c4d9/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-12-13 17:15:00,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:15:00,522 INFO L263 TraceCheckSpWp]: Trace formula consists of 456 conjuncts, 66 conjunts are in the unsatisfiable core [2022-12-13 17:15:00,525 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 17:15:00,567 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 17:15:00,894 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2022-12-13 17:15:00,898 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2022-12-13 17:15:01,070 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_1926 Int)) (= (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_1926) |c_#length|)) (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_1931 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_1931))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)) (exists ((v_ArrVal_1932 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_1932) |c_#memory_$Pointer$.offset|)))) is different from true [2022-12-13 17:15:01,101 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:15:01,102 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 31 [2022-12-13 17:15:01,106 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:15:01,107 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-12-13 17:15:01,111 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:15:01,112 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 29 [2022-12-13 17:15:01,122 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-12-13 17:15:01,122 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2022-12-13 17:15:01,168 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2022-12-13 17:15:01,170 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2022-12-13 17:15:01,227 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 23 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 3 not checked. [2022-12-13 17:15:01,227 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 17:15:01,490 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [957406444] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 17:15:01,490 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 17:15:01,490 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18] total 34 [2022-12-13 17:15:01,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504901889] [2022-12-13 17:15:01,490 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 17:15:01,490 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-12-13 17:15:01,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:15:01,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-12-13 17:15:01,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=1296, Unknown=2, NotChecked=72, Total=1482 [2022-12-13 17:15:01,492 INFO L87 Difference]: Start difference. First operand 79 states and 87 transitions. Second operand has 35 states, 32 states have (on average 2.53125) internal successors, (81), 31 states have internal predecessors, (81), 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-12-13 17:15:03,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:15:03,082 INFO L93 Difference]: Finished difference Result 117 states and 127 transitions. [2022-12-13 17:15:03,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-12-13 17:15:03,083 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 32 states have (on average 2.53125) internal successors, (81), 31 states have internal predecessors, (81), 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 51 [2022-12-13 17:15:03,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:15:03,084 INFO L225 Difference]: With dead ends: 117 [2022-12-13 17:15:03,084 INFO L226 Difference]: Without dead ends: 117 [2022-12-13 17:15:03,085 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 535 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=292, Invalid=2569, Unknown=5, NotChecked=104, Total=2970 [2022-12-13 17:15:03,086 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 532 mSDsluCounter, 964 mSDsCounter, 0 mSdLazyCounter, 1269 mSolverCounterSat, 18 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 532 SdHoareTripleChecker+Valid, 1026 SdHoareTripleChecker+Invalid, 1377 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 1269 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 87 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-12-13 17:15:03,086 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [532 Valid, 1026 Invalid, 1377 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 1269 Invalid, 3 Unknown, 87 Unchecked, 0.8s Time] [2022-12-13 17:15:03,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2022-12-13 17:15:03,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 82. [2022-12-13 17:15:03,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 61 states have (on average 1.3770491803278688) internal successors, (84), 77 states have internal predecessors, (84), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-13 17:15:03,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 90 transitions. [2022-12-13 17:15:03,088 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 90 transitions. Word has length 51 [2022-12-13 17:15:03,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:15:03,089 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 90 transitions. [2022-12-13 17:15:03,089 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 32 states have (on average 2.53125) internal successors, (81), 31 states have internal predecessors, (81), 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-12-13 17:15:03,089 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 90 transitions. [2022-12-13 17:15:03,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-12-13 17:15:03,089 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:15:03,089 INFO L195 NwaCegarLoop]: trace histogram [3, 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] [2022-12-13 17:15:03,094 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ee4424a-8107-47bf-b6a4-11ede3e4c4d9/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-12-13 17:15:03,290 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ee4424a-8107-47bf-b6a4-11ede3e4c4d9/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-12-13 17:15:03,292 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-12-13 17:15:03,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:15:03,293 INFO L85 PathProgramCache]: Analyzing trace with hash -1709893007, now seen corresponding path program 1 times [2022-12-13 17:15:03,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:15:03,293 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527489426] [2022-12-13 17:15:03,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:15:03,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:15:03,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:15:03,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:15:03,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:15:03,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-12-13 17:15:03,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:15:03,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-12-13 17:15:03,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:15:03,439 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-12-13 17:15:03,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:15:03,439 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527489426] [2022-12-13 17:15:03,439 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1527489426] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:15:03,439 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:15:03,439 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 17:15:03,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507364895] [2022-12-13 17:15:03,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:15:03,440 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 17:15:03,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:15:03,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 17:15:03,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-13 17:15:03,441 INFO L87 Difference]: Start difference. First operand 82 states and 90 transitions. Second operand has 7 states, 6 states have (on average 5.666666666666667) internal successors, (34), 5 states have internal predecessors, (34), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-13 17:15:03,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:15:03,544 INFO L93 Difference]: Finished difference Result 93 states and 102 transitions. [2022-12-13 17:15:03,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 17:15:03,544 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.666666666666667) internal successors, (34), 5 states have internal predecessors, (34), 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 54 [2022-12-13 17:15:03,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:15:03,545 INFO L225 Difference]: With dead ends: 93 [2022-12-13 17:15:03,545 INFO L226 Difference]: Without dead ends: 93 [2022-12-13 17:15:03,546 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-12-13 17:15:03,546 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 44 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 17:15:03,546 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 219 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 17:15:03,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-12-13 17:15:03,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 81. [2022-12-13 17:15:03,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 61 states have (on average 1.360655737704918) internal successors, (83), 76 states have internal predecessors, (83), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-13 17:15:03,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 89 transitions. [2022-12-13 17:15:03,549 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 89 transitions. Word has length 54 [2022-12-13 17:15:03,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:15:03,549 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 89 transitions. [2022-12-13 17:15:03,549 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.666666666666667) internal successors, (34), 5 states have internal predecessors, (34), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-13 17:15:03,549 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 89 transitions. [2022-12-13 17:15:03,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-12-13 17:15:03,550 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:15:03,550 INFO L195 NwaCegarLoop]: trace histogram [3, 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] [2022-12-13 17:15:03,550 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-13 17:15:03,550 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-12-13 17:15:03,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:15:03,550 INFO L85 PathProgramCache]: Analyzing trace with hash -1709893006, now seen corresponding path program 1 times [2022-12-13 17:15:03,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:15:03,550 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272449289] [2022-12-13 17:15:03,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:15:03,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:15:03,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:15:03,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:15:03,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:15:03,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-12-13 17:15:03,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:15:03,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-12-13 17:15:03,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:15:03,737 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-12-13 17:15:03,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:15:03,737 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272449289] [2022-12-13 17:15:03,737 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [272449289] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:15:03,737 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:15:03,738 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 17:15:03,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761846348] [2022-12-13 17:15:03,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:15:03,738 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 17:15:03,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:15:03,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 17:15:03,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-13 17:15:03,739 INFO L87 Difference]: Start difference. First operand 81 states and 89 transitions. Second operand has 7 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-13 17:15:03,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:15:03,844 INFO L93 Difference]: Finished difference Result 80 states and 88 transitions. [2022-12-13 17:15:03,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 17:15:03,844 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 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 54 [2022-12-13 17:15:03,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:15:03,845 INFO L225 Difference]: With dead ends: 80 [2022-12-13 17:15:03,845 INFO L226 Difference]: Without dead ends: 80 [2022-12-13 17:15:03,845 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-12-13 17:15:03,845 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 45 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 17:15:03,845 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 218 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 17:15:03,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-12-13 17:15:03,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2022-12-13 17:15:03,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 61 states have (on average 1.3442622950819672) internal successors, (82), 75 states have internal predecessors, (82), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-13 17:15:03,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 88 transitions. [2022-12-13 17:15:03,847 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 88 transitions. Word has length 54 [2022-12-13 17:15:03,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:15:03,848 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 88 transitions. [2022-12-13 17:15:03,848 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-13 17:15:03,848 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 88 transitions. [2022-12-13 17:15:03,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-12-13 17:15:03,848 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:15:03,848 INFO L195 NwaCegarLoop]: trace histogram [3, 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] [2022-12-13 17:15:03,848 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-13 17:15:03,848 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-12-13 17:15:03,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:15:03,849 INFO L85 PathProgramCache]: Analyzing trace with hash -1969948792, now seen corresponding path program 1 times [2022-12-13 17:15:03,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:15:03,849 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914743286] [2022-12-13 17:15:03,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:15:03,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:15:03,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:15:04,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:15:04,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:15:04,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-12-13 17:15:04,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:15:04,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-12-13 17:15:04,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:15:04,049 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-12-13 17:15:04,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:15:04,049 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914743286] [2022-12-13 17:15:04,050 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1914743286] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:15:04,050 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:15:04,050 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-13 17:15:04,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009306052] [2022-12-13 17:15:04,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:15:04,050 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 17:15:04,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:15:04,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 17:15:04,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-12-13 17:15:04,051 INFO L87 Difference]: Start difference. First operand 80 states and 88 transitions. Second operand has 11 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 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-12-13 17:15:04,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:15:04,260 INFO L93 Difference]: Finished difference Result 141 states and 154 transitions. [2022-12-13 17:15:04,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-13 17:15:04,261 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 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 54 [2022-12-13 17:15:04,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:15:04,262 INFO L225 Difference]: With dead ends: 141 [2022-12-13 17:15:04,263 INFO L226 Difference]: Without dead ends: 141 [2022-12-13 17:15:04,263 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2022-12-13 17:15:04,263 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 165 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 330 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 333 SdHoareTripleChecker+Invalid, 334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 330 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 17:15:04,264 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 333 Invalid, 334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 330 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 17:15:04,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2022-12-13 17:15:04,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 84. [2022-12-13 17:15:04,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 66 states have (on average 1.3333333333333333) internal successors, (88), 79 states have internal predecessors, (88), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-13 17:15:04,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 94 transitions. [2022-12-13 17:15:04,266 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 94 transitions. Word has length 54 [2022-12-13 17:15:04,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:15:04,266 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 94 transitions. [2022-12-13 17:15:04,266 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 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-12-13 17:15:04,266 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 94 transitions. [2022-12-13 17:15:04,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-12-13 17:15:04,267 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:15:04,267 INFO L195 NwaCegarLoop]: trace histogram [3, 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] [2022-12-13 17:15:04,267 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-12-13 17:15:04,267 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-12-13 17:15:04,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:15:04,267 INFO L85 PathProgramCache]: Analyzing trace with hash -1969948791, now seen corresponding path program 1 times [2022-12-13 17:15:04,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:15:04,267 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245798190] [2022-12-13 17:15:04,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:15:04,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:15:04,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:15:04,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:15:04,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:15:04,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-12-13 17:15:04,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:15:04,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-12-13 17:15:04,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:15:04,583 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-12-13 17:15:04,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:15:04,583 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245798190] [2022-12-13 17:15:04,583 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1245798190] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:15:04,583 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:15:04,583 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-13 17:15:04,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623314795] [2022-12-13 17:15:04,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:15:04,584 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 17:15:04,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:15:04,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 17:15:04,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-12-13 17:15:04,584 INFO L87 Difference]: Start difference. First operand 84 states and 94 transitions. Second operand has 11 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 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-12-13 17:15:04,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:15:04,807 INFO L93 Difference]: Finished difference Result 131 states and 144 transitions. [2022-12-13 17:15:04,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-13 17:15:04,808 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 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 54 [2022-12-13 17:15:04,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:15:04,808 INFO L225 Difference]: With dead ends: 131 [2022-12-13 17:15:04,808 INFO L226 Difference]: Without dead ends: 131 [2022-12-13 17:15:04,808 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2022-12-13 17:15:04,809 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 223 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 301 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 301 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 17:15:04,809 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [223 Valid, 325 Invalid, 302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 301 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 17:15:04,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2022-12-13 17:15:04,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 86. [2022-12-13 17:15:04,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 68 states have (on average 1.3235294117647058) internal successors, (90), 81 states have internal predecessors, (90), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-13 17:15:04,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 96 transitions. [2022-12-13 17:15:04,811 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 96 transitions. Word has length 54 [2022-12-13 17:15:04,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:15:04,811 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 96 transitions. [2022-12-13 17:15:04,811 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 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-12-13 17:15:04,811 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 96 transitions. [2022-12-13 17:15:04,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-12-13 17:15:04,811 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:15:04,812 INFO L195 NwaCegarLoop]: trace histogram [3, 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] [2022-12-13 17:15:04,812 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-12-13 17:15:04,812 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-12-13 17:15:04,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:15:04,812 INFO L85 PathProgramCache]: Analyzing trace with hash -1467023000, now seen corresponding path program 1 times [2022-12-13 17:15:04,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:15:04,812 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868141155] [2022-12-13 17:15:04,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:15:04,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:15:04,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:15:05,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:15:05,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:15:05,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-12-13 17:15:05,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:15:05,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-12-13 17:15:05,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:15:06,356 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 18 proven. 13 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-13 17:15:06,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:15:06,357 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868141155] [2022-12-13 17:15:06,357 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868141155] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 17:15:06,357 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [306207952] [2022-12-13 17:15:06,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:15:06,357 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 17:15:06,357 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ee4424a-8107-47bf-b6a4-11ede3e4c4d9/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:15:06,358 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ee4424a-8107-47bf-b6a4-11ede3e4c4d9/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 17:15:06,359 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ee4424a-8107-47bf-b6a4-11ede3e4c4d9/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-12-13 17:15:06,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:15:06,539 INFO L263 TraceCheckSpWp]: Trace formula consists of 477 conjuncts, 94 conjunts are in the unsatisfiable core [2022-12-13 17:15:06,543 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 17:15:06,569 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 17:15:06,809 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-12-13 17:15:06,810 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-12-13 17:15:06,964 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-12-13 17:15:07,043 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 17:15:07,043 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 35 [2022-12-13 17:15:07,286 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:15:07,288 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 17:15:07,288 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 51 treesize of output 18 [2022-12-13 17:15:07,291 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-12-13 17:15:07,447 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int) (v_ArrVal_2833 (Array Int Int)) (v_ArrVal_2832 (Array Int Int))) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_2832)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))) (= (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_2833) |c_#memory_$Pointer$.base|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2022-12-13 17:15:07,483 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:15:07,491 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-12-13 17:15:07,491 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 57 treesize of output 55 [2022-12-13 17:15:07,497 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:15:07,498 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 62 treesize of output 58 [2022-12-13 17:15:07,531 INFO L321 Elim1Store]: treesize reduction 94, result has 36.9 percent of original size [2022-12-13 17:15:07,532 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 42 treesize of output 64 [2022-12-13 17:15:07,633 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 63 treesize of output 43 [2022-12-13 17:15:07,790 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:15:07,792 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 17:15:07,792 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 56 treesize of output 21 [2022-12-13 17:15:07,897 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 19 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2022-12-13 17:15:07,897 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 17:15:08,123 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [306207952] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 17:15:08,124 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 17:15:08,124 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 27] total 48 [2022-12-13 17:15:08,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534872510] [2022-12-13 17:15:08,124 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 17:15:08,124 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2022-12-13 17:15:08,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:15:08,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2022-12-13 17:15:08,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=2448, Unknown=1, NotChecked=100, Total=2756 [2022-12-13 17:15:08,126 INFO L87 Difference]: Start difference. First operand 86 states and 96 transitions. Second operand has 49 states, 46 states have (on average 1.9565217391304348) internal successors, (90), 42 states have internal predecessors, (90), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-12-13 17:15:10,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:15:10,099 INFO L93 Difference]: Finished difference Result 133 states and 148 transitions. [2022-12-13 17:15:10,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-12-13 17:15:10,100 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 46 states have (on average 1.9565217391304348) internal successors, (90), 42 states have internal predecessors, (90), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 55 [2022-12-13 17:15:10,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:15:10,100 INFO L225 Difference]: With dead ends: 133 [2022-12-13 17:15:10,100 INFO L226 Difference]: Without dead ends: 133 [2022-12-13 17:15:10,101 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 42 SyntacticMatches, 4 SemanticMatches, 67 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1269 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=496, Invalid=4063, Unknown=1, NotChecked=132, Total=4692 [2022-12-13 17:15:10,101 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 521 mSDsluCounter, 1050 mSDsCounter, 0 mSdLazyCounter, 1561 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 521 SdHoareTripleChecker+Valid, 1106 SdHoareTripleChecker+Invalid, 1716 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 1561 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 125 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-12-13 17:15:10,102 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [521 Valid, 1106 Invalid, 1716 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 1561 Invalid, 0 Unknown, 125 Unchecked, 1.0s Time] [2022-12-13 17:15:10,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2022-12-13 17:15:10,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 88. [2022-12-13 17:15:10,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 70 states have (on average 1.3285714285714285) internal successors, (93), 83 states have internal predecessors, (93), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-13 17:15:10,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 99 transitions. [2022-12-13 17:15:10,104 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 99 transitions. Word has length 55 [2022-12-13 17:15:10,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:15:10,104 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 99 transitions. [2022-12-13 17:15:10,105 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 46 states have (on average 1.9565217391304348) internal successors, (90), 42 states have internal predecessors, (90), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-12-13 17:15:10,105 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 99 transitions. [2022-12-13 17:15:10,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-12-13 17:15:10,105 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:15:10,105 INFO L195 NwaCegarLoop]: trace histogram [3, 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] [2022-12-13 17:15:10,110 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ee4424a-8107-47bf-b6a4-11ede3e4c4d9/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-12-13 17:15:10,306 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ee4424a-8107-47bf-b6a4-11ede3e4c4d9/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 17:15:10,307 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-12-13 17:15:10,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:15:10,308 INFO L85 PathProgramCache]: Analyzing trace with hash -1467022999, now seen corresponding path program 1 times [2022-12-13 17:15:10,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:15:10,308 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451249910] [2022-12-13 17:15:10,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:15:10,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:15:10,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:15:11,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:15:11,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:15:11,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-12-13 17:15:11,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:15:11,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-12-13 17:15:11,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:15:12,378 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 3 proven. 28 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-13 17:15:12,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:15:12,378 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451249910] [2022-12-13 17:15:12,378 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [451249910] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 17:15:12,378 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [276079800] [2022-12-13 17:15:12,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:15:12,378 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 17:15:12,379 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ee4424a-8107-47bf-b6a4-11ede3e4c4d9/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:15:12,379 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ee4424a-8107-47bf-b6a4-11ede3e4c4d9/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 17:15:12,380 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ee4424a-8107-47bf-b6a4-11ede3e4c4d9/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-12-13 17:15:12,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:15:12,555 INFO L263 TraceCheckSpWp]: Trace formula consists of 477 conjuncts, 123 conjunts are in the unsatisfiable core [2022-12-13 17:15:12,560 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 17:15:12,595 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 17:15:12,913 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-12-13 17:15:12,913 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-12-13 17:15:13,063 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-12-13 17:15:13,067 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-12-13 17:15:13,154 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 17:15:13,154 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 62 [2022-12-13 17:15:13,159 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 41 treesize of output 41 [2022-12-13 17:15:13,528 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 17:15:13,529 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 73 treesize of output 36 [2022-12-13 17:15:13,536 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 17:15:13,537 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 26 treesize of output 14 [2022-12-13 17:15:13,804 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_3104 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_3104) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3105 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_3105) |c_#memory_$Pointer$.offset|)) (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_3099 Int)) (= |c_#length| (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_3099))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2022-12-13 17:15:13,846 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:15:13,854 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-12-13 17:15:13,855 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 79 treesize of output 67 [2022-12-13 17:15:13,863 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:15:13,864 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:15:13,867 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-13 17:15:13,867 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 48 treesize of output 47 [2022-12-13 17:15:13,876 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:15:13,877 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 30 treesize of output 32 [2022-12-13 17:15:13,895 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-12-13 17:15:13,895 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2022-12-13 17:15:14,163 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:15:14,163 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 17:15:14,165 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 17:15:14,166 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 85 treesize of output 45 [2022-12-13 17:15:14,173 INFO L321 Elim1Store]: treesize reduction 18, result has 14.3 percent of original size [2022-12-13 17:15:14,173 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 3 case distinctions, treesize of input 39 treesize of output 25 [2022-12-13 17:15:14,178 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 19 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2022-12-13 17:15:14,178 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 17:15:15,589 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [276079800] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 17:15:15,589 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 17:15:15,589 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 26] total 51 [2022-12-13 17:15:15,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357929687] [2022-12-13 17:15:15,589 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 17:15:15,590 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2022-12-13 17:15:15,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:15:15,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2022-12-13 17:15:15,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=3001, Unknown=2, NotChecked=110, Total=3306 [2022-12-13 17:15:15,591 INFO L87 Difference]: Start difference. First operand 88 states and 99 transitions. Second operand has 52 states, 49 states have (on average 1.9387755102040816) internal successors, (95), 45 states have internal predecessors, (95), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-12-13 17:15:19,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:15:19,192 INFO L93 Difference]: Finished difference Result 179 states and 198 transitions. [2022-12-13 17:15:19,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-12-13 17:15:19,193 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 49 states have (on average 1.9387755102040816) internal successors, (95), 45 states have internal predecessors, (95), 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 55 [2022-12-13 17:15:19,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:15:19,193 INFO L225 Difference]: With dead ends: 179 [2022-12-13 17:15:19,193 INFO L226 Difference]: Without dead ends: 179 [2022-12-13 17:15:19,194 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 41 SyntacticMatches, 2 SemanticMatches, 78 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1475 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=577, Invalid=5587, Unknown=2, NotChecked=154, Total=6320 [2022-12-13 17:15:19,195 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 772 mSDsluCounter, 1295 mSDsCounter, 0 mSdLazyCounter, 2419 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 772 SdHoareTripleChecker+Valid, 1347 SdHoareTripleChecker+Invalid, 2647 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 2419 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 189 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-12-13 17:15:19,195 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [772 Valid, 1347 Invalid, 2647 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 2419 Invalid, 0 Unknown, 189 Unchecked, 1.5s Time] [2022-12-13 17:15:19,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2022-12-13 17:15:19,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 90. [2022-12-13 17:15:19,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 72 states have (on average 1.3194444444444444) internal successors, (95), 85 states have internal predecessors, (95), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-13 17:15:19,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 101 transitions. [2022-12-13 17:15:19,197 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 101 transitions. Word has length 55 [2022-12-13 17:15:19,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:15:19,197 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 101 transitions. [2022-12-13 17:15:19,197 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 49 states have (on average 1.9387755102040816) internal successors, (95), 45 states have internal predecessors, (95), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-12-13 17:15:19,197 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 101 transitions. [2022-12-13 17:15:19,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-12-13 17:15:19,198 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:15:19,198 INFO L195 NwaCegarLoop]: trace histogram [3, 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] [2022-12-13 17:15:19,203 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ee4424a-8107-47bf-b6a4-11ede3e4c4d9/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-12-13 17:15:19,399 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ee4424a-8107-47bf-b6a4-11ede3e4c4d9/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 17:15:19,400 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-12-13 17:15:19,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:15:19,401 INFO L85 PathProgramCache]: Analyzing trace with hash -938871693, now seen corresponding path program 1 times [2022-12-13 17:15:19,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:15:19,402 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526299362] [2022-12-13 17:15:19,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:15:19,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:15:19,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:15:19,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:15:19,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:15:19,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-12-13 17:15:19,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:15:19,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-12-13 17:15:19,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:15:19,605 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-12-13 17:15:19,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:15:19,605 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526299362] [2022-12-13 17:15:19,605 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [526299362] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:15:19,605 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:15:19,605 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-12-13 17:15:19,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100011140] [2022-12-13 17:15:19,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:15:19,606 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 17:15:19,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:15:19,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 17:15:19,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-12-13 17:15:19,606 INFO L87 Difference]: Start difference. First operand 90 states and 101 transitions. Second operand has 11 states, 10 states have (on average 3.7) internal successors, (37), 9 states have internal predecessors, (37), 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-12-13 17:15:19,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:15:19,764 INFO L93 Difference]: Finished difference Result 118 states and 130 transitions. [2022-12-13 17:15:19,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 17:15:19,764 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.7) internal successors, (37), 9 states have internal predecessors, (37), 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 55 [2022-12-13 17:15:19,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:15:19,764 INFO L225 Difference]: With dead ends: 118 [2022-12-13 17:15:19,764 INFO L226 Difference]: Without dead ends: 118 [2022-12-13 17:15:19,765 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2022-12-13 17:15:19,765 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 99 mSDsluCounter, 458 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 531 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 17:15:19,765 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 531 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 229 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 17:15:19,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2022-12-13 17:15:19,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 90. [2022-12-13 17:15:19,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 72 states have (on average 1.3055555555555556) internal successors, (94), 85 states have internal predecessors, (94), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-13 17:15:19,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 100 transitions. [2022-12-13 17:15:19,767 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 100 transitions. Word has length 55 [2022-12-13 17:15:19,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:15:19,767 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 100 transitions. [2022-12-13 17:15:19,767 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.7) internal successors, (37), 9 states have internal predecessors, (37), 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-12-13 17:15:19,767 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 100 transitions. [2022-12-13 17:15:19,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-12-13 17:15:19,768 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:15:19,768 INFO L195 NwaCegarLoop]: trace histogram [3, 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-12-13 17:15:19,768 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-12-13 17:15:19,768 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-12-13 17:15:19,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:15:19,768 INFO L85 PathProgramCache]: Analyzing trace with hash 959790642, now seen corresponding path program 1 times [2022-12-13 17:15:19,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:15:19,768 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581672617] [2022-12-13 17:15:19,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:15:19,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:15:19,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:15:19,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:15:19,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:15:19,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-12-13 17:15:19,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:15:19,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-12-13 17:15:19,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:15:20,112 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 21 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-13 17:15:20,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:15:20,112 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581672617] [2022-12-13 17:15:20,112 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [581672617] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 17:15:20,112 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [262628680] [2022-12-13 17:15:20,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:15:20,113 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 17:15:20,113 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ee4424a-8107-47bf-b6a4-11ede3e4c4d9/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:15:20,113 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ee4424a-8107-47bf-b6a4-11ede3e4c4d9/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 17:15:20,114 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ee4424a-8107-47bf-b6a4-11ede3e4c4d9/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-12-13 17:15:20,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:15:20,297 INFO L263 TraceCheckSpWp]: Trace formula consists of 486 conjuncts, 60 conjunts are in the unsatisfiable core [2022-12-13 17:15:20,300 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 17:15:20,435 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-13 17:15:20,550 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-13 17:15:20,554 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:15:20,554 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-13 17:15:20,559 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-13 17:15:20,592 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-12-13 17:15:20,594 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-12-13 17:15:20,642 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-12-13 17:15:20,659 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-12-13 17:15:20,659 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 17:15:20,659 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [262628680] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:15:20,659 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 17:15:20,659 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [16] total 27 [2022-12-13 17:15:20,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117687239] [2022-12-13 17:15:20,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:15:20,660 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-13 17:15:20,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:15:20,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-13 17:15:20,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=638, Unknown=0, NotChecked=0, Total=702 [2022-12-13 17:15:20,660 INFO L87 Difference]: Start difference. First operand 90 states and 100 transitions. Second operand has 13 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 12 states have internal predecessors, (38), 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-12-13 17:15:21,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:15:21,033 INFO L93 Difference]: Finished difference Result 116 states and 128 transitions. [2022-12-13 17:15:21,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-13 17:15:21,034 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 12 states have internal predecessors, (38), 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 56 [2022-12-13 17:15:21,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:15:21,035 INFO L225 Difference]: With dead ends: 116 [2022-12-13 17:15:21,035 INFO L226 Difference]: Without dead ends: 116 [2022-12-13 17:15:21,035 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=126, Invalid=1064, Unknown=0, NotChecked=0, Total=1190 [2022-12-13 17:15:21,036 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 201 mSDsluCounter, 499 mSDsCounter, 0 mSdLazyCounter, 360 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 566 SdHoareTripleChecker+Invalid, 362 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 17:15:21,036 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 566 Invalid, 362 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 360 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 17:15:21,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2022-12-13 17:15:21,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 90. [2022-12-13 17:15:21,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 72 states have (on average 1.2916666666666667) internal successors, (93), 85 states have internal predecessors, (93), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-13 17:15:21,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 99 transitions. [2022-12-13 17:15:21,039 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 99 transitions. Word has length 56 [2022-12-13 17:15:21,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:15:21,040 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 99 transitions. [2022-12-13 17:15:21,040 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 12 states have internal predecessors, (38), 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-12-13 17:15:21,040 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 99 transitions. [2022-12-13 17:15:21,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-12-13 17:15:21,040 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:15:21,040 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] [2022-12-13 17:15:21,045 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ee4424a-8107-47bf-b6a4-11ede3e4c4d9/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-12-13 17:15:21,241 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ee4424a-8107-47bf-b6a4-11ede3e4c4d9/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 17:15:21,241 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-12-13 17:15:21,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:15:21,242 INFO L85 PathProgramCache]: Analyzing trace with hash -588248546, now seen corresponding path program 2 times [2022-12-13 17:15:21,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:15:21,243 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313564261] [2022-12-13 17:15:21,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:15:21,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:15:21,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:15:22,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:15:22,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:15:22,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-12-13 17:15:22,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:15:23,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-12-13 17:15:23,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:15:24,007 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 7 proven. 29 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-13 17:15:24,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:15:24,007 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313564261] [2022-12-13 17:15:24,007 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [313564261] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 17:15:24,007 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1930375312] [2022-12-13 17:15:24,007 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 17:15:24,007 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 17:15:24,007 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ee4424a-8107-47bf-b6a4-11ede3e4c4d9/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:15:24,008 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ee4424a-8107-47bf-b6a4-11ede3e4c4d9/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 17:15:24,009 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ee4424a-8107-47bf-b6a4-11ede3e4c4d9/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-12-13 17:15:24,234 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 17:15:24,234 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 17:15:24,237 INFO L263 TraceCheckSpWp]: Trace formula consists of 498 conjuncts, 141 conjunts are in the unsatisfiable core [2022-12-13 17:15:24,243 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 17:15:24,291 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 17:15:24,444 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-13 17:15:24,450 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-13 17:15:24,853 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-13 17:15:24,853 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-12-13 17:15:24,865 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-13 17:15:24,866 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-12-13 17:15:24,870 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-12-13 17:15:25,017 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-12-13 17:15:25,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-12-13 17:15:25,104 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-12-13 17:15:25,112 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-12-13 17:15:25,240 INFO L321 Elim1Store]: treesize reduction 39, result has 18.8 percent of original size [2022-12-13 17:15:25,240 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 94 treesize of output 57 [2022-12-13 17:15:25,248 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 46 treesize of output 42 [2022-12-13 17:15:25,711 INFO L321 Elim1Store]: treesize reduction 34, result has 2.9 percent of original size [2022-12-13 17:15:25,712 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 110 treesize of output 44 [2022-12-13 17:15:25,725 INFO L321 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2022-12-13 17:15:25,725 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 2 case distinctions, treesize of input 21 treesize of output 21 [2022-12-13 17:15:25,729 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-13 17:15:25,910 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int) (v_ArrVal_3809 (Array Int Int)) (v_ArrVal_3810 (Array Int Int))) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_3810) |c_#memory_$Pointer$.offset|) (= (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_3809) |c_#memory_$Pointer$.base|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2022-12-13 17:15:25,939 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:15:25,956 INFO L321 Elim1Store]: treesize reduction 52, result has 17.5 percent of original size [2022-12-13 17:15:25,957 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 116 treesize of output 106 [2022-12-13 17:15:25,963 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:15:25,964 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:15:25,974 INFO L321 Elim1Store]: treesize reduction 47, result has 9.6 percent of original size [2022-12-13 17:15:25,975 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 107 treesize of output 110 [2022-12-13 17:15:25,996 INFO L321 Elim1Store]: treesize reduction 8, result has 77.1 percent of original size [2022-12-13 17:15:25,996 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 34 treesize of output 36 [2022-12-13 17:15:26,680 INFO L321 Elim1Store]: treesize reduction 70, result has 4.1 percent of original size [2022-12-13 17:15:26,680 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 7 new quantified variables, introduced 6 case distinctions, treesize of input 156 treesize of output 74 [2022-12-13 17:15:26,695 INFO L321 Elim1Store]: treesize reduction 20, result has 39.4 percent of original size [2022-12-13 17:15:26,695 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 4 case distinctions, treesize of input 40 treesize of output 32 [2022-12-13 17:15:26,760 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 6 proven. 26 refuted. 0 times theorem prover too weak. 1 trivial. 6 not checked. [2022-12-13 17:15:26,760 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 17:15:27,400 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1930375312] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 17:15:27,400 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 17:15:27,400 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 30] total 56 [2022-12-13 17:15:27,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549107875] [2022-12-13 17:15:27,400 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 17:15:27,401 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2022-12-13 17:15:27,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:15:27,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2022-12-13 17:15:27,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=3491, Unknown=3, NotChecked=118, Total=3782 [2022-12-13 17:15:27,404 INFO L87 Difference]: Start difference. First operand 90 states and 99 transitions. Second operand has 56 states, 54 states have (on average 1.8148148148148149) internal successors, (98), 50 states have internal predecessors, (98), 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-12-13 17:15:31,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:15:31,278 INFO L93 Difference]: Finished difference Result 116 states and 131 transitions. [2022-12-13 17:15:31,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-12-13 17:15:31,278 INFO L78 Accepts]: Start accepts. Automaton has has 56 states, 54 states have (on average 1.8148148148148149) internal successors, (98), 50 states have internal predecessors, (98), 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 59 [2022-12-13 17:15:31,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:15:31,279 INFO L225 Difference]: With dead ends: 116 [2022-12-13 17:15:31,279 INFO L226 Difference]: Without dead ends: 116 [2022-12-13 17:15:31,280 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 50 SyntacticMatches, 6 SemanticMatches, 82 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1335 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=371, Invalid=6436, Unknown=3, NotChecked=162, Total=6972 [2022-12-13 17:15:31,280 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 60 mSDsluCounter, 1460 mSDsCounter, 0 mSdLazyCounter, 2082 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 1513 SdHoareTripleChecker+Invalid, 2201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 2082 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 102 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-12-13 17:15:31,280 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 1513 Invalid, 2201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 2082 Invalid, 0 Unknown, 102 Unchecked, 1.7s Time] [2022-12-13 17:15:31,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2022-12-13 17:15:31,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 112. [2022-12-13 17:15:31,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 92 states have (on average 1.2608695652173914) internal successors, (116), 105 states have internal predecessors, (116), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-12-13 17:15:31,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 126 transitions. [2022-12-13 17:15:31,283 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 126 transitions. Word has length 59 [2022-12-13 17:15:31,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:15:31,283 INFO L495 AbstractCegarLoop]: Abstraction has 112 states and 126 transitions. [2022-12-13 17:15:31,283 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 54 states have (on average 1.8148148148148149) internal successors, (98), 50 states have internal predecessors, (98), 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-12-13 17:15:31,283 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 126 transitions. [2022-12-13 17:15:31,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-12-13 17:15:31,283 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:15:31,283 INFO L195 NwaCegarLoop]: trace histogram [3, 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] [2022-12-13 17:15:31,289 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ee4424a-8107-47bf-b6a4-11ede3e4c4d9/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-12-13 17:15:31,484 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ee4424a-8107-47bf-b6a4-11ede3e4c4d9/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 17:15:31,485 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-12-13 17:15:31,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:15:31,485 INFO L85 PathProgramCache]: Analyzing trace with hash -1935094492, now seen corresponding path program 1 times [2022-12-13 17:15:31,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:15:31,486 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322129897] [2022-12-13 17:15:31,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:15:31,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:15:31,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:15:31,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:15:31,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:15:31,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-12-13 17:15:31,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:15:31,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-12-13 17:15:31,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:15:32,052 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-13 17:15:32,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:15:32,052 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322129897] [2022-12-13 17:15:32,052 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1322129897] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:15:32,052 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:15:32,052 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-12-13 17:15:32,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279020887] [2022-12-13 17:15:32,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:15:32,053 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-12-13 17:15:32,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:15:32,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-12-13 17:15:32,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=450, Unknown=0, NotChecked=0, Total=506 [2022-12-13 17:15:32,053 INFO L87 Difference]: Start difference. First operand 112 states and 126 transitions. Second operand has 23 states, 21 states have (on average 2.4761904761904763) internal successors, (52), 20 states have internal predecessors, (52), 2 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-12-13 17:15:32,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:15:32,795 INFO L93 Difference]: Finished difference Result 176 states and 195 transitions. [2022-12-13 17:15:32,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-12-13 17:15:32,795 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 21 states have (on average 2.4761904761904763) internal successors, (52), 20 states have internal predecessors, (52), 2 states have call successors, (2), 1 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 59 [2022-12-13 17:15:32,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:15:32,796 INFO L225 Difference]: With dead ends: 176 [2022-12-13 17:15:32,796 INFO L226 Difference]: Without dead ends: 176 [2022-12-13 17:15:32,796 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 222 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=229, Invalid=1177, Unknown=0, NotChecked=0, Total=1406 [2022-12-13 17:15:32,796 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 612 mSDsluCounter, 463 mSDsCounter, 0 mSdLazyCounter, 773 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 613 SdHoareTripleChecker+Valid, 502 SdHoareTripleChecker+Invalid, 796 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 773 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-13 17:15:32,797 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [613 Valid, 502 Invalid, 796 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 773 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-13 17:15:32,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2022-12-13 17:15:32,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 119. [2022-12-13 17:15:32,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 99 states have (on average 1.2626262626262625) internal successors, (125), 112 states have internal predecessors, (125), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-12-13 17:15:32,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 135 transitions. [2022-12-13 17:15:32,800 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 135 transitions. Word has length 59 [2022-12-13 17:15:32,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:15:32,800 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 135 transitions. [2022-12-13 17:15:32,801 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 21 states have (on average 2.4761904761904763) internal successors, (52), 20 states have internal predecessors, (52), 2 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-12-13 17:15:32,801 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 135 transitions. [2022-12-13 17:15:32,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-12-13 17:15:32,801 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:15:32,801 INFO L195 NwaCegarLoop]: trace histogram [3, 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] [2022-12-13 17:15:32,801 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-12-13 17:15:32,801 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-12-13 17:15:32,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:15:32,802 INFO L85 PathProgramCache]: Analyzing trace with hash -1935094491, now seen corresponding path program 1 times [2022-12-13 17:15:32,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:15:32,802 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779408213] [2022-12-13 17:15:32,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:15:32,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:15:32,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:15:33,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:15:33,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:15:33,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-12-13 17:15:33,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:15:33,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-12-13 17:15:33,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:15:34,172 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 21 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-13 17:15:34,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:15:34,172 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779408213] [2022-12-13 17:15:34,173 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779408213] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 17:15:34,173 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1573341127] [2022-12-13 17:15:34,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:15:34,173 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 17:15:34,173 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ee4424a-8107-47bf-b6a4-11ede3e4c4d9/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:15:34,174 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ee4424a-8107-47bf-b6a4-11ede3e4c4d9/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 17:15:34,174 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ee4424a-8107-47bf-b6a4-11ede3e4c4d9/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-12-13 17:15:34,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:15:34,356 INFO L263 TraceCheckSpWp]: Trace formula consists of 516 conjuncts, 78 conjunts are in the unsatisfiable core [2022-12-13 17:15:34,360 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 17:15:34,373 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 5 [2022-12-13 17:15:34,842 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 27 treesize of output 15 [2022-12-13 17:15:34,846 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-12-13 17:15:35,099 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:15:35,099 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2022-12-13 17:15:35,106 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:15:35,107 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 26 [2022-12-13 17:15:35,119 INFO L321 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2022-12-13 17:15:35,119 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 18 treesize of output 21 [2022-12-13 17:15:35,129 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-12-13 17:15:35,130 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 15 treesize of output 15 [2022-12-13 17:15:35,386 INFO L321 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2022-12-13 17:15:35,387 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 21 treesize of output 20 [2022-12-13 17:15:35,405 INFO L321 Elim1Store]: treesize reduction 31, result has 38.0 percent of original size [2022-12-13 17:15:35,405 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 48 treesize of output 44 [2022-12-13 17:15:35,422 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:15:35,422 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-13 17:15:35,426 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:15:35,426 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 32 treesize of output 30 [2022-12-13 17:15:35,534 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 33 treesize of output 17 [2022-12-13 17:15:35,539 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-12-13 17:15:35,677 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 23 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-13 17:15:35,677 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 17:15:37,096 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1573341127] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 17:15:37,097 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 17:15:37,097 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21] total 39 [2022-12-13 17:15:37,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642352324] [2022-12-13 17:15:37,097 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 17:15:37,097 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-12-13 17:15:37,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:15:37,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-12-13 17:15:37,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=2197, Unknown=0, NotChecked=0, Total=2352 [2022-12-13 17:15:37,098 INFO L87 Difference]: Start difference. First operand 119 states and 135 transitions. Second operand has 40 states, 37 states have (on average 2.324324324324324) internal successors, (86), 34 states have internal predecessors, (86), 3 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2022-12-13 17:15:40,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:15:40,306 INFO L93 Difference]: Finished difference Result 206 states and 228 transitions. [2022-12-13 17:15:40,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-12-13 17:15:40,306 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 37 states have (on average 2.324324324324324) internal successors, (86), 34 states have internal predecessors, (86), 3 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Word has length 59 [2022-12-13 17:15:40,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:15:40,307 INFO L225 Difference]: With dead ends: 206 [2022-12-13 17:15:40,307 INFO L226 Difference]: Without dead ends: 206 [2022-12-13 17:15:40,307 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 48 SyntacticMatches, 5 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 900 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=480, Invalid=4490, Unknown=0, NotChecked=0, Total=4970 [2022-12-13 17:15:40,308 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 714 mSDsluCounter, 1235 mSDsCounter, 0 mSdLazyCounter, 2076 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 714 SdHoareTripleChecker+Valid, 1289 SdHoareTripleChecker+Invalid, 2107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 2076 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-12-13 17:15:40,308 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [714 Valid, 1289 Invalid, 2107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 2076 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-12-13 17:15:40,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2022-12-13 17:15:40,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 122. [2022-12-13 17:15:40,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 102 states have (on average 1.2549019607843137) internal successors, (128), 115 states have internal predecessors, (128), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-12-13 17:15:40,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 138 transitions. [2022-12-13 17:15:40,310 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 138 transitions. Word has length 59 [2022-12-13 17:15:40,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:15:40,310 INFO L495 AbstractCegarLoop]: Abstraction has 122 states and 138 transitions. [2022-12-13 17:15:40,311 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 37 states have (on average 2.324324324324324) internal successors, (86), 34 states have internal predecessors, (86), 3 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2022-12-13 17:15:40,311 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 138 transitions. [2022-12-13 17:15:40,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-12-13 17:15:40,311 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:15:40,311 INFO L195 NwaCegarLoop]: trace histogram [3, 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] [2022-12-13 17:15:40,317 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ee4424a-8107-47bf-b6a4-11ede3e4c4d9/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2022-12-13 17:15:40,512 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ee4424a-8107-47bf-b6a4-11ede3e4c4d9/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-12-13 17:15:40,513 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-12-13 17:15:40,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:15:40,513 INFO L85 PathProgramCache]: Analyzing trace with hash 1526484642, now seen corresponding path program 1 times [2022-12-13 17:15:40,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:15:40,514 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854831290] [2022-12-13 17:15:40,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:15:40,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:15:40,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:15:40,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:15:40,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:15:40,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-12-13 17:15:40,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:15:40,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-12-13 17:15:40,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:15:40,895 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 21 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-12-13 17:15:40,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:15:40,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854831290] [2022-12-13 17:15:40,895 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1854831290] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 17:15:40,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2043938779] [2022-12-13 17:15:40,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:15:40,895 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 17:15:40,896 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ee4424a-8107-47bf-b6a4-11ede3e4c4d9/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:15:40,896 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ee4424a-8107-47bf-b6a4-11ede3e4c4d9/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 17:15:40,897 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ee4424a-8107-47bf-b6a4-11ede3e4c4d9/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-12-13 17:15:41,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:15:41,099 INFO L263 TraceCheckSpWp]: Trace formula consists of 502 conjuncts, 34 conjunts are in the unsatisfiable core [2022-12-13 17:15:41,100 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 17:15:41,255 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2022-12-13 17:15:41,311 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int) (v_ArrVal_4538 (Array Int Int))) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_4538)))) is different from true [2022-12-13 17:15:41,323 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:15:41,323 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2022-12-13 17:15:41,343 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2022-12-13 17:15:41,355 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 23 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 3 not checked. [2022-12-13 17:15:41,355 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 17:15:41,418 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2043938779] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 17:15:41,418 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 17:15:41,418 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 26 [2022-12-13 17:15:41,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945516156] [2022-12-13 17:15:41,419 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 17:15:41,419 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-12-13 17:15:41,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:15:41,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-12-13 17:15:41,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=614, Unknown=5, NotChecked=50, Total=756 [2022-12-13 17:15:41,420 INFO L87 Difference]: Start difference. First operand 122 states and 138 transitions. Second operand has 26 states, 24 states have (on average 3.1666666666666665) internal successors, (76), 22 states have internal predecessors, (76), 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-12-13 17:15:41,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:15:41,808 INFO L93 Difference]: Finished difference Result 115 states and 129 transitions. [2022-12-13 17:15:41,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-13 17:15:41,808 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 24 states have (on average 3.1666666666666665) internal successors, (76), 22 states have internal predecessors, (76), 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 59 [2022-12-13 17:15:41,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:15:41,809 INFO L225 Difference]: With dead ends: 115 [2022-12-13 17:15:41,809 INFO L226 Difference]: Without dead ends: 115 [2022-12-13 17:15:41,809 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 65 SyntacticMatches, 4 SemanticMatches, 34 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 276 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=176, Invalid=1013, Unknown=5, NotChecked=66, Total=1260 [2022-12-13 17:15:41,809 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 398 mSDsluCounter, 487 mSDsCounter, 0 mSdLazyCounter, 510 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 398 SdHoareTripleChecker+Valid, 534 SdHoareTripleChecker+Invalid, 599 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 510 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 76 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 17:15:41,810 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [398 Valid, 534 Invalid, 599 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 510 Invalid, 0 Unknown, 76 Unchecked, 0.2s Time] [2022-12-13 17:15:41,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2022-12-13 17:15:41,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2022-12-13 17:15:41,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 95 states have (on average 1.2526315789473683) internal successors, (119), 108 states have internal predecessors, (119), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-12-13 17:15:41,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 129 transitions. [2022-12-13 17:15:41,812 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 129 transitions. Word has length 59 [2022-12-13 17:15:41,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:15:41,812 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 129 transitions. [2022-12-13 17:15:41,812 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 24 states have (on average 3.1666666666666665) internal successors, (76), 22 states have internal predecessors, (76), 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-12-13 17:15:41,812 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 129 transitions. [2022-12-13 17:15:41,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-12-13 17:15:41,812 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:15:41,812 INFO L195 NwaCegarLoop]: trace histogram [3, 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] [2022-12-13 17:15:41,817 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ee4424a-8107-47bf-b6a4-11ede3e4c4d9/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2022-12-13 17:15:42,013 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ee4424a-8107-47bf-b6a4-11ede3e4c4d9/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-12-13 17:15:42,014 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-12-13 17:15:42,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:15:42,015 INFO L85 PathProgramCache]: Analyzing trace with hash 95034574, now seen corresponding path program 1 times [2022-12-13 17:15:42,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:15:42,016 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291921149] [2022-12-13 17:15:42,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:15:42,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:15:42,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:15:42,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:15:42,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:15:42,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-12-13 17:15:42,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:15:43,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-12-13 17:15:43,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:15:44,585 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 13 proven. 17 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-13 17:15:44,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:15:44,586 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291921149] [2022-12-13 17:15:44,586 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [291921149] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 17:15:44,586 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [574684659] [2022-12-13 17:15:44,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:15:44,586 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 17:15:44,586 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ee4424a-8107-47bf-b6a4-11ede3e4c4d9/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:15:44,587 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ee4424a-8107-47bf-b6a4-11ede3e4c4d9/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 17:15:44,587 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ee4424a-8107-47bf-b6a4-11ede3e4c4d9/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-12-13 17:15:44,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:15:44,840 INFO L263 TraceCheckSpWp]: Trace formula consists of 523 conjuncts, 90 conjunts are in the unsatisfiable core [2022-12-13 17:15:44,844 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 17:15:44,883 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 5 [2022-12-13 17:15:45,236 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-12-13 17:15:45,236 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-12-13 17:15:45,348 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 13 treesize of output 9 [2022-12-13 17:15:45,419 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 17:15:45,419 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2022-12-13 17:15:45,701 INFO L321 Elim1Store]: treesize reduction 3, result has 83.3 percent of original size [2022-12-13 17:15:45,701 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 69 treesize of output 37 [2022-12-13 17:15:45,705 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 11 [2022-12-13 17:15:45,708 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-13 17:15:46,165 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:15:46,171 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-12-13 17:15:46,171 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 75 treesize of output 67 [2022-12-13 17:15:46,174 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:15:46,175 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 66 treesize of output 64 [2022-12-13 17:15:46,187 INFO L321 Elim1Store]: treesize reduction 8, result has 77.1 percent of original size [2022-12-13 17:15:46,187 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 34 treesize of output 36 [2022-12-13 17:15:46,367 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 50 [2022-12-13 17:15:46,705 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 6 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 17:15:46,705 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 17:15:47,179 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [574684659] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 17:15:47,179 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 17:15:47,179 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 27] total 56 [2022-12-13 17:15:47,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675828553] [2022-12-13 17:15:47,179 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 17:15:47,179 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2022-12-13 17:15:47,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:15:47,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2022-12-13 17:15:47,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=3486, Unknown=5, NotChecked=0, Total=3660 [2022-12-13 17:15:47,180 INFO L87 Difference]: Start difference. First operand 115 states and 129 transitions. Second operand has 56 states, 54 states have (on average 2.0) internal successors, (108), 47 states have internal predecessors, (108), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-12-13 17:15:52,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:15:52,345 INFO L93 Difference]: Finished difference Result 120 states and 133 transitions. [2022-12-13 17:15:52,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-12-13 17:15:52,345 INFO L78 Accepts]: Start accepts. Automaton has has 56 states, 54 states have (on average 2.0) internal successors, (108), 47 states have internal predecessors, (108), 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 61 [2022-12-13 17:15:52,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:15:52,346 INFO L225 Difference]: With dead ends: 120 [2022-12-13 17:15:52,346 INFO L226 Difference]: Without dead ends: 120 [2022-12-13 17:15:52,347 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 53 SyntacticMatches, 2 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1292 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=590, Invalid=6377, Unknown=5, NotChecked=0, Total=6972 [2022-12-13 17:15:52,347 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 469 mSDsluCounter, 1112 mSDsCounter, 0 mSdLazyCounter, 2231 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 469 SdHoareTripleChecker+Valid, 1148 SdHoareTripleChecker+Invalid, 2266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 2231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-12-13 17:15:52,347 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [469 Valid, 1148 Invalid, 2266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 2231 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-12-13 17:15:52,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2022-12-13 17:15:52,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 108. [2022-12-13 17:15:52,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 88 states have (on average 1.25) internal successors, (110), 101 states have internal predecessors, (110), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-12-13 17:15:52,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 120 transitions. [2022-12-13 17:15:52,350 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 120 transitions. Word has length 61 [2022-12-13 17:15:52,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:15:52,350 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 120 transitions. [2022-12-13 17:15:52,350 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 54 states have (on average 2.0) internal successors, (108), 47 states have internal predecessors, (108), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-12-13 17:15:52,350 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 120 transitions. [2022-12-13 17:15:52,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-12-13 17:15:52,350 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:15:52,350 INFO L195 NwaCegarLoop]: trace histogram [3, 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, 1, 1] [2022-12-13 17:15:52,356 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ee4424a-8107-47bf-b6a4-11ede3e4c4d9/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2022-12-13 17:15:52,551 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ee4424a-8107-47bf-b6a4-11ede3e4c4d9/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-12-13 17:15:52,551 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-12-13 17:15:52,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:15:52,551 INFO L85 PathProgramCache]: Analyzing trace with hash 592087770, now seen corresponding path program 1 times [2022-12-13 17:15:52,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:15:52,551 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391244855] [2022-12-13 17:15:52,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:15:52,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:15:52,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:15:53,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:15:53,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:15:53,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-12-13 17:15:53,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:15:53,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-12-13 17:15:53,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:15:53,297 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 21 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-13 17:15:53,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:15:53,297 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391244855] [2022-12-13 17:15:53,297 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [391244855] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 17:15:53,297 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [847388530] [2022-12-13 17:15:53,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:15:53,298 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 17:15:53,298 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ee4424a-8107-47bf-b6a4-11ede3e4c4d9/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:15:53,298 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ee4424a-8107-47bf-b6a4-11ede3e4c4d9/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 17:15:53,299 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ee4424a-8107-47bf-b6a4-11ede3e4c4d9/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-12-13 17:15:53,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:15:53,503 INFO L263 TraceCheckSpWp]: Trace formula consists of 537 conjuncts, 64 conjunts are in the unsatisfiable core [2022-12-13 17:15:53,506 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 17:15:53,556 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 5 [2022-12-13 17:15:53,841 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 18 treesize of output 10 [2022-12-13 17:15:53,913 WARN L859 $PredicateComparison]: unable to prove that (and (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_5105 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| v_ArrVal_5105))) (exists ((v_ArrVal_5104 Int)) (= (store |c_old(#valid)| |c_node_create_~temp~0#1.base| v_ArrVal_5104) |c_#valid|))) is different from true [2022-12-13 17:15:53,919 WARN L859 $PredicateComparison]: unable to prove that (and (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_5106 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| v_ArrVal_5106))) (exists ((v_ArrVal_5104 Int)) (= (store |c_old(#valid)| |c_node_create_~temp~0#1.base| v_ArrVal_5104) |c_#valid|))) is different from true [2022-12-13 17:15:53,925 WARN L859 $PredicateComparison]: unable to prove that (and (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_5104 Int)) (= (store |c_old(#valid)| |c_node_create_~temp~0#1.base| v_ArrVal_5104) |c_#valid|)) (exists ((v_ArrVal_5107 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| v_ArrVal_5107)))) is different from true [2022-12-13 17:15:53,931 WARN L859 $PredicateComparison]: unable to prove that (and (< |c_node_create_#res#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_5107 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.base)| |c_node_create_#res#1.base| v_ArrVal_5107) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5104 Int)) (= |c_#valid| (store |c_old(#valid)| |c_node_create_#res#1.base| v_ArrVal_5104)))) is different from true [2022-12-13 17:15:53,945 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:15:53,946 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-12-13 17:15:53,964 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-12-13 17:15:53,965 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 16 treesize of output 26 [2022-12-13 17:15:54,361 INFO L321 Elim1Store]: treesize reduction 31, result has 38.0 percent of original size [2022-12-13 17:15:54,361 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 40 treesize of output 40 [2022-12-13 17:15:54,371 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:15:54,371 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-12-13 17:15:54,433 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-12-13 17:15:54,502 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 24 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 5 not checked. [2022-12-13 17:15:54,502 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 17:15:55,145 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5110 (Array Int Int)) (|v_ULTIMATE.start_dll_append_#t~ret7#1.base_38| Int) (v_ArrVal_5108 Int) (|ULTIMATE.start_dll_append_~last~0#1.offset| Int) (|ULTIMATE.start_dll_append_~last~0#1.base| Int) (v_ArrVal_5118 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_38| v_ArrVal_5118))) (let ((.cse0 (store |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_38| 1)) (.cse2 (select .cse1 |ULTIMATE.start_dll_append_~last~0#1.base|)) (.cse3 (+ |ULTIMATE.start_dll_append_~last~0#1.offset| 4))) (or (not (= (select .cse0 (select (select .cse1 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) 1)) (not (= (select .cse2 .cse3) 0)) (not (< |v_ULTIMATE.start_dll_append_#t~ret7#1.base_38| |c_#StackHeapBarrier|)) (= (select .cse0 (select (select (store (store .cse1 |ULTIMATE.start_dll_append_~last~0#1.base| (store .cse2 .cse3 v_ArrVal_5108)) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_38| v_ArrVal_5110) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) 1))))) is different from false [2022-12-13 17:15:55,147 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [847388530] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 17:15:55,147 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 17:15:55,147 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 25] total 50 [2022-12-13 17:15:55,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017410900] [2022-12-13 17:15:55,147 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 17:15:55,147 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-12-13 17:15:55,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:15:55,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-12-13 17:15:55,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=240, Invalid=2744, Unknown=6, NotChecked=550, Total=3540 [2022-12-13 17:15:55,148 INFO L87 Difference]: Start difference. First operand 108 states and 120 transitions. Second operand has 51 states, 48 states have (on average 2.1875) internal successors, (105), 45 states have internal predecessors, (105), 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-12-13 17:15:56,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:15:56,771 INFO L93 Difference]: Finished difference Result 125 states and 135 transitions. [2022-12-13 17:15:56,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-12-13 17:15:56,772 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 48 states have (on average 2.1875) internal successors, (105), 45 states have internal predecessors, (105), 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 63 [2022-12-13 17:15:56,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:15:56,772 INFO L225 Difference]: With dead ends: 125 [2022-12-13 17:15:56,772 INFO L226 Difference]: Without dead ends: 125 [2022-12-13 17:15:56,773 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 54 SyntacticMatches, 2 SemanticMatches, 77 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 1317 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=681, Invalid=4734, Unknown=7, NotChecked=740, Total=6162 [2022-12-13 17:15:56,773 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 953 mSDsluCounter, 591 mSDsCounter, 0 mSdLazyCounter, 1254 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 953 SdHoareTripleChecker+Valid, 622 SdHoareTripleChecker+Invalid, 1632 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 1254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 343 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-12-13 17:15:56,773 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [953 Valid, 622 Invalid, 1632 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 1254 Invalid, 0 Unknown, 343 Unchecked, 0.6s Time] [2022-12-13 17:15:56,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2022-12-13 17:15:56,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 108. [2022-12-13 17:15:56,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 88 states have (on average 1.2386363636363635) internal successors, (109), 101 states have internal predecessors, (109), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-12-13 17:15:56,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 119 transitions. [2022-12-13 17:15:56,775 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 119 transitions. Word has length 63 [2022-12-13 17:15:56,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:15:56,775 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 119 transitions. [2022-12-13 17:15:56,775 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 48 states have (on average 2.1875) internal successors, (105), 45 states have internal predecessors, (105), 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-12-13 17:15:56,775 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 119 transitions. [2022-12-13 17:15:56,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-12-13 17:15:56,776 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:15:56,776 INFO L195 NwaCegarLoop]: trace histogram [3, 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, 1, 1, 1, 1] [2022-12-13 17:15:56,782 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ee4424a-8107-47bf-b6a4-11ede3e4c4d9/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-12-13 17:15:56,976 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ee4424a-8107-47bf-b6a4-11ede3e4c4d9/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-12-13 17:15:56,976 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-12-13 17:15:56,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:15:56,976 INFO L85 PathProgramCache]: Analyzing trace with hash 2060666116, now seen corresponding path program 1 times [2022-12-13 17:15:56,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:15:56,977 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722127908] [2022-12-13 17:15:56,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:15:56,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:15:57,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:15:58,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:15:58,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:15:58,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-12-13 17:15:58,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:15:59,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-12-13 17:15:59,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:16:00,952 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 13 proven. 19 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-13 17:16:00,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:16:00,952 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722127908] [2022-12-13 17:16:00,953 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722127908] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 17:16:00,953 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1450641286] [2022-12-13 17:16:00,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:16:00,953 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 17:16:00,953 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ee4424a-8107-47bf-b6a4-11ede3e4c4d9/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:16:00,954 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ee4424a-8107-47bf-b6a4-11ede3e4c4d9/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 17:16:00,954 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ee4424a-8107-47bf-b6a4-11ede3e4c4d9/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-12-13 17:16:01,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:16:01,191 INFO L263 TraceCheckSpWp]: Trace formula consists of 544 conjuncts, 147 conjunts are in the unsatisfiable core [2022-12-13 17:16:01,199 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 17:16:01,210 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 17:16:01,262 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-12-13 17:16:01,422 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-12-13 17:16:01,423 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-12-13 17:16:01,635 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-13 17:16:01,781 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-12-13 17:16:01,781 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 4 case distinctions, treesize of input 22 treesize of output 33 [2022-12-13 17:16:02,001 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-13 17:16:02,104 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-13 17:16:02,115 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:16:02,115 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 21 treesize of output 20 [2022-12-13 17:16:02,245 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 17:16:02,245 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 53 [2022-12-13 17:16:02,250 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-12-13 17:16:02,737 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 17:16:02,737 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 78 treesize of output 37 [2022-12-13 17:16:02,743 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 7 treesize of output 3 [2022-12-13 17:16:02,747 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 16 treesize of output 10 [2022-12-13 17:16:03,352 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:16:03,359 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-12-13 17:16:03,359 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 84 treesize of output 70 [2022-12-13 17:16:03,367 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:16:03,373 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-12-13 17:16:03,373 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 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-12-13 17:16:03,381 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 18 treesize of output 20 [2022-12-13 17:16:03,392 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:16:03,393 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-13 17:16:04,623 INFO L321 Elim1Store]: treesize reduction 52, result has 17.5 percent of original size [2022-12-13 17:16:04,624 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 180 treesize of output 129 [2022-12-13 17:16:04,638 INFO L321 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2022-12-13 17:16:04,638 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 49 [2022-12-13 17:16:04,642 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2022-12-13 17:16:04,781 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:16:04,787 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-12-13 17:16:04,788 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 82 treesize of output 68 [2022-12-13 17:16:04,795 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 18 treesize of output 20 [2022-12-13 17:16:04,802 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:16:04,802 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 14 treesize of output 16 [2022-12-13 17:16:04,925 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 17:16:04,926 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 63 treesize of output 30 [2022-12-13 17:16:04,929 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 15 treesize of output 7 [2022-12-13 17:16:05,065 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 15 treesize of output 7 [2022-12-13 17:16:05,124 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 13 proven. 21 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 17:16:05,124 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 17:16:05,133 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5411 (Array Int Int)) (v_ArrVal_5413 (Array Int Int)) (v_ArrVal_5412 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_5411) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_5413) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_5412) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) is different from false [2022-12-13 17:16:05,139 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5409 Int) (v_ArrVal_5411 (Array Int Int)) (v_ArrVal_5410 (Array Int Int)) (v_ArrVal_5413 (Array Int Int)) (v_ArrVal_5412 (Array Int Int)) (v_ArrVal_5408 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_dll_append_~last~0#1.base| v_ArrVal_5410) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_5411) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base| v_ArrVal_5408) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_5413) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 4) v_ArrVal_5409)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_5412) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) is different from false [2022-12-13 17:16:06,723 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5409 Int) (v_ArrVal_5411 (Array Int Int)) (v_ArrVal_5410 (Array Int Int)) (v_ArrVal_5413 (Array Int Int)) (v_ArrVal_5412 (Array Int Int)) (v_ArrVal_5426 (Array Int Int)) (|v_ULTIMATE.start_dll_append_#t~ret7#1.base_41| Int) (v_ArrVal_5428 (Array Int Int)) (v_ArrVal_5427 (Array Int Int)) (v_ArrVal_5408 (Array Int Int)) (|v_ULTIMATE.start_dll_append_~last~0#1.offset_28| Int)) (let ((.cse0 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_41| v_ArrVal_5427)) (.cse3 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_41| v_ArrVal_5426))) (let ((.cse1 (select (select .cse0 (select (select .cse0 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (+ (select (select .cse3 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (.cse2 (+ |v_ULTIMATE.start_dll_append_~last~0#1.offset_28| 4))) (or (not (< |v_ULTIMATE.start_dll_append_#t~ret7#1.base_41| |c_#StackHeapBarrier|)) (not (= (select (select .cse0 .cse1) .cse2) 0)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_41| v_ArrVal_5428) .cse1 v_ArrVal_5410) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_41| v_ArrVal_5411) (select (select (store (store .cse0 .cse1 v_ArrVal_5408) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_41| v_ArrVal_5413) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store (store .cse3 .cse1 (store (select .cse3 .cse1) .cse2 v_ArrVal_5409)) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_41| v_ArrVal_5412) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_41|) 0)))))) is different from false [2022-12-13 17:16:06,725 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1450641286] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 17:16:06,725 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 17:16:06,725 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 70 [2022-12-13 17:16:06,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779226249] [2022-12-13 17:16:06,725 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 17:16:06,726 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 70 states [2022-12-13 17:16:06,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:16:06,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2022-12-13 17:16:06,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=292, Invalid=5565, Unknown=7, NotChecked=456, Total=6320 [2022-12-13 17:16:06,727 INFO L87 Difference]: Start difference. First operand 108 states and 119 transitions. Second operand has 70 states, 68 states have (on average 1.7058823529411764) internal successors, (116), 61 states have internal predecessors, (116), 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-12-13 17:16:13,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:16:13,519 INFO L93 Difference]: Finished difference Result 167 states and 183 transitions. [2022-12-13 17:16:13,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-12-13 17:16:13,519 INFO L78 Accepts]: Start accepts. Automaton has has 70 states, 68 states have (on average 1.7058823529411764) internal successors, (116), 61 states have internal predecessors, (116), 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 65 [2022-12-13 17:16:13,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:16:13,520 INFO L225 Difference]: With dead ends: 167 [2022-12-13 17:16:13,520 INFO L226 Difference]: Without dead ends: 167 [2022-12-13 17:16:13,521 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 46 SyntacticMatches, 2 SemanticMatches, 106 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 2657 ImplicationChecksByTransitivity, 11.1s TimeCoverageRelationStatistics Valid=928, Invalid=9997, Unknown=7, NotChecked=624, Total=11556 [2022-12-13 17:16:13,522 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 808 mSDsluCounter, 1133 mSDsCounter, 0 mSdLazyCounter, 2572 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 808 SdHoareTripleChecker+Valid, 1167 SdHoareTripleChecker+Invalid, 2610 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 2572 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-12-13 17:16:13,522 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [808 Valid, 1167 Invalid, 2610 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 2572 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-12-13 17:16:13,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2022-12-13 17:16:13,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 115. [2022-12-13 17:16:13,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 95 states have (on average 1.2210526315789474) internal successors, (116), 108 states have internal predecessors, (116), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-12-13 17:16:13,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 126 transitions. [2022-12-13 17:16:13,525 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 126 transitions. Word has length 65 [2022-12-13 17:16:13,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:16:13,526 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 126 transitions. [2022-12-13 17:16:13,526 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 70 states, 68 states have (on average 1.7058823529411764) internal successors, (116), 61 states have internal predecessors, (116), 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-12-13 17:16:13,526 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 126 transitions. [2022-12-13 17:16:13,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-12-13 17:16:13,527 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:16:13,527 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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-12-13 17:16:13,532 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ee4424a-8107-47bf-b6a4-11ede3e4c4d9/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-12-13 17:16:13,727 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ee4424a-8107-47bf-b6a4-11ede3e4c4d9/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-12-13 17:16:13,728 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-12-13 17:16:13,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:16:13,729 INFO L85 PathProgramCache]: Analyzing trace with hash 1337458320, now seen corresponding path program 1 times [2022-12-13 17:16:13,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:16:13,729 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762937167] [2022-12-13 17:16:13,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:16:13,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:16:13,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:16:14,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:16:14,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:16:15,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-12-13 17:16:15,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:16:15,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-12-13 17:16:15,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:16:15,983 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 2 proven. 32 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-13 17:16:15,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:16:15,984 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762937167] [2022-12-13 17:16:15,984 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1762937167] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 17:16:15,984 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1704203384] [2022-12-13 17:16:15,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:16:15,984 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 17:16:15,984 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ee4424a-8107-47bf-b6a4-11ede3e4c4d9/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:16:15,985 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ee4424a-8107-47bf-b6a4-11ede3e4c4d9/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 17:16:15,986 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ee4424a-8107-47bf-b6a4-11ede3e4c4d9/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-12-13 17:16:16,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:16:16,204 INFO L263 TraceCheckSpWp]: Trace formula consists of 560 conjuncts, 134 conjunts are in the unsatisfiable core [2022-12-13 17:16:16,208 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 17:16:16,213 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 17:16:16,264 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-12-13 17:16:16,402 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-12-13 17:16:16,402 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-12-13 17:16:16,600 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-13 17:16:16,758 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-12-13 17:16:16,758 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 4 case distinctions, treesize of input 22 treesize of output 33 [2022-12-13 17:16:16,946 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-13 17:16:17,058 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 17:16:17,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 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2022-12-13 17:16:17,446 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 17:16:17,447 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 67 treesize of output 30 [2022-12-13 17:16:17,451 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 16 treesize of output 10 [2022-12-13 17:16:17,454 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-12-13 17:16:17,767 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:16:17,774 INFO L321 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2022-12-13 17:16:17,774 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 75 treesize of output 56 [2022-12-13 17:16:17,781 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:16:17,790 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-12-13 17:16:17,791 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 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-12-13 17:16:17,804 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:16:17,805 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-12-13 17:16:18,703 INFO L321 Elim1Store]: treesize reduction 52, result has 17.5 percent of original size [2022-12-13 17:16:18,703 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 168 treesize of output 119 [2022-12-13 17:16:18,720 INFO L321 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2022-12-13 17:16:18,721 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 48 [2022-12-13 17:16:18,837 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:16:18,845 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-12-13 17:16:18,845 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 90 treesize of output 72 [2022-12-13 17:16:18,855 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:16:18,855 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 33 treesize of output 33 [2022-12-13 17:16:18,975 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 34 treesize of output 22 [2022-12-13 17:16:19,172 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 17:16:19,172 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 69 treesize of output 28 [2022-12-13 17:16:19,177 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 18 proven. 18 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 17:16:19,177 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 17:16:19,399 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5712 (Array Int Int)) (v_ArrVal_5713 (Array Int Int))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_5713) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= (select |c_#valid| (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_5712))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ .cse1 4))) 1) (not (<= 0 .cse1))))) is different from false [2022-12-13 17:16:19,768 INFO L321 Elim1Store]: treesize reduction 5, result has 89.4 percent of original size [2022-12-13 17:16:19,768 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 51 treesize of output 50 [2022-12-13 17:16:20,989 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1704203384] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 17:16:20,989 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 17:16:20,989 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 65 [2022-12-13 17:16:20,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632955718] [2022-12-13 17:16:20,990 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 17:16:20,990 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2022-12-13 17:16:20,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:16:20,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2022-12-13 17:16:20,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=294, Invalid=5855, Unknown=17, NotChecked=154, Total=6320 [2022-12-13 17:16:20,991 INFO L87 Difference]: Start difference. First operand 115 states and 126 transitions. Second operand has 66 states, 63 states have (on average 1.8412698412698412) internal successors, (116), 57 states have internal predecessors, (116), 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-12-13 17:16:25,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:16:25,763 INFO L93 Difference]: Finished difference Result 189 states and 206 transitions. [2022-12-13 17:16:25,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-12-13 17:16:25,765 INFO L78 Accepts]: Start accepts. Automaton has has 66 states, 63 states have (on average 1.8412698412698412) internal successors, (116), 57 states have internal predecessors, (116), 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 68 [2022-12-13 17:16:25,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:16:25,766 INFO L225 Difference]: With dead ends: 189 [2022-12-13 17:16:25,766 INFO L226 Difference]: Without dead ends: 189 [2022-12-13 17:16:25,767 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 48 SyntacticMatches, 4 SemanticMatches, 105 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2441 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=959, Invalid=10158, Unknown=17, NotChecked=208, Total=11342 [2022-12-13 17:16:25,767 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 1290 mSDsluCounter, 988 mSDsCounter, 0 mSdLazyCounter, 2380 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1290 SdHoareTripleChecker+Valid, 1020 SdHoareTripleChecker+Invalid, 2424 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 2380 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-12-13 17:16:25,767 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1290 Valid, 1020 Invalid, 2424 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 2380 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-12-13 17:16:25,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2022-12-13 17:16:25,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 119. [2022-12-13 17:16:25,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 99 states have (on average 1.2323232323232323) internal successors, (122), 112 states have internal predecessors, (122), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-12-13 17:16:25,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 132 transitions. [2022-12-13 17:16:25,769 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 132 transitions. Word has length 68 [2022-12-13 17:16:25,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:16:25,769 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 132 transitions. [2022-12-13 17:16:25,769 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 66 states, 63 states have (on average 1.8412698412698412) internal successors, (116), 57 states have internal predecessors, (116), 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-12-13 17:16:25,770 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 132 transitions. [2022-12-13 17:16:25,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-12-13 17:16:25,770 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:16:25,770 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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-12-13 17:16:25,775 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ee4424a-8107-47bf-b6a4-11ede3e4c4d9/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-12-13 17:16:25,970 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ee4424a-8107-47bf-b6a4-11ede3e4c4d9/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 17:16:25,971 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-12-13 17:16:25,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:16:25,973 INFO L85 PathProgramCache]: Analyzing trace with hash 1337458321, now seen corresponding path program 1 times [2022-12-13 17:16:25,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:16:25,973 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854960511] [2022-12-13 17:16:25,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:16:25,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:16:26,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:16:27,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:16:27,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:16:27,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-12-13 17:16:27,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:16:28,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-12-13 17:16:28,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:16:29,155 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-13 17:16:29,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:16:29,155 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854960511] [2022-12-13 17:16:29,155 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [854960511] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 17:16:29,155 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1239789011] [2022-12-13 17:16:29,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:16:29,155 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 17:16:29,155 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ee4424a-8107-47bf-b6a4-11ede3e4c4d9/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:16:29,156 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ee4424a-8107-47bf-b6a4-11ede3e4c4d9/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 17:16:29,157 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ee4424a-8107-47bf-b6a4-11ede3e4c4d9/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-12-13 17:16:29,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:16:29,410 INFO L263 TraceCheckSpWp]: Trace formula consists of 560 conjuncts, 147 conjunts are in the unsatisfiable core [2022-12-13 17:16:29,413 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 17:16:29,417 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 17:16:29,471 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-12-13 17:16:29,624 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-12-13 17:16:29,624 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-12-13 17:16:29,865 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-13 17:16:30,015 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-12-13 17:16:30,015 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 4 case distinctions, treesize of input 22 treesize of output 33 [2022-12-13 17:16:30,202 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-13 17:16:30,205 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-13 17:16:30,327 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 17:16:30,327 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 70 [2022-12-13 17:16:30,336 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 41 treesize of output 41 [2022-12-13 17:16:30,849 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 17:16:30,850 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 101 treesize of output 48 [2022-12-13 17:16:30,860 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2022-12-13 17:16:30,866 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 16 treesize of output 10 [2022-12-13 17:16:31,233 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:16:31,239 INFO L321 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2022-12-13 17:16:31,239 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 109 treesize of output 80 [2022-12-13 17:16:31,248 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:16:31,254 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-12-13 17:16:31,254 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 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-12-13 17:16:31,261 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:16:31,261 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 42 [2022-12-13 17:16:31,266 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 32 treesize of output 27 [2022-12-13 17:16:32,499 INFO L321 Elim1Store]: treesize reduction 52, result has 17.5 percent of original size [2022-12-13 17:16:32,500 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 183 treesize of output 130 [2022-12-13 17:16:32,531 INFO L321 Elim1Store]: treesize reduction 64, result has 22.9 percent of original size [2022-12-13 17:16:32,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 3 new quantified variables, introduced 2 case distinctions, treesize of input 83 treesize of output 62 [2022-12-13 17:16:32,652 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:16:32,660 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-12-13 17:16:32,660 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 105 treesize of output 83 [2022-12-13 17:16:32,668 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:16:32,668 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 47 [2022-12-13 17:16:33,250 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 17:16:33,251 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:16:33,253 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 17:16:33,253 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 113 treesize of output 57 [2022-12-13 17:16:33,259 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-12-13 17:16:33,259 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 39 treesize of output 25 [2022-12-13 17:16:33,401 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 18 proven. 18 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 17:16:33,401 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 17:16:43,692 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1239789011] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 17:16:43,692 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 17:16:43,693 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 36] total 68 [2022-12-13 17:16:43,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589268265] [2022-12-13 17:16:43,693 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 17:16:43,693 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 69 states [2022-12-13 17:16:43,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:16:43,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2022-12-13 17:16:43,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=314, Invalid=6794, Unknown=32, NotChecked=0, Total=7140 [2022-12-13 17:16:43,694 INFO L87 Difference]: Start difference. First operand 119 states and 132 transitions. Second operand has 69 states, 66 states have (on average 1.803030303030303) internal successors, (119), 60 states have internal predecessors, (119), 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-12-13 17:16:56,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:16:56,327 INFO L93 Difference]: Finished difference Result 203 states and 222 transitions. [2022-12-13 17:16:56,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-12-13 17:16:56,327 INFO L78 Accepts]: Start accepts. Automaton has has 69 states, 66 states have (on average 1.803030303030303) internal successors, (119), 60 states have internal predecessors, (119), 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 68 [2022-12-13 17:16:56,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:16:56,328 INFO L225 Difference]: With dead ends: 203 [2022-12-13 17:16:56,328 INFO L226 Difference]: Without dead ends: 203 [2022-12-13 17:16:56,329 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 42 SyntacticMatches, 5 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2016 ImplicationChecksByTransitivity, 23.4s TimeCoverageRelationStatistics Valid=1038, Invalid=12038, Unknown=34, NotChecked=0, Total=13110 [2022-12-13 17:16:56,329 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 1674 mSDsluCounter, 1086 mSDsCounter, 0 mSdLazyCounter, 3146 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1674 SdHoareTripleChecker+Valid, 1116 SdHoareTripleChecker+Invalid, 3205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 3146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2022-12-13 17:16:56,329 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1674 Valid, 1116 Invalid, 3205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 3146 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2022-12-13 17:16:56,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2022-12-13 17:16:56,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 118. [2022-12-13 17:16:56,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 98 states have (on average 1.2244897959183674) internal successors, (120), 111 states have internal predecessors, (120), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-12-13 17:16:56,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 130 transitions. [2022-12-13 17:16:56,331 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 130 transitions. Word has length 68 [2022-12-13 17:16:56,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:16:56,332 INFO L495 AbstractCegarLoop]: Abstraction has 118 states and 130 transitions. [2022-12-13 17:16:56,332 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 69 states, 66 states have (on average 1.803030303030303) internal successors, (119), 60 states have internal predecessors, (119), 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-12-13 17:16:56,332 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 130 transitions. [2022-12-13 17:16:56,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-12-13 17:16:56,332 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:16:56,333 INFO L195 NwaCegarLoop]: trace histogram [3, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:16:56,338 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ee4424a-8107-47bf-b6a4-11ede3e4c4d9/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2022-12-13 17:16:56,533 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ee4424a-8107-47bf-b6a4-11ede3e4c4d9/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2022-12-13 17:16:56,534 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-12-13 17:16:56,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:16:56,535 INFO L85 PathProgramCache]: Analyzing trace with hash -1488466325, now seen corresponding path program 1 times [2022-12-13 17:16:56,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:16:56,535 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973827935] [2022-12-13 17:16:56,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:16:56,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:16:56,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:16:58,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:16:58,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:16:59,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-12-13 17:16:59,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:16:59,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-12-13 17:16:59,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:17:00,072 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 15 proven. 18 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-13 17:17:00,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:17:00,073 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973827935] [2022-12-13 17:17:00,073 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [973827935] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 17:17:00,073 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1557327283] [2022-12-13 17:17:00,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:17:00,073 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 17:17:00,073 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ee4424a-8107-47bf-b6a4-11ede3e4c4d9/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:17:00,074 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ee4424a-8107-47bf-b6a4-11ede3e4c4d9/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 17:17:00,075 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ee4424a-8107-47bf-b6a4-11ede3e4c4d9/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-12-13 17:17:00,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:17:00,341 INFO L263 TraceCheckSpWp]: Trace formula consists of 564 conjuncts, 134 conjunts are in the unsatisfiable core [2022-12-13 17:17:00,346 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 17:17:00,354 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 17:17:00,428 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-12-13 17:17:00,654 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-12-13 17:17:00,654 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-12-13 17:17:00,901 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-13 17:17:01,086 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-12-13 17:17:01,086 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2022-12-13 17:17:01,341 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-13 17:17:01,477 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 17:17:01,477 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 51 [2022-12-13 17:17:01,999 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 17:17:01,999 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 79 treesize of output 34 [2022-12-13 17:17:02,006 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 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-12-13 17:17:02,011 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-12-13 17:17:02,655 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:17:02,656 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-12-13 17:17:02,666 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:17:02,676 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-12-13 17:17:02,676 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 85 treesize of output 67 [2022-12-13 17:17:02,688 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:17:02,704 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-12-13 17:17:02,705 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 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-12-13 17:17:04,042 INFO L321 Elim1Store]: treesize reduction 52, result has 17.5 percent of original size [2022-12-13 17:17:04,043 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 161 treesize of output 112 [2022-12-13 17:17:04,062 INFO L321 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2022-12-13 17:17:04,063 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 33 [2022-12-13 17:17:04,198 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:17:04,208 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-12-13 17:17:04,208 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 83 treesize of output 65 [2022-12-13 17:17:04,223 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:17:04,223 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 14 treesize of output 16 [2022-12-13 17:17:04,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 15 treesize of output 7 [2022-12-13 17:17:04,615 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 17:17:04,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 68 treesize of output 27 [2022-12-13 17:17:04,620 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 18 proven. 17 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 17:17:04,620 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 17:17:04,828 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6310 (Array Int Int)) (v_ArrVal_6309 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_6310) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (<= (+ .cse0 1) 0) (not (= (select (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_6309))) (select .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ 4 .cse0)) 0))))) is different from false [2022-12-13 17:17:04,841 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6310 (Array Int Int)) (v_ArrVal_6306 Int) (v_ArrVal_6308 (Array Int Int)) (v_ArrVal_6309 (Array Int Int))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 4) v_ArrVal_6306)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_6310) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (<= (+ .cse0 1) 0) (not (= (select (let ((.cse1 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base| v_ArrVal_6308) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_6309))) (select .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ .cse0 4)) 0))))) is different from false [2022-12-13 17:17:06,446 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1557327283] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 17:17:06,447 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 17:17:06,447 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 36] total 70 [2022-12-13 17:17:06,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282912752] [2022-12-13 17:17:06,447 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 17:17:06,447 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 70 states [2022-12-13 17:17:06,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:17:06,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2022-12-13 17:17:06,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=310, Invalid=6012, Unknown=6, NotChecked=314, Total=6642 [2022-12-13 17:17:06,448 INFO L87 Difference]: Start difference. First operand 118 states and 130 transitions. Second operand has 70 states, 68 states have (on average 1.7794117647058822) internal successors, (121), 61 states have internal predecessors, (121), 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-12-13 17:17:18,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:17:18,959 INFO L93 Difference]: Finished difference Result 187 states and 202 transitions. [2022-12-13 17:17:18,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-12-13 17:17:18,960 INFO L78 Accepts]: Start accepts. Automaton has has 70 states, 68 states have (on average 1.7794117647058822) internal successors, (121), 61 states have internal predecessors, (121), 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 69 [2022-12-13 17:17:18,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:17:18,960 INFO L225 Difference]: With dead ends: 187 [2022-12-13 17:17:18,961 INFO L226 Difference]: Without dead ends: 187 [2022-12-13 17:17:18,962 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 52 SyntacticMatches, 3 SemanticMatches, 117 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 3342 ImplicationChecksByTransitivity, 16.0s TimeCoverageRelationStatistics Valid=1317, Invalid=12257, Unknown=6, NotChecked=462, Total=14042 [2022-12-13 17:17:18,962 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 1626 mSDsluCounter, 1042 mSDsCounter, 0 mSdLazyCounter, 2813 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1626 SdHoareTripleChecker+Valid, 1073 SdHoareTripleChecker+Invalid, 2886 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 2813 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-12-13 17:17:18,962 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1626 Valid, 1073 Invalid, 2886 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 2813 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2022-12-13 17:17:18,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2022-12-13 17:17:18,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 123. [2022-12-13 17:17:18,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 103 states have (on average 1.2135922330097086) internal successors, (125), 116 states have internal predecessors, (125), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-12-13 17:17:18,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 135 transitions. [2022-12-13 17:17:18,966 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 135 transitions. Word has length 69 [2022-12-13 17:17:18,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:17:18,966 INFO L495 AbstractCegarLoop]: Abstraction has 123 states and 135 transitions. [2022-12-13 17:17:18,966 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 70 states, 68 states have (on average 1.7794117647058822) internal successors, (121), 61 states have internal predecessors, (121), 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-12-13 17:17:18,966 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 135 transitions. [2022-12-13 17:17:18,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-12-13 17:17:18,967 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:17:18,967 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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-12-13 17:17:18,973 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ee4424a-8107-47bf-b6a4-11ede3e4c4d9/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2022-12-13 17:17:19,168 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ee4424a-8107-47bf-b6a4-11ede3e4c4d9/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 17:17:19,168 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-12-13 17:17:19,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:17:19,169 INFO L85 PathProgramCache]: Analyzing trace with hash 1102226234, now seen corresponding path program 1 times [2022-12-13 17:17:19,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:17:19,170 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788423528] [2022-12-13 17:17:19,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:17:19,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:17:19,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:17:21,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:17:21,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:17:21,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-12-13 17:17:21,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:17:21,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-12-13 17:17:21,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:17:23,969 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-13 17:17:23,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:17:23,969 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788423528] [2022-12-13 17:17:23,969 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1788423528] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 17:17:23,969 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1131527926] [2022-12-13 17:17:23,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:17:23,969 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 17:17:23,970 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ee4424a-8107-47bf-b6a4-11ede3e4c4d9/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:17:23,970 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ee4424a-8107-47bf-b6a4-11ede3e4c4d9/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 17:17:23,975 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ee4424a-8107-47bf-b6a4-11ede3e4c4d9/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-12-13 17:17:24,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:17:24,202 INFO L263 TraceCheckSpWp]: Trace formula consists of 567 conjuncts, 183 conjunts are in the unsatisfiable core [2022-12-13 17:17:24,210 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 17:17:24,216 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 17:17:24,312 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-12-13 17:17:24,527 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-12-13 17:17:24,527 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-12-13 17:17:24,743 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-13 17:17:24,850 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:17:24,851 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-12-13 17:17:25,008 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-13 17:17:25,733 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-13 17:17:25,734 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 14 treesize of output 20 [2022-12-13 17:17:25,738 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-12-13 17:17:25,771 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-12-13 17:17:25,771 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 4 case distinctions, treesize of input 22 treesize of output 33 [2022-12-13 17:17:26,056 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 14 treesize of output 16 [2022-12-13 17:17:26,073 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-13 17:17:26,083 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 14 treesize of output 16 [2022-12-13 17:17:26,110 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-13 17:17:26,326 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 17:17:26,327 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 100 treesize of output 91 [2022-12-13 17:17:26,338 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:17:26,338 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 45 treesize of output 38 [2022-12-13 17:17:26,343 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-12-13 17:17:26,941 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 17:17:26,942 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-12-13 17:17:26,947 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-12-13 17:17:26,953 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 16 treesize of output 10 [2022-12-13 17:17:27,554 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:17:27,566 INFO L321 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2022-12-13 17:17:27,567 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 74 [2022-12-13 17:17:27,583 INFO L321 Elim1Store]: treesize reduction 29, result has 46.3 percent of original size [2022-12-13 17:17:27,583 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 24 treesize of output 31 [2022-12-13 17:17:27,587 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-12-13 17:17:27,598 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:17:27,608 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-12-13 17:17:27,608 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 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-12-13 17:17:27,624 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:17:27,625 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 25 [2022-12-13 17:17:29,190 INFO L321 Elim1Store]: treesize reduction 52, result has 17.5 percent of original size [2022-12-13 17:17:29,191 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 233 treesize of output 168 [2022-12-13 17:17:29,234 INFO L321 Elim1Store]: treesize reduction 120, result has 15.5 percent of original size [2022-12-13 17:17:29,234 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 118 treesize of output 91 [2022-12-13 17:17:29,244 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 17:17:29,245 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:17:29,245 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 57 treesize of output 42 [2022-12-13 17:17:29,250 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-12-13 17:17:29,404 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:17:29,413 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-12-13 17:17:29,413 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 103 treesize of output 83 [2022-12-13 17:17:29,423 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-12-13 17:17:29,429 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:17:29,430 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 34 [2022-12-13 17:17:30,256 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 17:17:30,257 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:17:30,259 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 17:17:30,259 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 111 treesize of output 59 [2022-12-13 17:17:30,263 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 15 [2022-12-13 17:17:30,480 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-12-13 17:17:30,568 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 10 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 17:17:30,568 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 17:17:34,931 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6618 Int) (v_ArrVal_6640 (Array Int Int)) (v_ArrVal_6621 (Array Int Int)) (v_ArrVal_6623 (Array Int Int)) (v_ArrVal_6625 (Array Int Int)) (v_ArrVal_6624 (Array Int Int)) (|v_ULTIMATE.start_dll_append_#t~ret7#1.base_53| Int) (v_ArrVal_6638 (Array Int Int)) (v_ArrVal_6620 Int) (|v_ULTIMATE.start_dll_append_~last~0#1.offset_38| Int) (v_ArrVal_6639 (Array Int Int))) (let ((.cse9 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_53| v_ArrVal_6640)) (.cse8 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_53| v_ArrVal_6638))) (let ((.cse10 (select (select .cse8 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse11 (+ (select (select .cse9 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (let ((.cse1 (select (select .cse8 .cse10) .cse11)) (.cse2 (+ |v_ULTIMATE.start_dll_append_~last~0#1.offset_38| 4))) (let ((.cse6 (store (store .cse9 .cse1 (store (select .cse9 .cse1) .cse2 v_ArrVal_6620)) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_53| v_ArrVal_6625))) (let ((.cse7 (select (select .cse6 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (< |v_ULTIMATE.start_dll_append_#t~ret7#1.base_53| |c_#StackHeapBarrier|)) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse3 (store (store .cse8 .cse1 v_ArrVal_6621) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_53| v_ArrVal_6623))) (let ((.cse4 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse5 (+ .cse7 4))) (select (select (store (let ((.cse0 (store |c_#memory_int| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_53| v_ArrVal_6639))) (store .cse0 .cse1 (store (select .cse0 .cse1) .cse2 v_ArrVal_6618))) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_53| v_ArrVal_6624) (select (select .cse3 .cse4) .cse5)) (select (select .cse6 .cse4) .cse5))))) (not (<= 0 .cse7)) (< |v_ULTIMATE.start_dll_append_~last~0#1.offset_38| (select (select .cse9 .cse10) .cse11)) (not (= (select (select .cse8 .cse1) .cse2) 0)) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_53|) 0))))))))) is different from false [2022-12-13 17:17:34,934 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1131527926] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 17:17:34,934 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 17:17:34,934 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 40] total 74 [2022-12-13 17:17:34,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259558948] [2022-12-13 17:17:34,935 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 17:17:34,935 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 74 states [2022-12-13 17:17:34,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:17:34,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2022-12-13 17:17:34,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=337, Invalid=7094, Unknown=55, NotChecked=170, Total=7656 [2022-12-13 17:17:34,936 INFO L87 Difference]: Start difference. First operand 123 states and 135 transitions. Second operand has 74 states, 72 states have (on average 1.6944444444444444) internal successors, (122), 64 states have internal predecessors, (122), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-12-13 17:17:44,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:17:44,032 INFO L93 Difference]: Finished difference Result 174 states and 190 transitions. [2022-12-13 17:17:44,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-12-13 17:17:44,033 INFO L78 Accepts]: Start accepts. Automaton has has 74 states, 72 states have (on average 1.6944444444444444) internal successors, (122), 64 states have internal predecessors, (122), 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 70 [2022-12-13 17:17:44,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:17:44,033 INFO L225 Difference]: With dead ends: 174 [2022-12-13 17:17:44,033 INFO L226 Difference]: Without dead ends: 174 [2022-12-13 17:17:44,034 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 49 SyntacticMatches, 7 SemanticMatches, 119 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2973 ImplicationChecksByTransitivity, 16.8s TimeCoverageRelationStatistics Valid=1133, Invalid=13094, Unknown=57, NotChecked=236, Total=14520 [2022-12-13 17:17:44,034 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 832 mSDsluCounter, 1189 mSDsCounter, 0 mSdLazyCounter, 3130 mSolverCounterSat, 49 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 832 SdHoareTripleChecker+Valid, 1222 SdHoareTripleChecker+Invalid, 3181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 3130 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2022-12-13 17:17:44,034 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [832 Valid, 1222 Invalid, 3181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 3130 Invalid, 2 Unknown, 0 Unchecked, 3.4s Time] [2022-12-13 17:17:44,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2022-12-13 17:17:44,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 123. [2022-12-13 17:17:44,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 103 states have (on average 1.203883495145631) internal successors, (124), 116 states have internal predecessors, (124), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-12-13 17:17:44,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 134 transitions. [2022-12-13 17:17:44,037 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 134 transitions. Word has length 70 [2022-12-13 17:17:44,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:17:44,037 INFO L495 AbstractCegarLoop]: Abstraction has 123 states and 134 transitions. [2022-12-13 17:17:44,037 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 74 states, 72 states have (on average 1.6944444444444444) internal successors, (122), 64 states have internal predecessors, (122), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-12-13 17:17:44,037 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 134 transitions. [2022-12-13 17:17:44,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-12-13 17:17:44,037 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:17:44,038 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 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-12-13 17:17:44,045 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ee4424a-8107-47bf-b6a4-11ede3e4c4d9/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2022-12-13 17:17:44,238 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ee4424a-8107-47bf-b6a4-11ede3e4c4d9/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 17:17:44,238 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-12-13 17:17:44,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:17:44,238 INFO L85 PathProgramCache]: Analyzing trace with hash 1397517466, now seen corresponding path program 2 times [2022-12-13 17:17:44,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:17:44,239 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011034399] [2022-12-13 17:17:44,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:17:44,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:17:44,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:17:48,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:17:48,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:17:49,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-12-13 17:17:49,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:17:50,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-12-13 17:17:50,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:17:51,087 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 5 proven. 36 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-13 17:17:51,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:17:51,087 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011034399] [2022-12-13 17:17:51,088 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2011034399] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 17:17:51,088 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2136339989] [2022-12-13 17:17:51,088 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 17:17:51,088 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 17:17:51,088 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ee4424a-8107-47bf-b6a4-11ede3e4c4d9/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:17:51,089 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ee4424a-8107-47bf-b6a4-11ede3e4c4d9/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 17:17:51,089 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ee4424a-8107-47bf-b6a4-11ede3e4c4d9/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-12-13 17:17:51,468 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 17:17:51,468 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 17:17:51,472 INFO L263 TraceCheckSpWp]: Trace formula consists of 583 conjuncts, 163 conjunts are in the unsatisfiable core [2022-12-13 17:17:51,477 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 17:17:51,483 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 17:17:51,591 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-12-13 17:17:51,856 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-13 17:17:51,856 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-12-13 17:17:52,316 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-13 17:17:52,316 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-12-13 17:17:52,655 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 13 treesize of output 9 [2022-12-13 17:17:52,664 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-12-13 17:17:52,815 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 17:17:52,815 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 53 [2022-12-13 17:17:52,824 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 22 treesize of output 24 [2022-12-13 17:17:53,472 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 17:17:53,472 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 62 treesize of output 29 [2022-12-13 17:17:53,478 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-13 17:17:53,484 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 17:17:53,484 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 15 treesize of output 7 [2022-12-13 17:17:54,448 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:17:54,459 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-12-13 17:17:54,459 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 68 treesize of output 58 [2022-12-13 17:17:54,467 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:17:54,480 INFO L321 Elim1Store]: treesize reduction 31, result has 35.4 percent of original size [2022-12-13 17:17:54,480 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 2 case distinctions, treesize of input 25 treesize of output 38 [2022-12-13 17:17:54,524 INFO L321 Elim1Store]: treesize reduction 72, result has 37.4 percent of original size [2022-12-13 17:17:54,525 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 4 case distinctions, treesize of input 34 treesize of output 57 [2022-12-13 17:17:56,074 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:17:56,075 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 17:17:56,100 INFO L321 Elim1Store]: treesize reduction 103, result has 14.9 percent of original size [2022-12-13 17:17:56,101 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 160 treesize of output 85 [2022-12-13 17:17:56,118 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-13 17:17:56,118 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 47 [2022-12-13 17:17:56,426 INFO L321 Elim1Store]: treesize reduction 66, result has 19.5 percent of original size [2022-12-13 17:17:56,426 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 256 treesize of output 187 [2022-12-13 17:17:56,453 INFO L321 Elim1Store]: treesize reduction 52, result has 22.4 percent of original size [2022-12-13 17:17:56,453 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 195 treesize of output 163 [2022-12-13 17:17:57,645 INFO L321 Elim1Store]: treesize reduction 22, result has 12.0 percent of original size [2022-12-13 17:17:57,645 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 195 treesize of output 117 [2022-12-13 17:17:58,209 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-13 17:17:58,209 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 128 treesize of output 46 [2022-12-13 17:17:58,607 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 2 proven. 34 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-12-13 17:17:58,607 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 17:17:59,679 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6928 (Array Int Int)) (v_ArrVal_6927 (Array Int Int))) (let ((.cse5 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_6927))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_6928))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (+ .cse4 4))) (let ((.cse3 (select (select .cse5 .cse1) .cse2))) (or (= (select |c_#valid| (select (select .cse0 (select (select .cse0 .cse1) .cse2)) (+ .cse3 4))) 1) (not (<= 0 .cse4)) (not (<= 0 .cse3)))))))) is different from false [2022-12-13 17:17:59,698 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6924 (Array Int Int)) (v_ArrVal_6928 (Array Int Int)) (v_ArrVal_6927 (Array Int Int))) (let ((.cse5 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base| v_ArrVal_6924) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_6927))) (let ((.cse0 (select (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 4) |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_6928))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse4 (+ 4 .cse0))) (let ((.cse1 (select (select .cse5 .cse3) .cse4))) (or (not (<= 0 .cse0)) (not (<= 0 .cse1)) (= (select |c_#valid| (select (select .cse2 (select (select .cse2 .cse3) .cse4)) (+ .cse1 4))) 1))))))) is different from false [2022-12-13 17:18:00,698 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6924 (Array Int Int)) (v_ArrVal_6928 (Array Int Int)) (v_ArrVal_6927 (Array Int Int))) (let ((.cse7 (+ |c_ULTIMATE.start_dll_append_#t~mem9#1.offset| 4))) (let ((.cse6 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_#t~mem9#1.base|) .cse7))) (let ((.cse5 (store (store |c_#memory_$Pointer$.offset| .cse6 v_ArrVal_6924) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_6927))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1 (store (store |c_#memory_$Pointer$.base| .cse6 (store (select |c_#memory_$Pointer$.base| .cse6) (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_#t~mem9#1.base|) .cse7) 4) |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_6928))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (+ .cse4 4))) (let ((.cse0 (select (select .cse5 .cse2) .cse3))) (or (not (<= 0 .cse0)) (= (select |c_#valid| (select (select .cse1 (select (select .cse1 .cse2) .cse3)) (+ .cse0 4))) 1) (not (<= 0 .cse4)))))))))) is different from false [2022-12-13 17:18:00,719 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6924 (Array Int Int)) (v_ArrVal_6928 (Array Int Int)) (v_ArrVal_6927 (Array Int Int))) (let ((.cse7 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse8 (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (let ((.cse6 (select (select |c_#memory_$Pointer$.base| .cse7) .cse8))) (let ((.cse5 (store (store |c_#memory_$Pointer$.offset| .cse6 v_ArrVal_6924) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_6927))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse0 (store (store |c_#memory_$Pointer$.base| .cse6 (store (select |c_#memory_$Pointer$.base| .cse6) (+ (select (select |c_#memory_$Pointer$.offset| .cse7) .cse8) 4) |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_6928))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (+ .cse4 4))) (let ((.cse3 (select (select .cse5 .cse1) .cse2))) (or (= (select |c_#valid| (select (select .cse0 (select (select .cse0 .cse1) .cse2)) (+ .cse3 4))) 1) (not (<= 0 .cse3)) (not (<= 0 .cse4)))))))))) is different from false [2022-12-13 17:18:00,771 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6924 (Array Int Int)) (v_ArrVal_6928 (Array Int Int)) (v_ArrVal_6927 (Array Int Int))) (let ((.cse7 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse8 (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (let ((.cse6 (select (select |c_#memory_$Pointer$.base| .cse7) .cse8))) (let ((.cse5 (store (store |c_#memory_$Pointer$.offset| .cse6 v_ArrVal_6924) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_6927))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1 (store (store |c_#memory_$Pointer$.base| .cse6 (store (select |c_#memory_$Pointer$.base| .cse6) (+ (select (select |c_#memory_$Pointer$.offset| .cse7) .cse8) 4) |c_ULTIMATE.start_dll_append_#t~ret7#1.base|)) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_6928))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (+ 4 .cse4))) (let ((.cse0 (select (select .cse5 .cse2) .cse3))) (or (not (<= 0 .cse0)) (= (select |c_#valid| (select (select .cse1 (select (select .cse1 .cse2) .cse3)) (+ .cse0 4))) 1) (not (<= 0 .cse4)))))))))) is different from false [2022-12-13 17:18:01,384 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2136339989] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 17:18:01,384 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 17:18:01,384 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 35] total 77 [2022-12-13 17:18:01,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164789619] [2022-12-13 17:18:01,385 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 17:18:01,385 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 78 states [2022-12-13 17:18:01,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:18:01,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2022-12-13 17:18:01,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=262, Invalid=7574, Unknown=16, NotChecked=890, Total=8742 [2022-12-13 17:18:01,386 INFO L87 Difference]: Start difference. First operand 123 states and 134 transitions. Second operand has 78 states, 75 states have (on average 1.68) internal successors, (126), 69 states have internal predecessors, (126), 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-12-13 17:18:21,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:18:21,612 INFO L93 Difference]: Finished difference Result 272 states and 296 transitions. [2022-12-13 17:18:21,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2022-12-13 17:18:21,613 INFO L78 Accepts]: Start accepts. Automaton has has 78 states, 75 states have (on average 1.68) internal successors, (126), 69 states have internal predecessors, (126), 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 73 [2022-12-13 17:18:21,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:18:21,614 INFO L225 Difference]: With dead ends: 272 [2022-12-13 17:18:21,614 INFO L226 Difference]: Without dead ends: 272 [2022-12-13 17:18:21,615 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 58 SyntacticMatches, 3 SemanticMatches, 150 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 4119 ImplicationChecksByTransitivity, 27.2s TimeCoverageRelationStatistics Valid=1489, Invalid=19975, Unknown=18, NotChecked=1470, Total=22952 [2022-12-13 17:18:21,615 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 2277 mSDsluCounter, 1428 mSDsCounter, 0 mSdLazyCounter, 3978 mSolverCounterSat, 107 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2277 SdHoareTripleChecker+Valid, 1461 SdHoareTripleChecker+Invalid, 4087 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 3978 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2022-12-13 17:18:21,615 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2277 Valid, 1461 Invalid, 4087 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 3978 Invalid, 2 Unknown, 0 Unchecked, 4.3s Time] [2022-12-13 17:18:21,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2022-12-13 17:18:21,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 126. [2022-12-13 17:18:21,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 106 states have (on average 1.2169811320754718) internal successors, (129), 119 states have internal predecessors, (129), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-12-13 17:18:21,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 139 transitions. [2022-12-13 17:18:21,618 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 139 transitions. Word has length 73 [2022-12-13 17:18:21,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:18:21,618 INFO L495 AbstractCegarLoop]: Abstraction has 126 states and 139 transitions. [2022-12-13 17:18:21,618 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 78 states, 75 states have (on average 1.68) internal successors, (126), 69 states have internal predecessors, (126), 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-12-13 17:18:21,618 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 139 transitions. [2022-12-13 17:18:21,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-12-13 17:18:21,618 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:18:21,619 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 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-12-13 17:18:21,624 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ee4424a-8107-47bf-b6a4-11ede3e4c4d9/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2022-12-13 17:18:21,819 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ee4424a-8107-47bf-b6a4-11ede3e4c4d9/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2022-12-13 17:18:21,820 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-12-13 17:18:21,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:18:21,821 INFO L85 PathProgramCache]: Analyzing trace with hash 1397517467, now seen corresponding path program 2 times [2022-12-13 17:18:21,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:18:21,821 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086516426] [2022-12-13 17:18:21,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:18:21,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:18:21,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:18:24,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:18:24,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:18:24,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-12-13 17:18:24,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:18:24,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-12-13 17:18:24,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:18:25,144 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 4 proven. 37 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-13 17:18:25,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:18:25,145 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086516426] [2022-12-13 17:18:25,145 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2086516426] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 17:18:25,145 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1189944263] [2022-12-13 17:18:25,145 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 17:18:25,145 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 17:18:25,145 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ee4424a-8107-47bf-b6a4-11ede3e4c4d9/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:18:25,146 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ee4424a-8107-47bf-b6a4-11ede3e4c4d9/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 17:18:25,147 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ee4424a-8107-47bf-b6a4-11ede3e4c4d9/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-12-13 17:18:25,490 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 17:18:25,490 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 17:18:25,493 INFO L263 TraceCheckSpWp]: Trace formula consists of 583 conjuncts, 145 conjunts are in the unsatisfiable core [2022-12-13 17:18:25,497 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 17:18:25,574 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 5 [2022-12-13 17:18:26,359 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 34 treesize of output 18 [2022-12-13 17:18:26,362 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-12-13 17:18:26,366 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-12-13 17:18:26,369 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-12-13 17:18:27,118 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:18:27,119 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-12-13 17:18:27,134 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:18:27,137 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 16 treesize of output 18 [2022-12-13 17:18:27,144 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:18:27,145 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 42 treesize of output 38 [2022-12-13 17:18:27,160 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-12-13 17:18:27,160 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 15 treesize of output 15 [2022-12-13 17:18:28,613 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:18:28,652 INFO L321 Elim1Store]: treesize reduction 96, result has 17.9 percent of original size [2022-12-13 17:18:28,652 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 5 case distinctions, treesize of input 91 treesize of output 70 [2022-12-13 17:18:28,663 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:18:28,684 INFO L321 Elim1Store]: treesize reduction 68, result has 21.8 percent of original size [2022-12-13 17:18:28,684 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 55 treesize of output 52 [2022-12-13 17:18:28,886 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:18:28,923 INFO L321 Elim1Store]: treesize reduction 120, result has 18.9 percent of original size [2022-12-13 17:18:28,924 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 8 new quantified variables, introduced 6 case distinctions, treesize of input 516 treesize of output 188 [2022-12-13 17:18:28,936 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:18:28,977 INFO L321 Elim1Store]: treesize reduction 104, result has 24.6 percent of original size [2022-12-13 17:18:28,977 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 8 new quantified variables, introduced 5 case distinctions, treesize of input 459 treesize of output 233 [2022-12-13 17:18:32,833 INFO L321 Elim1Store]: treesize reduction 172, result has 67.2 percent of original size [2022-12-13 17:18:32,833 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 10 select indices, 10 select index equivalence classes, 3 disjoint index pairs (out of 45 index pairs), introduced 17 new quantified variables, introduced 45 case distinctions, treesize of input 568 treesize of output 569 [2022-12-13 17:18:34,101 INFO L321 Elim1Store]: treesize reduction 138, result has 64.3 percent of original size [2022-12-13 17:18:34,101 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 10 select indices, 10 select index equivalence classes, 3 disjoint index pairs (out of 45 index pairs), introduced 13 new quantified variables, introduced 45 case distinctions, treesize of input 582 treesize of output 665 [2022-12-13 17:20:40,997 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 23 proven. 18 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-13 17:20:40,997 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 17:21:18,506 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1189944263] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 17:21:18,506 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 17:21:18,506 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 31] total 69 [2022-12-13 17:21:18,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201246933] [2022-12-13 17:21:18,506 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 17:21:18,506 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 70 states [2022-12-13 17:21:18,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:21:18,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2022-12-13 17:21:18,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=257, Invalid=7392, Unknown=7, NotChecked=0, Total=7656 [2022-12-13 17:21:18,507 INFO L87 Difference]: Start difference. First operand 126 states and 139 transitions. Second operand has 70 states, 67 states have (on average 1.9701492537313432) internal successors, (132), 63 states have internal predecessors, (132), 5 states have call successors, (5), 3 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-12-13 17:21:35,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:21:35,304 INFO L93 Difference]: Finished difference Result 210 states and 229 transitions. [2022-12-13 17:21:35,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-12-13 17:21:35,305 INFO L78 Accepts]: Start accepts. Automaton has has 70 states, 67 states have (on average 1.9701492537313432) internal successors, (132), 63 states have internal predecessors, (132), 5 states have call successors, (5), 3 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 73 [2022-12-13 17:21:35,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:21:35,305 INFO L225 Difference]: With dead ends: 210 [2022-12-13 17:21:35,305 INFO L226 Difference]: Without dead ends: 210 [2022-12-13 17:21:35,306 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 56 SyntacticMatches, 2 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2269 ImplicationChecksByTransitivity, 54.7s TimeCoverageRelationStatistics Valid=867, Invalid=14129, Unknown=10, NotChecked=0, Total=15006 [2022-12-13 17:21:35,306 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 1205 mSDsluCounter, 1284 mSDsCounter, 0 mSdLazyCounter, 3772 mSolverCounterSat, 24 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1205 SdHoareTripleChecker+Valid, 1314 SdHoareTripleChecker+Invalid, 3799 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 3772 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2022-12-13 17:21:35,306 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1205 Valid, 1314 Invalid, 3799 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 3772 Invalid, 3 Unknown, 0 Unchecked, 5.0s Time] [2022-12-13 17:21:35,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2022-12-13 17:21:35,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 128. [2022-12-13 17:21:35,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 108 states have (on average 1.212962962962963) internal successors, (131), 121 states have internal predecessors, (131), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-12-13 17:21:35,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 141 transitions. [2022-12-13 17:21:35,309 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 141 transitions. Word has length 73 [2022-12-13 17:21:35,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:21:35,309 INFO L495 AbstractCegarLoop]: Abstraction has 128 states and 141 transitions. [2022-12-13 17:21:35,309 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 70 states, 67 states have (on average 1.9701492537313432) internal successors, (132), 63 states have internal predecessors, (132), 5 states have call successors, (5), 3 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-12-13 17:21:35,309 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 141 transitions. [2022-12-13 17:21:35,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-12-13 17:21:35,309 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:21:35,309 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:21:35,316 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ee4424a-8107-47bf-b6a4-11ede3e4c4d9/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2022-12-13 17:21:35,510 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ee4424a-8107-47bf-b6a4-11ede3e4c4d9/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2022-12-13 17:21:35,510 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-12-13 17:21:35,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:21:35,511 INFO L85 PathProgramCache]: Analyzing trace with hash 373367201, now seen corresponding path program 2 times [2022-12-13 17:21:35,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:21:35,512 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087551529] [2022-12-13 17:21:35,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:21:35,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:21:35,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:21:38,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:21:38,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:21:38,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-12-13 17:21:38,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:21:38,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-12-13 17:21:38,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:21:39,966 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 17 proven. 22 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-13 17:21:39,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:21:39,966 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087551529] [2022-12-13 17:21:39,966 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1087551529] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 17:21:39,966 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1551966202] [2022-12-13 17:21:39,966 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 17:21:39,967 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 17:21:39,967 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ee4424a-8107-47bf-b6a4-11ede3e4c4d9/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:21:39,967 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ee4424a-8107-47bf-b6a4-11ede3e4c4d9/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 17:21:39,968 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ee4424a-8107-47bf-b6a4-11ede3e4c4d9/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-12-13 17:21:40,392 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 17:21:40,392 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 17:21:40,396 INFO L263 TraceCheckSpWp]: Trace formula consists of 587 conjuncts, 163 conjunts are in the unsatisfiable core [2022-12-13 17:21:40,401 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 17:21:40,408 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 17:21:40,487 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-12-13 17:21:40,735 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-12-13 17:21:40,736 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-12-13 17:21:41,037 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-13 17:21:41,205 INFO L321 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-12-13 17:21:41,205 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 16 treesize of output 18 [2022-12-13 17:21:41,493 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-13 17:21:41,502 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-13 17:21:41,630 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 17:21:41,630 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 53 [2022-12-13 17:21:41,640 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-12-13 17:21:42,129 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 17:21:42,129 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 78 treesize of output 37 [2022-12-13 17:21:42,134 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-12-13 17:21:42,827 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:21:42,836 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-12-13 17:21:42,837 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 84 treesize of output 70 [2022-12-13 17:21:42,858 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-12-13 17:21:42,859 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2022-12-13 17:21:42,868 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:21:42,868 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 30 [2022-12-13 17:21:44,381 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 17:21:44,404 INFO L321 Elim1Store]: treesize reduction 145, result has 11.0 percent of original size [2022-12-13 17:21:44,404 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 7 new quantified variables, introduced 9 case distinctions, treesize of input 172 treesize of output 82 [2022-12-13 17:21:44,426 INFO L321 Elim1Store]: treesize reduction 43, result has 17.3 percent of original size [2022-12-13 17:21:44,426 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 61 [2022-12-13 17:21:44,615 INFO L321 Elim1Store]: treesize reduction 66, result has 19.5 percent of original size [2022-12-13 17:21:44,615 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 249 treesize of output 184 [2022-12-13 17:21:44,637 INFO L321 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2022-12-13 17:21:44,637 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 194 treesize of output 162 [2022-12-13 17:21:45,548 INFO L321 Elim1Store]: treesize reduction 20, result has 25.9 percent of original size [2022-12-13 17:21:45,548 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 180 treesize of output 109 [2022-12-13 17:21:46,008 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 17:21:46,009 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:21:46,025 INFO L321 Elim1Store]: treesize reduction 33, result has 25.0 percent of original size [2022-12-13 17:21:46,025 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 123 treesize of output 52 [2022-12-13 17:21:46,030 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 4 proven. 37 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 17:21:46,031 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 17:21:46,806 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~ptr~0#1.offset_34| Int) (v_ArrVal_7525 (Array Int Int)) (v_ArrVal_7524 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_7525))) (or (not (= (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_7524))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_34| 4))) (select (select .cse0 (select (select .cse0 .cse1) .cse2)) (+ (select (select .cse3 .cse1) .cse2) 4)))) 0)) (< (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_34|) (not (<= 0 |v_ULTIMATE.start_main_~ptr~0#1.offset_34|))))) is different from false [2022-12-13 17:21:49,722 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1551966202] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 17:21:49,722 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 17:21:49,722 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 40] total 78 [2022-12-13 17:21:49,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413775287] [2022-12-13 17:21:49,722 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 17:21:49,722 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 78 states [2022-12-13 17:21:49,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:21:49,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2022-12-13 17:21:49,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=271, Invalid=8099, Unknown=6, NotChecked=180, Total=8556 [2022-12-13 17:21:49,723 INFO L87 Difference]: Start difference. First operand 128 states and 141 transitions. Second operand has 78 states, 76 states have (on average 1.7236842105263157) internal successors, (131), 69 states have internal predecessors, (131), 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-12-13 17:22:03,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:22:03,913 INFO L93 Difference]: Finished difference Result 181 states and 197 transitions. [2022-12-13 17:22:03,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-12-13 17:22:03,914 INFO L78 Accepts]: Start accepts. Automaton has has 78 states, 76 states have (on average 1.7236842105263157) internal successors, (131), 69 states have internal predecessors, (131), 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 74 [2022-12-13 17:22:03,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:22:03,915 INFO L225 Difference]: With dead ends: 181 [2022-12-13 17:22:03,915 INFO L226 Difference]: Without dead ends: 181 [2022-12-13 17:22:03,916 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 56 SyntacticMatches, 2 SemanticMatches, 124 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2854 ImplicationChecksByTransitivity, 19.9s TimeCoverageRelationStatistics Valid=1067, Invalid=14431, Unknown=6, NotChecked=246, Total=15750 [2022-12-13 17:22:03,916 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 1433 mSDsluCounter, 1290 mSDsCounter, 0 mSdLazyCounter, 3725 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1433 SdHoareTripleChecker+Valid, 1319 SdHoareTripleChecker+Invalid, 3781 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 3725 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2022-12-13 17:22:03,916 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1433 Valid, 1319 Invalid, 3781 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 3725 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2022-12-13 17:22:03,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2022-12-13 17:22:03,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 128. [2022-12-13 17:22:03,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 108 states have (on average 1.2037037037037037) internal successors, (130), 121 states have internal predecessors, (130), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-12-13 17:22:03,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 140 transitions. [2022-12-13 17:22:03,918 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 140 transitions. Word has length 74 [2022-12-13 17:22:03,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:22:03,918 INFO L495 AbstractCegarLoop]: Abstraction has 128 states and 140 transitions. [2022-12-13 17:22:03,919 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 78 states, 76 states have (on average 1.7236842105263157) internal successors, (131), 69 states have internal predecessors, (131), 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-12-13 17:22:03,919 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 140 transitions. [2022-12-13 17:22:03,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-12-13 17:22:03,919 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:22:03,919 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:22:03,925 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ee4424a-8107-47bf-b6a4-11ede3e4c4d9/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2022-12-13 17:22:04,119 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ee4424a-8107-47bf-b6a4-11ede3e4c4d9/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2022-12-13 17:22:04,120 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-12-13 17:22:04,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:22:04,121 INFO L85 PathProgramCache]: Analyzing trace with hash 345185237, now seen corresponding path program 3 times [2022-12-13 17:22:04,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:22:04,121 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636480221] [2022-12-13 17:22:04,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:22:04,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:22:04,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:22:04,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:22:04,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:22:04,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-12-13 17:22:04,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:22:04,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-12-13 17:22:04,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:22:04,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-12-13 17:22:04,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:22:04,288 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 17 proven. 8 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2022-12-13 17:22:04,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:22:04,288 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636480221] [2022-12-13 17:22:04,288 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [636480221] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 17:22:04,288 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1759606083] [2022-12-13 17:22:04,288 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-13 17:22:04,288 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 17:22:04,288 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ee4424a-8107-47bf-b6a4-11ede3e4c4d9/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:22:04,289 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ee4424a-8107-47bf-b6a4-11ede3e4c4d9/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 17:22:04,290 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ee4424a-8107-47bf-b6a4-11ede3e4c4d9/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-12-13 17:22:04,722 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-12-13 17:22:04,722 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 17:22:04,726 INFO L263 TraceCheckSpWp]: Trace formula consists of 511 conjuncts, 144 conjunts are in the unsatisfiable core [2022-12-13 17:22:04,732 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 17:22:04,855 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-13 17:22:04,911 INFO L321 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-12-13 17:22:04,912 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 27 [2022-12-13 17:22:05,213 INFO L321 Elim1Store]: treesize reduction 60, result has 31.0 percent of original size [2022-12-13 17:22:05,213 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 5 case distinctions, treesize of input 26 treesize of output 41 [2022-12-13 17:22:05,229 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-12-13 17:22:05,229 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 37 treesize of output 41 [2022-12-13 17:22:05,360 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-12-13 17:22:05,361 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 37 treesize of output 41 [2022-12-13 17:22:05,450 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-12-13 17:22:05,472 INFO L321 Elim1Store]: treesize reduction 45, result has 16.7 percent of original size [2022-12-13 17:22:05,472 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 44 treesize of output 41 [2022-12-13 17:22:05,616 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:22:05,616 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:22:05,617 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 17:22:05,637 INFO L321 Elim1Store]: treesize reduction 61, result has 27.4 percent of original size [2022-12-13 17:22:05,637 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 109 treesize of output 84 [2022-12-13 17:22:05,642 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:22:05,642 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 77 treesize of output 77 [2022-12-13 17:22:06,030 INFO L321 Elim1Store]: treesize reduction 35, result has 31.4 percent of original size [2022-12-13 17:22:06,030 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 7 new quantified variables, introduced 6 case distinctions, treesize of input 100 treesize of output 54 [2022-12-13 17:22:06,037 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-13 17:22:06,037 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 1 case distinctions, treesize of input 16 treesize of output 10 [2022-12-13 17:22:06,043 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 17:22:06,043 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 15 treesize of output 7 [2022-12-13 17:22:06,259 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_7897 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_7897) |c_#memory_$Pointer$.base|)) (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_7898 (Array Int Int))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_7898))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| 1)))) is different from true [2022-12-13 17:22:06,306 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:22:06,338 INFO L321 Elim1Store]: treesize reduction 90, result has 15.1 percent of original size [2022-12-13 17:22:06,339 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 9 case distinctions, treesize of input 106 treesize of output 88 [2022-12-13 17:22:06,353 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:22:06,395 INFO L321 Elim1Store]: treesize reduction 154, result has 33.0 percent of original size [2022-12-13 17:22:06,396 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 51 treesize of output 93 [2022-12-13 17:22:06,412 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:22:06,415 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-13 17:22:06,416 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 30 [2022-12-13 17:22:07,078 INFO L321 Elim1Store]: treesize reduction 22, result has 12.0 percent of original size [2022-12-13 17:22:07,078 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 3 case distinctions, treesize of input 53 treesize of output 31 [2022-12-13 17:22:07,418 INFO L321 Elim1Store]: treesize reduction 35, result has 31.4 percent of original size [2022-12-13 17:22:07,418 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 7 new quantified variables, introduced 6 case distinctions, treesize of input 140 treesize of output 62 [2022-12-13 17:22:07,582 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 54 proven. 16 refuted. 0 times theorem prover too weak. 3 trivial. 6 not checked. [2022-12-13 17:22:07,582 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 17:22:08,232 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1759606083] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 17:22:08,232 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 17:22:08,232 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 33] total 38 [2022-12-13 17:22:08,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362920123] [2022-12-13 17:22:08,232 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 17:22:08,232 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-12-13 17:22:08,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:22:08,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-12-13 17:22:08,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=1920, Unknown=3, NotChecked=88, Total=2162 [2022-12-13 17:22:08,233 INFO L87 Difference]: Start difference. First operand 128 states and 140 transitions. Second operand has 38 states, 37 states have (on average 2.72972972972973) internal successors, (101), 33 states have internal predecessors, (101), 6 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (8), 7 states have call predecessors, (8), 6 states have call successors, (8) [2022-12-13 17:22:10,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:22:10,448 INFO L93 Difference]: Finished difference Result 98 states and 104 transitions. [2022-12-13 17:22:10,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-12-13 17:22:10,449 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 2.72972972972973) internal successors, (101), 33 states have internal predecessors, (101), 6 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (8), 7 states have call predecessors, (8), 6 states have call successors, (8) Word has length 75 [2022-12-13 17:22:10,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:22:10,449 INFO L225 Difference]: With dead ends: 98 [2022-12-13 17:22:10,449 INFO L226 Difference]: Without dead ends: 98 [2022-12-13 17:22:10,449 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 53 SyntacticMatches, 5 SemanticMatches, 61 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 930 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=274, Invalid=3506, Unknown=6, NotChecked=120, Total=3906 [2022-12-13 17:22:10,450 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 212 mSDsluCounter, 609 mSDsCounter, 0 mSdLazyCounter, 1050 mSolverCounterSat, 10 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 641 SdHoareTripleChecker+Invalid, 1150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1050 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 85 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-12-13 17:22:10,450 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [212 Valid, 641 Invalid, 1150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1050 Invalid, 5 Unknown, 85 Unchecked, 1.3s Time] [2022-12-13 17:22:10,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2022-12-13 17:22:10,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 86. [2022-12-13 17:22:10,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 72 states have (on average 1.1805555555555556) internal successors, (85), 81 states have internal predecessors, (85), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-13 17:22:10,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 91 transitions. [2022-12-13 17:22:10,451 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 91 transitions. Word has length 75 [2022-12-13 17:22:10,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:22:10,451 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 91 transitions. [2022-12-13 17:22:10,451 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 2.72972972972973) internal successors, (101), 33 states have internal predecessors, (101), 6 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (8), 7 states have call predecessors, (8), 6 states have call successors, (8) [2022-12-13 17:22:10,451 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 91 transitions. [2022-12-13 17:22:10,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-12-13 17:22:10,452 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:22:10,452 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 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, 1, 1, 1, 1, 1, 1] [2022-12-13 17:22:10,459 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ee4424a-8107-47bf-b6a4-11ede3e4c4d9/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0 [2022-12-13 17:22:10,652 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ee4424a-8107-47bf-b6a4-11ede3e4c4d9/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2022-12-13 17:22:10,653 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-12-13 17:22:10,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:22:10,654 INFO L85 PathProgramCache]: Analyzing trace with hash -1310476604, now seen corresponding path program 2 times [2022-12-13 17:22:10,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:22:10,655 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086931922] [2022-12-13 17:22:10,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:22:10,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:22:10,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:22:13,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:22:13,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:22:13,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-12-13 17:22:13,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:22:13,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-12-13 17:22:13,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:22:14,893 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 4 proven. 39 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-13 17:22:14,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:22:14,894 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086931922] [2022-12-13 17:22:14,894 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2086931922] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 17:22:14,894 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1828337479] [2022-12-13 17:22:14,894 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 17:22:14,894 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 17:22:14,894 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ee4424a-8107-47bf-b6a4-11ede3e4c4d9/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:22:14,895 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ee4424a-8107-47bf-b6a4-11ede3e4c4d9/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 17:22:14,895 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ee4424a-8107-47bf-b6a4-11ede3e4c4d9/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-12-13 17:22:15,354 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 17:22:15,354 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 17:22:15,359 INFO L263 TraceCheckSpWp]: Trace formula consists of 590 conjuncts, 188 conjunts are in the unsatisfiable core [2022-12-13 17:22:15,365 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 17:22:15,372 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 17:22:15,378 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 17:22:15,489 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-12-13 17:22:15,493 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-12-13 17:22:15,568 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)) (exists ((v_ArrVal_8180 Int)) (= (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_8180) |c_#length|)))) is different from true [2022-12-13 17:22:15,605 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:22:15,606 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-12-13 17:22:15,613 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-13 17:22:15,614 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-12-13 17:22:15,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-12-13 17:22:16,085 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:22:16,086 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-12-13 17:22:16,846 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-12-13 17:22:16,849 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-12-13 17:22:16,853 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-12-13 17:22:16,856 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-12-13 17:22:17,328 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-13 17:22:17,646 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:22:17,647 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-12-13 17:22:17,655 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:22:17,656 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-12-13 17:22:17,663 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:22:17,663 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 33 treesize of output 31 [2022-12-13 17:22:17,687 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-12-13 17:22:17,687 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 15 treesize of output 15 [2022-12-13 17:22:18,844 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 17:22:18,844 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2022-12-13 17:22:19,284 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:22:19,297 INFO L321 Elim1Store]: treesize reduction 59, result has 15.7 percent of original size [2022-12-13 17:22:19,297 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 4 new quantified variables, introduced 2 case distinctions, treesize of input 64 treesize of output 55 [2022-12-13 17:22:19,314 INFO L321 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2022-12-13 17:22:19,314 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 3 case distinctions, treesize of input 70 treesize of output 53 [2022-12-13 17:22:19,356 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-12-13 17:22:19,357 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 30 [2022-12-13 17:22:19,647 INFO L321 Elim1Store]: treesize reduction 96, result has 18.6 percent of original size [2022-12-13 17:22:19,647 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 8 new quantified variables, introduced 6 case distinctions, treesize of input 455 treesize of output 177 [2022-12-13 17:22:19,661 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:22:19,704 INFO L321 Elim1Store]: treesize reduction 116, result has 30.1 percent of original size [2022-12-13 17:22:19,705 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 4 case distinctions, treesize of input 407 treesize of output 261 [2022-12-13 17:22:19,739 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 133 treesize of output 110 [2022-12-13 17:22:23,838 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:22:24,515 INFO L321 Elim1Store]: treesize reduction 110, result has 77.9 percent of original size [2022-12-13 17:22:24,515 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 10 select indices, 10 select index equivalence classes, 4 disjoint index pairs (out of 45 index pairs), introduced 17 new quantified variables, introduced 45 case distinctions, treesize of input 493 treesize of output 574 [2022-12-13 17:22:24,542 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:22:25,319 INFO L321 Elim1Store]: treesize reduction 112, result has 68.8 percent of original size [2022-12-13 17:22:25,319 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 10 select indices, 10 select index equivalence classes, 4 disjoint index pairs (out of 45 index pairs), introduced 13 new quantified variables, introduced 45 case distinctions, treesize of input 581 treesize of output 666 [2022-12-13 17:25:20,834 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-12-13 17:25:20,835 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 38 treesize of output 25 [2022-12-13 17:25:20,972 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 8 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 14 not checked. [2022-12-13 17:25:20,972 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 17:25:28,806 INFO L321 Elim1Store]: treesize reduction 4, result has 99.9 percent of original size [2022-12-13 17:25:28,806 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 432720 treesize of output 411263 [2022-12-13 17:25:45,341 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse19 (= |c_ULTIMATE.start_main_~data~0#1| |c_ULTIMATE.start_dll_append_~data#1|))) (let ((.cse39 (not .cse19))) (and (forall ((|v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| Int)) (or (not (< |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 0)) (forall ((v_ArrVal_8218 (Array Int Int)) (v_ArrVal_8219 (Array Int Int)) (v_ArrVal_8217 Int)) (let ((.cse16 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8218)) (.cse14 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8219))) (let ((.cse17 (select (select .cse14 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse18 (+ (select (select .cse16 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (let ((.cse5 (select (select .cse16 .cse17) .cse18)) (.cse6 (select (select .cse14 .cse17) .cse18))) (let ((.cse10 (select .cse16 .cse6)) (.cse0 (+ .cse5 4))) (let ((.cse9 (select .cse14 .cse6)) (.cse7 (let ((.cse15 (store .cse16 .cse6 (store .cse10 .cse0 0)))) (store .cse15 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse15 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse5))))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1 (let ((.cse13 (store .cse14 .cse6 (store .cse9 .cse0 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|)))) (store .cse13 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse13 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse6))))) (let ((.cse11 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse12 (+ 4 .cse4))) (let ((.cse8 (select (select .cse7 .cse11) .cse12))) (let ((.cse3 (+ 4 .cse8)) (.cse2 (select (select .cse1 .cse11) .cse12))) (or (not (<= 0 .cse0)) (= (select (select .cse1 .cse2) .cse3) .cse2) (not (<= 0 .cse4)) (not (<= (+ .cse5 8) (select (store |c_#length| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8217) .cse6))) (= (select (select .cse7 .cse2) .cse3) 0) (not (<= 0 .cse8)) (not (= (select .cse9 .cse0) 0)) (not (= (select .cse10 .cse0) 0)) (= |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| .cse2)))))))))))))) (or .cse19 (forall ((|v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| Int) (v_ArrVal_8218 (Array Int Int)) (v_ArrVal_8219 (Array Int Int)) (v_ArrVal_8217 Int)) (let ((.cse36 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8218)) (.cse34 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8219))) (let ((.cse37 (select (select .cse34 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse38 (+ (select (select .cse36 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (let ((.cse22 (select (select .cse36 .cse37) .cse38)) (.cse21 (select (select .cse34 .cse37) .cse38))) (let ((.cse29 (select .cse36 .cse21)) (.cse27 (+ .cse22 4))) (let ((.cse28 (select .cse34 .cse21)) (.cse30 (let ((.cse35 (store .cse36 .cse21 (store .cse29 .cse27 0)))) (store .cse35 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse35 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse22))))) (let ((.cse20 (select (select .cse30 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse23 (let ((.cse33 (store .cse34 .cse21 (store .cse28 .cse27 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|)))) (store .cse33 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse33 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse21))))) (let ((.cse31 (select (select .cse23 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse32 (+ 4 .cse20))) (let ((.cse26 (select (select .cse30 .cse31) .cse32))) (let ((.cse24 (select (select .cse23 .cse31) .cse32)) (.cse25 (+ 4 .cse26))) (or (< .cse20 0) (not (< |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 0)) (< (select (store |c_#length| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8217) .cse21) (+ .cse22 8)) (= (select (select .cse23 .cse24) .cse25) .cse24) (not (= |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| .cse24)) (not (= 8 .cse26)) (< .cse27 0) (not (= (select .cse28 .cse27) 0)) (not (= (select .cse29 .cse27) 0)) (= .cse27 (select (select .cse30 .cse24) .cse25)))))))))))))) (or .cse39 (forall ((|v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| Int) (v_ArrVal_8218 (Array Int Int)) (v_ArrVal_8219 (Array Int Int)) (v_ArrVal_8217 Int)) (let ((.cse57 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8218)) (.cse55 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8219))) (let ((.cse58 (select (select .cse55 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse59 (+ (select (select .cse57 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (let ((.cse47 (select (select .cse57 .cse58) .cse59)) (.cse44 (select (select .cse55 .cse58) .cse59))) (let ((.cse50 (select .cse57 .cse44)) (.cse40 (+ .cse47 4))) (let ((.cse49 (select .cse55 .cse44)) (.cse51 (let ((.cse56 (store .cse57 .cse44 (store .cse50 .cse40 0)))) (store .cse56 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse56 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse47))))) (let ((.cse45 (select (select .cse51 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse41 (let ((.cse54 (store .cse55 .cse44 (store .cse49 .cse40 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|)))) (store .cse54 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse54 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse44))))) (let ((.cse52 (select (select .cse41 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse53 (+ 4 .cse45))) (let ((.cse46 (select (select .cse51 .cse52) .cse53))) (let ((.cse42 (select (select .cse41 .cse52) .cse53)) (.cse43 (+ 4 .cse46))) (let ((.cse48 (select (select .cse51 .cse42) .cse43))) (or (not (<= 0 .cse40)) (not (< |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| |c_#StackHeapBarrier|)) (not (= (select (select .cse41 .cse42) .cse43) .cse44)) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 0)) (not (<= 0 .cse45)) (= 8 .cse46) (not (<= (+ .cse47 8) (select (store |c_#length| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8217) .cse44))) (not (<= 0 .cse46)) (= .cse48 .cse46) (not (= (select .cse49 .cse40) 0)) (not (= .cse40 .cse48)) (not (= (select .cse50 .cse40) 0))))))))))))))) (forall ((|v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| Int)) (or (not (< |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 0)) (forall ((v_ArrVal_8218 (Array Int Int)) (v_ArrVal_8219 (Array Int Int)) (v_ArrVal_8217 Int)) (let ((.cse75 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8218)) (.cse73 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8219))) (let ((.cse76 (select (select .cse73 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse77 (+ (select (select .cse75 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (let ((.cse63 (select (select .cse75 .cse76) .cse77)) (.cse64 (select (select .cse73 .cse76) .cse77))) (let ((.cse67 (select .cse75 .cse64)) (.cse60 (+ .cse63 4))) (let ((.cse66 (select .cse73 .cse64)) (.cse68 (let ((.cse74 (store .cse75 .cse64 (store .cse67 .cse60 0)))) (store .cse74 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse74 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse63))))) (let ((.cse61 (select (select .cse68 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse69 (let ((.cse72 (store .cse73 .cse64 (store .cse66 .cse60 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|)))) (store .cse72 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse72 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse64))))) (let ((.cse70 (select (select .cse69 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse71 (+ 4 .cse61))) (let ((.cse62 (select (select .cse68 .cse70) .cse71))) (let ((.cse65 (select (select .cse68 (select (select .cse69 .cse70) .cse71)) (+ 4 .cse62)))) (or (not (<= 0 .cse60)) (not (<= 0 .cse61)) (= 8 .cse62) (not (<= (+ .cse63 8) (select (store |c_#length| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8217) .cse64))) (= .cse65 0) (not (<= 0 .cse62)) (= .cse65 .cse62) (not (= (select .cse66 .cse60) 0)) (not (= (select .cse67 .cse60) 0)) (= 0 .cse62)))))))))))))) (forall ((|v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| Int)) (or (not (< |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 0)) (forall ((v_ArrVal_8218 (Array Int Int)) (v_ArrVal_8219 (Array Int Int)) (v_ArrVal_8217 Int)) (let ((.cse94 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8218)) (.cse92 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8219))) (let ((.cse95 (select (select .cse92 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse96 (+ (select (select .cse94 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (let ((.cse80 (select (select .cse94 .cse95) .cse96)) (.cse79 (select (select .cse92 .cse95) .cse96))) (let ((.cse86 (select .cse94 .cse79)) (.cse83 (+ .cse80 4))) (let ((.cse85 (select .cse92 .cse79)) (.cse87 (let ((.cse93 (store .cse94 .cse79 (store .cse86 .cse83 0)))) (store .cse93 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse93 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse80))))) (let ((.cse78 (select (select .cse87 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse90 (let ((.cse91 (store .cse92 .cse79 (store .cse85 .cse83 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|)))) (store .cse91 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse91 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse79))))) (let ((.cse88 (select (select .cse90 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse89 (+ 4 .cse78))) (let ((.cse81 (select (select .cse90 .cse88) .cse89)) (.cse82 (select (select .cse87 .cse88) .cse89))) (let ((.cse84 (select (select .cse87 .cse81) (+ 4 .cse82)))) (or (< .cse78 0) (< (select (store |c_#length| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8217) .cse79) (+ .cse80 8)) (not (= |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| .cse81)) (not (= 8 .cse82)) (< .cse83 0) (= .cse84 0) (= .cse84 .cse82) (not (= (select .cse85 .cse83) 0)) (not (= (select .cse86 .cse83) 0)) (= .cse83 .cse84)))))))))))))) (or .cse19 (forall ((|v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| Int) (v_ArrVal_8218 (Array Int Int)) (v_ArrVal_8219 (Array Int Int)) (v_ArrVal_8217 Int)) (let ((.cse113 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8218)) (.cse111 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8219))) (let ((.cse114 (select (select .cse111 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse115 (+ (select (select .cse113 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (let ((.cse99 (select (select .cse113 .cse114) .cse115)) (.cse98 (select (select .cse111 .cse114) .cse115))) (let ((.cse107 (select .cse113 .cse98)) (.cse104 (+ .cse99 4))) (let ((.cse106 (select .cse111 .cse98)) (.cse105 (let ((.cse112 (store .cse113 .cse98 (store .cse107 .cse104 0)))) (store .cse112 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse112 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse99))))) (let ((.cse97 (select (select .cse105 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse102 (let ((.cse110 (store .cse111 .cse98 (store .cse106 .cse104 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|)))) (store .cse110 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse110 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse98))))) (let ((.cse108 (select (select .cse102 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse109 (+ 4 .cse97))) (let ((.cse101 (select (select .cse105 .cse108) .cse109))) (let ((.cse100 (select (select .cse102 .cse108) .cse109)) (.cse103 (+ 4 .cse101))) (or (< .cse97 0) (not (< |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 0)) (< (select (store |c_#length| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8217) .cse98) (+ .cse99 8)) (not (= |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| .cse100)) (not (= 8 .cse101)) (= (select (select .cse102 .cse100) .cse103) .cse98) (< .cse104 0) (= (select (select .cse105 .cse100) .cse103) .cse101) (not (= (select .cse106 .cse104) 0)) (not (= (select .cse107 .cse104) 0)))))))))))))) (forall ((|v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| Int)) (or (not (< |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 0)) (forall ((v_ArrVal_8218 (Array Int Int)) (v_ArrVal_8219 (Array Int Int)) (v_ArrVal_8217 Int)) (let ((.cse133 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8218)) (.cse131 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8219))) (let ((.cse134 (select (select .cse131 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse135 (+ (select (select .cse133 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (let ((.cse118 (select (select .cse133 .cse134) .cse135)) (.cse117 (select (select .cse131 .cse134) .cse135))) (let ((.cse126 (select .cse133 .cse117)) (.cse123 (+ .cse118 4))) (let ((.cse125 (select .cse131 .cse117)) (.cse127 (let ((.cse132 (store .cse133 .cse117 (store .cse126 .cse123 0)))) (store .cse132 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse132 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse118))))) (let ((.cse116 (select (select .cse127 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse119 (let ((.cse130 (store .cse131 .cse117 (store .cse125 .cse123 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|)))) (store .cse130 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse130 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse117))))) (let ((.cse128 (select (select .cse119 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse129 (+ 4 .cse116))) (let ((.cse122 (select (select .cse127 .cse128) .cse129))) (let ((.cse120 (select (select .cse119 .cse128) .cse129)) (.cse121 (+ 4 .cse122))) (let ((.cse124 (select (select .cse127 .cse120) .cse121))) (or (< .cse116 0) (< (select (store |c_#length| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8217) .cse117) (+ .cse118 8)) (= (select (select .cse119 .cse120) .cse121) .cse120) (not (= |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| .cse120)) (not (= 8 .cse122)) (< .cse123 0) (= .cse124 0) (not (= (select .cse125 .cse123) 0)) (not (= (select .cse126 .cse123) 0)) (= .cse123 .cse124))))))))))))))) (or .cse19 (and (forall ((|v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| Int)) (or (not (< |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 0)) (forall ((v_ArrVal_8218 (Array Int Int)) (v_ArrVal_8219 (Array Int Int)) (v_ArrVal_8217 Int)) (let ((.cse151 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8218)) (.cse149 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8219))) (let ((.cse152 (select (select .cse149 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse153 (+ (select (select .cse151 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (let ((.cse142 (select (select .cse151 .cse152) .cse153)) (.cse141 (select (select .cse149 .cse152) .cse153))) (let ((.cse144 (select .cse151 .cse141)) (.cse136 (+ .cse142 4))) (let ((.cse143 (select .cse149 .cse141)) (.cse147 (let ((.cse150 (store .cse151 .cse141 (store .cse144 .cse136 0)))) (store .cse150 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse150 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse142))))) (let ((.cse140 (select (select .cse147 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse138 (let ((.cse148 (store .cse149 .cse141 (store .cse143 .cse136 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|)))) (store .cse148 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse148 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse141))))) (let ((.cse145 (select (select .cse138 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse146 (+ 4 .cse140))) (let ((.cse137 (select (select .cse147 .cse145) .cse146)) (.cse139 (select (select .cse138 .cse145) .cse146))) (or (not (<= 0 .cse136)) (not (= .cse136 .cse137)) (= (select (select .cse138 .cse139) (+ 4 .cse137)) .cse139) (not (<= 0 .cse140)) (= 8 .cse137) (not (= .cse141 .cse139)) (not (<= (+ .cse142 8) (select (store |c_#length| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8217) .cse141))) (not (= (select .cse143 .cse136) 0)) (not (= (select .cse144 .cse136) 0)))))))))))))) (forall ((|v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| Int)) (or (not (< |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 0)) (forall ((v_ArrVal_8218 (Array Int Int)) (v_ArrVal_8219 (Array Int Int)) (v_ArrVal_8217 Int)) (let ((.cse169 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8218)) (.cse167 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8219))) (let ((.cse170 (select (select .cse167 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse171 (+ (select (select .cse169 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (let ((.cse160 (select (select .cse169 .cse170) .cse171)) (.cse159 (select (select .cse167 .cse170) .cse171))) (let ((.cse162 (select .cse169 .cse159)) (.cse154 (+ .cse160 4))) (let ((.cse161 (select .cse167 .cse159)) (.cse165 (let ((.cse168 (store .cse169 .cse159 (store .cse162 .cse154 0)))) (store .cse168 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse168 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse160))))) (let ((.cse158 (select (select .cse165 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse156 (let ((.cse166 (store .cse167 .cse159 (store .cse161 .cse154 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|)))) (store .cse166 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse166 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse159))))) (let ((.cse163 (select (select .cse156 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse164 (+ 4 .cse158))) (let ((.cse155 (select (select .cse165 .cse163) .cse164)) (.cse157 (select (select .cse156 .cse163) .cse164))) (or (not (<= 0 .cse154)) (not (= .cse154 .cse155)) (= (select (select .cse156 .cse157) (+ 4 .cse155)) .cse157) (not (<= 0 .cse158)) (not (= .cse159 .cse157)) (not (<= (+ .cse160 8) (select (store |c_#length| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8217) .cse159))) (not (= (select .cse161 .cse154) 0)) (not (= (select .cse162 .cse154) 0)) (= |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| .cse157))))))))))))))) (forall ((|v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| Int)) (or (not (< |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 0)) (forall ((v_ArrVal_8218 (Array Int Int)) (v_ArrVal_8219 (Array Int Int)) (v_ArrVal_8217 Int)) (let ((.cse188 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8218)) (.cse186 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8219))) (let ((.cse189 (select (select .cse186 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse190 (+ (select (select .cse188 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (let ((.cse178 (select (select .cse188 .cse189) .cse190)) (.cse179 (select (select .cse186 .cse189) .cse190))) (let ((.cse182 (select .cse188 .cse179)) (.cse172 (+ .cse178 4))) (let ((.cse181 (select .cse186 .cse179)) (.cse180 (let ((.cse187 (store .cse188 .cse179 (store .cse182 .cse172 0)))) (store .cse187 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse187 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse178))))) (let ((.cse176 (select (select .cse180 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse173 (let ((.cse185 (store .cse186 .cse179 (store .cse181 .cse172 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|)))) (store .cse185 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse185 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse179))))) (let ((.cse183 (select (select .cse173 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse184 (+ 4 .cse176))) (let ((.cse177 (select (select .cse180 .cse183) .cse184))) (let ((.cse174 (select (select .cse173 .cse183) .cse184)) (.cse175 (+ 4 .cse177))) (or (not (<= 0 .cse172)) (= (select (select .cse173 .cse174) .cse175) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) (not (<= 0 .cse176)) (= 8 .cse177) (not (<= (+ .cse178 8) (select (store |c_#length| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8217) .cse179))) (not (<= 0 .cse177)) (= (select (select .cse180 .cse174) .cse175) .cse177) (not (= (select .cse181 .cse172) 0)) (not (= (select .cse182 .cse172) 0)) (= 0 .cse177)))))))))))))) (forall ((|v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| Int)) (or (not (< |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 0)) (forall ((v_ArrVal_8218 (Array Int Int)) (v_ArrVal_8219 (Array Int Int)) (v_ArrVal_8217 Int)) (let ((.cse208 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8218)) (.cse206 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8219))) (let ((.cse209 (select (select .cse206 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse210 (+ (select (select .cse208 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (let ((.cse193 (select (select .cse208 .cse209) .cse210)) (.cse192 (select (select .cse206 .cse209) .cse210))) (let ((.cse201 (select .cse208 .cse192)) (.cse198 (+ .cse193 4))) (let ((.cse200 (select .cse206 .cse192)) (.cse202 (let ((.cse207 (store .cse208 .cse192 (store .cse201 .cse198 0)))) (store .cse207 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse207 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse193))))) (let ((.cse191 (select (select .cse202 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse196 (let ((.cse205 (store .cse206 .cse192 (store .cse200 .cse198 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|)))) (store .cse205 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse205 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse192))))) (let ((.cse203 (select (select .cse196 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse204 (+ 4 .cse191))) (let ((.cse195 (select (select .cse202 .cse203) .cse204))) (let ((.cse194 (select (select .cse196 .cse203) .cse204)) (.cse197 (+ 4 .cse195))) (let ((.cse199 (select (select .cse202 .cse194) .cse197))) (or (< .cse191 0) (< (select (store |c_#length| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8217) .cse192) (+ .cse193 8)) (not (= |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| .cse194)) (not (= 8 .cse195)) (= (select (select .cse196 .cse194) .cse197) .cse192) (< .cse198 0) (= .cse199 0) (= .cse199 .cse195) (not (= (select .cse200 .cse198) 0)) (not (= (select .cse201 .cse198) 0)))))))))))))))) (forall ((|v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| Int)) (or (not (< |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 0)) (forall ((v_ArrVal_8218 (Array Int Int)) (v_ArrVal_8219 (Array Int Int)) (v_ArrVal_8217 Int)) (let ((.cse228 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8218)) (.cse226 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8219))) (let ((.cse229 (select (select .cse226 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse230 (+ (select (select .cse228 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (let ((.cse218 (select (select .cse228 .cse229) .cse230)) (.cse215 (select (select .cse226 .cse229) .cse230))) (let ((.cse221 (select .cse228 .cse215)) (.cse211 (+ .cse218 4))) (let ((.cse220 (select .cse226 .cse215)) (.cse222 (let ((.cse227 (store .cse228 .cse215 (store .cse221 .cse211 0)))) (store .cse227 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse227 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse218))))) (let ((.cse216 (select (select .cse222 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse212 (let ((.cse225 (store .cse226 .cse215 (store .cse220 .cse211 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|)))) (store .cse225 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse225 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse215))))) (let ((.cse223 (select (select .cse212 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse224 (+ 4 .cse216))) (let ((.cse217 (select (select .cse222 .cse223) .cse224))) (let ((.cse213 (select (select .cse212 .cse223) .cse224)) (.cse214 (+ 4 .cse217))) (let ((.cse219 (select (select .cse222 .cse213) .cse214))) (or (not (<= 0 .cse211)) (not (= (select (select .cse212 .cse213) .cse214) .cse215)) (not (<= 0 .cse216)) (= 8 .cse217) (not (<= (+ .cse218 8) (select (store |c_#length| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8217) .cse215))) (not (<= 0 .cse217)) (= .cse219 .cse217) (not (= (select .cse220 .cse211) 0)) (not (= .cse211 .cse219)) (not (= (select .cse221 .cse211) 0)) (= |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| .cse213))))))))))))))) (forall ((|v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| Int)) (or (not (< |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 0)) (forall ((v_ArrVal_8218 (Array Int Int)) (v_ArrVal_8219 (Array Int Int)) (v_ArrVal_8217 Int)) (let ((.cse247 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8218)) (.cse245 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8219))) (let ((.cse248 (select (select .cse245 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse249 (+ (select (select .cse247 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (let ((.cse236 (select (select .cse247 .cse248) .cse249)) (.cse235 (select (select .cse245 .cse248) .cse249))) (let ((.cse240 (select .cse247 .cse235)) (.cse238 (+ .cse236 4))) (let ((.cse239 (select .cse245 .cse235)) (.cse241 (let ((.cse246 (store .cse247 .cse235 (store .cse240 .cse238 0)))) (store .cse246 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse246 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse236))))) (let ((.cse231 (select (select .cse241 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse232 (let ((.cse244 (store .cse245 .cse235 (store .cse239 .cse238 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|)))) (store .cse244 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse244 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse235))))) (let ((.cse242 (select (select .cse232 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse243 (+ 4 .cse231))) (let ((.cse237 (select (select .cse241 .cse242) .cse243))) (let ((.cse233 (select (select .cse232 .cse242) .cse243)) (.cse234 (+ 4 .cse237))) (or (< .cse231 0) (= (select (select .cse232 .cse233) .cse234) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) (< (select (store |c_#length| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8217) .cse235) (+ .cse236 8)) (not (= |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| .cse233)) (not (= 8 .cse237)) (< .cse238 0) (not (= (select .cse239 .cse238) 0)) (not (= (select .cse240 .cse238) 0)) (= .cse238 (select (select .cse241 .cse233) .cse234))))))))))))))) (forall ((|v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| Int)) (or (not (< |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 0)) (forall ((v_ArrVal_8218 (Array Int Int)) (v_ArrVal_8219 (Array Int Int)) (v_ArrVal_8217 Int)) (let ((.cse267 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8218)) (.cse265 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8219))) (let ((.cse268 (select (select .cse265 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse269 (+ (select (select .cse267 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (let ((.cse257 (select (select .cse267 .cse268) .cse269)) (.cse254 (select (select .cse265 .cse268) .cse269))) (let ((.cse260 (select .cse267 .cse254)) (.cse250 (+ .cse257 4))) (let ((.cse259 (select .cse265 .cse254)) (.cse261 (let ((.cse266 (store .cse267 .cse254 (store .cse260 .cse250 0)))) (store .cse266 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse266 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse257))))) (let ((.cse255 (select (select .cse261 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse251 (let ((.cse264 (store .cse265 .cse254 (store .cse259 .cse250 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|)))) (store .cse264 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse264 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse254))))) (let ((.cse262 (select (select .cse251 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse263 (+ 4 .cse255))) (let ((.cse256 (select (select .cse261 .cse262) .cse263))) (let ((.cse252 (select (select .cse251 .cse262) .cse263)) (.cse253 (+ 4 .cse256))) (let ((.cse258 (select (select .cse261 .cse252) .cse253))) (or (not (<= 0 .cse250)) (not (= (select (select .cse251 .cse252) .cse253) .cse254)) (not (<= 0 .cse255)) (= 8 .cse256) (not (<= (+ .cse257 8) (select (store |c_#length| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8217) .cse254))) (not (<= 0 .cse256)) (= .cse258 .cse256) (not (= (select .cse259 .cse250) 0)) (not (= .cse250 .cse258)) (not (= (select .cse260 .cse250) 0)) (= 0 .cse256))))))))))))))) (forall ((|v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| Int)) (or (not (< |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 0)) (forall ((v_ArrVal_8218 (Array Int Int)) (v_ArrVal_8219 (Array Int Int)) (v_ArrVal_8217 Int)) (let ((.cse287 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8218)) (.cse285 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8219))) (let ((.cse288 (select (select .cse285 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse289 (+ (select (select .cse287 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (let ((.cse276 (select (select .cse287 .cse288) .cse289)) (.cse274 (select (select .cse285 .cse288) .cse289))) (let ((.cse280 (select .cse287 .cse274)) (.cse270 (+ .cse276 4))) (let ((.cse279 (select .cse285 .cse274)) (.cse281 (let ((.cse286 (store .cse287 .cse274 (store .cse280 .cse270 0)))) (store .cse286 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse286 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse276))))) (let ((.cse275 (select (select .cse281 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse271 (let ((.cse284 (store .cse285 .cse274 (store .cse279 .cse270 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|)))) (store .cse284 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse284 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse274))))) (let ((.cse282 (select (select .cse271 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse283 (+ 4 .cse275))) (let ((.cse277 (select (select .cse281 .cse282) .cse283))) (let ((.cse272 (select (select .cse271 .cse282) .cse283)) (.cse273 (+ 4 .cse277))) (let ((.cse278 (select (select .cse281 .cse272) .cse273))) (or (not (<= 0 .cse270)) (not (= (select (select .cse271 .cse272) .cse273) .cse274)) (not (<= 0 .cse275)) (not (<= (+ .cse276 8) (select (store |c_#length| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8217) .cse274))) (not (<= 0 .cse277)) (= .cse278 .cse277) (not (= (select .cse279 .cse270) 0)) (not (= .cse270 .cse278)) (not (= (select .cse280 .cse270) 0)) (= |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| .cse272))))))))))))))) (forall ((|v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| Int)) (or (not (< |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 0)) (forall ((v_ArrVal_8218 (Array Int Int)) (v_ArrVal_8219 (Array Int Int)) (v_ArrVal_8217 Int)) (let ((.cse306 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8218)) (.cse304 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8219))) (let ((.cse307 (select (select .cse304 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse308 (+ (select (select .cse306 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (let ((.cse297 (select (select .cse306 .cse307) .cse308)) (.cse296 (select (select .cse304 .cse307) .cse308))) (let ((.cse300 (select .cse306 .cse296)) (.cse290 (+ .cse297 4))) (let ((.cse299 (select .cse304 .cse296)) (.cse298 (let ((.cse305 (store .cse306 .cse296 (store .cse300 .cse290 0)))) (store .cse305 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse305 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse297))))) (let ((.cse295 (select (select .cse298 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse292 (let ((.cse303 (store .cse304 .cse296 (store .cse299 .cse290 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|)))) (store .cse303 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse303 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse296))))) (let ((.cse301 (select (select .cse292 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse302 (+ 4 .cse295))) (let ((.cse291 (select (select .cse298 .cse301) .cse302))) (let ((.cse293 (select (select .cse292 .cse301) .cse302)) (.cse294 (+ 4 .cse291))) (or (not (<= 0 .cse290)) (not (= .cse290 .cse291)) (= (select (select .cse292 .cse293) .cse294) .cse293) (not (<= 0 .cse295)) (= 8 .cse291) (not (= .cse296 .cse293)) (not (<= (+ .cse297 8) (select (store |c_#length| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8217) .cse296))) (= (select (select .cse298 .cse293) .cse294) 0) (not (= (select .cse299 .cse290) 0)) (not (= (select .cse300 .cse290) 0))))))))))))))) (forall ((|v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| Int)) (or (not (< |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 0)) (forall ((v_ArrVal_8218 (Array Int Int)) (v_ArrVal_8219 (Array Int Int)) (v_ArrVal_8217 Int)) (let ((.cse325 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8218)) (.cse323 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8219))) (let ((.cse326 (select (select .cse323 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse327 (+ (select (select .cse325 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (let ((.cse314 (select (select .cse325 .cse326) .cse327)) (.cse315 (select (select .cse323 .cse326) .cse327))) (let ((.cse317 (select .cse325 .cse315)) (.cse309 (+ .cse314 4))) (let ((.cse316 (select .cse323 .cse315)) (.cse319 (let ((.cse324 (store .cse325 .cse315 (store .cse317 .cse309 0)))) (store .cse324 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse324 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse314))))) (let ((.cse312 (select (select .cse319 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse318 (let ((.cse322 (store .cse323 .cse315 (store .cse316 .cse309 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|)))) (store .cse322 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse322 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse315))))) (let ((.cse320 (select (select .cse318 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse321 (+ 4 .cse312))) (let ((.cse311 (select (select .cse318 .cse320) .cse321)) (.cse313 (select (select .cse319 .cse320) .cse321))) (let ((.cse310 (select (select .cse318 .cse311) (+ 4 .cse313)))) (or (not (<= 0 .cse309)) (= .cse310 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) (= .cse310 .cse311) (not (<= 0 .cse312)) (= 8 .cse313) (not (<= (+ .cse314 8) (select (store |c_#length| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8217) .cse315))) (not (<= 0 .cse313)) (not (= (select .cse316 .cse309) 0)) (not (= (select .cse317 .cse309) 0)) (= 0 .cse313)))))))))))))) (or .cse39 (forall ((|v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| Int) (v_ArrVal_8218 (Array Int Int)) (v_ArrVal_8219 (Array Int Int)) (v_ArrVal_8217 Int)) (let ((.cse344 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8218)) (.cse342 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8219))) (let ((.cse345 (select (select .cse342 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse346 (+ (select (select .cse344 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (let ((.cse334 (select (select .cse344 .cse345) .cse346)) (.cse335 (select (select .cse342 .cse345) .cse346))) (let ((.cse338 (select .cse344 .cse335)) (.cse328 (+ .cse334 4))) (let ((.cse337 (select .cse342 .cse335)) (.cse336 (let ((.cse343 (store .cse344 .cse335 (store .cse338 .cse328 0)))) (store .cse343 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse343 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse334))))) (let ((.cse332 (select (select .cse336 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse329 (let ((.cse341 (store .cse342 .cse335 (store .cse337 .cse328 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|)))) (store .cse341 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse341 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse335))))) (let ((.cse339 (select (select .cse329 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse340 (+ 4 .cse332))) (let ((.cse333 (select (select .cse336 .cse339) .cse340))) (let ((.cse330 (select (select .cse329 .cse339) .cse340)) (.cse331 (+ 4 .cse333))) (or (not (<= 0 .cse328)) (not (< |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| |c_#StackHeapBarrier|)) (= (select (select .cse329 .cse330) .cse331) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 0)) (not (<= 0 .cse332)) (= 8 .cse333) (not (<= (+ .cse334 8) (select (store |c_#length| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8217) .cse335))) (not (<= 0 .cse333)) (= (select (select .cse336 .cse330) .cse331) .cse333) (not (= (select .cse337 .cse328) 0)) (not (= (select .cse338 .cse328) 0)))))))))))))) (or .cse19 (and (forall ((|v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| Int)) (or (not (< |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 0)) (forall ((v_ArrVal_8218 (Array Int Int)) (v_ArrVal_8219 (Array Int Int)) (v_ArrVal_8217 Int)) (let ((.cse362 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8218)) (.cse360 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8219))) (let ((.cse363 (select (select .cse360 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse364 (+ (select (select .cse362 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (let ((.cse352 (select (select .cse362 .cse363) .cse364)) (.cse353 (select (select .cse360 .cse363) .cse364))) (let ((.cse355 (select .cse362 .cse353)) (.cse347 (+ .cse352 4))) (let ((.cse354 (select .cse360 .cse353)) (.cse356 (let ((.cse361 (store .cse362 .cse353 (store .cse355 .cse347 0)))) (store .cse361 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse361 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse352))))) (let ((.cse351 (select (select .cse356 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse348 (let ((.cse359 (store .cse360 .cse353 (store .cse354 .cse347 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|)))) (store .cse359 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse359 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse353))))) (let ((.cse357 (select (select .cse348 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse358 (+ 4 .cse351))) (let ((.cse349 (select (select .cse348 .cse357) .cse358)) (.cse350 (select (select .cse356 .cse357) .cse358))) (or (not (<= 0 .cse347)) (= (select (select .cse348 .cse349) (+ 4 .cse350)) .cse349) (not (<= 0 .cse351)) (not (<= (+ .cse352 8) (select (store |c_#length| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8217) .cse353))) (not (<= 0 .cse350)) (not (= (select .cse354 .cse347) 0)) (not (= (select .cse355 .cse347) 0)) (= |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| .cse349) (= 0 .cse350))))))))))))) (forall ((|v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| Int)) (or (not (< |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 0)) (forall ((v_ArrVal_8218 (Array Int Int)) (v_ArrVal_8219 (Array Int Int)) (v_ArrVal_8217 Int)) (let ((.cse380 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8218)) (.cse378 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8219))) (let ((.cse381 (select (select .cse378 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse382 (+ (select (select .cse380 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (let ((.cse372 (select (select .cse380 .cse381) .cse382)) (.cse373 (select (select .cse378 .cse381) .cse382))) (let ((.cse375 (select .cse380 .cse373)) (.cse365 (+ .cse372 4))) (let ((.cse374 (select .cse378 .cse373)) (.cse376 (let ((.cse379 (store .cse380 .cse373 (store .cse375 .cse365 0)))) (store .cse379 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse379 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse372))))) (let ((.cse371 (select (select .cse376 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse366 (let ((.cse377 (store .cse378 .cse373 (store .cse374 .cse365 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|)))) (store .cse377 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse377 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse373))))) (let ((.cse369 (select (select .cse366 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse370 (+ 4 .cse371))) (let ((.cse368 (select (select .cse376 .cse369) .cse370))) (or (not (<= 0 .cse365)) (let ((.cse367 (select (select .cse366 .cse369) .cse370))) (= (select (select .cse366 .cse367) (+ 4 .cse368)) .cse367)) (not (<= 0 .cse371)) (= 8 .cse368) (not (<= (+ .cse372 8) (select (store |c_#length| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8217) .cse373))) (not (<= 0 .cse368)) (not (= (select .cse374 .cse365) 0)) (not (= (select .cse375 .cse365) 0)) (= 0 .cse368))))))))))))) (forall ((|v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| Int)) (or (forall ((v_ArrVal_8218 (Array Int Int)) (v_ArrVal_8219 (Array Int Int)) (v_ArrVal_8217 Int)) (let ((.cse398 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8218)) (.cse396 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8219))) (let ((.cse399 (select (select .cse396 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse400 (+ (select (select .cse398 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (let ((.cse388 (select (select .cse398 .cse399) .cse400)) (.cse389 (select (select .cse396 .cse399) .cse400))) (let ((.cse391 (select .cse398 .cse389)) (.cse383 (+ .cse388 4))) (let ((.cse390 (select .cse396 .cse389)) (.cse394 (let ((.cse397 (store .cse398 .cse389 (store .cse391 .cse383 0)))) (store .cse397 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse397 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse388))))) (let ((.cse387 (select (select .cse394 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse384 (let ((.cse395 (store .cse396 .cse389 (store .cse390 .cse383 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|)))) (store .cse395 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse395 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse389))))) (let ((.cse392 (select (select .cse384 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse393 (+ 4 .cse387))) (let ((.cse386 (select (select .cse394 .cse392) .cse393)) (.cse385 (select (select .cse384 .cse392) .cse393))) (or (not (<= 0 .cse383)) (= (select (select .cse384 .cse385) (+ 4 .cse386)) .cse385) (not (<= 0 .cse387)) (not (<= (+ .cse388 8) (select (store |c_#length| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8217) .cse389))) (not (<= 0 .cse386)) (not (= (select .cse390 .cse383) 0)) (not (= (select .cse391 .cse383) 0)) (= |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| .cse385))))))))))) (not (< |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 0)))))) (forall ((|v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| Int)) (or (not (< |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 0)) (forall ((v_ArrVal_8218 (Array Int Int)) (v_ArrVal_8219 (Array Int Int)) (v_ArrVal_8217 Int)) (let ((.cse418 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8218)) (.cse416 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8219))) (let ((.cse419 (select (select .cse416 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse420 (+ (select (select .cse418 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (let ((.cse406 (select (select .cse418 .cse419) .cse420)) (.cse403 (select (select .cse416 .cse419) .cse420))) (let ((.cse411 (select .cse418 .cse403)) (.cse401 (+ .cse406 4))) (let ((.cse408 (select .cse416 .cse403)) (.cse409 (let ((.cse417 (store .cse418 .cse403 (store .cse411 .cse401 0)))) (store .cse417 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse417 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse406))))) (let ((.cse405 (select (select .cse409 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse412 (let ((.cse415 (store .cse416 .cse403 (store .cse408 .cse401 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|)))) (store .cse415 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse415 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse403))))) (let ((.cse413 (select (select .cse412 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse414 (+ 4 .cse405))) (let ((.cse407 (select (select .cse409 .cse413) .cse414))) (let ((.cse404 (select (select .cse412 .cse413) .cse414)) (.cse410 (+ 4 .cse407))) (let ((.cse402 (select (select .cse412 .cse404) .cse410))) (or (not (<= 0 .cse401)) (not (= .cse402 .cse403)) (= .cse402 .cse404) (not (<= 0 .cse405)) (not (<= (+ .cse406 8) (select (store |c_#length| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8217) .cse403))) (not (<= 0 .cse407)) (not (= (select .cse408 .cse401) 0)) (not (= .cse401 (select (select .cse409 .cse404) .cse410))) (not (= (select .cse411 .cse401) 0)) (= |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| .cse404))))))))))))))) (or .cse39 (forall ((|v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| Int) (v_ArrVal_8218 (Array Int Int)) (v_ArrVal_8219 (Array Int Int)) (v_ArrVal_8217 Int)) (let ((.cse437 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8218)) (.cse435 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8219))) (let ((.cse438 (select (select .cse435 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse439 (+ (select (select .cse437 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (let ((.cse427 (select (select .cse437 .cse438) .cse439)) (.cse428 (select (select .cse435 .cse438) .cse439))) (let ((.cse431 (select .cse437 .cse428)) (.cse421 (+ .cse427 4))) (let ((.cse430 (select .cse435 .cse428)) (.cse429 (let ((.cse436 (store .cse437 .cse428 (store .cse431 .cse421 0)))) (store .cse436 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse436 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse427))))) (let ((.cse425 (select (select .cse429 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse422 (let ((.cse434 (store .cse435 .cse428 (store .cse430 .cse421 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|)))) (store .cse434 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse434 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse428))))) (let ((.cse432 (select (select .cse422 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse433 (+ 4 .cse425))) (let ((.cse426 (select (select .cse429 .cse432) .cse433))) (let ((.cse423 (select (select .cse422 .cse432) .cse433)) (.cse424 (+ 4 .cse426))) (or (not (<= 0 .cse421)) (not (< |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 0)) (= (select (select .cse422 .cse423) .cse424) .cse423) (not (<= 0 .cse425)) (= 8 .cse426) (not (<= (+ .cse427 8) (select (store |c_#length| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8217) .cse428))) (= (select (select .cse429 .cse423) .cse424) 0) (not (<= 0 .cse426)) (not (= (select .cse430 .cse421) 0)) (not (= (select .cse431 .cse421) 0)))))))))))))) (forall ((|v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| Int)) (or (forall ((v_ArrVal_8218 (Array Int Int)) (v_ArrVal_8219 (Array Int Int)) (v_ArrVal_8217 Int)) (let ((.cse456 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8218)) (.cse454 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8219))) (let ((.cse457 (select (select .cse454 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse458 (+ (select (select .cse456 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (let ((.cse445 (select (select .cse456 .cse457) .cse458)) (.cse446 (select (select .cse454 .cse457) .cse458))) (let ((.cse450 (select .cse456 .cse446)) (.cse440 (+ .cse445 4))) (let ((.cse449 (select .cse454 .cse446)) (.cse448 (let ((.cse455 (store .cse456 .cse446 (store .cse450 .cse440 0)))) (store .cse455 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse455 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse445))))) (let ((.cse444 (select (select .cse448 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse441 (let ((.cse453 (store .cse454 .cse446 (store .cse449 .cse440 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|)))) (store .cse453 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse453 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse446))))) (let ((.cse451 (select (select .cse441 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse452 (+ 4 .cse444))) (let ((.cse447 (select (select .cse448 .cse451) .cse452))) (let ((.cse443 (+ 4 .cse447)) (.cse442 (select (select .cse441 .cse451) .cse452))) (or (not (<= 0 .cse440)) (= (select (select .cse441 .cse442) .cse443) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) (not (<= 0 .cse444)) (not (<= (+ .cse445 8) (select (store |c_#length| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8217) .cse446))) (not (<= 0 .cse447)) (= (select (select .cse448 .cse442) .cse443) .cse447) (not (= (select .cse449 .cse440) 0)) (not (= (select .cse450 .cse440) 0)) (= |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| .cse442)))))))))))) (not (< |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 0)))) (or .cse19 (and (forall ((|v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| Int)) (or (not (< |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 0)) (forall ((v_ArrVal_8218 (Array Int Int)) (v_ArrVal_8219 (Array Int Int)) (v_ArrVal_8217 Int)) (let ((.cse474 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8218)) (.cse472 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8219))) (let ((.cse475 (select (select .cse472 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse476 (+ (select (select .cse474 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (let ((.cse461 (select (select .cse474 .cse475) .cse476)) (.cse462 (select (select .cse472 .cse475) .cse476))) (let ((.cse467 (select .cse474 .cse462)) (.cse459 (+ .cse461 4))) (let ((.cse466 (select .cse472 .cse462)) (.cse464 (let ((.cse473 (store .cse474 .cse462 (store .cse467 .cse459 0)))) (store .cse473 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse473 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse461))))) (let ((.cse460 (select (select .cse464 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse470 (let ((.cse471 (store .cse472 .cse462 (store .cse466 .cse459 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|)))) (store .cse471 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse471 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse462))))) (let ((.cse468 (select (select .cse470 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse469 (+ 4 .cse460))) (let ((.cse465 (select (select .cse470 .cse468) .cse469)) (.cse463 (select (select .cse464 .cse468) .cse469))) (or (not (<= 0 .cse459)) (not (<= 0 .cse460)) (not (<= (+ .cse461 8) (select (store |c_#length| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8217) .cse462))) (not (<= 0 .cse463)) (= (select (select .cse464 .cse465) (+ 4 .cse463)) .cse463) (not (= (select .cse466 .cse459) 0)) (not (= (select .cse467 .cse459) 0)) (= |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| .cse465) (= 0 .cse463))))))))))))) (forall ((|v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| Int)) (or (not (< |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 0)) (forall ((v_ArrVal_8218 (Array Int Int)) (v_ArrVal_8219 (Array Int Int)) (v_ArrVal_8217 Int)) (let ((.cse491 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8218)) (.cse489 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8219))) (let ((.cse492 (select (select .cse489 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse493 (+ (select (select .cse491 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (let ((.cse480 (select (select .cse491 .cse492) .cse493)) (.cse481 (select (select .cse489 .cse492) .cse493))) (let ((.cse487 (select .cse491 .cse481)) (.cse477 (+ .cse480 4))) (let ((.cse486 (select .cse489 .cse481)) (.cse482 (let ((.cse490 (store .cse491 .cse481 (store .cse487 .cse477 0)))) (store .cse490 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse490 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse480))))) (let ((.cse478 (select (select .cse482 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse483 (let ((.cse488 (store .cse489 .cse481 (store .cse486 .cse477 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|)))) (store .cse488 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse488 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse481))))) (let ((.cse484 (select (select .cse483 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse485 (+ 4 .cse478))) (let ((.cse479 (select (select .cse482 .cse484) .cse485))) (or (not (<= 0 .cse477)) (not (<= 0 .cse478)) (= 8 .cse479) (not (<= (+ .cse480 8) (select (store |c_#length| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8217) .cse481))) (not (<= 0 .cse479)) (= (select (select .cse482 (select (select .cse483 .cse484) .cse485)) (+ 4 .cse479)) .cse479) (not (= (select .cse486 .cse477) 0)) (not (= (select .cse487 .cse477) 0)) (= 0 .cse479))))))))))))) (forall ((|v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| Int)) (or (not (< |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 0)) (forall ((v_ArrVal_8218 (Array Int Int)) (v_ArrVal_8219 (Array Int Int)) (v_ArrVal_8217 Int)) (let ((.cse509 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8218)) (.cse507 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8219))) (let ((.cse510 (select (select .cse507 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse511 (+ (select (select .cse509 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (let ((.cse496 (select (select .cse509 .cse510) .cse511)) (.cse497 (select (select .cse507 .cse510) .cse511))) (let ((.cse502 (select .cse509 .cse497)) (.cse494 (+ .cse496 4))) (let ((.cse501 (select .cse507 .cse497)) (.cse499 (let ((.cse508 (store .cse509 .cse497 (store .cse502 .cse494 0)))) (store .cse508 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse508 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse496))))) (let ((.cse495 (select (select .cse499 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse503 (let ((.cse506 (store .cse507 .cse497 (store .cse501 .cse494 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|)))) (store .cse506 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse506 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse497))))) (let ((.cse504 (select (select .cse503 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse505 (+ 4 .cse495))) (let ((.cse498 (select (select .cse499 .cse504) .cse505)) (.cse500 (select (select .cse503 .cse504) .cse505))) (or (not (<= 0 .cse494)) (not (<= 0 .cse495)) (not (<= (+ .cse496 8) (select (store |c_#length| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8217) .cse497))) (not (<= 0 .cse498)) (= (select (select .cse499 .cse500) (+ 4 .cse498)) .cse498) (not (= (select .cse501 .cse494) 0)) (not (= (select .cse502 .cse494) 0)) (= |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| .cse500))))))))))))))) (or .cse19 (and (forall ((|v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| Int)) (or (not (< |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 0)) (forall ((v_ArrVal_8218 (Array Int Int)) (v_ArrVal_8219 (Array Int Int)) (v_ArrVal_8217 Int)) (let ((.cse527 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8218)) (.cse525 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8219))) (let ((.cse528 (select (select .cse525 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse529 (+ (select (select .cse527 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (let ((.cse517 (select (select .cse527 .cse528) .cse529)) (.cse515 (select (select .cse525 .cse528) .cse529))) (let ((.cse520 (select .cse527 .cse515)) (.cse512 (+ .cse517 4))) (let ((.cse519 (select .cse525 .cse515)) (.cse518 (let ((.cse526 (store .cse527 .cse515 (store .cse520 .cse512 0)))) (store .cse526 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse526 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse517))))) (let ((.cse514 (select (select .cse518 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse523 (let ((.cse524 (store .cse525 .cse515 (store .cse519 .cse512 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|)))) (store .cse524 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse524 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse515))))) (let ((.cse521 (select (select .cse523 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse522 (+ 4 .cse514))) (let ((.cse516 (select (select .cse523 .cse521) .cse522)) (.cse513 (select (select .cse518 .cse521) .cse522))) (or (not (<= 0 .cse512)) (not (= .cse512 .cse513)) (not (<= 0 .cse514)) (= 8 .cse513) (not (= .cse515 .cse516)) (not (<= (+ .cse517 8) (select (store |c_#length| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8217) .cse515))) (= (select (select .cse518 .cse516) (+ 4 .cse513)) .cse513) (not (= (select .cse519 .cse512) 0)) (not (= (select .cse520 .cse512) 0)))))))))))))) (forall ((|v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| Int)) (or (not (< |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 0)) (forall ((v_ArrVal_8218 (Array Int Int)) (v_ArrVal_8219 (Array Int Int)) (v_ArrVal_8217 Int)) (let ((.cse545 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8218)) (.cse543 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8219))) (let ((.cse546 (select (select .cse543 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse547 (+ (select (select .cse545 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (let ((.cse535 (select (select .cse545 .cse546) .cse547)) (.cse533 (select (select .cse543 .cse546) .cse547))) (let ((.cse538 (select .cse545 .cse533)) (.cse530 (+ .cse535 4))) (let ((.cse537 (select .cse543 .cse533)) (.cse536 (let ((.cse544 (store .cse545 .cse533 (store .cse538 .cse530 0)))) (store .cse544 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse544 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse535))))) (let ((.cse532 (select (select .cse536 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse539 (let ((.cse542 (store .cse543 .cse533 (store .cse537 .cse530 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|)))) (store .cse542 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse542 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse533))))) (let ((.cse540 (select (select .cse539 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse541 (+ 4 .cse532))) (let ((.cse531 (select (select .cse536 .cse540) .cse541)) (.cse534 (select (select .cse539 .cse540) .cse541))) (or (not (<= 0 .cse530)) (not (= .cse530 .cse531)) (not (<= 0 .cse532)) (not (= .cse533 .cse534)) (not (<= (+ .cse535 8) (select (store |c_#length| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8217) .cse533))) (= (select (select .cse536 .cse534) (+ 4 .cse531)) .cse531) (not (= (select .cse537 .cse530) 0)) (not (= (select .cse538 .cse530) 0)) (= |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| .cse534))))))))))))))) (forall ((|v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| Int)) (or (forall ((v_ArrVal_8218 (Array Int Int)) (v_ArrVal_8219 (Array Int Int)) (v_ArrVal_8217 Int)) (let ((.cse564 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8218)) (.cse562 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8219))) (let ((.cse565 (select (select .cse562 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse566 (+ (select (select .cse564 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (let ((.cse553 (select (select .cse564 .cse565) .cse566)) (.cse554 (select (select .cse562 .cse565) .cse566))) (let ((.cse556 (select .cse564 .cse554)) (.cse548 (+ .cse553 4))) (let ((.cse555 (select .cse562 .cse554)) (.cse558 (let ((.cse563 (store .cse564 .cse554 (store .cse556 .cse548 0)))) (store .cse563 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse563 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse553))))) (let ((.cse551 (select (select .cse558 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse557 (let ((.cse561 (store .cse562 .cse554 (store .cse555 .cse548 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|)))) (store .cse561 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse561 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse554))))) (let ((.cse559 (select (select .cse557 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse560 (+ 4 .cse551))) (let ((.cse550 (select (select .cse557 .cse559) .cse560)) (.cse552 (select (select .cse558 .cse559) .cse560))) (let ((.cse549 (select (select .cse557 .cse550) (+ 4 .cse552)))) (or (not (<= 0 .cse548)) (= .cse549 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) (= .cse549 .cse550) (not (<= 0 .cse551)) (= 8 .cse552) (not (<= (+ .cse553 8) (select (store |c_#length| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8217) .cse554))) (not (<= 0 .cse552)) (not (= (select .cse555 .cse548) 0)) (not (= (select .cse556 .cse548) 0)) (= |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| .cse550)))))))))))) (not (< |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 0)))) (forall ((|v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| Int)) (or (not (< |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_8218 (Array Int Int)) (v_ArrVal_8219 (Array Int Int)) (v_ArrVal_8217 Int)) (let ((.cse583 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8218)) (.cse581 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8219))) (let ((.cse584 (select (select .cse581 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse585 (+ (select (select .cse583 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (let ((.cse572 (select (select .cse583 .cse584) .cse585)) (.cse570 (select (select .cse581 .cse584) .cse585))) (let ((.cse575 (select .cse583 .cse570)) (.cse567 (+ .cse572 4))) (let ((.cse574 (select .cse581 .cse570)) (.cse576 (let ((.cse582 (store .cse583 .cse570 (store .cse575 .cse567 0)))) (store .cse582 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse582 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse572))))) (let ((.cse569 (select (select .cse576 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse579 (let ((.cse580 (store .cse581 .cse570 (store .cse574 .cse567 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|)))) (store .cse580 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse580 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse570))))) (let ((.cse577 (select (select .cse579 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse578 (+ 4 .cse569))) (let ((.cse571 (select (select .cse579 .cse577) .cse578)) (.cse568 (select (select .cse576 .cse577) .cse578))) (let ((.cse573 (select (select .cse576 .cse571) (+ 4 .cse568)))) (or (not (<= 0 .cse567)) (not (= .cse567 .cse568)) (not (<= 0 .cse569)) (not (= .cse570 .cse571)) (not (<= (+ .cse572 8) (select (store |c_#length| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8217) .cse570))) (= .cse573 0) (= .cse573 .cse568) (not (= (select .cse574 .cse567) 0)) (not (= (select .cse575 .cse567) 0)) (= |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| .cse571)))))))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 0)))) (or (forall ((|v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| Int) (v_ArrVal_8218 (Array Int Int)) (v_ArrVal_8219 (Array Int Int)) (v_ArrVal_8217 Int)) (let ((.cse602 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8218)) (.cse600 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8219))) (let ((.cse603 (select (select .cse600 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse604 (+ (select (select .cse602 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (let ((.cse588 (select (select .cse602 .cse603) .cse604)) (.cse587 (select (select .cse600 .cse603) .cse604))) (let ((.cse594 (select .cse602 .cse587)) (.cse591 (+ .cse588 4))) (let ((.cse593 (select .cse600 .cse587)) (.cse595 (let ((.cse601 (store .cse602 .cse587 (store .cse594 .cse591 0)))) (store .cse601 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse601 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse588))))) (let ((.cse586 (select (select .cse595 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse598 (let ((.cse599 (store .cse600 .cse587 (store .cse593 .cse591 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|)))) (store .cse599 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse599 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse587))))) (let ((.cse596 (select (select .cse598 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse597 (+ 4 .cse586))) (let ((.cse589 (select (select .cse598 .cse596) .cse597)) (.cse590 (select (select .cse595 .cse596) .cse597))) (let ((.cse592 (select (select .cse595 .cse589) (+ 4 .cse590)))) (or (< .cse586 0) (not (< |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 0)) (< (select (store |c_#length| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8217) .cse587) (+ .cse588 8)) (not (= |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| .cse589)) (not (= 8 .cse590)) (< .cse591 0) (= .cse592 .cse590) (not (= (select .cse593 .cse591) 0)) (not (= (select .cse594 .cse591) 0)) (= .cse591 .cse592)))))))))))) .cse19) (forall ((|v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| Int)) (or (not (< |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 0)) (forall ((v_ArrVal_8218 (Array Int Int)) (v_ArrVal_8219 (Array Int Int)) (v_ArrVal_8217 Int)) (let ((.cse622 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8218)) (.cse620 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8219))) (let ((.cse623 (select (select .cse620 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse624 (+ (select (select .cse622 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (let ((.cse611 (select (select .cse622 .cse623) .cse624)) (.cse607 (select (select .cse620 .cse623) .cse624))) (let ((.cse615 (select .cse622 .cse607)) (.cse605 (+ .cse611 4))) (let ((.cse612 (select .cse620 .cse607)) (.cse613 (let ((.cse621 (store .cse622 .cse607 (store .cse615 .cse605 0)))) (store .cse621 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse621 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse611))))) (let ((.cse609 (select (select .cse613 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse616 (let ((.cse619 (store .cse620 .cse607 (store .cse612 .cse605 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|)))) (store .cse619 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse619 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse607))))) (let ((.cse617 (select (select .cse616 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse618 (+ 4 .cse609))) (let ((.cse610 (select (select .cse613 .cse617) .cse618))) (let ((.cse608 (select (select .cse616 .cse617) .cse618)) (.cse614 (+ 4 .cse610))) (let ((.cse606 (select (select .cse616 .cse608) .cse614))) (or (not (<= 0 .cse605)) (not (= .cse606 .cse607)) (= .cse606 .cse608) (not (<= 0 .cse609)) (= 8 .cse610) (not (<= (+ .cse611 8) (select (store |c_#length| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8217) .cse607))) (not (<= 0 .cse610)) (not (= (select .cse612 .cse605) 0)) (not (= .cse605 (select (select .cse613 .cse608) .cse614))) (not (= (select .cse615 .cse605) 0)) (= |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| .cse608))))))))))))))) (forall ((|v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| Int)) (or (not (< |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 0)) (forall ((v_ArrVal_8218 (Array Int Int)) (v_ArrVal_8219 (Array Int Int)) (v_ArrVal_8217 Int)) (let ((.cse641 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8218)) (.cse639 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8219))) (let ((.cse642 (select (select .cse639 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse643 (+ (select (select .cse641 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (let ((.cse632 (select (select .cse641 .cse642) .cse643)) (.cse631 (select (select .cse639 .cse642) .cse643))) (let ((.cse635 (select .cse641 .cse631)) (.cse625 (+ .cse632 4))) (let ((.cse634 (select .cse639 .cse631)) (.cse633 (let ((.cse640 (store .cse641 .cse631 (store .cse635 .cse625 0)))) (store .cse640 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse640 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse632))))) (let ((.cse630 (select (select .cse633 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse627 (let ((.cse638 (store .cse639 .cse631 (store .cse634 .cse625 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|)))) (store .cse638 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse638 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse631))))) (let ((.cse636 (select (select .cse627 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse637 (+ 4 .cse630))) (let ((.cse626 (select (select .cse633 .cse636) .cse637))) (let ((.cse629 (+ 4 .cse626)) (.cse628 (select (select .cse627 .cse636) .cse637))) (or (not (<= 0 .cse625)) (not (= .cse625 .cse626)) (= (select (select .cse627 .cse628) .cse629) .cse628) (not (<= 0 .cse630)) (not (= .cse631 .cse628)) (not (<= (+ .cse632 8) (select (store |c_#length| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8217) .cse631))) (= (select (select .cse633 .cse628) .cse629) 0) (not (= (select .cse634 .cse625) 0)) (not (= (select .cse635 .cse625) 0)) (= |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| .cse628)))))))))))))) (forall ((|v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| Int)) (or (not (< |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 0)) (forall ((v_ArrVal_8218 (Array Int Int)) (v_ArrVal_8219 (Array Int Int)) (v_ArrVal_8217 Int)) (let ((.cse661 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8218)) (.cse659 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8219))) (let ((.cse662 (select (select .cse659 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse663 (+ (select (select .cse661 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (let ((.cse649 (select (select .cse661 .cse662) .cse663)) (.cse648 (select (select .cse659 .cse662) .cse663))) (let ((.cse654 (select .cse661 .cse648)) (.cse651 (+ .cse649 4))) (let ((.cse653 (select .cse659 .cse648)) (.cse655 (let ((.cse660 (store .cse661 .cse648 (store .cse654 .cse651 0)))) (store .cse660 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse660 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse649))))) (let ((.cse644 (select (select .cse655 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse645 (let ((.cse658 (store .cse659 .cse648 (store .cse653 .cse651 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|)))) (store .cse658 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse658 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse648))))) (let ((.cse656 (select (select .cse645 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse657 (+ 4 .cse644))) (let ((.cse650 (select (select .cse655 .cse656) .cse657))) (let ((.cse646 (select (select .cse645 .cse656) .cse657)) (.cse647 (+ 4 .cse650))) (let ((.cse652 (select (select .cse655 .cse646) .cse647))) (or (< .cse644 0) (not (= (select (select .cse645 .cse646) .cse647) .cse648)) (< (select (store |c_#length| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8217) .cse648) (+ .cse649 8)) (not (= |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| .cse646)) (not (= 8 .cse650)) (< .cse651 0) (= .cse652 .cse650) (not (= (select .cse653 .cse651) 0)) (not (= .cse651 .cse652)) (not (= (select .cse654 .cse651) 0)))))))))))))))) (forall ((|v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| Int)) (or (not (< |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 0)) (forall ((v_ArrVal_8218 (Array Int Int)) (v_ArrVal_8219 (Array Int Int)) (v_ArrVal_8217 Int)) (let ((.cse680 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8218)) (.cse678 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8219))) (let ((.cse681 (select (select .cse678 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse682 (+ (select (select .cse680 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (let ((.cse671 (select (select .cse680 .cse681) .cse682)) (.cse670 (select (select .cse678 .cse681) .cse682))) (let ((.cse674 (select .cse680 .cse670)) (.cse664 (+ .cse671 4))) (let ((.cse673 (select .cse678 .cse670)) (.cse672 (let ((.cse679 (store .cse680 .cse670 (store .cse674 .cse664 0)))) (store .cse679 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse679 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse671))))) (let ((.cse669 (select (select .cse672 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse665 (let ((.cse677 (store .cse678 .cse670 (store .cse673 .cse664 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|)))) (store .cse677 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse677 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse670))))) (let ((.cse675 (select (select .cse665 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse676 (+ 4 .cse669))) (let ((.cse668 (select (select .cse672 .cse675) .cse676))) (let ((.cse666 (select (select .cse665 .cse675) .cse676)) (.cse667 (+ 4 .cse668))) (or (not (<= 0 .cse664)) (= (select (select .cse665 .cse666) .cse667) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) (not (= .cse664 .cse668)) (not (<= 0 .cse669)) (= 8 .cse668) (not (= .cse670 .cse666)) (not (<= (+ .cse671 8) (select (store |c_#length| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8217) .cse670))) (= (select (select .cse672 .cse666) .cse667) .cse668) (not (= (select .cse673 .cse664) 0)) (not (= (select .cse674 .cse664) 0))))))))))))))) (forall ((|v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| Int)) (or (forall ((v_ArrVal_8218 (Array Int Int)) (v_ArrVal_8219 (Array Int Int)) (v_ArrVal_8217 Int)) (let ((.cse700 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8218)) (.cse698 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8219))) (let ((.cse701 (select (select .cse698 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse702 (+ (select (select .cse700 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (let ((.cse686 (select (select .cse700 .cse701) .cse702)) (.cse685 (select (select .cse698 .cse701) .cse702))) (let ((.cse693 (select .cse700 .cse685)) (.cse689 (+ .cse686 4))) (let ((.cse690 (select .cse698 .cse685)) (.cse691 (let ((.cse699 (store .cse700 .cse685 (store .cse693 .cse689 0)))) (store .cse699 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse699 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse686))))) (let ((.cse683 (select (select .cse691 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse694 (let ((.cse697 (store .cse698 .cse685 (store .cse690 .cse689 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|)))) (store .cse697 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse697 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse685))))) (let ((.cse695 (select (select .cse694 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse696 (+ 4 .cse683))) (let ((.cse688 (select (select .cse691 .cse695) .cse696))) (let ((.cse687 (select (select .cse694 .cse695) .cse696)) (.cse692 (+ 4 .cse688))) (let ((.cse684 (select (select .cse694 .cse687) .cse692))) (or (< .cse683 0) (not (= .cse684 .cse685)) (< (select (store |c_#length| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8217) .cse685) (+ .cse686 8)) (= .cse684 .cse687) (not (= |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| .cse687)) (not (= 8 .cse688)) (< .cse689 0) (not (= (select .cse690 .cse689) 0)) (not (= .cse689 (select (select .cse691 .cse687) .cse692))) (not (= (select .cse693 .cse689) 0)))))))))))))) (not (< |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 0)))) (forall ((|v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| Int)) (or (not (< |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 0)) (forall ((v_ArrVal_8218 (Array Int Int)) (v_ArrVal_8219 (Array Int Int)) (v_ArrVal_8217 Int)) (let ((.cse719 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8218)) (.cse717 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8219))) (let ((.cse720 (select (select .cse717 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse721 (+ (select (select .cse719 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (let ((.cse709 (select (select .cse719 .cse720) .cse721)) (.cse708 (select (select .cse717 .cse720) .cse721))) (let ((.cse711 (select .cse719 .cse708)) (.cse703 (+ .cse709 4))) (let ((.cse710 (select .cse717 .cse708)) (.cse713 (let ((.cse718 (store .cse719 .cse708 (store .cse711 .cse703 0)))) (store .cse718 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse718 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse709))))) (let ((.cse707 (select (select .cse713 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse712 (let ((.cse716 (store .cse717 .cse708 (store .cse710 .cse703 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|)))) (store .cse716 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse716 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse708))))) (let ((.cse714 (select (select .cse712 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse715 (+ 4 .cse707))) (let ((.cse706 (select (select .cse712 .cse714) .cse715)) (.cse705 (select (select .cse713 .cse714) .cse715))) (let ((.cse704 (select (select .cse712 .cse706) (+ 4 .cse705)))) (or (not (<= 0 .cse703)) (= .cse704 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) (not (= .cse703 .cse705)) (= .cse704 .cse706) (not (<= 0 .cse707)) (not (= .cse708 .cse706)) (not (<= (+ .cse709 8) (select (store |c_#length| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8217) .cse708))) (not (= (select .cse710 .cse703) 0)) (not (= (select .cse711 .cse703) 0)) (= |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| .cse706)))))))))))))) (forall ((|v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| Int)) (or (forall ((v_ArrVal_8218 (Array Int Int)) (v_ArrVal_8219 (Array Int Int)) (v_ArrVal_8217 Int)) (let ((.cse738 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8218)) (.cse736 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8219))) (let ((.cse739 (select (select .cse736 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse740 (+ (select (select .cse738 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (let ((.cse728 (select (select .cse738 .cse739) .cse740)) (.cse729 (select (select .cse736 .cse739) .cse740))) (let ((.cse732 (select .cse738 .cse729)) (.cse722 (+ .cse728 4))) (let ((.cse731 (select .cse736 .cse729)) (.cse730 (let ((.cse737 (store .cse738 .cse729 (store .cse732 .cse722 0)))) (store .cse737 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse737 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse728))))) (let ((.cse726 (select (select .cse730 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse723 (let ((.cse735 (store .cse736 .cse729 (store .cse731 .cse722 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|)))) (store .cse735 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse735 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse729))))) (let ((.cse733 (select (select .cse723 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse734 (+ 4 .cse726))) (let ((.cse727 (select (select .cse730 .cse733) .cse734))) (let ((.cse725 (+ 4 .cse727)) (.cse724 (select (select .cse723 .cse733) .cse734))) (or (not (<= 0 .cse722)) (= (select (select .cse723 .cse724) .cse725) .cse724) (not (<= 0 .cse726)) (= 8 .cse727) (not (<= (+ .cse728 8) (select (store |c_#length| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8217) .cse729))) (= (select (select .cse730 .cse724) .cse725) 0) (not (<= 0 .cse727)) (not (= (select .cse731 .cse722) 0)) (not (= (select .cse732 .cse722) 0)) (= |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| .cse724)))))))))))) (not (< |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 0)))) (forall ((|v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| Int)) (or (not (< |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 0)) (forall ((v_ArrVal_8218 (Array Int Int)) (v_ArrVal_8219 (Array Int Int)) (v_ArrVal_8217 Int)) (let ((.cse757 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8218)) (.cse755 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8219))) (let ((.cse758 (select (select .cse755 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse759 (+ (select (select .cse757 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (let ((.cse744 (select (select .cse757 .cse758) .cse759)) (.cse743 (select (select .cse755 .cse758) .cse759))) (let ((.cse749 (select .cse757 .cse743)) (.cse747 (+ .cse744 4))) (let ((.cse748 (select .cse755 .cse743)) (.cse751 (let ((.cse756 (store .cse757 .cse743 (store .cse749 .cse747 0)))) (store .cse756 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse756 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse744))))) (let ((.cse741 (select (select .cse751 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse750 (let ((.cse754 (store .cse755 .cse743 (store .cse748 .cse747 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|)))) (store .cse754 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse754 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse743))))) (let ((.cse752 (select (select .cse750 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse753 (+ 4 .cse741))) (let ((.cse745 (select (select .cse750 .cse752) .cse753)) (.cse746 (select (select .cse751 .cse752) .cse753))) (let ((.cse742 (select (select .cse750 .cse745) (+ 4 .cse746)))) (or (< .cse741 0) (= .cse742 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) (< (select (store |c_#length| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8217) .cse743) (+ .cse744 8)) (not (= |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| .cse745)) (not (= 8 .cse746)) (= .cse742 .cse743) (< .cse747 0) (not (= (select .cse748 .cse747) 0)) (not (= (select .cse749 .cse747) 0))))))))))))))) (forall ((|v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| Int)) (or (not (< |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 0)) (forall ((v_ArrVal_8218 (Array Int Int)) (v_ArrVal_8219 (Array Int Int)) (v_ArrVal_8217 Int)) (let ((.cse776 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8218)) (.cse774 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8219))) (let ((.cse777 (select (select .cse774 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse778 (+ (select (select .cse776 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (let ((.cse766 (select (select .cse776 .cse777) .cse778)) (.cse765 (select (select .cse774 .cse777) .cse778))) (let ((.cse768 (select .cse776 .cse765)) (.cse760 (+ .cse766 4))) (let ((.cse767 (select .cse774 .cse765)) (.cse770 (let ((.cse775 (store .cse776 .cse765 (store .cse768 .cse760 0)))) (store .cse775 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse775 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse766))))) (let ((.cse764 (select (select .cse770 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse769 (let ((.cse773 (store .cse774 .cse765 (store .cse767 .cse760 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|)))) (store .cse773 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse773 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse765))))) (let ((.cse771 (select (select .cse769 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse772 (+ 4 .cse764))) (let ((.cse763 (select (select .cse769 .cse771) .cse772)) (.cse762 (select (select .cse770 .cse771) .cse772))) (let ((.cse761 (select (select .cse769 .cse763) (+ 4 .cse762)))) (or (not (<= 0 .cse760)) (= .cse761 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) (not (= .cse760 .cse762)) (= .cse761 .cse763) (not (<= 0 .cse764)) (= 8 .cse762) (not (= .cse765 .cse763)) (not (<= (+ .cse766 8) (select (store |c_#length| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8217) .cse765))) (not (= (select .cse767 .cse760) 0)) (not (= (select .cse768 .cse760) 0))))))))))))))) (or .cse39 (forall ((|v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| Int) (v_ArrVal_8218 (Array Int Int)) (v_ArrVal_8219 (Array Int Int)) (v_ArrVal_8217 Int)) (let ((.cse795 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8218)) (.cse793 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8219))) (let ((.cse796 (select (select .cse793 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse797 (+ (select (select .cse795 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (let ((.cse784 (select (select .cse795 .cse796) .cse797)) (.cse785 (select (select .cse793 .cse796) .cse797))) (let ((.cse787 (select .cse795 .cse785)) (.cse779 (+ .cse784 4))) (let ((.cse786 (select .cse793 .cse785)) (.cse789 (let ((.cse794 (store .cse795 .cse785 (store .cse787 .cse779 0)))) (store .cse794 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse794 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse784))))) (let ((.cse782 (select (select .cse789 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse788 (let ((.cse792 (store .cse793 .cse785 (store .cse786 .cse779 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|)))) (store .cse792 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse792 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse785))))) (let ((.cse790 (select (select .cse788 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse791 (+ 4 .cse782))) (let ((.cse781 (select (select .cse788 .cse790) .cse791)) (.cse783 (select (select .cse789 .cse790) .cse791))) (let ((.cse780 (select (select .cse788 .cse781) (+ 4 .cse783)))) (or (not (<= 0 .cse779)) (not (< |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| |c_#StackHeapBarrier|)) (= .cse780 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 0)) (= .cse780 .cse781) (not (<= 0 .cse782)) (= 8 .cse783) (not (<= (+ .cse784 8) (select (store |c_#length| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8217) .cse785))) (not (<= 0 .cse783)) (not (= (select .cse786 .cse779) 0)) (not (= (select .cse787 .cse779) 0)))))))))))))) (forall ((|v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| Int)) (or (not (< |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 0)) (forall ((v_ArrVal_8218 (Array Int Int)) (v_ArrVal_8219 (Array Int Int)) (v_ArrVal_8217 Int)) (let ((.cse815 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8218)) (.cse813 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8219))) (let ((.cse816 (select (select .cse813 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse817 (+ (select (select .cse815 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (let ((.cse804 (select (select .cse815 .cse816) .cse817)) (.cse800 (select (select .cse813 .cse816) .cse817))) (let ((.cse808 (select .cse815 .cse800)) (.cse798 (+ .cse804 4))) (let ((.cse805 (select .cse813 .cse800)) (.cse806 (let ((.cse814 (store .cse815 .cse800 (store .cse808 .cse798 0)))) (store .cse814 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse814 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse804))))) (let ((.cse802 (select (select .cse806 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse809 (let ((.cse812 (store .cse813 .cse800 (store .cse805 .cse798 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|)))) (store .cse812 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse812 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse800))))) (let ((.cse810 (select (select .cse809 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse811 (+ 4 .cse802))) (let ((.cse803 (select (select .cse806 .cse810) .cse811))) (let ((.cse801 (select (select .cse809 .cse810) .cse811)) (.cse807 (+ 4 .cse803))) (let ((.cse799 (select (select .cse809 .cse801) .cse807))) (or (not (<= 0 .cse798)) (not (= .cse799 .cse800)) (= .cse799 .cse801) (not (<= 0 .cse802)) (= 8 .cse803) (not (<= (+ .cse804 8) (select (store |c_#length| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8217) .cse800))) (not (<= 0 .cse803)) (not (= (select .cse805 .cse798) 0)) (not (= .cse798 (select (select .cse806 .cse801) .cse807))) (not (= (select .cse808 .cse798) 0)) (= 0 .cse803))))))))))))))) (forall ((|v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| Int)) (or (not (< |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 0)) (forall ((v_ArrVal_8218 (Array Int Int)) (v_ArrVal_8219 (Array Int Int)) (v_ArrVal_8217 Int)) (let ((.cse834 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8218)) (.cse832 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8219))) (let ((.cse835 (select (select .cse832 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse836 (+ (select (select .cse834 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (let ((.cse824 (select (select .cse834 .cse835) .cse836)) (.cse825 (select (select .cse832 .cse835) .cse836))) (let ((.cse828 (select .cse834 .cse825)) (.cse818 (+ .cse824 4))) (let ((.cse827 (select .cse832 .cse825)) (.cse826 (let ((.cse833 (store .cse834 .cse825 (store .cse828 .cse818 0)))) (store .cse833 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse833 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse824))))) (let ((.cse822 (select (select .cse826 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse819 (let ((.cse831 (store .cse832 .cse825 (store .cse827 .cse818 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|)))) (store .cse831 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse831 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse825))))) (let ((.cse829 (select (select .cse819 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse830 (+ 4 .cse822))) (let ((.cse823 (select (select .cse826 .cse829) .cse830))) (let ((.cse820 (select (select .cse819 .cse829) .cse830)) (.cse821 (+ 4 .cse823))) (or (not (<= 0 .cse818)) (= (select (select .cse819 .cse820) .cse821) .cse820) (not (<= 0 .cse822)) (= 8 .cse823) (not (<= (+ .cse824 8) (select (store |c_#length| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8217) .cse825))) (= (select (select .cse826 .cse820) .cse821) 0) (not (<= 0 .cse823)) (not (= (select .cse827 .cse818) 0)) (not (= (select .cse828 .cse818) 0)) (= 0 .cse823)))))))))))))) (forall ((|v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| Int)) (or (not (< |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 0)) (forall ((v_ArrVal_8218 (Array Int Int)) (v_ArrVal_8219 (Array Int Int)) (v_ArrVal_8217 Int)) (let ((.cse853 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8218)) (.cse851 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8219))) (let ((.cse854 (select (select .cse851 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse855 (+ (select (select .cse853 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (let ((.cse842 (select (select .cse853 .cse854) .cse855)) (.cse840 (select (select .cse851 .cse854) .cse855))) (let ((.cse845 (select .cse853 .cse840)) (.cse837 (+ .cse842 4))) (let ((.cse844 (select .cse851 .cse840)) (.cse846 (let ((.cse852 (store .cse853 .cse840 (store .cse845 .cse837 0)))) (store .cse852 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse852 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse842))))) (let ((.cse839 (select (select .cse846 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse849 (let ((.cse850 (store .cse851 .cse840 (store .cse844 .cse837 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|)))) (store .cse850 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse850 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse840))))) (let ((.cse847 (select (select .cse849 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse848 (+ 4 .cse839))) (let ((.cse841 (select (select .cse849 .cse847) .cse848)) (.cse838 (select (select .cse846 .cse847) .cse848))) (let ((.cse843 (select (select .cse846 .cse841) (+ 4 .cse838)))) (or (not (<= 0 .cse837)) (not (= .cse837 .cse838)) (not (<= 0 .cse839)) (= 8 .cse838) (not (= .cse840 .cse841)) (not (<= (+ .cse842 8) (select (store |c_#length| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8217) .cse840))) (= .cse843 0) (= .cse843 .cse838) (not (= (select .cse844 .cse837) 0)) (not (= (select .cse845 .cse837) 0))))))))))))))) (or .cse19 (forall ((|v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| Int) (v_ArrVal_8218 (Array Int Int)) (v_ArrVal_8219 (Array Int Int)) (v_ArrVal_8217 Int)) (let ((.cse872 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8218)) (.cse870 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8219))) (let ((.cse873 (select (select .cse870 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse874 (+ (select (select .cse872 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (let ((.cse858 (select (select .cse872 .cse873) .cse874)) (.cse857 (select (select .cse870 .cse873) .cse874))) (let ((.cse864 (select .cse872 .cse857)) (.cse862 (+ .cse858 4))) (let ((.cse863 (select .cse870 .cse857)) (.cse866 (let ((.cse871 (store .cse872 .cse857 (store .cse864 .cse862 0)))) (store .cse871 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse871 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse858))))) (let ((.cse856 (select (select .cse866 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse865 (let ((.cse869 (store .cse870 .cse857 (store .cse863 .cse862 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|)))) (store .cse869 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse869 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse857))))) (let ((.cse867 (select (select .cse865 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse868 (+ 4 .cse856))) (let ((.cse860 (select (select .cse865 .cse867) .cse868)) (.cse861 (select (select .cse866 .cse867) .cse868))) (let ((.cse859 (select (select .cse865 .cse860) (+ 4 .cse861)))) (or (< .cse856 0) (not (< |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 0)) (< (select (store |c_#length| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8217) .cse857) (+ .cse858 8)) (= .cse859 .cse860) (not (= |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| .cse860)) (not (= 8 .cse861)) (= .cse859 .cse857) (< .cse862 0) (not (= (select .cse863 .cse862) 0)) (not (= (select .cse864 .cse862) 0)))))))))))))) (forall ((|v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| Int)) (or (forall ((v_ArrVal_8218 (Array Int Int)) (v_ArrVal_8219 (Array Int Int)) (v_ArrVal_8217 Int)) (let ((.cse892 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8218)) (.cse890 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8219))) (let ((.cse893 (select (select .cse890 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse894 (+ (select (select .cse892 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (let ((.cse878 (select (select .cse892 .cse893) .cse894)) (.cse877 (select (select .cse890 .cse893) .cse894))) (let ((.cse885 (select .cse892 .cse877)) (.cse881 (+ .cse878 4))) (let ((.cse884 (select .cse890 .cse877)) (.cse882 (let ((.cse891 (store .cse892 .cse877 (store .cse885 .cse881 0)))) (store .cse891 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse891 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse878))))) (let ((.cse875 (select (select .cse882 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse886 (let ((.cse889 (store .cse890 .cse877 (store .cse884 .cse881 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|)))) (store .cse889 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse889 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse877))))) (let ((.cse887 (select (select .cse886 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse888 (+ 4 .cse875))) (let ((.cse880 (select (select .cse882 .cse887) .cse888))) (let ((.cse879 (select (select .cse886 .cse887) .cse888)) (.cse883 (+ 4 .cse880))) (let ((.cse876 (select (select .cse886 .cse879) .cse883))) (or (< .cse875 0) (= .cse876 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) (< (select (store |c_#length| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8217) .cse877) (+ .cse878 8)) (not (= |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| .cse879)) (not (= 8 .cse880)) (= .cse876 .cse877) (< .cse881 0) (= (select (select .cse882 .cse879) .cse883) .cse880) (not (= (select .cse884 .cse881) 0)) (not (= (select .cse885 .cse881) 0)))))))))))))) (not (< |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 0)))) (forall ((|v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| Int)) (or (forall ((v_ArrVal_8218 (Array Int Int)) (v_ArrVal_8219 (Array Int Int)) (v_ArrVal_8217 Int)) (let ((.cse912 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8218)) (.cse910 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8219))) (let ((.cse913 (select (select .cse910 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse914 (+ (select (select .cse912 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (let ((.cse900 (select (select .cse912 .cse913) .cse914)) (.cse899 (select (select .cse910 .cse913) .cse914))) (let ((.cse905 (select .cse912 .cse899)) (.cse902 (+ .cse900 4))) (let ((.cse904 (select .cse910 .cse899)) (.cse906 (let ((.cse911 (store .cse912 .cse899 (store .cse905 .cse902 0)))) (store .cse911 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse911 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse900))))) (let ((.cse895 (select (select .cse906 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse896 (let ((.cse909 (store .cse910 .cse899 (store .cse904 .cse902 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|)))) (store .cse909 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse909 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse899))))) (let ((.cse907 (select (select .cse896 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse908 (+ 4 .cse895))) (let ((.cse901 (select (select .cse906 .cse907) .cse908))) (let ((.cse897 (select (select .cse896 .cse907) .cse908)) (.cse898 (+ 4 .cse901))) (let ((.cse903 (select (select .cse906 .cse897) .cse898))) (or (< .cse895 0) (= (select (select .cse896 .cse897) .cse898) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) (< (select (store |c_#length| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8217) .cse899) (+ .cse900 8)) (not (= |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| .cse897)) (not (= 8 .cse901)) (< .cse902 0) (= .cse903 .cse901) (not (= (select .cse904 .cse902) 0)) (not (= (select .cse905 .cse902) 0)) (= .cse902 .cse903))))))))))))) (not (< |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 0)))) (forall ((|v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| Int)) (or (not (< |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 0)) (forall ((v_ArrVal_8218 (Array Int Int)) (v_ArrVal_8219 (Array Int Int)) (v_ArrVal_8217 Int)) (let ((.cse931 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8218)) (.cse929 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8219))) (let ((.cse932 (select (select .cse929 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse933 (+ (select (select .cse931 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (let ((.cse921 (select (select .cse931 .cse932) .cse933)) (.cse922 (select (select .cse929 .cse932) .cse933))) (let ((.cse925 (select .cse931 .cse922)) (.cse915 (+ .cse921 4))) (let ((.cse924 (select .cse929 .cse922)) (.cse923 (let ((.cse930 (store .cse931 .cse922 (store .cse925 .cse915 0)))) (store .cse930 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse930 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse921))))) (let ((.cse919 (select (select .cse923 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse916 (let ((.cse928 (store .cse929 .cse922 (store .cse924 .cse915 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|)))) (store .cse928 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse928 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse922))))) (let ((.cse926 (select (select .cse916 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse927 (+ 4 .cse919))) (let ((.cse920 (select (select .cse923 .cse926) .cse927))) (let ((.cse918 (+ 4 .cse920)) (.cse917 (select (select .cse916 .cse926) .cse927))) (or (not (<= 0 .cse915)) (= (select (select .cse916 .cse917) .cse918) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) (not (<= 0 .cse919)) (= 8 .cse920) (not (<= (+ .cse921 8) (select (store |c_#length| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8217) .cse922))) (not (<= 0 .cse920)) (= (select (select .cse923 .cse917) .cse918) .cse920) (not (= (select .cse924 .cse915) 0)) (not (= (select .cse925 .cse915) 0)) (= |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| .cse917)))))))))))))) (forall ((|v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| Int)) (or (not (< |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 0)) (forall ((v_ArrVal_8218 (Array Int Int)) (v_ArrVal_8219 (Array Int Int)) (v_ArrVal_8217 Int)) (let ((.cse950 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8218)) (.cse948 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8219))) (let ((.cse951 (select (select .cse948 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse952 (+ (select (select .cse950 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (let ((.cse941 (select (select .cse950 .cse951) .cse952)) (.cse940 (select (select .cse948 .cse951) .cse952))) (let ((.cse944 (select .cse950 .cse940)) (.cse934 (+ .cse941 4))) (let ((.cse943 (select .cse948 .cse940)) (.cse942 (let ((.cse949 (store .cse950 .cse940 (store .cse944 .cse934 0)))) (store .cse949 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse949 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse941))))) (let ((.cse939 (select (select .cse942 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse935 (let ((.cse947 (store .cse948 .cse940 (store .cse943 .cse934 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|)))) (store .cse947 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse947 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse940))))) (let ((.cse945 (select (select .cse935 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse946 (+ 4 .cse939))) (let ((.cse938 (select (select .cse942 .cse945) .cse946))) (let ((.cse937 (+ 4 .cse938)) (.cse936 (select (select .cse935 .cse945) .cse946))) (or (not (<= 0 .cse934)) (= (select (select .cse935 .cse936) .cse937) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) (not (= .cse934 .cse938)) (not (<= 0 .cse939)) (not (= .cse940 .cse936)) (not (<= (+ .cse941 8) (select (store |c_#length| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8217) .cse940))) (= (select (select .cse942 .cse936) .cse937) .cse938) (not (= (select .cse943 .cse934) 0)) (not (= (select .cse944 .cse934) 0)) (= |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| .cse936)))))))))))))) (forall ((|v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| Int)) (or (not (< |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 0)) (forall ((v_ArrVal_8218 (Array Int Int)) (v_ArrVal_8219 (Array Int Int)) (v_ArrVal_8217 Int)) (let ((.cse969 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8218)) (.cse967 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8219))) (let ((.cse970 (select (select .cse967 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse971 (+ (select (select .cse969 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (let ((.cse956 (select (select .cse969 .cse970) .cse971)) (.cse957 (select (select .cse967 .cse970) .cse971))) (let ((.cse960 (select .cse969 .cse957)) (.cse953 (+ .cse956 4))) (let ((.cse959 (select .cse967 .cse957)) (.cse962 (let ((.cse968 (store .cse969 .cse957 (store .cse960 .cse953 0)))) (store .cse968 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse968 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse956))))) (let ((.cse954 (select (select .cse962 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse965 (let ((.cse966 (store .cse967 .cse957 (store .cse959 .cse953 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|)))) (store .cse966 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse966 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse957))))) (let ((.cse963 (select (select .cse965 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse964 (+ 4 .cse954))) (let ((.cse961 (select (select .cse965 .cse963) .cse964)) (.cse955 (select (select .cse962 .cse963) .cse964))) (let ((.cse958 (select (select .cse962 .cse961) (+ 4 .cse955)))) (or (not (<= 0 .cse953)) (not (<= 0 .cse954)) (= 8 .cse955) (not (<= (+ .cse956 8) (select (store |c_#length| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8217) .cse957))) (= .cse958 0) (not (<= 0 .cse955)) (= .cse958 .cse955) (not (= (select .cse959 .cse953) 0)) (not (= (select .cse960 .cse953) 0)) (= |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| .cse961)))))))))))))) (forall ((|v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| Int)) (or (not (< |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 0)) (forall ((v_ArrVal_8218 (Array Int Int)) (v_ArrVal_8219 (Array Int Int)) (v_ArrVal_8217 Int)) (let ((.cse989 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8218)) (.cse987 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8219))) (let ((.cse990 (select (select .cse987 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse991 (+ (select (select .cse989 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (let ((.cse974 (select (select .cse989 .cse990) .cse991)) (.cse973 (select (select .cse987 .cse990) .cse991))) (let ((.cse982 (select .cse989 .cse973)) (.cse978 (+ .cse974 4))) (let ((.cse981 (select .cse987 .cse973)) (.cse979 (let ((.cse988 (store .cse989 .cse973 (store .cse982 .cse978 0)))) (store .cse988 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse988 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse974))))) (let ((.cse972 (select (select .cse979 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse983 (let ((.cse986 (store .cse987 .cse973 (store .cse981 .cse978 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|)))) (store .cse986 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse986 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse973))))) (let ((.cse984 (select (select .cse983 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse985 (+ 4 .cse972))) (let ((.cse977 (select (select .cse979 .cse984) .cse985))) (let ((.cse976 (select (select .cse983 .cse984) .cse985)) (.cse980 (+ 4 .cse977))) (let ((.cse975 (select (select .cse983 .cse976) .cse980))) (or (< .cse972 0) (< (select (store |c_#length| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8217) .cse973) (+ .cse974 8)) (= .cse975 .cse976) (not (= |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| .cse976)) (not (= 8 .cse977)) (= .cse975 .cse973) (< .cse978 0) (= (select (select .cse979 .cse976) .cse980) 0) (not (= (select .cse981 .cse978) 0)) (not (= (select .cse982 .cse978) 0)))))))))))))))) (forall ((|v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| Int)) (or (not (< |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 0)) (forall ((v_ArrVal_8218 (Array Int Int)) (v_ArrVal_8219 (Array Int Int)) (v_ArrVal_8217 Int)) (let ((.cse1008 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8218)) (.cse1006 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8219))) (let ((.cse1009 (select (select .cse1006 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse1010 (+ (select (select .cse1008 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (let ((.cse994 (select (select .cse1008 .cse1009) .cse1010)) (.cse995 (select (select .cse1006 .cse1009) .cse1010))) (let ((.cse999 (select .cse1008 .cse995)) (.cse992 (+ .cse994 4))) (let ((.cse998 (select .cse1006 .cse995)) (.cse1001 (let ((.cse1007 (store .cse1008 .cse995 (store .cse999 .cse992 0)))) (store .cse1007 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse1007 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse994))))) (let ((.cse993 (select (select .cse1001 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1004 (let ((.cse1005 (store .cse1006 .cse995 (store .cse998 .cse992 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|)))) (store .cse1005 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse1005 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse995))))) (let ((.cse1002 (select (select .cse1004 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1003 (+ 4 .cse993))) (let ((.cse1000 (select (select .cse1004 .cse1002) .cse1003)) (.cse997 (select (select .cse1001 .cse1002) .cse1003))) (let ((.cse996 (select (select .cse1001 .cse1000) (+ 4 .cse997)))) (or (not (<= 0 .cse992)) (not (<= 0 .cse993)) (not (<= (+ .cse994 8) (select (store |c_#length| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8217) .cse995))) (= .cse996 0) (not (<= 0 .cse997)) (= .cse996 .cse997) (not (= (select .cse998 .cse992) 0)) (not (= (select .cse999 .cse992) 0)) (= |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| .cse1000)))))))))))))) (or (forall ((|v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| Int) (v_ArrVal_8218 (Array Int Int)) (v_ArrVal_8219 (Array Int Int)) (v_ArrVal_8217 Int)) (let ((.cse1026 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8218)) (.cse1024 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8219))) (let ((.cse1027 (select (select .cse1024 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse1028 (+ (select (select .cse1026 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (let ((.cse1014 (select (select .cse1026 .cse1027) .cse1028)) (.cse1015 (select (select .cse1024 .cse1027) .cse1028))) (let ((.cse1018 (select .cse1026 .cse1015)) (.cse1011 (+ .cse1014 4))) (let ((.cse1017 (select .cse1024 .cse1015)) (.cse1019 (let ((.cse1025 (store .cse1026 .cse1015 (store .cse1018 .cse1011 0)))) (store .cse1025 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse1025 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse1014))))) (let ((.cse1012 (select (select .cse1019 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1020 (let ((.cse1023 (store .cse1024 .cse1015 (store .cse1017 .cse1011 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|)))) (store .cse1023 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse1023 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse1015))))) (let ((.cse1021 (select (select .cse1020 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1022 (+ 4 .cse1012))) (let ((.cse1013 (select (select .cse1019 .cse1021) .cse1022))) (let ((.cse1016 (select (select .cse1019 (select (select .cse1020 .cse1021) .cse1022)) (+ 4 .cse1013)))) (or (not (<= 0 .cse1011)) (not (< |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 0)) (not (<= 0 .cse1012)) (= 8 .cse1013) (not (<= (+ .cse1014 8) (select (store |c_#length| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8217) .cse1015))) (= .cse1016 0) (not (<= 0 .cse1013)) (= .cse1016 .cse1013) (not (= (select .cse1017 .cse1011) 0)) (not (= (select .cse1018 .cse1011) 0))))))))))))) .cse39) (forall ((|v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| Int)) (or (not (< |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 0)) (forall ((v_ArrVal_8218 (Array Int Int)) (v_ArrVal_8219 (Array Int Int)) (v_ArrVal_8217 Int)) (let ((.cse1045 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8218)) (.cse1043 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8219))) (let ((.cse1046 (select (select .cse1043 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse1047 (+ (select (select .cse1045 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (let ((.cse1033 (select (select .cse1045 .cse1046) .cse1047)) (.cse1034 (select (select .cse1043 .cse1046) .cse1047))) (let ((.cse1037 (select .cse1045 .cse1034)) (.cse1029 (+ .cse1033 4))) (let ((.cse1036 (select .cse1043 .cse1034)) (.cse1039 (let ((.cse1044 (store .cse1045 .cse1034 (store .cse1037 .cse1029 0)))) (store .cse1044 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse1044 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse1033))))) (let ((.cse1032 (select (select .cse1039 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1038 (let ((.cse1042 (store .cse1043 .cse1034 (store .cse1036 .cse1029 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|)))) (store .cse1042 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse1042 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse1034))))) (let ((.cse1040 (select (select .cse1038 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1041 (+ 4 .cse1032))) (let ((.cse1031 (select (select .cse1038 .cse1040) .cse1041)) (.cse1035 (select (select .cse1039 .cse1040) .cse1041))) (let ((.cse1030 (select (select .cse1038 .cse1031) (+ 4 .cse1035)))) (or (not (<= 0 .cse1029)) (= .cse1030 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) (= .cse1030 .cse1031) (not (<= 0 .cse1032)) (not (<= (+ .cse1033 8) (select (store |c_#length| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8217) .cse1034))) (not (<= 0 .cse1035)) (not (= (select .cse1036 .cse1029) 0)) (not (= (select .cse1037 .cse1029) 0)) (= |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| .cse1031)))))))))))))) (or .cse39 (forall ((|v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| Int) (v_ArrVal_8218 (Array Int Int)) (v_ArrVal_8219 (Array Int Int)) (v_ArrVal_8217 Int)) (let ((.cse1065 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8218)) (.cse1063 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8219))) (let ((.cse1066 (select (select .cse1063 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse1067 (+ (select (select .cse1065 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (let ((.cse1054 (select (select .cse1065 .cse1066) .cse1067)) (.cse1050 (select (select .cse1063 .cse1066) .cse1067))) (let ((.cse1058 (select .cse1065 .cse1050)) (.cse1048 (+ .cse1054 4))) (let ((.cse1055 (select .cse1063 .cse1050)) (.cse1056 (let ((.cse1064 (store .cse1065 .cse1050 (store .cse1058 .cse1048 0)))) (store .cse1064 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse1064 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse1054))))) (let ((.cse1052 (select (select .cse1056 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1059 (let ((.cse1062 (store .cse1063 .cse1050 (store .cse1055 .cse1048 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|)))) (store .cse1062 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| (store (select .cse1062 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 8 .cse1050))))) (let ((.cse1060 (select (select .cse1059 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1061 (+ 4 .cse1052))) (let ((.cse1053 (select (select .cse1056 .cse1060) .cse1061))) (let ((.cse1051 (select (select .cse1059 .cse1060) .cse1061)) (.cse1057 (+ 4 .cse1053))) (let ((.cse1049 (select (select .cse1059 .cse1051) .cse1057))) (or (not (<= 0 .cse1048)) (not (< |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| |c_#StackHeapBarrier|)) (not (= .cse1049 .cse1050)) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67|) 0)) (= .cse1049 .cse1051) (not (<= 0 .cse1052)) (= 8 .cse1053) (not (<= (+ .cse1054 8) (select (store |c_#length| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_67| v_ArrVal_8217) .cse1050))) (not (<= 0 .cse1053)) (not (= (select .cse1055 .cse1048) 0)) (not (= .cse1048 (select (select .cse1056 .cse1051) .cse1057))) (not (= (select .cse1058 .cse1048) 0)))))))))))))))))) is different from true [2022-12-13 17:25:45,361 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1828337479] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 17:25:45,361 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 17:25:45,361 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39] total 76 [2022-12-13 17:25:45,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253232050] [2022-12-13 17:25:45,361 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 17:25:45,362 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 76 states [2022-12-13 17:25:45,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:25:45,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2022-12-13 17:25:45,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=282, Invalid=8091, Unknown=7, NotChecked=362, Total=8742 [2022-12-13 17:25:45,363 INFO L87 Difference]: Start difference. First operand 86 states and 91 transitions. Second operand has 76 states, 74 states have (on average 1.837837837837838) internal successors, (136), 67 states have internal predecessors, (136), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-12-13 17:26:02,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:26:02,770 INFO L93 Difference]: Finished difference Result 99 states and 104 transitions. [2022-12-13 17:26:02,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-12-13 17:26:02,771 INFO L78 Accepts]: Start accepts. Automaton has has 76 states, 74 states have (on average 1.837837837837838) internal successors, (136), 67 states have internal predecessors, (136), 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 75 [2022-12-13 17:26:02,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:26:02,771 INFO L225 Difference]: With dead ends: 99 [2022-12-13 17:26:02,771 INFO L226 Difference]: Without dead ends: 99 [2022-12-13 17:26:02,772 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 53 SyntacticMatches, 2 SemanticMatches, 126 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 2441 ImplicationChecksByTransitivity, 30.4s TimeCoverageRelationStatistics Valid=913, Invalid=14836, Unknown=9, NotChecked=498, Total=16256 [2022-12-13 17:26:02,772 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 678 mSDsluCounter, 935 mSDsCounter, 0 mSdLazyCounter, 3143 mSolverCounterSat, 23 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 678 SdHoareTripleChecker+Valid, 959 SdHoareTripleChecker+Invalid, 3261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 3143 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 92 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2022-12-13 17:26:02,772 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [678 Valid, 959 Invalid, 3261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 3143 Invalid, 3 Unknown, 92 Unchecked, 4.7s Time] [2022-12-13 17:26:02,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2022-12-13 17:26:02,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 86. [2022-12-13 17:26:02,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 72 states have (on average 1.1666666666666667) internal successors, (84), 81 states have internal predecessors, (84), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-13 17:26:02,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 90 transitions. [2022-12-13 17:26:02,775 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 90 transitions. Word has length 75 [2022-12-13 17:26:02,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:26:02,775 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 90 transitions. [2022-12-13 17:26:02,775 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 76 states, 74 states have (on average 1.837837837837838) internal successors, (136), 67 states have internal predecessors, (136), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-12-13 17:26:02,775 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 90 transitions. [2022-12-13 17:26:02,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-12-13 17:26:02,776 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:26:02,776 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 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, 1] [2022-12-13 17:26:02,782 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ee4424a-8107-47bf-b6a4-11ede3e4c4d9/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Ended with exit code 0 [2022-12-13 17:26:02,976 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37,27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ee4424a-8107-47bf-b6a4-11ede3e4c4d9/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 17:26:02,977 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-12-13 17:26:02,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:26:02,978 INFO L85 PathProgramCache]: Analyzing trace with hash 844969168, now seen corresponding path program 3 times [2022-12-13 17:26:02,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:26:02,978 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363216953] [2022-12-13 17:26:02,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:26:02,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:26:03,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:26:06,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:26:06,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:26:07,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-12-13 17:26:07,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:26:07,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-12-13 17:26:07,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:26:08,476 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 4 proven. 49 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-13 17:26:08,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:26:08,477 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363216953] [2022-12-13 17:26:08,477 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [363216953] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 17:26:08,477 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1291475789] [2022-12-13 17:26:08,477 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-13 17:26:08,477 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 17:26:08,477 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ee4424a-8107-47bf-b6a4-11ede3e4c4d9/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:26:08,478 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ee4424a-8107-47bf-b6a4-11ede3e4c4d9/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 17:26:08,478 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ee4424a-8107-47bf-b6a4-11ede3e4c4d9/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2022-12-13 17:26:10,250 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-12-13 17:26:10,250 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 17:26:10,256 INFO L263 TraceCheckSpWp]: Trace formula consists of 606 conjuncts, 184 conjunts are in the unsatisfiable core [2022-12-13 17:26:10,270 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 17:26:10,276 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 17:26:10,386 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-12-13 17:26:10,691 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-13 17:26:10,692 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-12-13 17:26:11,314 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-13 17:26:11,315 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-12-13 17:26:11,704 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-12-13 17:26:11,726 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 13 treesize of output 9 [2022-12-13 17:26:11,942 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 17:26:11,943 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 53 [2022-12-13 17:26:11,952 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 31 treesize of output 31 [2022-12-13 17:26:12,561 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 17:26:12,562 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 73 treesize of output 36 [2022-12-13 17:26:12,569 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 17:26:12,570 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 1 case distinctions, treesize of input 22 treesize of output 10 [2022-12-13 17:26:13,606 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:26:13,607 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:26:13,607 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:26:13,608 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:26:13,609 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:26:13,612 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 17:26:13,612 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 53 [2022-12-13 17:26:13,622 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:26:13,623 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:26:13,624 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:26:13,624 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 17:26:13,633 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-12-13 17:26:13,633 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 94 treesize of output 75 [2022-12-13 17:26:13,667 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-12-13 17:26:13,667 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 28 treesize of output 30 [2022-12-13 17:26:15,355 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:26:15,355 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 17:26:15,356 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 17:26:15,357 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:26:15,409 INFO L321 Elim1Store]: treesize reduction 179, result has 16.7 percent of original size [2022-12-13 17:26:15,409 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 8 new quantified variables, introduced 12 case distinctions, treesize of input 199 treesize of output 123 [2022-12-13 17:26:15,420 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:26:15,425 INFO L321 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-12-13 17:26:15,425 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 6 new quantified variables, introduced 3 case distinctions, treesize of input 113 treesize of output 93 [2022-12-13 17:26:15,702 INFO L321 Elim1Store]: treesize reduction 81, result has 8.0 percent of original size [2022-12-13 17:26:15,702 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 9 new quantified variables, introduced 11 case distinctions, treesize of input 348 treesize of output 122 [2022-12-13 17:26:15,728 INFO L321 Elim1Store]: treesize reduction 105, result has 12.5 percent of original size [2022-12-13 17:26:15,728 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 259 treesize of output 173 [2022-12-13 17:26:19,556 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 17:26:19,557 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:26:19,617 INFO L321 Elim1Store]: treesize reduction 182, result has 7.1 percent of original size [2022-12-13 17:26:19,617 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 2 disjoint index pairs (out of 21 index pairs), introduced 14 new quantified variables, introduced 21 case distinctions, treesize of input 308 treesize of output 130 [2022-12-13 17:26:19,640 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:26:19,642 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:26:19,664 INFO L321 Elim1Store]: treesize reduction 15, result has 40.0 percent of original size [2022-12-13 17:26:19,664 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 7 disjoint index pairs (out of 21 index pairs), introduced 9 new quantified variables, introduced 5 case distinctions, treesize of input 73 treesize of output 44 [2022-12-13 17:26:19,901 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 26 proven. 29 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 17:26:19,901 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 17:28:32,355 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1291475789] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 17:28:32,355 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 17:28:32,356 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 44] total 85 [2022-12-13 17:28:32,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70195490] [2022-12-13 17:28:32,356 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 17:28:32,356 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 85 states [2022-12-13 17:28:32,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:28:32,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2022-12-13 17:28:32,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=290, Invalid=10194, Unknown=22, NotChecked=0, Total=10506 [2022-12-13 17:28:32,357 INFO L87 Difference]: Start difference. First operand 86 states and 90 transitions. Second operand has 85 states, 83 states have (on average 1.7108433734939759) internal successors, (142), 76 states have internal predecessors, (142), 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-12-13 17:28:54,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:28:54,919 INFO L93 Difference]: Finished difference Result 92 states and 95 transitions. [2022-12-13 17:28:54,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-12-13 17:28:54,920 INFO L78 Accepts]: Start accepts. Automaton has has 85 states, 83 states have (on average 1.7108433734939759) internal successors, (142), 76 states have internal predecessors, (142), 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 78 [2022-12-13 17:28:54,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:28:54,921 INFO L225 Difference]: With dead ends: 92 [2022-12-13 17:28:54,921 INFO L226 Difference]: Without dead ends: 92 [2022-12-13 17:28:54,922 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 61 SyntacticMatches, 3 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3126 ImplicationChecksByTransitivity, 157.0s TimeCoverageRelationStatistics Valid=861, Invalid=19423, Unknown=22, NotChecked=0, Total=20306 [2022-12-13 17:28:54,922 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 497 mSDsluCounter, 1186 mSDsCounter, 0 mSdLazyCounter, 3670 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 497 SdHoareTripleChecker+Valid, 1211 SdHoareTripleChecker+Invalid, 3704 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 3670 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.8s IncrementalHoareTripleChecker+Time [2022-12-13 17:28:54,922 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [497 Valid, 1211 Invalid, 3704 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 3670 Invalid, 0 Unknown, 0 Unchecked, 5.8s Time] [2022-12-13 17:28:54,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-12-13 17:28:54,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 80. [2022-12-13 17:28:54,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 69 states have (on average 1.1014492753623188) internal successors, (76), 75 states have internal predecessors, (76), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-13 17:28:54,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 82 transitions. [2022-12-13 17:28:54,924 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 82 transitions. Word has length 78 [2022-12-13 17:28:54,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:28:54,924 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 82 transitions. [2022-12-13 17:28:54,924 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 85 states, 83 states have (on average 1.7108433734939759) internal successors, (142), 76 states have internal predecessors, (142), 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-12-13 17:28:54,924 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 82 transitions. [2022-12-13 17:28:54,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-12-13 17:28:54,925 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:28:54,925 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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, 1, 1, 1] [2022-12-13 17:28:54,933 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ee4424a-8107-47bf-b6a4-11ede3e4c4d9/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Ended with exit code 0 [2022-12-13 17:28:55,125 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ee4424a-8107-47bf-b6a4-11ede3e4c4d9/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2022-12-13 17:28:55,126 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-12-13 17:28:55,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:28:55,126 INFO L85 PathProgramCache]: Analyzing trace with hash 424239147, now seen corresponding path program 3 times [2022-12-13 17:28:55,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:28:55,126 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610113628] [2022-12-13 17:28:55,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:28:55,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:28:55,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:28:55,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:28:55,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:28:55,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-12-13 17:28:55,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:28:55,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-12-13 17:28:55,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:28:55,364 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-12-13 17:28:55,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:28:55,364 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610113628] [2022-12-13 17:28:55,364 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1610113628] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 17:28:55,364 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1411583823] [2022-12-13 17:28:55,364 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-13 17:28:55,364 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 17:28:55,364 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ee4424a-8107-47bf-b6a4-11ede3e4c4d9/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:28:55,365 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ee4424a-8107-47bf-b6a4-11ede3e4c4d9/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 17:28:55,366 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ee4424a-8107-47bf-b6a4-11ede3e4c4d9/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2022-12-13 17:28:57,079 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-12-13 17:28:57,079 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 17:28:57,084 INFO L263 TraceCheckSpWp]: Trace formula consists of 610 conjuncts, 11 conjunts are in the unsatisfiable core [2022-12-13 17:28:57,085 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 17:28:57,322 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-12-13 17:28:57,322 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 17:28:57,512 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-12-13 17:28:57,512 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1411583823] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 17:28:57,512 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 17:28:57,513 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 13 [2022-12-13 17:28:57,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415610508] [2022-12-13 17:28:57,513 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 17:28:57,513 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-13 17:28:57,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:28:57,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-13 17:28:57,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2022-12-13 17:28:57,514 INFO L87 Difference]: Start difference. First operand 80 states and 82 transitions. Second operand has 13 states, 13 states have (on average 6.153846153846154) internal successors, (80), 12 states have internal predecessors, (80), 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-12-13 17:28:57,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:28:57,630 INFO L93 Difference]: Finished difference Result 78 states and 80 transitions. [2022-12-13 17:28:57,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 17:28:57,631 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.153846153846154) internal successors, (80), 12 states have internal predecessors, (80), 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 79 [2022-12-13 17:28:57,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:28:57,631 INFO L225 Difference]: With dead ends: 78 [2022-12-13 17:28:57,631 INFO L226 Difference]: Without dead ends: 78 [2022-12-13 17:28:57,631 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 156 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2022-12-13 17:28:57,631 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 17 mSDsluCounter, 476 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 542 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 17:28:57,632 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 542 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 17:28:57,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-12-13 17:28:57,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2022-12-13 17:28:57,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 68 states have (on average 1.088235294117647) internal successors, (74), 73 states have internal predecessors, (74), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-13 17:28:57,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 80 transitions. [2022-12-13 17:28:57,633 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 80 transitions. Word has length 79 [2022-12-13 17:28:57,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:28:57,634 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 80 transitions. [2022-12-13 17:28:57,634 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.153846153846154) internal successors, (80), 12 states have internal predecessors, (80), 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-12-13 17:28:57,634 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 80 transitions. [2022-12-13 17:28:57,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-12-13 17:28:57,634 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:28:57,634 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1] [2022-12-13 17:28:57,643 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ee4424a-8107-47bf-b6a4-11ede3e4c4d9/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Ended with exit code 0 [2022-12-13 17:28:57,835 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ee4424a-8107-47bf-b6a4-11ede3e4c4d9/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2022-12-13 17:28:57,836 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-12-13 17:28:57,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:28:57,837 INFO L85 PathProgramCache]: Analyzing trace with hash -1579195478, now seen corresponding path program 1 times [2022-12-13 17:28:57,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:28:57,838 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148495607] [2022-12-13 17:28:57,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:28:57,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:28:57,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:28:58,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:28:58,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:28:58,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-12-13 17:28:58,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:28:58,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-12-13 17:28:58,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:28:58,125 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-12-13 17:28:58,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:28:58,126 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148495607] [2022-12-13 17:28:58,126 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1148495607] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 17:28:58,126 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1394031371] [2022-12-13 17:28:58,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:28:58,126 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 17:28:58,126 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ee4424a-8107-47bf-b6a4-11ede3e4c4d9/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:28:58,127 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ee4424a-8107-47bf-b6a4-11ede3e4c4d9/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 17:28:58,127 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ee4424a-8107-47bf-b6a4-11ede3e4c4d9/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2022-12-13 17:28:58,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:28:58,406 INFO L263 TraceCheckSpWp]: Trace formula consists of 628 conjuncts, 23 conjunts are in the unsatisfiable core [2022-12-13 17:28:58,407 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 17:28:58,490 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2022-12-13 17:28:58,492 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2022-12-13 17:28:58,504 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-12-13 17:28:58,505 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 17:28:58,624 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 17:28:58,624 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 34 treesize of output 38 [2022-12-13 17:28:58,750 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-12-13 17:28:58,750 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1394031371] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 17:28:58,751 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 17:28:58,751 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 14 [2022-12-13 17:28:58,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545810490] [2022-12-13 17:28:58,751 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 17:28:58,751 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-13 17:28:58,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:28:58,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-13 17:28:58,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2022-12-13 17:28:58,752 INFO L87 Difference]: Start difference. First operand 78 states and 80 transitions. Second operand has 15 states, 14 states have (on average 4.857142857142857) internal successors, (68), 14 states have internal predecessors, (68), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-13 17:28:59,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:28:59,085 INFO L93 Difference]: Finished difference Result 87 states and 89 transitions. [2022-12-13 17:28:59,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-13 17:28:59,085 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 4.857142857142857) internal successors, (68), 14 states have internal predecessors, (68), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 82 [2022-12-13 17:28:59,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:28:59,086 INFO L225 Difference]: With dead ends: 87 [2022-12-13 17:28:59,086 INFO L226 Difference]: Without dead ends: 87 [2022-12-13 17:28:59,086 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=68, Invalid=274, Unknown=0, NotChecked=0, Total=342 [2022-12-13 17:28:59,087 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 88 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 17:28:59,087 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 314 Invalid, 336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 334 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 17:28:59,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2022-12-13 17:28:59,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 80. [2022-12-13 17:28:59,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 70 states have (on average 1.1142857142857143) internal successors, (78), 75 states have internal predecessors, (78), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-13 17:28:59,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 84 transitions. [2022-12-13 17:28:59,089 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 84 transitions. Word has length 82 [2022-12-13 17:28:59,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:28:59,089 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 84 transitions. [2022-12-13 17:28:59,089 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 4.857142857142857) internal successors, (68), 14 states have internal predecessors, (68), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-13 17:28:59,090 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 84 transitions. [2022-12-13 17:28:59,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-12-13 17:28:59,090 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:28:59,090 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1] [2022-12-13 17:28:59,096 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ee4424a-8107-47bf-b6a4-11ede3e4c4d9/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Ended with exit code 0 [2022-12-13 17:28:59,291 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ee4424a-8107-47bf-b6a4-11ede3e4c4d9/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 17:28:59,291 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-12-13 17:28:59,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:28:59,292 INFO L85 PathProgramCache]: Analyzing trace with hash -1579195479, now seen corresponding path program 1 times [2022-12-13 17:28:59,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:28:59,293 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020489645] [2022-12-13 17:28:59,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:28:59,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:28:59,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:28:59,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:28:59,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:28:59,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-12-13 17:28:59,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:28:59,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-12-13 17:28:59,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:28:59,493 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-12-13 17:28:59,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:28:59,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020489645] [2022-12-13 17:28:59,493 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020489645] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 17:28:59,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [388655142] [2022-12-13 17:28:59,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:28:59,494 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 17:28:59,494 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ee4424a-8107-47bf-b6a4-11ede3e4c4d9/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:28:59,494 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ee4424a-8107-47bf-b6a4-11ede3e4c4d9/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 17:28:59,495 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ee4424a-8107-47bf-b6a4-11ede3e4c4d9/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2022-12-13 17:28:59,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:28:59,825 INFO L263 TraceCheckSpWp]: Trace formula consists of 628 conjuncts, 13 conjunts are in the unsatisfiable core [2022-12-13 17:28:59,827 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 17:28:59,857 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-12-13 17:28:59,862 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2022-12-13 17:28:59,862 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 17:28:59,894 INFO L321 Elim1Store]: treesize reduction 5, result has 58.3 percent of original size [2022-12-13 17:28:59,894 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 16 treesize of output 15 [2022-12-13 17:28:59,905 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2022-12-13 17:28:59,906 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [388655142] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 17:28:59,906 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 17:28:59,906 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 8 [2022-12-13 17:28:59,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279117065] [2022-12-13 17:28:59,906 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 17:28:59,906 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 17:28:59,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:28:59,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 17:28:59,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-12-13 17:28:59,907 INFO L87 Difference]: Start difference. First operand 80 states and 84 transitions. Second operand has 9 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-13 17:29:00,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:29:00,069 INFO L93 Difference]: Finished difference Result 86 states and 89 transitions. [2022-12-13 17:29:00,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 17:29:00,069 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 82 [2022-12-13 17:29:00,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:29:00,069 INFO L225 Difference]: With dead ends: 86 [2022-12-13 17:29:00,069 INFO L226 Difference]: Without dead ends: 86 [2022-12-13 17:29:00,069 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-12-13 17:29:00,070 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 33 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 17:29:00,070 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 225 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 17:29:00,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2022-12-13 17:29:00,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 79. [2022-12-13 17:29:00,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 70 states have (on average 1.0857142857142856) internal successors, (76), 74 states have internal predecessors, (76), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-13 17:29:00,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 82 transitions. [2022-12-13 17:29:00,071 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 82 transitions. Word has length 82 [2022-12-13 17:29:00,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:29:00,071 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 82 transitions. [2022-12-13 17:29:00,071 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-13 17:29:00,071 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 82 transitions. [2022-12-13 17:29:00,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-12-13 17:29:00,072 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:29:00,072 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:29:00,078 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ee4424a-8107-47bf-b6a4-11ede3e4c4d9/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Ended with exit code 0 [2022-12-13 17:29:00,272 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,31 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ee4424a-8107-47bf-b6a4-11ede3e4c4d9/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 17:29:00,273 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-12-13 17:29:00,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:29:00,274 INFO L85 PathProgramCache]: Analyzing trace with hash -1710420999, now seen corresponding path program 1 times [2022-12-13 17:29:00,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:29:00,274 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803795062] [2022-12-13 17:29:00,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:29:00,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:29:00,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:29:00,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:29:00,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:29:00,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-12-13 17:29:00,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:29:00,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-12-13 17:29:00,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:29:00,497 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2022-12-13 17:29:00,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:29:00,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803795062] [2022-12-13 17:29:00,497 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [803795062] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 17:29:00,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [508638927] [2022-12-13 17:29:00,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:29:00,497 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 17:29:00,497 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ee4424a-8107-47bf-b6a4-11ede3e4c4d9/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:29:00,498 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ee4424a-8107-47bf-b6a4-11ede3e4c4d9/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 17:29:00,499 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ee4424a-8107-47bf-b6a4-11ede3e4c4d9/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2022-12-13 17:29:00,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:29:00,856 INFO L263 TraceCheckSpWp]: Trace formula consists of 636 conjuncts, 25 conjunts are in the unsatisfiable core [2022-12-13 17:29:00,857 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 17:29:00,947 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2022-12-13 17:29:00,950 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 21 treesize of output 13 [2022-12-13 17:29:00,959 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2022-12-13 17:29:00,959 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 17:29:01,097 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2022-12-13 17:29:01,097 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [508638927] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-13 17:29:01,097 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-13 17:29:01,097 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8, 7] total 10 [2022-12-13 17:29:01,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599678792] [2022-12-13 17:29:01,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:29:01,098 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 17:29:01,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:29:01,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 17:29:01,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-12-13 17:29:01,098 INFO L87 Difference]: Start difference. First operand 79 states and 82 transitions. Second operand has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 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-12-13 17:29:01,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:29:01,200 INFO L93 Difference]: Finished difference Result 79 states and 81 transitions. [2022-12-13 17:29:01,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 17:29:01,200 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 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 83 [2022-12-13 17:29:01,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:29:01,200 INFO L225 Difference]: With dead ends: 79 [2022-12-13 17:29:01,201 INFO L226 Difference]: Without dead ends: 79 [2022-12-13 17:29:01,201 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2022-12-13 17:29:01,201 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 64 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 17:29:01,201 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 184 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 17:29:01,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-12-13 17:29:01,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2022-12-13 17:29:01,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 70 states have (on average 1.0714285714285714) internal successors, (75), 74 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-12-13 17:29:01,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 81 transitions. [2022-12-13 17:29:01,203 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 81 transitions. Word has length 83 [2022-12-13 17:29:01,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:29:01,203 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 81 transitions. [2022-12-13 17:29:01,203 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 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-12-13 17:29:01,203 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 81 transitions. [2022-12-13 17:29:01,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-12-13 17:29:01,204 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:29:01,204 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:29:01,210 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ee4424a-8107-47bf-b6a4-11ede3e4c4d9/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Ended with exit code 0 [2022-12-13 17:29:01,405 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42,32 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ee4424a-8107-47bf-b6a4-11ede3e4c4d9/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 17:29:01,405 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-12-13 17:29:01,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:29:01,406 INFO L85 PathProgramCache]: Analyzing trace with hash -1483396663, now seen corresponding path program 1 times [2022-12-13 17:29:01,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:29:01,407 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117939397] [2022-12-13 17:29:01,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:29:01,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:29:01,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:29:02,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:29:02,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:29:02,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-12-13 17:29:02,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:29:02,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-12-13 17:29:02,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:29:02,262 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 28 proven. 2 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-12-13 17:29:02,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:29:02,262 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117939397] [2022-12-13 17:29:02,262 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2117939397] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 17:29:02,263 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1162819718] [2022-12-13 17:29:02,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:29:02,263 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 17:29:02,263 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ee4424a-8107-47bf-b6a4-11ede3e4c4d9/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:29:02,263 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ee4424a-8107-47bf-b6a4-11ede3e4c4d9/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 17:29:02,264 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ee4424a-8107-47bf-b6a4-11ede3e4c4d9/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2022-12-13 17:29:02,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:29:02,630 INFO L263 TraceCheckSpWp]: Trace formula consists of 640 conjuncts, 63 conjunts are in the unsatisfiable core [2022-12-13 17:29:02,634 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 17:29:02,968 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-12-13 17:29:02,971 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2022-12-13 17:29:03,063 WARN L859 $PredicateComparison]: unable to prove that (and (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_9875 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| v_ArrVal_9875) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_9876 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.offset)| |c_node_create_~temp~0#1.base| v_ArrVal_9876) |c_#memory_$Pointer$.offset|))) is different from true [2022-12-13 17:29:03,073 WARN L859 $PredicateComparison]: unable to prove that (and (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_9878 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| v_ArrVal_9878) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_9877 (Array Int Int))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_node_create_~temp~0#1.base| v_ArrVal_9877)))) is different from true [2022-12-13 17:29:03,080 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_9880 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| v_ArrVal_9880))) (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_9879 (Array Int Int))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_node_create_~temp~0#1.base| v_ArrVal_9879)))) is different from true [2022-12-13 17:29:03,088 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_9879 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.offset)| |c_node_create_#res#1.base| v_ArrVal_9879) |c_#memory_$Pointer$.offset|)) (< |c_node_create_#res#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_9880 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_node_create_#res#1.base| v_ArrVal_9880)))) is different from true [2022-12-13 17:29:03,098 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:29:03,099 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-12-13 17:29:03,105 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:29:03,105 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2022-12-13 17:29:03,221 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 17:29:03,221 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 18 treesize of output 22 [2022-12-13 17:29:03,330 INFO L321 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2022-12-13 17:29:03,330 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 21 treesize of output 20 [2022-12-13 17:29:03,372 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:29:03,372 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-12-13 17:29:03,438 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-12-13 17:29:03,446 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 23 proven. 3 refuted. 0 times theorem prover too weak. 22 trivial. 5 not checked. [2022-12-13 17:29:03,446 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 17:29:04,026 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9883 (Array Int Int)) (v_ArrVal_9882 Int) (|v_ULTIMATE.start_dll_append_#t~ret7#1.base_79| Int) (|ULTIMATE.start_dll_append_~last~0#1.offset| Int) (|ULTIMATE.start_dll_append_~last~0#1.base| Int) (v_ArrVal_9892 (Array Int Int)) (v_ArrVal_9893 (Array Int Int))) (let ((.cse0 (+ |ULTIMATE.start_dll_append_~last~0#1.offset| 4))) (or (not (< |v_ULTIMATE.start_dll_append_#t~ret7#1.base_79| |c_#StackHeapBarrier|)) (not (= (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_79| v_ArrVal_9892) |ULTIMATE.start_dll_append_~last~0#1.base|) .cse0) 0)) (= (select (select (store (let ((.cse1 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_79| v_ArrVal_9893))) (store .cse1 |ULTIMATE.start_dll_append_~last~0#1.base| (store (select .cse1 |ULTIMATE.start_dll_append_~last~0#1.base|) .cse0 v_ArrVal_9882))) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_79| v_ArrVal_9883) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)))) is different from false [2022-12-13 17:29:04,028 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1162819718] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 17:29:04,028 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 17:29:04,028 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 24] total 40 [2022-12-13 17:29:04,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508718229] [2022-12-13 17:29:04,028 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 17:29:04,029 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-12-13 17:29:04,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:29:04,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-12-13 17:29:04,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=1557, Unknown=29, NotChecked=420, Total=2162 [2022-12-13 17:29:04,029 INFO L87 Difference]: Start difference. First operand 79 states and 81 transitions. Second operand has 41 states, 38 states have (on average 2.789473684210526) internal successors, (106), 35 states have internal predecessors, (106), 3 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2022-12-13 17:29:05,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:29:05,831 INFO L93 Difference]: Finished difference Result 81 states and 83 transitions. [2022-12-13 17:29:05,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-12-13 17:29:05,831 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 38 states have (on average 2.789473684210526) internal successors, (106), 35 states have internal predecessors, (106), 3 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Word has length 84 [2022-12-13 17:29:05,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:29:05,832 INFO L225 Difference]: With dead ends: 81 [2022-12-13 17:29:05,832 INFO L226 Difference]: Without dead ends: 81 [2022-12-13 17:29:05,833 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 103 SyntacticMatches, 3 SemanticMatches, 61 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 828 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=433, Invalid=2863, Unknown=30, NotChecked=580, Total=3906 [2022-12-13 17:29:05,833 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 399 mSDsluCounter, 374 mSDsCounter, 0 mSdLazyCounter, 906 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 400 SdHoareTripleChecker+Valid, 400 SdHoareTripleChecker+Invalid, 1211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 906 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 281 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-12-13 17:29:05,833 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [400 Valid, 400 Invalid, 1211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 906 Invalid, 0 Unknown, 281 Unchecked, 0.8s Time] [2022-12-13 17:29:05,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-12-13 17:29:05,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2022-12-13 17:29:05,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 72 states have (on average 1.0694444444444444) internal successors, (77), 76 states have internal predecessors, (77), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-13 17:29:05,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 83 transitions. [2022-12-13 17:29:05,835 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 83 transitions. Word has length 84 [2022-12-13 17:29:05,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:29:05,836 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 83 transitions. [2022-12-13 17:29:05,836 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 38 states have (on average 2.789473684210526) internal successors, (106), 35 states have internal predecessors, (106), 3 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2022-12-13 17:29:05,836 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 83 transitions. [2022-12-13 17:29:05,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-12-13 17:29:05,836 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:29:05,836 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:29:05,843 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ee4424a-8107-47bf-b6a4-11ede3e4c4d9/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Ended with exit code 0 [2022-12-13 17:29:06,037 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ee4424a-8107-47bf-b6a4-11ede3e4c4d9/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable43 [2022-12-13 17:29:06,037 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-12-13 17:29:06,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:29:06,037 INFO L85 PathProgramCache]: Analyzing trace with hash 1259343866, now seen corresponding path program 1 times [2022-12-13 17:29:06,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:29:06,037 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314148992] [2022-12-13 17:29:06,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:29:06,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:29:06,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:29:06,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:29:06,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:29:06,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-12-13 17:29:06,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:29:06,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-12-13 17:29:06,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:29:07,208 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 21 proven. 9 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-12-13 17:29:07,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:29:07,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314148992] [2022-12-13 17:29:07,209 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [314148992] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 17:29:07,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [410458069] [2022-12-13 17:29:07,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:29:07,209 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 17:29:07,209 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ee4424a-8107-47bf-b6a4-11ede3e4c4d9/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:29:07,210 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ee4424a-8107-47bf-b6a4-11ede3e4c4d9/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 17:29:07,211 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ee4424a-8107-47bf-b6a4-11ede3e4c4d9/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2022-12-13 17:29:07,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:29:07,523 INFO L263 TraceCheckSpWp]: Trace formula consists of 642 conjuncts, 45 conjunts are in the unsatisfiable core [2022-12-13 17:29:07,526 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 17:29:08,057 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 18 treesize of output 10 [2022-12-13 17:29:08,324 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:29:08,325 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 26 treesize of output 19 [2022-12-13 17:29:08,755 INFO L321 Elim1Store]: treesize reduction 31, result has 38.0 percent of original size [2022-12-13 17:29:08,755 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 40 treesize of output 40 [2022-12-13 17:29:08,770 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:29:08,770 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-12-13 17:29:08,983 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-12-13 17:29:09,142 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 24 proven. 7 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-12-13 17:29:09,142 INFO L328 TraceCheckSpWp]: Computing backward predicates...