./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-simple/dll2c_insert_equal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 38b53e6a 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_88e7b293-1926-49ea-8916-68815ea6b012/bin/uautomizer-ZsLfNo2U6R/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88e7b293-1926-49ea-8916-68815ea6b012/bin/uautomizer-ZsLfNo2U6R/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88e7b293-1926-49ea-8916-68815ea6b012/bin/uautomizer-ZsLfNo2U6R/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88e7b293-1926-49ea-8916-68815ea6b012/bin/uautomizer-ZsLfNo2U6R/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/dll2c_insert_equal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88e7b293-1926-49ea-8916-68815ea6b012/bin/uautomizer-ZsLfNo2U6R/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88e7b293-1926-49ea-8916-68815ea6b012/bin/uautomizer-ZsLfNo2U6R --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 535caea86e22f289c2fcb0364594f5e7b1dfaabfa814e56099346e6a240c0067 --- 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-38b53e6 [2022-11-25 17:07:14,354 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 17:07:14,357 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 17:07:14,377 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 17:07:14,378 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 17:07:14,379 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 17:07:14,381 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 17:07:14,383 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 17:07:14,385 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 17:07:14,386 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 17:07:14,387 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 17:07:14,389 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 17:07:14,389 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 17:07:14,391 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 17:07:14,392 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 17:07:14,393 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 17:07:14,395 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 17:07:14,396 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 17:07:14,397 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 17:07:14,400 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 17:07:14,401 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 17:07:14,409 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 17:07:14,412 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 17:07:14,414 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 17:07:14,419 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 17:07:14,427 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 17:07:14,427 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 17:07:14,428 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 17:07:14,429 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 17:07:14,431 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 17:07:14,433 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 17:07:14,434 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 17:07:14,436 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 17:07:14,437 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 17:07:14,439 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 17:07:14,440 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 17:07:14,441 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 17:07:14,441 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 17:07:14,442 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 17:07:14,443 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 17:07:14,444 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 17:07:14,445 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88e7b293-1926-49ea-8916-68815ea6b012/bin/uautomizer-ZsLfNo2U6R/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-11-25 17:07:14,485 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 17:07:14,485 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 17:07:14,486 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 17:07:14,486 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 17:07:14,487 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 17:07:14,487 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 17:07:14,488 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-25 17:07:14,488 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-25 17:07:14,488 INFO L138 SettingsManager]: * Use SBE=true [2022-11-25 17:07:14,489 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 17:07:14,490 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-25 17:07:14,490 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-25 17:07:14,490 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 17:07:14,491 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-25 17:07:14,491 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 17:07:14,491 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-25 17:07:14,491 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-25 17:07:14,492 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-25 17:07:14,492 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 17:07:14,492 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-25 17:07:14,492 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-25 17:07:14,498 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 17:07:14,498 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 17:07:14,499 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-25 17:07:14,499 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 17:07:14,499 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 17:07:14,499 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 17:07:14,500 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 17:07:14,500 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-25 17:07:14,501 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-25 17:07:14,501 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-25 17:07:14,501 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-11-25 17:07:14,502 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-25 17:07:14,502 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_88e7b293-1926-49ea-8916-68815ea6b012/bin/uautomizer-ZsLfNo2U6R/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_88e7b293-1926-49ea-8916-68815ea6b012/bin/uautomizer-ZsLfNo2U6R 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 -> 535caea86e22f289c2fcb0364594f5e7b1dfaabfa814e56099346e6a240c0067 [2022-11-25 17:07:14,750 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 17:07:14,773 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 17:07:14,776 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 17:07:14,777 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 17:07:14,778 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 17:07:14,779 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88e7b293-1926-49ea-8916-68815ea6b012/bin/uautomizer-ZsLfNo2U6R/../../sv-benchmarks/c/list-simple/dll2c_insert_equal.i [2022-11-25 17:07:17,850 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 17:07:18,094 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 17:07:18,095 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88e7b293-1926-49ea-8916-68815ea6b012/sv-benchmarks/c/list-simple/dll2c_insert_equal.i [2022-11-25 17:07:18,108 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88e7b293-1926-49ea-8916-68815ea6b012/bin/uautomizer-ZsLfNo2U6R/data/59c31ef0a/835f5d97e11a43eda0aa702d4d7b00d0/FLAG2c72792da [2022-11-25 17:07:18,139 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88e7b293-1926-49ea-8916-68815ea6b012/bin/uautomizer-ZsLfNo2U6R/data/59c31ef0a/835f5d97e11a43eda0aa702d4d7b00d0 [2022-11-25 17:07:18,142 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 17:07:18,147 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 17:07:18,148 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 17:07:18,148 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 17:07:18,155 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 17:07:18,156 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 05:07:18" (1/1) ... [2022-11-25 17:07:18,157 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7893ced0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:07:18, skipping insertion in model container [2022-11-25 17:07:18,157 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 05:07:18" (1/1) ... [2022-11-25 17:07:18,164 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 17:07:18,203 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 17:07:18,465 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_88e7b293-1926-49ea-8916-68815ea6b012/sv-benchmarks/c/list-simple/dll2c_insert_equal.i[24877,24890] [2022-11-25 17:07:18,470 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 17:07:18,478 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 17:07:18,576 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_88e7b293-1926-49ea-8916-68815ea6b012/sv-benchmarks/c/list-simple/dll2c_insert_equal.i[24877,24890] [2022-11-25 17:07:18,578 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 17:07:18,605 INFO L208 MainTranslator]: Completed translation [2022-11-25 17:07:18,605 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:07:18 WrapperNode [2022-11-25 17:07:18,606 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 17:07:18,607 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 17:07:18,607 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 17:07:18,607 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 17:07:18,614 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:07:18" (1/1) ... [2022-11-25 17:07:18,647 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:07:18" (1/1) ... [2022-11-25 17:07:18,686 INFO L138 Inliner]: procedures = 127, calls = 53, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 160 [2022-11-25 17:07:18,686 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 17:07:18,687 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 17:07:18,687 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 17:07:18,687 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 17:07:18,696 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:07:18" (1/1) ... [2022-11-25 17:07:18,697 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:07:18" (1/1) ... [2022-11-25 17:07:18,716 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:07:18" (1/1) ... [2022-11-25 17:07:18,716 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:07:18" (1/1) ... [2022-11-25 17:07:18,728 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:07:18" (1/1) ... [2022-11-25 17:07:18,732 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:07:18" (1/1) ... [2022-11-25 17:07:18,733 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:07:18" (1/1) ... [2022-11-25 17:07:18,749 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:07:18" (1/1) ... [2022-11-25 17:07:18,751 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 17:07:18,752 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 17:07:18,752 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 17:07:18,753 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 17:07:18,753 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:07:18" (1/1) ... [2022-11-25 17:07:18,762 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 17:07:18,776 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88e7b293-1926-49ea-8916-68815ea6b012/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:07:18,792 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88e7b293-1926-49ea-8916-68815ea6b012/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 17:07:18,794 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88e7b293-1926-49ea-8916-68815ea6b012/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 17:07:18,835 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-25 17:07:18,835 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-25 17:07:18,835 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2022-11-25 17:07:18,835 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2022-11-25 17:07:18,836 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-25 17:07:18,836 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-25 17:07:18,836 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-25 17:07:18,836 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-25 17:07:18,836 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-25 17:07:18,836 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-25 17:07:18,836 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-25 17:07:18,837 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-25 17:07:18,837 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 17:07:18,837 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 17:07:19,007 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 17:07:19,009 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 17:07:19,569 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 17:07:19,576 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 17:07:19,577 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2022-11-25 17:07:19,579 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 05:07:19 BoogieIcfgContainer [2022-11-25 17:07:19,579 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 17:07:19,582 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 17:07:19,582 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 17:07:19,596 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 17:07:19,596 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 05:07:18" (1/3) ... [2022-11-25 17:07:19,597 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f3caa1e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 05:07:19, skipping insertion in model container [2022-11-25 17:07:19,598 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:07:18" (2/3) ... [2022-11-25 17:07:19,600 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f3caa1e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 05:07:19, skipping insertion in model container [2022-11-25 17:07:19,600 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 05:07:19" (3/3) ... [2022-11-25 17:07:19,604 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2c_insert_equal.i [2022-11-25 17:07:19,625 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 17:07:19,625 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 72 error locations. [2022-11-25 17:07:19,675 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 17:07:19,682 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;@216d6258, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 17:07:19,682 INFO L358 AbstractCegarLoop]: Starting to check reachability of 72 error locations. [2022-11-25 17:07:19,687 INFO L276 IsEmpty]: Start isEmpty. Operand has 154 states, 77 states have (on average 2.1298701298701297) internal successors, (164), 149 states have internal predecessors, (164), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-25 17:07:19,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-25 17:07:19,694 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:07:19,695 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-25 17:07:19,695 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-11-25 17:07:19,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:07:19,701 INFO L85 PathProgramCache]: Analyzing trace with hash 896534515, now seen corresponding path program 1 times [2022-11-25 17:07:19,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:07:19,711 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238427448] [2022-11-25 17:07:19,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:07:19,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:07:19,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:07:20,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:07:20,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:07:20,028 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238427448] [2022-11-25 17:07:20,029 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [238427448] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:07:20,029 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:07:20,029 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 17:07:20,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839823051] [2022-11-25 17:07:20,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:07:20,036 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 17:07:20,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:07:20,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 17:07:20,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 17:07:20,070 INFO L87 Difference]: Start difference. First operand has 154 states, 77 states have (on average 2.1298701298701297) internal successors, (164), 149 states have internal predecessors, (164), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:07:20,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:07:20,275 INFO L93 Difference]: Finished difference Result 151 states and 162 transitions. [2022-11-25 17:07:20,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 17:07:20,278 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-11-25 17:07:20,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:07:20,288 INFO L225 Difference]: With dead ends: 151 [2022-11-25 17:07:20,288 INFO L226 Difference]: Without dead ends: 148 [2022-11-25 17:07:20,290 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 17:07:20,300 INFO L413 NwaCegarLoop]: 153 mSDtfsCounter, 10 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 17:07:20,301 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 240 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 17:07:20,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2022-11-25 17:07:20,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 148. [2022-11-25 17:07:20,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 75 states have (on average 2.026666666666667) internal successors, (152), 143 states have internal predecessors, (152), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-25 17:07:20,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 158 transitions. [2022-11-25 17:07:20,359 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 158 transitions. Word has length 6 [2022-11-25 17:07:20,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:07:20,360 INFO L495 AbstractCegarLoop]: Abstraction has 148 states and 158 transitions. [2022-11-25 17:07:20,360 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:07:20,360 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 158 transitions. [2022-11-25 17:07:20,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-25 17:07:20,361 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:07:20,361 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-25 17:07:20,361 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-25 17:07:20,362 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-11-25 17:07:20,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:07:20,363 INFO L85 PathProgramCache]: Analyzing trace with hash 896534514, now seen corresponding path program 1 times [2022-11-25 17:07:20,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:07:20,363 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915257514] [2022-11-25 17:07:20,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:07:20,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:07:20,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:07:20,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:07:20,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:07:20,494 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915257514] [2022-11-25 17:07:20,495 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915257514] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:07:20,495 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:07:20,495 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 17:07:20,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648561267] [2022-11-25 17:07:20,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:07:20,497 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 17:07:20,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:07:20,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 17:07:20,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 17:07:20,499 INFO L87 Difference]: Start difference. First operand 148 states and 158 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:07:20,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:07:20,689 INFO L93 Difference]: Finished difference Result 145 states and 155 transitions. [2022-11-25 17:07:20,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 17:07:20,690 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-11-25 17:07:20,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:07:20,695 INFO L225 Difference]: With dead ends: 145 [2022-11-25 17:07:20,695 INFO L226 Difference]: Without dead ends: 145 [2022-11-25 17:07:20,696 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 17:07:20,697 INFO L413 NwaCegarLoop]: 150 mSDtfsCounter, 5 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 17:07:20,698 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 229 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 17:07:20,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2022-11-25 17:07:20,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2022-11-25 17:07:20,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 75 states have (on average 1.9866666666666666) internal successors, (149), 140 states have internal predecessors, (149), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-25 17:07:20,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 155 transitions. [2022-11-25 17:07:20,706 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 155 transitions. Word has length 6 [2022-11-25 17:07:20,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:07:20,706 INFO L495 AbstractCegarLoop]: Abstraction has 145 states and 155 transitions. [2022-11-25 17:07:20,706 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:07:20,707 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 155 transitions. [2022-11-25 17:07:20,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-25 17:07:20,707 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:07:20,707 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:07:20,708 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-25 17:07:20,708 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-11-25 17:07:20,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:07:20,709 INFO L85 PathProgramCache]: Analyzing trace with hash 976905444, now seen corresponding path program 1 times [2022-11-25 17:07:20,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:07:20,709 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580303673] [2022-11-25 17:07:20,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:07:20,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:07:20,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:07:20,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:07:20,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:07:20,865 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:07:20,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:07:20,865 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580303673] [2022-11-25 17:07:20,865 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1580303673] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:07:20,866 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:07:20,866 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 17:07:20,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078118870] [2022-11-25 17:07:20,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:07:20,866 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 17:07:20,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:07:20,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 17:07:20,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 17:07:20,868 INFO L87 Difference]: Start difference. First operand 145 states and 155 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 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-11-25 17:07:21,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:07:21,089 INFO L93 Difference]: Finished difference Result 156 states and 168 transitions. [2022-11-25 17:07:21,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 17:07:21,090 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 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-11-25 17:07:21,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:07:21,092 INFO L225 Difference]: With dead ends: 156 [2022-11-25 17:07:21,092 INFO L226 Difference]: Without dead ends: 156 [2022-11-25 17:07:21,096 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 17:07:21,100 INFO L413 NwaCegarLoop]: 153 mSDtfsCounter, 10 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 17:07:21,101 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 352 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 17:07:21,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2022-11-25 17:07:21,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 146. [2022-11-25 17:07:21,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 76 states have (on average 1.9736842105263157) internal successors, (150), 141 states have internal predecessors, (150), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-25 17:07:21,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 156 transitions. [2022-11-25 17:07:21,152 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 156 transitions. Word has length 14 [2022-11-25 17:07:21,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:07:21,152 INFO L495 AbstractCegarLoop]: Abstraction has 146 states and 156 transitions. [2022-11-25 17:07:21,153 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 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-11-25 17:07:21,153 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 156 transitions. [2022-11-25 17:07:21,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-25 17:07:21,154 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:07:21,154 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:07:21,154 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-25 17:07:21,154 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-11-25 17:07:21,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:07:21,155 INFO L85 PathProgramCache]: Analyzing trace with hash 302098592, now seen corresponding path program 1 times [2022-11-25 17:07:21,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:07:21,155 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525802923] [2022-11-25 17:07:21,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:07:21,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:07:21,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:07:21,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:07:21,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:07:21,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-25 17:07:21,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:07:21,552 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-25 17:07:21,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:07:21,552 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525802923] [2022-11-25 17:07:21,553 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [525802923] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:07:21,553 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:07:21,554 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-25 17:07:21,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153178105] [2022-11-25 17:07:21,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:07:21,555 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 17:07:21,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:07:21,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 17:07:21,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-25 17:07:21,556 INFO L87 Difference]: Start difference. First operand 146 states and 156 transitions. Second operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-25 17:07:21,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:07:21,950 INFO L93 Difference]: Finished difference Result 146 states and 157 transitions. [2022-11-25 17:07:21,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 17:07:21,952 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2022-11-25 17:07:21,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:07:21,954 INFO L225 Difference]: With dead ends: 146 [2022-11-25 17:07:21,954 INFO L226 Difference]: Without dead ends: 146 [2022-11-25 17:07:21,954 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-25 17:07:21,955 INFO L413 NwaCegarLoop]: 141 mSDtfsCounter, 21 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 424 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 484 SdHoareTripleChecker+Invalid, 426 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 424 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-25 17:07:21,956 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 484 Invalid, 426 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 424 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-25 17:07:21,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2022-11-25 17:07:21,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 145. [2022-11-25 17:07:21,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 76 states have (on average 1.9605263157894737) internal successors, (149), 140 states have internal predecessors, (149), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-25 17:07:21,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 155 transitions. [2022-11-25 17:07:21,969 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 155 transitions. Word has length 24 [2022-11-25 17:07:21,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:07:21,969 INFO L495 AbstractCegarLoop]: Abstraction has 145 states and 155 transitions. [2022-11-25 17:07:21,969 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-25 17:07:21,969 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 155 transitions. [2022-11-25 17:07:21,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-25 17:07:21,970 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:07:21,970 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:07:21,970 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-25 17:07:21,971 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-11-25 17:07:21,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:07:21,971 INFO L85 PathProgramCache]: Analyzing trace with hash 302098593, now seen corresponding path program 1 times [2022-11-25 17:07:21,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:07:21,972 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181589958] [2022-11-25 17:07:21,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:07:21,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:07:22,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:07:22,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:07:22,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:07:22,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-25 17:07:22,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:07:22,368 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-25 17:07:22,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:07:22,369 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181589958] [2022-11-25 17:07:22,369 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [181589958] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:07:22,369 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:07:22,369 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-25 17:07:22,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564159199] [2022-11-25 17:07:22,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:07:22,370 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 17:07:22,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:07:22,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 17:07:22,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-25 17:07:22,371 INFO L87 Difference]: Start difference. First operand 145 states and 155 transitions. Second operand has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-25 17:07:22,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:07:22,728 INFO L93 Difference]: Finished difference Result 145 states and 156 transitions. [2022-11-25 17:07:22,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 17:07:22,729 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 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 24 [2022-11-25 17:07:22,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:07:22,730 INFO L225 Difference]: With dead ends: 145 [2022-11-25 17:07:22,730 INFO L226 Difference]: Without dead ends: 145 [2022-11-25 17:07:22,730 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-25 17:07:22,731 INFO L413 NwaCegarLoop]: 141 mSDtfsCounter, 19 mSDsluCounter, 367 mSDsCounter, 0 mSdLazyCounter, 395 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 508 SdHoareTripleChecker+Invalid, 396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 395 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-25 17:07:22,732 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 508 Invalid, 396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 395 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-25 17:07:22,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2022-11-25 17:07:22,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 144. [2022-11-25 17:07:22,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 76 states have (on average 1.9473684210526316) internal successors, (148), 139 states have internal predecessors, (148), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-25 17:07:22,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 154 transitions. [2022-11-25 17:07:22,738 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 154 transitions. Word has length 24 [2022-11-25 17:07:22,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:07:22,738 INFO L495 AbstractCegarLoop]: Abstraction has 144 states and 154 transitions. [2022-11-25 17:07:22,739 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-25 17:07:22,739 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 154 transitions. [2022-11-25 17:07:22,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-25 17:07:22,740 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:07:22,740 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:07:22,740 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-25 17:07:22,741 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-11-25 17:07:22,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:07:22,741 INFO L85 PathProgramCache]: Analyzing trace with hash -1741029503, now seen corresponding path program 1 times [2022-11-25 17:07:22,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:07:22,742 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035525985] [2022-11-25 17:07:22,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:07:22,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:07:22,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:07:22,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:07:22,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:07:22,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-25 17:07:22,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:07:23,082 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-25 17:07:23,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:07:23,083 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035525985] [2022-11-25 17:07:23,083 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1035525985] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:07:23,083 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1717098106] [2022-11-25 17:07:23,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:07:23,084 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:07:23,084 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88e7b293-1926-49ea-8916-68815ea6b012/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:07:23,088 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88e7b293-1926-49ea-8916-68815ea6b012/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:07:23,114 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88e7b293-1926-49ea-8916-68815ea6b012/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-25 17:07:23,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:07:23,235 INFO L263 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 15 conjunts are in the unsatisfiable core [2022-11-25 17:07:23,241 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:07:23,293 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 17:07:23,359 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_352 Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_352))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2022-11-25 17:07:23,449 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-25 17:07:23,449 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-25 17:07:23,463 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2022-11-25 17:07:23,464 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 17:07:23,541 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1717098106] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:07:23,541 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 17:07:23,542 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 10 [2022-11-25 17:07:23,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335022125] [2022-11-25 17:07:23,542 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 17:07:23,543 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-25 17:07:23,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:07:23,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-25 17:07:23,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=87, Unknown=1, NotChecked=18, Total=132 [2022-11-25 17:07:23,544 INFO L87 Difference]: Start difference. First operand 144 states and 154 transitions. Second operand has 11 states, 10 states have (on average 3.2) internal successors, (32), 8 states have internal predecessors, (32), 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-11-25 17:07:24,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:07:24,023 INFO L93 Difference]: Finished difference Result 169 states and 182 transitions. [2022-11-25 17:07:24,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 17:07:24,023 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.2) internal successors, (32), 8 states have internal predecessors, (32), 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 26 [2022-11-25 17:07:24,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:07:24,024 INFO L225 Difference]: With dead ends: 169 [2022-11-25 17:07:24,025 INFO L226 Difference]: Without dead ends: 169 [2022-11-25 17:07:24,025 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=121, Unknown=1, NotChecked=22, Total=182 [2022-11-25 17:07:24,026 INFO L413 NwaCegarLoop]: 84 mSDtfsCounter, 124 mSDsluCounter, 373 mSDsCounter, 0 mSdLazyCounter, 495 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 457 SdHoareTripleChecker+Invalid, 677 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 495 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 175 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-25 17:07:24,026 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 457 Invalid, 677 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 495 Invalid, 0 Unknown, 175 Unchecked, 0.4s Time] [2022-11-25 17:07:24,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2022-11-25 17:07:24,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 149. [2022-11-25 17:07:24,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 80 states have (on average 1.925) internal successors, (154), 143 states have internal predecessors, (154), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-25 17:07:24,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 162 transitions. [2022-11-25 17:07:24,033 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 162 transitions. Word has length 26 [2022-11-25 17:07:24,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:07:24,034 INFO L495 AbstractCegarLoop]: Abstraction has 149 states and 162 transitions. [2022-11-25 17:07:24,034 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.2) internal successors, (32), 8 states have internal predecessors, (32), 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-11-25 17:07:24,034 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 162 transitions. [2022-11-25 17:07:24,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-25 17:07:24,035 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:07:24,035 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:07:24,050 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88e7b293-1926-49ea-8916-68815ea6b012/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-25 17:07:24,242 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88e7b293-1926-49ea-8916-68815ea6b012/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:07:24,242 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-11-25 17:07:24,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:07:24,243 INFO L85 PathProgramCache]: Analyzing trace with hash -1741029502, now seen corresponding path program 1 times [2022-11-25 17:07:24,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:07:24,243 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457270566] [2022-11-25 17:07:24,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:07:24,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:07:24,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:07:24,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:07:24,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:07:24,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-25 17:07:24,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:07:24,783 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-25 17:07:24,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:07:24,784 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457270566] [2022-11-25 17:07:24,784 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457270566] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:07:24,784 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [102399313] [2022-11-25 17:07:24,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:07:24,784 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:07:24,785 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88e7b293-1926-49ea-8916-68815ea6b012/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:07:24,786 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88e7b293-1926-49ea-8916-68815ea6b012/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:07:24,809 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88e7b293-1926-49ea-8916-68815ea6b012/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-25 17:07:24,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:07:24,935 INFO L263 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 25 conjunts are in the unsatisfiable core [2022-11-25 17:07:24,938 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:07:24,949 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 17:07:25,188 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_493 Int)) (= (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_493) |c_#length|)) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2022-11-25 17:07:25,258 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:07:25,260 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-25 17:07:25,268 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-25 17:07:25,269 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-11-25 17:07:25,312 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2022-11-25 17:07:25,312 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 17:07:27,497 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [102399313] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:07:27,497 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 17:07:27,497 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 18 [2022-11-25 17:07:27,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351586013] [2022-11-25 17:07:27,497 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 17:07:27,498 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-11-25 17:07:27,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:07:27,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-11-25 17:07:27,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=323, Unknown=1, NotChecked=36, Total=420 [2022-11-25 17:07:27,499 INFO L87 Difference]: Start difference. First operand 149 states and 162 transitions. Second operand has 19 states, 18 states have (on average 2.3333333333333335) internal successors, (42), 15 states have internal predecessors, (42), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-11-25 17:07:28,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:07:28,682 INFO L93 Difference]: Finished difference Result 151 states and 163 transitions. [2022-11-25 17:07:28,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-25 17:07:28,683 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.3333333333333335) internal successors, (42), 15 states have internal predecessors, (42), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 26 [2022-11-25 17:07:28,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:07:28,683 INFO L225 Difference]: With dead ends: 151 [2022-11-25 17:07:28,684 INFO L226 Difference]: Without dead ends: 151 [2022-11-25 17:07:28,684 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=79, Invalid=386, Unknown=1, NotChecked=40, Total=506 [2022-11-25 17:07:28,685 INFO L413 NwaCegarLoop]: 143 mSDtfsCounter, 7 mSDsluCounter, 797 mSDsCounter, 0 mSdLazyCounter, 1183 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 940 SdHoareTripleChecker+Invalid, 1345 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 156 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-25 17:07:28,685 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 940 Invalid, 1345 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1183 Invalid, 0 Unknown, 156 Unchecked, 1.0s Time] [2022-11-25 17:07:28,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2022-11-25 17:07:28,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 149. [2022-11-25 17:07:28,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 80 states have (on average 1.9125) internal successors, (153), 143 states have internal predecessors, (153), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-25 17:07:28,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 161 transitions. [2022-11-25 17:07:28,690 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 161 transitions. Word has length 26 [2022-11-25 17:07:28,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:07:28,690 INFO L495 AbstractCegarLoop]: Abstraction has 149 states and 161 transitions. [2022-11-25 17:07:28,690 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.3333333333333335) internal successors, (42), 15 states have internal predecessors, (42), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-11-25 17:07:28,691 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 161 transitions. [2022-11-25 17:07:28,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-25 17:07:28,691 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:07:28,691 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] [2022-11-25 17:07:28,704 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88e7b293-1926-49ea-8916-68815ea6b012/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-25 17:07:28,892 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88e7b293-1926-49ea-8916-68815ea6b012/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:07:28,892 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-11-25 17:07:28,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:07:28,893 INFO L85 PathProgramCache]: Analyzing trace with hash 1908047191, now seen corresponding path program 1 times [2022-11-25 17:07:28,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:07:28,893 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478675826] [2022-11-25 17:07:28,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:07:28,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:07:28,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:07:28,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:07:28,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:07:29,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-25 17:07:29,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:07:29,039 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-25 17:07:29,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:07:29,040 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478675826] [2022-11-25 17:07:29,040 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1478675826] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:07:29,040 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1317242257] [2022-11-25 17:07:29,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:07:29,040 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:07:29,041 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88e7b293-1926-49ea-8916-68815ea6b012/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:07:29,042 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88e7b293-1926-49ea-8916-68815ea6b012/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:07:29,077 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88e7b293-1926-49ea-8916-68815ea6b012/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-25 17:07:29,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:07:29,197 INFO L263 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-25 17:07:29,199 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:07:29,227 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-25 17:07:29,227 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 17:07:29,275 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-25 17:07:29,276 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1317242257] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 17:07:29,276 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 17:07:29,276 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 7 [2022-11-25 17:07:29,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515894542] [2022-11-25 17:07:29,276 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 17:07:29,277 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 17:07:29,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:07:29,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 17:07:29,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-25 17:07:29,278 INFO L87 Difference]: Start difference. First operand 149 states and 161 transitions. Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-25 17:07:29,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:07:29,496 INFO L93 Difference]: Finished difference Result 150 states and 161 transitions. [2022-11-25 17:07:29,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 17:07:29,497 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 28 [2022-11-25 17:07:29,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:07:29,498 INFO L225 Difference]: With dead ends: 150 [2022-11-25 17:07:29,498 INFO L226 Difference]: Without dead ends: 150 [2022-11-25 17:07:29,498 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-25 17:07:29,499 INFO L413 NwaCegarLoop]: 144 mSDtfsCounter, 4 mSDsluCounter, 606 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 750 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 17:07:29,499 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 750 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 17:07:29,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2022-11-25 17:07:29,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 149. [2022-11-25 17:07:29,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 80 states have (on average 1.9) internal successors, (152), 143 states have internal predecessors, (152), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-25 17:07:29,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 160 transitions. [2022-11-25 17:07:29,504 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 160 transitions. Word has length 28 [2022-11-25 17:07:29,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:07:29,505 INFO L495 AbstractCegarLoop]: Abstraction has 149 states and 160 transitions. [2022-11-25 17:07:29,505 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-25 17:07:29,505 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 160 transitions. [2022-11-25 17:07:29,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-25 17:07:29,506 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:07:29,506 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] [2022-11-25 17:07:29,519 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88e7b293-1926-49ea-8916-68815ea6b012/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-25 17:07:29,719 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88e7b293-1926-49ea-8916-68815ea6b012/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:07:29,720 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-11-25 17:07:29,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:07:29,720 INFO L85 PathProgramCache]: Analyzing trace with hash -984859886, now seen corresponding path program 1 times [2022-11-25 17:07:29,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:07:29,721 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681189990] [2022-11-25 17:07:29,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:07:29,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:07:29,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:07:29,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:07:29,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:07:29,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-25 17:07:29,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:07:29,847 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-25 17:07:29,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:07:29,847 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681189990] [2022-11-25 17:07:29,848 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1681189990] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:07:29,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [177119995] [2022-11-25 17:07:29,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:07:29,848 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:07:29,848 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88e7b293-1926-49ea-8916-68815ea6b012/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:07:29,849 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88e7b293-1926-49ea-8916-68815ea6b012/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:07:29,855 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88e7b293-1926-49ea-8916-68815ea6b012/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-25 17:07:30,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:07:30,008 INFO L263 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 11 conjunts are in the unsatisfiable core [2022-11-25 17:07:30,010 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:07:30,053 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-25 17:07:30,053 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 17:07:30,067 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-25 17:07:30,068 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 11 [2022-11-25 17:07:30,091 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-25 17:07:30,092 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [177119995] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 17:07:30,092 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 17:07:30,092 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 3] total 5 [2022-11-25 17:07:30,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660439584] [2022-11-25 17:07:30,092 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 17:07:30,093 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 17:07:30,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:07:30,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 17:07:30,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-25 17:07:30,096 INFO L87 Difference]: Start difference. First operand 149 states and 160 transitions. Second operand has 6 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-25 17:07:30,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:07:30,399 INFO L93 Difference]: Finished difference Result 154 states and 167 transitions. [2022-11-25 17:07:30,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 17:07:30,403 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 29 [2022-11-25 17:07:30,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:07:30,404 INFO L225 Difference]: With dead ends: 154 [2022-11-25 17:07:30,404 INFO L226 Difference]: Without dead ends: 154 [2022-11-25 17:07:30,404 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-11-25 17:07:30,405 INFO L413 NwaCegarLoop]: 148 mSDtfsCounter, 12 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-25 17:07:30,405 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 351 Invalid, 268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-25 17:07:30,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2022-11-25 17:07:30,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 152. [2022-11-25 17:07:30,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 83 states have (on average 1.891566265060241) internal successors, (157), 146 states have internal predecessors, (157), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-25 17:07:30,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 165 transitions. [2022-11-25 17:07:30,410 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 165 transitions. Word has length 29 [2022-11-25 17:07:30,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:07:30,410 INFO L495 AbstractCegarLoop]: Abstraction has 152 states and 165 transitions. [2022-11-25 17:07:30,411 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-25 17:07:30,411 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 165 transitions. [2022-11-25 17:07:30,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-25 17:07:30,412 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:07:30,412 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] [2022-11-25 17:07:30,423 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88e7b293-1926-49ea-8916-68815ea6b012/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-25 17:07:30,618 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88e7b293-1926-49ea-8916-68815ea6b012/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:07:30,618 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-11-25 17:07:30,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:07:30,619 INFO L85 PathProgramCache]: Analyzing trace with hash -984859885, now seen corresponding path program 1 times [2022-11-25 17:07:30,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:07:30,619 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637082149] [2022-11-25 17:07:30,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:07:30,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:07:30,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:07:30,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:07:30,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:07:30,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-25 17:07:30,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:07:30,866 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-25 17:07:30,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:07:30,867 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637082149] [2022-11-25 17:07:30,867 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1637082149] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:07:30,867 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1675910693] [2022-11-25 17:07:30,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:07:30,868 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:07:30,868 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88e7b293-1926-49ea-8916-68815ea6b012/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:07:30,869 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88e7b293-1926-49ea-8916-68815ea6b012/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:07:30,890 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88e7b293-1926-49ea-8916-68815ea6b012/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-25 17:07:31,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:07:31,033 INFO L263 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 16 conjunts are in the unsatisfiable core [2022-11-25 17:07:31,035 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:07:31,184 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-25 17:07:31,185 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 17:07:31,229 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 17:07:31,230 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 20 treesize of output 24 [2022-11-25 17:07:31,408 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-25 17:07:31,409 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1675910693] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 17:07:31,409 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 17:07:31,409 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 15 [2022-11-25 17:07:31,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304973055] [2022-11-25 17:07:31,410 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 17:07:31,411 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-11-25 17:07:31,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:07:31,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-11-25 17:07:31,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2022-11-25 17:07:31,412 INFO L87 Difference]: Start difference. First operand 152 states and 165 transitions. Second operand has 16 states, 15 states have (on average 3.4) internal successors, (51), 13 states have internal predecessors, (51), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2022-11-25 17:07:31,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:07:31,850 INFO L93 Difference]: Finished difference Result 159 states and 173 transitions. [2022-11-25 17:07:31,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-25 17:07:31,855 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 3.4) internal successors, (51), 13 states have internal predecessors, (51), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 29 [2022-11-25 17:07:31,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:07:31,856 INFO L225 Difference]: With dead ends: 159 [2022-11-25 17:07:31,856 INFO L226 Difference]: Without dead ends: 159 [2022-11-25 17:07:31,856 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 49 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2022-11-25 17:07:31,857 INFO L413 NwaCegarLoop]: 145 mSDtfsCounter, 21 mSDsluCounter, 1277 mSDsCounter, 0 mSdLazyCounter, 442 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 1422 SdHoareTripleChecker+Invalid, 447 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 442 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-25 17:07:31,857 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 1422 Invalid, 447 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 442 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-25 17:07:31,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2022-11-25 17:07:31,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 152. [2022-11-25 17:07:31,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 83 states have (on average 1.8795180722891567) internal successors, (156), 146 states have internal predecessors, (156), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-25 17:07:31,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 164 transitions. [2022-11-25 17:07:31,862 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 164 transitions. Word has length 29 [2022-11-25 17:07:31,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:07:31,862 INFO L495 AbstractCegarLoop]: Abstraction has 152 states and 164 transitions. [2022-11-25 17:07:31,863 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 3.4) internal successors, (51), 13 states have internal predecessors, (51), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2022-11-25 17:07:31,863 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 164 transitions. [2022-11-25 17:07:31,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-25 17:07:31,864 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:07:31,864 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] [2022-11-25 17:07:31,874 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88e7b293-1926-49ea-8916-68815ea6b012/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-25 17:07:32,070 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88e7b293-1926-49ea-8916-68815ea6b012/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-25 17:07:32,070 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-11-25 17:07:32,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:07:32,071 INFO L85 PathProgramCache]: Analyzing trace with hash -465885389, now seen corresponding path program 1 times [2022-11-25 17:07:32,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:07:32,071 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736468227] [2022-11-25 17:07:32,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:07:32,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:07:32,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:07:32,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:07:32,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:07:32,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-25 17:07:32,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:07:32,253 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-25 17:07:32,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:07:32,253 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736468227] [2022-11-25 17:07:32,253 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1736468227] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:07:32,253 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:07:32,253 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-25 17:07:32,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352320445] [2022-11-25 17:07:32,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:07:32,256 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-25 17:07:32,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:07:32,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-25 17:07:32,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-25 17:07:32,257 INFO L87 Difference]: Start difference. First operand 152 states and 164 transitions. Second operand has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-25 17:07:32,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:07:32,630 INFO L93 Difference]: Finished difference Result 152 states and 164 transitions. [2022-11-25 17:07:32,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-25 17:07:32,631 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 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 30 [2022-11-25 17:07:32,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:07:32,632 INFO L225 Difference]: With dead ends: 152 [2022-11-25 17:07:32,632 INFO L226 Difference]: Without dead ends: 152 [2022-11-25 17:07:32,632 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-11-25 17:07:32,633 INFO L413 NwaCegarLoop]: 139 mSDtfsCounter, 24 mSDsluCounter, 403 mSDsCounter, 0 mSdLazyCounter, 500 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 542 SdHoareTripleChecker+Invalid, 503 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 500 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-25 17:07:32,633 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 542 Invalid, 503 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 500 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-25 17:07:32,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2022-11-25 17:07:32,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 151. [2022-11-25 17:07:32,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 83 states have (on average 1.8674698795180722) internal successors, (155), 145 states have internal predecessors, (155), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-25 17:07:32,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 163 transitions. [2022-11-25 17:07:32,637 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 163 transitions. Word has length 30 [2022-11-25 17:07:32,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:07:32,638 INFO L495 AbstractCegarLoop]: Abstraction has 151 states and 163 transitions. [2022-11-25 17:07:32,638 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-25 17:07:32,638 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 163 transitions. [2022-11-25 17:07:32,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-25 17:07:32,639 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:07:32,639 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] [2022-11-25 17:07:32,639 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-25 17:07:32,639 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-11-25 17:07:32,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:07:32,640 INFO L85 PathProgramCache]: Analyzing trace with hash -465885388, now seen corresponding path program 1 times [2022-11-25 17:07:32,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:07:32,640 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840634284] [2022-11-25 17:07:32,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:07:32,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:07:32,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:07:32,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:07:32,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:07:32,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-25 17:07:32,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:07:32,909 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-25 17:07:32,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:07:32,910 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840634284] [2022-11-25 17:07:32,910 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [840634284] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:07:32,910 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:07:32,910 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-25 17:07:32,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096277737] [2022-11-25 17:07:32,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:07:32,911 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-25 17:07:32,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:07:32,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-25 17:07:32,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-25 17:07:32,912 INFO L87 Difference]: Start difference. First operand 151 states and 163 transitions. Second operand has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-25 17:07:33,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:07:33,312 INFO L93 Difference]: Finished difference Result 150 states and 162 transitions. [2022-11-25 17:07:33,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-25 17:07:33,313 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 states have internal predecessors, (26), 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 30 [2022-11-25 17:07:33,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:07:33,314 INFO L225 Difference]: With dead ends: 150 [2022-11-25 17:07:33,314 INFO L226 Difference]: Without dead ends: 150 [2022-11-25 17:07:33,314 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-11-25 17:07:33,315 INFO L413 NwaCegarLoop]: 139 mSDtfsCounter, 20 mSDsluCounter, 433 mSDsCounter, 0 mSdLazyCounter, 466 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 572 SdHoareTripleChecker+Invalid, 467 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 466 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-25 17:07:33,315 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 572 Invalid, 467 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 466 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-25 17:07:33,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2022-11-25 17:07:33,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2022-11-25 17:07:33,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 83 states have (on average 1.855421686746988) internal successors, (154), 144 states have internal predecessors, (154), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-25 17:07:33,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 162 transitions. [2022-11-25 17:07:33,319 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 162 transitions. Word has length 30 [2022-11-25 17:07:33,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:07:33,319 INFO L495 AbstractCegarLoop]: Abstraction has 150 states and 162 transitions. [2022-11-25 17:07:33,320 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-25 17:07:33,320 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 162 transitions. [2022-11-25 17:07:33,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-11-25 17:07:33,320 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:07:33,321 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:07:33,321 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-25 17:07:33,321 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-11-25 17:07:33,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:07:33,321 INFO L85 PathProgramCache]: Analyzing trace with hash 1959133359, now seen corresponding path program 1 times [2022-11-25 17:07:33,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:07:33,321 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508597281] [2022-11-25 17:07:33,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:07:33,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:07:33,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:07:33,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:07:33,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:07:33,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-25 17:07:33,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:07:33,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-11-25 17:07:33,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:07:33,498 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-11-25 17:07:33,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:07:33,499 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508597281] [2022-11-25 17:07:33,499 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1508597281] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:07:33,499 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1456164743] [2022-11-25 17:07:33,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:07:33,500 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:07:33,500 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88e7b293-1926-49ea-8916-68815ea6b012/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:07:33,501 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88e7b293-1926-49ea-8916-68815ea6b012/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:07:33,526 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88e7b293-1926-49ea-8916-68815ea6b012/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-25 17:07:33,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:07:33,717 INFO L263 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-25 17:07:33,719 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:07:33,754 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-25 17:07:33,754 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 17:07:33,755 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1456164743] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:07:33,755 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-25 17:07:33,755 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2022-11-25 17:07:33,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876662845] [2022-11-25 17:07:33,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:07:33,756 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 17:07:33,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:07:33,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 17:07:33,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-25 17:07:33,757 INFO L87 Difference]: Start difference. First operand 150 states and 162 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-25 17:07:33,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:07:33,770 INFO L93 Difference]: Finished difference Result 138 states and 146 transitions. [2022-11-25 17:07:33,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 17:07:33,771 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 41 [2022-11-25 17:07:33,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:07:33,772 INFO L225 Difference]: With dead ends: 138 [2022-11-25 17:07:33,772 INFO L226 Difference]: Without dead ends: 138 [2022-11-25 17:07:33,772 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-25 17:07:33,773 INFO L413 NwaCegarLoop]: 143 mSDtfsCounter, 124 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 17:07:33,773 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 170 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 17:07:33,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2022-11-25 17:07:33,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2022-11-25 17:07:33,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 76 states have (on average 1.8421052631578947) internal successors, (140), 133 states have internal predecessors, (140), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-25 17:07:33,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 146 transitions. [2022-11-25 17:07:33,778 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 146 transitions. Word has length 41 [2022-11-25 17:07:33,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:07:33,778 INFO L495 AbstractCegarLoop]: Abstraction has 138 states and 146 transitions. [2022-11-25 17:07:33,779 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-25 17:07:33,779 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 146 transitions. [2022-11-25 17:07:33,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-11-25 17:07:33,779 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:07:33,780 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:07:33,786 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88e7b293-1926-49ea-8916-68815ea6b012/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-25 17:07:33,986 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88e7b293-1926-49ea-8916-68815ea6b012/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-11-25 17:07:33,986 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-11-25 17:07:33,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:07:33,986 INFO L85 PathProgramCache]: Analyzing trace with hash -930567857, now seen corresponding path program 1 times [2022-11-25 17:07:33,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:07:33,987 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104076950] [2022-11-25 17:07:33,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:07:33,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:07:34,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:07:34,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:07:34,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:07:34,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-25 17:07:34,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:07:34,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-25 17:07:34,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:07:34,563 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-25 17:07:34,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:07:34,563 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104076950] [2022-11-25 17:07:34,563 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [104076950] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:07:34,563 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1480522464] [2022-11-25 17:07:34,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:07:34,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:07:34,564 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88e7b293-1926-49ea-8916-68815ea6b012/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:07:34,565 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88e7b293-1926-49ea-8916-68815ea6b012/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:07:34,568 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88e7b293-1926-49ea-8916-68815ea6b012/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-25 17:07:34,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:07:34,809 INFO L263 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 31 conjunts are in the unsatisfiable core [2022-11-25 17:07:34,812 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:07:34,824 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 17:07:34,836 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-25 17:07:34,855 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_1582 Int)) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| v_ArrVal_1582))) is different from true [2022-11-25 17:07:34,899 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_1582 Int)) (= |c_#valid| (store |c_old(#valid)| |c_node_create_#res#1.base| v_ArrVal_1582))) is different from true [2022-11-25 17:07:34,919 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-25 17:07:34,920 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2022-11-25 17:07:35,015 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-11-25 17:07:35,041 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_1583 Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_1583))))) is different from true [2022-11-25 17:07:35,116 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:07:35,117 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-25 17:07:35,189 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-11-25 17:07:35,218 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 17:07:35,219 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-11-25 17:07:35,232 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 21 not checked. [2022-11-25 17:07:35,233 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 17:07:37,510 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1480522464] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:07:37,510 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 17:07:37,510 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12] total 17 [2022-11-25 17:07:37,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399416566] [2022-11-25 17:07:37,510 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 17:07:37,511 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-11-25 17:07:37,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:07:37,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-11-25 17:07:37,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=221, Unknown=5, NotChecked=132, Total=420 [2022-11-25 17:07:37,512 INFO L87 Difference]: Start difference. First operand 138 states and 146 transitions. Second operand has 18 states, 17 states have (on average 3.5294117647058822) internal successors, (60), 15 states have internal predecessors, (60), 3 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2022-11-25 17:07:38,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:07:38,277 INFO L93 Difference]: Finished difference Result 146 states and 155 transitions. [2022-11-25 17:07:38,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 17:07:38,278 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 3.5294117647058822) internal successors, (60), 15 states have internal predecessors, (60), 3 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) Word has length 43 [2022-11-25 17:07:38,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:07:38,279 INFO L225 Difference]: With dead ends: 146 [2022-11-25 17:07:38,279 INFO L226 Difference]: Without dead ends: 146 [2022-11-25 17:07:38,280 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 56 SyntacticMatches, 4 SemanticMatches, 22 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=87, Invalid=304, Unknown=5, NotChecked=156, Total=552 [2022-11-25 17:07:38,280 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 559 mSDsluCounter, 331 mSDsCounter, 0 mSdLazyCounter, 561 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 559 SdHoareTripleChecker+Valid, 394 SdHoareTripleChecker+Invalid, 1176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 561 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 599 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-25 17:07:38,280 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [559 Valid, 394 Invalid, 1176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 561 Invalid, 0 Unknown, 599 Unchecked, 0.6s Time] [2022-11-25 17:07:38,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2022-11-25 17:07:38,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 128. [2022-11-25 17:07:38,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 76 states have (on average 1.7105263157894737) internal successors, (130), 123 states have internal predecessors, (130), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-25 17:07:38,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 136 transitions. [2022-11-25 17:07:38,284 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 136 transitions. Word has length 43 [2022-11-25 17:07:38,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:07:38,285 INFO L495 AbstractCegarLoop]: Abstraction has 128 states and 136 transitions. [2022-11-25 17:07:38,285 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 3.5294117647058822) internal successors, (60), 15 states have internal predecessors, (60), 3 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2022-11-25 17:07:38,285 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 136 transitions. [2022-11-25 17:07:38,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-11-25 17:07:38,286 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:07:38,286 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:07:38,302 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88e7b293-1926-49ea-8916-68815ea6b012/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-25 17:07:38,497 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88e7b293-1926-49ea-8916-68815ea6b012/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-11-25 17:07:38,497 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-11-25 17:07:38,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:07:38,498 INFO L85 PathProgramCache]: Analyzing trace with hash -930567856, now seen corresponding path program 1 times [2022-11-25 17:07:38,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:07:38,498 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561090495] [2022-11-25 17:07:38,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:07:38,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:07:38,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:07:39,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:07:39,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:07:39,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-25 17:07:39,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:07:39,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-25 17:07:39,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:07:39,313 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-25 17:07:39,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:07:39,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561090495] [2022-11-25 17:07:39,314 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [561090495] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:07:39,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1981761167] [2022-11-25 17:07:39,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:07:39,314 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:07:39,314 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88e7b293-1926-49ea-8916-68815ea6b012/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:07:39,315 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88e7b293-1926-49ea-8916-68815ea6b012/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:07:39,338 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88e7b293-1926-49ea-8916-68815ea6b012/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-25 17:07:39,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:07:39,555 INFO L263 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 26 conjunts are in the unsatisfiable core [2022-11-25 17:07:39,558 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:07:39,568 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 17:07:39,602 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-25 17:07:39,628 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_1822 Int)) (= |c_#length| (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_1822))))) is different from true [2022-11-25 17:07:39,676 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:07:39,677 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-25 17:07:39,701 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-25 17:07:39,710 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_1823 Int)) (= (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_1823) |c_#length|)) (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|))) is different from true [2022-11-25 17:07:39,754 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:07:39,755 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-25 17:07:39,882 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-25 17:07:39,894 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_1824 Int)) (= |c_#length| (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_1824))) (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|))) is different from true [2022-11-25 17:07:39,955 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:07:39,956 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-25 17:07:39,984 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 21 not checked. [2022-11-25 17:07:39,984 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 17:07:42,111 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1981761167] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:07:42,111 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 17:07:42,111 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 18 [2022-11-25 17:07:42,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371977049] [2022-11-25 17:07:42,111 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 17:07:42,112 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-11-25 17:07:42,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:07:42,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-11-25 17:07:42,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=251, Unknown=3, NotChecked=102, Total=420 [2022-11-25 17:07:42,113 INFO L87 Difference]: Start difference. First operand 128 states and 136 transitions. Second operand has 19 states, 15 states have (on average 4.4) internal successors, (66), 17 states have internal predecessors, (66), 5 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-11-25 17:07:42,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:07:42,789 INFO L93 Difference]: Finished difference Result 136 states and 145 transitions. [2022-11-25 17:07:42,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-25 17:07:42,795 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 15 states have (on average 4.4) internal successors, (66), 17 states have internal predecessors, (66), 5 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) Word has length 43 [2022-11-25 17:07:42,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:07:42,796 INFO L225 Difference]: With dead ends: 136 [2022-11-25 17:07:42,796 INFO L226 Difference]: Without dead ends: 136 [2022-11-25 17:07:42,799 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=94, Invalid=335, Unknown=3, NotChecked=120, Total=552 [2022-11-25 17:07:42,799 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 519 mSDsluCounter, 320 mSDsCounter, 0 mSdLazyCounter, 515 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 519 SdHoareTripleChecker+Valid, 379 SdHoareTripleChecker+Invalid, 887 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 515 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 357 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-25 17:07:42,800 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [519 Valid, 379 Invalid, 887 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 515 Invalid, 0 Unknown, 357 Unchecked, 0.6s Time] [2022-11-25 17:07:42,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2022-11-25 17:07:42,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 118. [2022-11-25 17:07:42,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 76 states have (on average 1.5789473684210527) internal successors, (120), 113 states have internal predecessors, (120), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-25 17:07:42,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 126 transitions. [2022-11-25 17:07:42,805 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 126 transitions. Word has length 43 [2022-11-25 17:07:42,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:07:42,805 INFO L495 AbstractCegarLoop]: Abstraction has 118 states and 126 transitions. [2022-11-25 17:07:42,805 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 15 states have (on average 4.4) internal successors, (66), 17 states have internal predecessors, (66), 5 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-11-25 17:07:42,806 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 126 transitions. [2022-11-25 17:07:42,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-11-25 17:07:42,808 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:07:42,808 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:07:42,823 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88e7b293-1926-49ea-8916-68815ea6b012/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-25 17:07:43,016 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88e7b293-1926-49ea-8916-68815ea6b012/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-11-25 17:07:43,016 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-11-25 17:07:43,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:07:43,016 INFO L85 PathProgramCache]: Analyzing trace with hash 1466883970, now seen corresponding path program 1 times [2022-11-25 17:07:43,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:07:43,017 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178518766] [2022-11-25 17:07:43,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:07:43,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:07:43,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:07:43,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:07:43,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:07:43,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-25 17:07:43,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:07:43,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-25 17:07:43,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:07:43,880 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 15 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-25 17:07:43,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:07:43,880 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178518766] [2022-11-25 17:07:43,880 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [178518766] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:07:43,881 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2094311425] [2022-11-25 17:07:43,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:07:43,881 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:07:43,881 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88e7b293-1926-49ea-8916-68815ea6b012/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:07:43,883 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88e7b293-1926-49ea-8916-68815ea6b012/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:07:43,891 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88e7b293-1926-49ea-8916-68815ea6b012/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-25 17:07:44,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:07:44,125 INFO L263 TraceCheckSpWp]: Trace formula consists of 433 conjuncts, 42 conjunts are in the unsatisfiable core [2022-11-25 17:07:44,129 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:07:44,183 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 17:07:44,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 9 treesize of output 5 [2022-11-25 17:07:44,628 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_2064 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_2064))) (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| 1)))) is different from true [2022-11-25 17:07:44,667 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:07:44,668 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-25 17:07:44,682 INFO L321 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-11-25 17:07:44,683 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 18 [2022-11-25 17:07:44,755 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-11-25 17:07:44,775 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 3 not checked. [2022-11-25 17:07:44,776 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 17:07:44,840 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2070 (Array Int Int)) (|v_node_create_~temp~0#1.base_52| Int)) (or (= (select (store |c_#valid| |v_node_create_~temp~0#1.base_52| 1) (select (select (store |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_52| v_ArrVal_2070) |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|)) 1) (not (< |v_node_create_~temp~0#1.base_52| |c_#StackHeapBarrier|)))) is different from false [2022-11-25 17:07:44,841 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2094311425] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:07:44,841 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 17:07:44,842 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 27 [2022-11-25 17:07:44,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188647848] [2022-11-25 17:07:44,842 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 17:07:44,842 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-11-25 17:07:44,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:07:44,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-11-25 17:07:44,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=623, Unknown=3, NotChecked=102, Total=812 [2022-11-25 17:07:44,844 INFO L87 Difference]: Start difference. First operand 118 states and 126 transitions. Second operand has 28 states, 25 states have (on average 2.56) internal successors, (64), 24 states have internal predecessors, (64), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-25 17:07:46,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:07:46,236 INFO L93 Difference]: Finished difference Result 223 states and 239 transitions. [2022-11-25 17:07:46,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-25 17:07:46,237 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 25 states have (on average 2.56) internal successors, (64), 24 states have internal predecessors, (64), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 46 [2022-11-25 17:07:46,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:07:46,239 INFO L225 Difference]: With dead ends: 223 [2022-11-25 17:07:46,239 INFO L226 Difference]: Without dead ends: 223 [2022-11-25 17:07:46,240 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 44 SyntacticMatches, 3 SemanticMatches, 37 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 277 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=208, Invalid=1127, Unknown=5, NotChecked=142, Total=1482 [2022-11-25 17:07:46,240 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 1373 mSDsluCounter, 619 mSDsCounter, 0 mSdLazyCounter, 1022 mSolverCounterSat, 25 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1373 SdHoareTripleChecker+Valid, 675 SdHoareTripleChecker+Invalid, 1192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1022 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 142 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-25 17:07:46,241 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1373 Valid, 675 Invalid, 1192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1022 Invalid, 3 Unknown, 142 Unchecked, 1.0s Time] [2022-11-25 17:07:46,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2022-11-25 17:07:46,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 125. [2022-11-25 17:07:46,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 83 states have (on average 1.6506024096385543) internal successors, (137), 120 states have internal predecessors, (137), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-25 17:07:46,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 143 transitions. [2022-11-25 17:07:46,246 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 143 transitions. Word has length 46 [2022-11-25 17:07:46,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:07:46,246 INFO L495 AbstractCegarLoop]: Abstraction has 125 states and 143 transitions. [2022-11-25 17:07:46,246 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 25 states have (on average 2.56) internal successors, (64), 24 states have internal predecessors, (64), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-25 17:07:46,246 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 143 transitions. [2022-11-25 17:07:46,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-11-25 17:07:46,247 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:07:46,247 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:07:46,259 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88e7b293-1926-49ea-8916-68815ea6b012/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-25 17:07:46,459 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88e7b293-1926-49ea-8916-68815ea6b012/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-11-25 17:07:46,460 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-11-25 17:07:46,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:07:46,460 INFO L85 PathProgramCache]: Analyzing trace with hash 1466883971, now seen corresponding path program 1 times [2022-11-25 17:07:46,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:07:46,460 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438526912] [2022-11-25 17:07:46,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:07:46,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:07:46,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:07:47,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:07:47,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:07:47,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-25 17:07:47,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:07:47,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-25 17:07:47,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:07:48,227 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 15 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-25 17:07:48,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:07:48,227 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438526912] [2022-11-25 17:07:48,227 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [438526912] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:07:48,228 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [724123655] [2022-11-25 17:07:48,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:07:48,228 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:07:48,228 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88e7b293-1926-49ea-8916-68815ea6b012/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:07:48,229 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88e7b293-1926-49ea-8916-68815ea6b012/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:07:48,243 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88e7b293-1926-49ea-8916-68815ea6b012/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-25 17:07:48,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:07:48,512 INFO L263 TraceCheckSpWp]: Trace formula consists of 433 conjuncts, 66 conjunts are in the unsatisfiable core [2022-11-25 17:07:48,521 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:07:48,574 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 17:07:48,581 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 17:07:49,167 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2022-11-25 17:07:49,172 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-25 17:07:49,423 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int) (v_ArrVal_2311 (Array Int Int)) (v_ArrVal_2310 (Array Int Int))) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|) (= 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_2310)) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_2311)))) is different from true [2022-11-25 17:07:49,481 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:07:49,482 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 21 [2022-11-25 17:07:49,506 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:07:49,507 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-25 17:07:49,519 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-11-25 17:07:49,520 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2022-11-25 17:07:49,532 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2022-11-25 17:07:49,602 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 22 treesize of output 10 [2022-11-25 17:07:49,609 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-11-25 17:07:49,629 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 17 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 3 not checked. [2022-11-25 17:07:49,629 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 17:07:50,726 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [724123655] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:07:50,726 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 17:07:50,726 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17] total 30 [2022-11-25 17:07:50,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933750618] [2022-11-25 17:07:50,727 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 17:07:50,727 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-11-25 17:07:50,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:07:50,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-11-25 17:07:50,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=1015, Unknown=1, NotChecked=64, Total=1190 [2022-11-25 17:07:50,728 INFO L87 Difference]: Start difference. First operand 125 states and 143 transitions. Second operand has 31 states, 28 states have (on average 2.392857142857143) internal successors, (67), 27 states have internal predecessors, (67), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-25 17:07:52,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:07:52,942 INFO L93 Difference]: Finished difference Result 204 states and 218 transitions. [2022-11-25 17:07:52,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-25 17:07:52,942 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 28 states have (on average 2.392857142857143) internal successors, (67), 27 states have internal predecessors, (67), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 46 [2022-11-25 17:07:52,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:07:52,944 INFO L225 Difference]: With dead ends: 204 [2022-11-25 17:07:52,944 INFO L226 Difference]: Without dead ends: 204 [2022-11-25 17:07:52,945 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 37 SyntacticMatches, 5 SemanticMatches, 44 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 502 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=220, Invalid=1763, Unknown=1, NotChecked=86, Total=2070 [2022-11-25 17:07:52,945 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 518 mSDsluCounter, 954 mSDsCounter, 0 mSdLazyCounter, 1798 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 518 SdHoareTripleChecker+Valid, 1017 SdHoareTripleChecker+Invalid, 1927 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1798 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 124 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-11-25 17:07:52,945 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [518 Valid, 1017 Invalid, 1927 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1798 Invalid, 0 Unknown, 124 Unchecked, 1.6s Time] [2022-11-25 17:07:52,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2022-11-25 17:07:52,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 125. [2022-11-25 17:07:52,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 83 states have (on average 1.6265060240963856) internal successors, (135), 120 states have internal predecessors, (135), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-25 17:07:52,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 141 transitions. [2022-11-25 17:07:52,950 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 141 transitions. Word has length 46 [2022-11-25 17:07:52,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:07:52,950 INFO L495 AbstractCegarLoop]: Abstraction has 125 states and 141 transitions. [2022-11-25 17:07:52,950 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 28 states have (on average 2.392857142857143) internal successors, (67), 27 states have internal predecessors, (67), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-25 17:07:52,950 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 141 transitions. [2022-11-25 17:07:52,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-11-25 17:07:52,951 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:07:52,951 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:07:52,959 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88e7b293-1926-49ea-8916-68815ea6b012/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-25 17:07:53,157 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88e7b293-1926-49ea-8916-68815ea6b012/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-11-25 17:07:53,158 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-11-25 17:07:53,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:07:53,158 INFO L85 PathProgramCache]: Analyzing trace with hash -1771238793, now seen corresponding path program 1 times [2022-11-25 17:07:53,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:07:53,159 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627038063] [2022-11-25 17:07:53,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:07:53,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:07:53,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:07:53,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:07:53,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:07:53,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-25 17:07:53,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:07:53,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-25 17:07:53,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:07:53,267 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-11-25 17:07:53,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:07:53,268 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627038063] [2022-11-25 17:07:53,268 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1627038063] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:07:53,268 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:07:53,269 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 17:07:53,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708354041] [2022-11-25 17:07:53,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:07:53,269 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 17:07:53,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:07:53,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 17:07:53,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 17:07:53,270 INFO L87 Difference]: Start difference. First operand 125 states and 141 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-25 17:07:53,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:07:53,404 INFO L93 Difference]: Finished difference Result 164 states and 176 transitions. [2022-11-25 17:07:53,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 17:07:53,404 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 47 [2022-11-25 17:07:53,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:07:53,405 INFO L225 Difference]: With dead ends: 164 [2022-11-25 17:07:53,405 INFO L226 Difference]: Without dead ends: 164 [2022-11-25 17:07:53,406 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 17:07:53,406 INFO L413 NwaCegarLoop]: 124 mSDtfsCounter, 77 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 17:07:53,406 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 258 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 17:07:53,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2022-11-25 17:07:53,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 121. [2022-11-25 17:07:53,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 79 states have (on average 1.5696202531645569) internal successors, (124), 116 states have internal predecessors, (124), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-25 17:07:53,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 130 transitions. [2022-11-25 17:07:53,410 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 130 transitions. Word has length 47 [2022-11-25 17:07:53,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:07:53,410 INFO L495 AbstractCegarLoop]: Abstraction has 121 states and 130 transitions. [2022-11-25 17:07:53,410 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-25 17:07:53,410 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 130 transitions. [2022-11-25 17:07:53,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-11-25 17:07:53,411 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:07:53,411 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:07:53,411 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-25 17:07:53,411 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-11-25 17:07:53,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:07:53,412 INFO L85 PathProgramCache]: Analyzing trace with hash -1352997608, now seen corresponding path program 1 times [2022-11-25 17:07:53,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:07:53,412 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361461397] [2022-11-25 17:07:53,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:07:53,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:07:53,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:07:53,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:07:53,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:07:53,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-25 17:07:53,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:07:53,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-25 17:07:53,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:07:53,602 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-11-25 17:07:53,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:07:53,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361461397] [2022-11-25 17:07:53,602 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361461397] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:07:53,603 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:07:53,603 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-25 17:07:53,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032822747] [2022-11-25 17:07:53,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:07:53,603 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 17:07:53,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:07:53,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 17:07:53,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-25 17:07:53,605 INFO L87 Difference]: Start difference. First operand 121 states and 130 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, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-25 17:07:53,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:07:53,880 INFO L93 Difference]: Finished difference Result 133 states and 143 transitions. [2022-11-25 17:07:53,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 17:07:53,881 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, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 49 [2022-11-25 17:07:53,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:07:53,881 INFO L225 Difference]: With dead ends: 133 [2022-11-25 17:07:53,882 INFO L226 Difference]: Without dead ends: 133 [2022-11-25 17:07:53,882 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-25 17:07:53,882 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 85 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 327 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-25 17:07:53,883 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 307 Invalid, 333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 327 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-25 17:07:53,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2022-11-25 17:07:53,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 115. [2022-11-25 17:07:53,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 79 states have (on average 1.4936708860759493) internal successors, (118), 110 states have internal predecessors, (118), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-25 17:07:53,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 124 transitions. [2022-11-25 17:07:53,886 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 124 transitions. Word has length 49 [2022-11-25 17:07:53,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:07:53,886 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 124 transitions. [2022-11-25 17:07:53,886 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, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-25 17:07:53,886 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 124 transitions. [2022-11-25 17:07:53,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-11-25 17:07:53,887 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:07:53,887 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:07:53,887 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-25 17:07:53,887 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-11-25 17:07:53,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:07:53,887 INFO L85 PathProgramCache]: Analyzing trace with hash -1352997607, now seen corresponding path program 1 times [2022-11-25 17:07:53,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:07:53,888 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156268138] [2022-11-25 17:07:53,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:07:53,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:07:53,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:07:54,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:07:54,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:07:54,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-25 17:07:54,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:07:54,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-25 17:07:54,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:07:54,046 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-11-25 17:07:54,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:07:54,047 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156268138] [2022-11-25 17:07:54,047 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [156268138] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:07:54,047 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:07:54,047 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 17:07:54,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993401710] [2022-11-25 17:07:54,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:07:54,048 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 17:07:54,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:07:54,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 17:07:54,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:07:54,049 INFO L87 Difference]: Start difference. First operand 115 states and 124 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-25 17:07:54,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:07:54,178 INFO L93 Difference]: Finished difference Result 114 states and 122 transitions. [2022-11-25 17:07:54,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 17:07:54,179 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 49 [2022-11-25 17:07:54,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:07:54,180 INFO L225 Difference]: With dead ends: 114 [2022-11-25 17:07:54,180 INFO L226 Difference]: Without dead ends: 114 [2022-11-25 17:07:54,180 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-25 17:07:54,180 INFO L413 NwaCegarLoop]: 114 mSDtfsCounter, 99 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 17:07:54,181 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 277 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 17:07:54,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2022-11-25 17:07:54,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2022-11-25 17:07:54,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 78 states have (on average 1.4871794871794872) internal successors, (116), 109 states have internal predecessors, (116), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-25 17:07:54,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 122 transitions. [2022-11-25 17:07:54,184 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 122 transitions. Word has length 49 [2022-11-25 17:07:54,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:07:54,184 INFO L495 AbstractCegarLoop]: Abstraction has 114 states and 122 transitions. [2022-11-25 17:07:54,184 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-25 17:07:54,184 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 122 transitions. [2022-11-25 17:07:54,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-11-25 17:07:54,185 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:07:54,185 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:07:54,185 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-25 17:07:54,185 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-11-25 17:07:54,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:07:54,186 INFO L85 PathProgramCache]: Analyzing trace with hash -1351857860, now seen corresponding path program 1 times [2022-11-25 17:07:54,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:07:54,186 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783244729] [2022-11-25 17:07:54,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:07:54,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:07:54,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:07:54,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:07:54,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:07:54,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-25 17:07:54,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:07:54,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-25 17:07:54,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:07:54,401 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-11-25 17:07:54,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:07:54,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783244729] [2022-11-25 17:07:54,402 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [783244729] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:07:54,402 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:07:54,402 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-25 17:07:54,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194290969] [2022-11-25 17:07:54,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:07:54,403 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 17:07:54,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:07:54,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 17:07:54,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-25 17:07:54,404 INFO L87 Difference]: Start difference. First operand 114 states and 122 transitions. Second operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-25 17:07:54,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:07:54,546 INFO L93 Difference]: Finished difference Result 111 states and 118 transitions. [2022-11-25 17:07:54,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 17:07:54,547 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 49 [2022-11-25 17:07:54,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:07:54,548 INFO L225 Difference]: With dead ends: 111 [2022-11-25 17:07:54,548 INFO L226 Difference]: Without dead ends: 111 [2022-11-25 17:07:54,548 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-11-25 17:07:54,549 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 177 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 17:07:54,549 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 219 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 17:07:54,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2022-11-25 17:07:54,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2022-11-25 17:07:54,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 77 states have (on average 1.4545454545454546) internal successors, (112), 106 states have internal predecessors, (112), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-25 17:07:54,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 118 transitions. [2022-11-25 17:07:54,552 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 118 transitions. Word has length 49 [2022-11-25 17:07:54,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:07:54,552 INFO L495 AbstractCegarLoop]: Abstraction has 111 states and 118 transitions. [2022-11-25 17:07:54,552 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-25 17:07:54,553 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 118 transitions. [2022-11-25 17:07:54,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-11-25 17:07:54,553 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:07:54,553 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:07:54,553 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-11-25 17:07:54,553 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-11-25 17:07:54,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:07:54,554 INFO L85 PathProgramCache]: Analyzing trace with hash 1042077693, now seen corresponding path program 1 times [2022-11-25 17:07:54,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:07:54,554 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390206385] [2022-11-25 17:07:54,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:07:54,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:07:54,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:07:54,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:07:54,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:07:54,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-25 17:07:54,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:07:54,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-25 17:07:54,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:07:54,675 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-11-25 17:07:54,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:07:54,676 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390206385] [2022-11-25 17:07:54,676 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1390206385] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:07:54,676 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:07:54,676 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 17:07:54,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988013433] [2022-11-25 17:07:54,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:07:54,677 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 17:07:54,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:07:54,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 17:07:54,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:07:54,678 INFO L87 Difference]: Start difference. First operand 111 states and 118 transitions. Second operand has 5 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-25 17:07:54,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:07:54,872 INFO L93 Difference]: Finished difference Result 169 states and 181 transitions. [2022-11-25 17:07:54,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 17:07:54,874 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 50 [2022-11-25 17:07:54,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:07:54,875 INFO L225 Difference]: With dead ends: 169 [2022-11-25 17:07:54,875 INFO L226 Difference]: Without dead ends: 169 [2022-11-25 17:07:54,876 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-25 17:07:54,876 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 163 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 17:07:54,876 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 215 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 17:07:54,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2022-11-25 17:07:54,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 110. [2022-11-25 17:07:54,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 77 states have (on average 1.4415584415584415) internal successors, (111), 105 states have internal predecessors, (111), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-25 17:07:54,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 117 transitions. [2022-11-25 17:07:54,879 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 117 transitions. Word has length 50 [2022-11-25 17:07:54,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:07:54,880 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 117 transitions. [2022-11-25 17:07:54,880 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-25 17:07:54,880 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 117 transitions. [2022-11-25 17:07:54,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-11-25 17:07:54,880 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:07:54,880 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:07:54,880 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-11-25 17:07:54,880 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-11-25 17:07:54,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:07:54,881 INFO L85 PathProgramCache]: Analyzing trace with hash 1042077694, now seen corresponding path program 1 times [2022-11-25 17:07:54,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:07:54,881 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534915254] [2022-11-25 17:07:54,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:07:54,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:07:54,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:07:55,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:07:55,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:07:55,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-25 17:07:55,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:07:55,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-25 17:07:55,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:07:55,055 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-11-25 17:07:55,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:07:55,055 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534915254] [2022-11-25 17:07:55,055 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534915254] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:07:55,055 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:07:55,055 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 17:07:55,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638013993] [2022-11-25 17:07:55,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:07:55,056 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 17:07:55,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:07:55,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 17:07:55,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:07:55,057 INFO L87 Difference]: Start difference. First operand 110 states and 117 transitions. Second operand has 5 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-25 17:07:55,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:07:55,241 INFO L93 Difference]: Finished difference Result 109 states and 116 transitions. [2022-11-25 17:07:55,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 17:07:55,241 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 50 [2022-11-25 17:07:55,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:07:55,242 INFO L225 Difference]: With dead ends: 109 [2022-11-25 17:07:55,242 INFO L226 Difference]: Without dead ends: 109 [2022-11-25 17:07:55,242 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-25 17:07:55,243 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 82 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 17:07:55,243 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 202 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 17:07:55,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2022-11-25 17:07:55,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2022-11-25 17:07:55,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 77 states have (on average 1.4285714285714286) internal successors, (110), 104 states have internal predecessors, (110), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-25 17:07:55,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 116 transitions. [2022-11-25 17:07:55,246 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 116 transitions. Word has length 50 [2022-11-25 17:07:55,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:07:55,246 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 116 transitions. [2022-11-25 17:07:55,246 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-25 17:07:55,246 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 116 transitions. [2022-11-25 17:07:55,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-11-25 17:07:55,247 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:07:55,247 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:07:55,247 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-11-25 17:07:55,247 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-11-25 17:07:55,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:07:55,248 INFO L85 PathProgramCache]: Analyzing trace with hash -2055329845, now seen corresponding path program 1 times [2022-11-25 17:07:55,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:07:55,248 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52942058] [2022-11-25 17:07:55,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:07:55,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:07:55,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:07:55,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:07:55,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:07:55,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-25 17:07:55,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:07:55,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-25 17:07:55,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:07:55,578 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-25 17:07:55,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:07:55,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52942058] [2022-11-25 17:07:55,579 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [52942058] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:07:55,579 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:07:55,580 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-25 17:07:55,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232348465] [2022-11-25 17:07:55,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:07:55,580 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 17:07:55,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:07:55,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 17:07:55,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-25 17:07:55,586 INFO L87 Difference]: Start difference. First operand 109 states and 116 transitions. Second operand has 7 states, 6 states have (on average 6.333333333333333) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-25 17:07:55,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:07:55,844 INFO L93 Difference]: Finished difference Result 103 states and 110 transitions. [2022-11-25 17:07:55,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 17:07:55,845 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 6.333333333333333) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 51 [2022-11-25 17:07:55,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:07:55,846 INFO L225 Difference]: With dead ends: 103 [2022-11-25 17:07:55,846 INFO L226 Difference]: Without dead ends: 103 [2022-11-25 17:07:55,846 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-25 17:07:55,847 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 76 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 17:07:55,847 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 310 Invalid, 259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 17:07:55,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2022-11-25 17:07:55,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2022-11-25 17:07:55,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 77 states have (on average 1.3506493506493507) internal successors, (104), 98 states have internal predecessors, (104), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-25 17:07:55,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 110 transitions. [2022-11-25 17:07:55,851 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 110 transitions. Word has length 51 [2022-11-25 17:07:55,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:07:55,851 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 110 transitions. [2022-11-25 17:07:55,851 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 6.333333333333333) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-25 17:07:55,851 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 110 transitions. [2022-11-25 17:07:55,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-11-25 17:07:55,852 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:07:55,852 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:07:55,852 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-11-25 17:07:55,852 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-11-25 17:07:55,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:07:55,852 INFO L85 PathProgramCache]: Analyzing trace with hash 512975501, now seen corresponding path program 1 times [2022-11-25 17:07:55,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:07:55,853 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721831179] [2022-11-25 17:07:55,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:07:55,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:07:55,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:07:57,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:07:57,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:07:57,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-25 17:07:57,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:07:57,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-25 17:07:57,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:07:58,384 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 9 proven. 14 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-25 17:07:58,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:07:58,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721831179] [2022-11-25 17:07:58,384 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [721831179] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:07:58,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [766184143] [2022-11-25 17:07:58,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:07:58,385 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:07:58,385 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88e7b293-1926-49ea-8916-68815ea6b012/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:07:58,387 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88e7b293-1926-49ea-8916-68815ea6b012/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:07:58,395 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88e7b293-1926-49ea-8916-68815ea6b012/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-25 17:07:58,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:07:58,717 INFO L263 TraceCheckSpWp]: Trace formula consists of 497 conjuncts, 98 conjunts are in the unsatisfiable core [2022-11-25 17:07:58,721 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:07:58,775 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 17:07:59,094 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-25 17:07:59,095 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-25 17:07:59,271 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-11-25 17:07:59,420 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 17:07:59,420 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 35 treesize of output 34 [2022-11-25 17:07:59,629 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 17:07:59,630 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2022-11-25 17:07:59,713 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:07:59,714 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 26 [2022-11-25 17:07:59,898 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-25 17:07:59,899 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 39 treesize of output 22 [2022-11-25 17:07:59,905 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-25 17:08:00,179 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int) (v_ArrVal_3634 (Array Int Int)) (v_ArrVal_3635 (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|))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_3635)) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_3634)) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2022-11-25 17:08:00,232 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:08:00,245 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-25 17:08:00,246 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 45 treesize of output 43 [2022-11-25 17:08:00,256 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:08:00,257 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-25 17:08:00,296 INFO L321 Elim1Store]: treesize reduction 76, result has 36.1 percent of original size [2022-11-25 17:08:00,296 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 36 treesize of output 52 [2022-11-25 17:08:00,390 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-25 17:08:00,576 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-25 17:08:00,576 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 25 [2022-11-25 17:08:00,750 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 10 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2022-11-25 17:08:00,750 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 17:08:00,960 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [766184143] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:08:00,960 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 17:08:00,960 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 47 [2022-11-25 17:08:00,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457545371] [2022-11-25 17:08:00,960 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 17:08:00,961 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2022-11-25 17:08:00,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:08:00,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2022-11-25 17:08:00,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=176, Invalid=2083, Unknown=1, NotChecked=92, Total=2352 [2022-11-25 17:08:00,963 INFO L87 Difference]: Start difference. First operand 103 states and 110 transitions. Second operand has 48 states, 43 states have (on average 2.0) internal successors, (86), 41 states have internal predecessors, (86), 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-11-25 17:08:04,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:08:04,301 INFO L93 Difference]: Finished difference Result 121 states and 129 transitions. [2022-11-25 17:08:04,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-25 17:08:04,302 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 43 states have (on average 2.0) internal successors, (86), 41 states have internal predecessors, (86), 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 53 [2022-11-25 17:08:04,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:08:04,303 INFO L225 Difference]: With dead ends: 121 [2022-11-25 17:08:04,303 INFO L226 Difference]: Without dead ends: 121 [2022-11-25 17:08:04,304 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 48 SyntacticMatches, 4 SemanticMatches, 60 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1045 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=396, Invalid=3267, Unknown=1, NotChecked=118, Total=3782 [2022-11-25 17:08:04,305 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 328 mSDsluCounter, 1173 mSDsCounter, 0 mSdLazyCounter, 1939 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 328 SdHoareTripleChecker+Valid, 1219 SdHoareTripleChecker+Invalid, 2084 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 1939 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 126 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-11-25 17:08:04,305 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [328 Valid, 1219 Invalid, 2084 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 1939 Invalid, 0 Unknown, 126 Unchecked, 1.8s Time] [2022-11-25 17:08:04,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2022-11-25 17:08:04,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 102. [2022-11-25 17:08:04,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 77 states have (on average 1.3376623376623376) internal successors, (103), 97 states have internal predecessors, (103), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-25 17:08:04,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 109 transitions. [2022-11-25 17:08:04,308 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 109 transitions. Word has length 53 [2022-11-25 17:08:04,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:08:04,309 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 109 transitions. [2022-11-25 17:08:04,309 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 43 states have (on average 2.0) internal successors, (86), 41 states have internal predecessors, (86), 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-11-25 17:08:04,309 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 109 transitions. [2022-11-25 17:08:04,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-11-25 17:08:04,310 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:08:04,310 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:08:04,319 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88e7b293-1926-49ea-8916-68815ea6b012/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-25 17:08:04,517 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88e7b293-1926-49ea-8916-68815ea6b012/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:08:04,517 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-11-25 17:08:04,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:08:04,517 INFO L85 PathProgramCache]: Analyzing trace with hash 512975502, now seen corresponding path program 1 times [2022-11-25 17:08:04,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:08:04,517 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013404999] [2022-11-25 17:08:04,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:08:04,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:08:04,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:06,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:08:06,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:06,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-25 17:08:06,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:06,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-25 17:08:06,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:07,970 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-25 17:08:07,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:08:07,971 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013404999] [2022-11-25 17:08:07,971 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1013404999] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:08:07,971 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [664069770] [2022-11-25 17:08:07,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:08:07,972 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:08:07,972 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88e7b293-1926-49ea-8916-68815ea6b012/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:08:07,979 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88e7b293-1926-49ea-8916-68815ea6b012/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:08:07,982 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88e7b293-1926-49ea-8916-68815ea6b012/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-25 17:08:08,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:08,332 INFO L263 TraceCheckSpWp]: Trace formula consists of 497 conjuncts, 115 conjunts are in the unsatisfiable core [2022-11-25 17:08:08,340 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:08:08,399 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 17:08:08,835 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-25 17:08:08,835 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-25 17:08:09,050 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-11-25 17:08:09,074 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-11-25 17:08:09,234 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 17:08:09,235 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 60 treesize of output 55 [2022-11-25 17:08:09,242 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 33 [2022-11-25 17:08:09,544 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 17:08:09,544 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 53 treesize of output 50 [2022-11-25 17:08:09,553 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 33 [2022-11-25 17:08:09,697 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:08:09,698 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2022-11-25 17:08:09,703 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:08:09,707 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 37 [2022-11-25 17:08:09,979 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-25 17:08:09,980 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 73 treesize of output 40 [2022-11-25 17:08:09,993 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2022-11-25 17:08:10,292 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_3937 (Array Int Int)) (|node_create_~temp~0#1.base| Int) (v_ArrVal_3936 (Array Int Int))) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|) (= 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_3937)) (= (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_3936) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-25 17:08:10,349 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:08:10,350 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:08:10,351 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:08:10,352 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 47 [2022-11-25 17:08:10,360 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:08:10,371 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-25 17:08:10,372 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-11-25 17:08:10,378 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:08:10,379 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 32 treesize of output 27 [2022-11-25 17:08:10,400 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-11-25 17:08:10,401 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2022-11-25 17:08:10,772 INFO L321 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-11-25 17:08:10,772 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 81 treesize of output 47 [2022-11-25 17:08:10,786 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-25 17:08:10,787 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 23 [2022-11-25 17:08:10,941 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 10 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2022-11-25 17:08:10,941 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 17:08:11,678 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [664069770] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:08:11,678 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 17:08:11,678 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 26] total 51 [2022-11-25 17:08:11,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011051121] [2022-11-25 17:08:11,678 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 17:08:11,679 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2022-11-25 17:08:11,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:08:11,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2022-11-25 17:08:11,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=3013, Unknown=1, NotChecked=110, Total=3306 [2022-11-25 17:08:11,681 INFO L87 Difference]: Start difference. First operand 102 states and 109 transitions. Second operand has 52 states, 47 states have (on average 1.9148936170212767) internal successors, (90), 45 states have internal predecessors, (90), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-25 17:08:17,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:08:17,011 INFO L93 Difference]: Finished difference Result 101 states and 108 transitions. [2022-11-25 17:08:17,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-25 17:08:17,013 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 47 states have (on average 1.9148936170212767) internal successors, (90), 45 states have internal predecessors, (90), 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 53 [2022-11-25 17:08:17,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:08:17,013 INFO L225 Difference]: With dead ends: 101 [2022-11-25 17:08:17,014 INFO L226 Difference]: Without dead ends: 101 [2022-11-25 17:08:17,015 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 39 SyntacticMatches, 4 SemanticMatches, 72 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1296 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=421, Invalid=4838, Unknown=1, NotChecked=142, Total=5402 [2022-11-25 17:08:17,015 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 350 mSDsluCounter, 1195 mSDsCounter, 0 mSdLazyCounter, 2108 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 350 SdHoareTripleChecker+Valid, 1245 SdHoareTripleChecker+Invalid, 2245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 2108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 105 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-11-25 17:08:17,016 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [350 Valid, 1245 Invalid, 2245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 2108 Invalid, 0 Unknown, 105 Unchecked, 2.1s Time] [2022-11-25 17:08:17,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2022-11-25 17:08:17,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2022-11-25 17:08:17,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 77 states have (on average 1.3246753246753247) internal successors, (102), 96 states have internal predecessors, (102), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-25 17:08:17,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 108 transitions. [2022-11-25 17:08:17,019 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 108 transitions. Word has length 53 [2022-11-25 17:08:17,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:08:17,019 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 108 transitions. [2022-11-25 17:08:17,020 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 47 states have (on average 1.9148936170212767) internal successors, (90), 45 states have internal predecessors, (90), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-25 17:08:17,020 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 108 transitions. [2022-11-25 17:08:17,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-11-25 17:08:17,020 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:08:17,021 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:08:17,028 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88e7b293-1926-49ea-8916-68815ea6b012/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-11-25 17:08:17,227 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88e7b293-1926-49ea-8916-68815ea6b012/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-11-25 17:08:17,228 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-11-25 17:08:17,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:08:17,228 INFO L85 PathProgramCache]: Analyzing trace with hash 167962770, now seen corresponding path program 1 times [2022-11-25 17:08:17,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:08:17,228 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675363535] [2022-11-25 17:08:17,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:08:17,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:08:17,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:19,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:08:19,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:19,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-25 17:08:19,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:19,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-25 17:08:19,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:20,693 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 21 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-25 17:08:20,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:08:20,693 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675363535] [2022-11-25 17:08:20,693 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [675363535] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:08:20,693 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1449378057] [2022-11-25 17:08:20,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:08:20,693 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:08:20,694 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88e7b293-1926-49ea-8916-68815ea6b012/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:08:20,695 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88e7b293-1926-49ea-8916-68815ea6b012/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:08:20,697 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88e7b293-1926-49ea-8916-68815ea6b012/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-11-25 17:08:21,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:21,058 INFO L263 TraceCheckSpWp]: Trace formula consists of 528 conjuncts, 116 conjunts are in the unsatisfiable core [2022-11-25 17:08:21,063 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:08:21,069 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 17:08:21,080 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-25 17:08:21,283 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-25 17:08:21,284 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-25 17:08:21,480 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 17:08:21,731 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:08:21,747 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-25 17:08:21,747 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 29 [2022-11-25 17:08:22,007 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 17:08:22,217 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 17:08:22,220 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 43 treesize of output 40 [2022-11-25 17:08:22,528 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 17:08:22,529 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 36 treesize of output 35 [2022-11-25 17:08:22,669 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:08:22,671 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 39 treesize of output 30 [2022-11-25 17:08:22,954 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-25 17:08:22,954 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 58 treesize of output 25 [2022-11-25 17:08:22,962 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:08:22,963 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-25 17:08:22,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-11-25 17:08:36,071 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:08:36,130 INFO L321 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2022-11-25 17:08:36,131 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 51 [2022-11-25 17:08:36,210 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:08:36,217 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:08:36,316 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-11-25 17:08:36,317 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 33 [2022-11-25 17:08:36,338 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:08:36,339 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2022-11-25 17:08:38,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-11-25 17:08:42,929 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-25 17:08:42,929 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 2 case distinctions, treesize of input 192 treesize of output 131 [2022-11-25 17:08:42,968 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 116 treesize of output 100 [2022-11-25 17:08:43,860 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 17:08:43,860 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 117 treesize of output 103 [2022-11-25 17:08:44,090 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 17:08:44,090 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 117 treesize of output 103 [2022-11-25 17:08:44,566 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-11-25 17:08:45,015 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2022-11-25 17:08:45,034 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 9 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-25 17:08:45,035 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 17:08:47,937 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4248 (Array Int Int)) (v_ArrVal_4249 (Array Int Int))) (= (select |c_#valid| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_4248) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_4249) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) 1)) is different from false [2022-11-25 17:08:49,972 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4246 (Array Int Int)) (v_ArrVal_4248 (Array Int Int)) (v_ArrVal_4249 (Array Int Int))) (= (select |c_#valid| (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_4246) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_4248) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_4249) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) 1)) is different from false [2022-11-25 17:08:52,020 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4246 (Array Int Int)) (v_ArrVal_4248 (Array Int Int)) (v_ArrVal_4249 (Array Int Int))) (= (select |c_#valid| (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_4246) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_4248) |c_ULTIMATE.start_dll_circular_insert_#t~mem11#1.base| v_ArrVal_4249) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) 1)) is different from false [2022-11-25 17:08:52,066 INFO L321 Elim1Store]: treesize reduction 5, result has 80.0 percent of original size [2022-11-25 17:08:52,066 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 28 [2022-11-25 17:08:57,776 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1449378057] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:08:57,776 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 17:08:57,776 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 33] total 61 [2022-11-25 17:08:57,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652798614] [2022-11-25 17:08:57,777 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 17:08:57,777 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2022-11-25 17:08:57,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:08:57,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2022-11-25 17:08:57,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=248, Invalid=4370, Unknown=86, NotChecked=408, Total=5112 [2022-11-25 17:08:57,780 INFO L87 Difference]: Start difference. First operand 101 states and 108 transitions. Second operand has 62 states, 58 states have (on average 1.6206896551724137) internal successors, (94), 53 states have internal predecessors, (94), 5 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-11-25 17:09:26,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:09:26,102 INFO L93 Difference]: Finished difference Result 225 states and 239 transitions. [2022-11-25 17:09:26,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-11-25 17:09:26,102 INFO L78 Accepts]: Start accepts. Automaton has has 62 states, 58 states have (on average 1.6206896551724137) internal successors, (94), 53 states have internal predecessors, (94), 5 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 57 [2022-11-25 17:09:26,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:09:26,103 INFO L225 Difference]: With dead ends: 225 [2022-11-25 17:09:26,103 INFO L226 Difference]: Without dead ends: 225 [2022-11-25 17:09:26,106 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 38 SyntacticMatches, 5 SemanticMatches, 91 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1726 ImplicationChecksByTransitivity, 50.6s TimeCoverageRelationStatistics Valid=673, Invalid=7263, Unknown=86, NotChecked=534, Total=8556 [2022-11-25 17:09:26,107 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 947 mSDsluCounter, 1283 mSDsCounter, 0 mSdLazyCounter, 2418 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 947 SdHoareTripleChecker+Valid, 1323 SdHoareTripleChecker+Invalid, 2489 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 2418 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.4s IncrementalHoareTripleChecker+Time [2022-11-25 17:09:26,107 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [947 Valid, 1323 Invalid, 2489 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 2418 Invalid, 0 Unknown, 0 Unchecked, 11.4s Time] [2022-11-25 17:09:26,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2022-11-25 17:09:26,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 104. [2022-11-25 17:09:26,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 81 states have (on average 1.308641975308642) internal successors, (106), 99 states have internal predecessors, (106), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-25 17:09:26,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 112 transitions. [2022-11-25 17:09:26,111 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 112 transitions. Word has length 57 [2022-11-25 17:09:26,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:09:26,111 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 112 transitions. [2022-11-25 17:09:26,112 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 62 states, 58 states have (on average 1.6206896551724137) internal successors, (94), 53 states have internal predecessors, (94), 5 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-11-25 17:09:26,112 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 112 transitions. [2022-11-25 17:09:26,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-11-25 17:09:26,112 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:09:26,113 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:09:26,123 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88e7b293-1926-49ea-8916-68815ea6b012/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-11-25 17:09:26,319 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88e7b293-1926-49ea-8916-68815ea6b012/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-11-25 17:09:26,319 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-11-25 17:09:26,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:09:26,320 INFO L85 PathProgramCache]: Analyzing trace with hash 167962771, now seen corresponding path program 1 times [2022-11-25 17:09:26,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:09:26,320 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565245181] [2022-11-25 17:09:26,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:09:26,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:09:26,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:32,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:09:32,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:33,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-25 17:09:33,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:34,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-25 17:09:34,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:37,471 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 21 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-25 17:09:37,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:09:37,472 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565245181] [2022-11-25 17:09:37,472 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [565245181] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:09:37,472 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1412307086] [2022-11-25 17:09:37,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:09:37,473 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:09:37,473 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88e7b293-1926-49ea-8916-68815ea6b012/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:09:37,475 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88e7b293-1926-49ea-8916-68815ea6b012/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:09:37,478 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88e7b293-1926-49ea-8916-68815ea6b012/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-11-25 17:09:37,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:37,867 INFO L263 TraceCheckSpWp]: Trace formula consists of 528 conjuncts, 127 conjunts are in the unsatisfiable core [2022-11-25 17:09:37,872 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:09:37,900 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 17:09:37,937 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-25 17:09:38,988 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-25 17:09:38,989 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-25 17:09:39,814 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 17:09:41,172 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:09:41,254 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-25 17:09:41,255 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 29 [2022-11-25 17:09:42,415 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 17:09:43,118 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 17:09:43,118 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 43 treesize of output 40 [2022-11-25 17:09:44,372 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 17:09:44,373 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 36 treesize of output 35 [2022-11-25 17:09:44,916 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:09:44,917 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 39 treesize of output 30 [2022-11-25 17:09:46,173 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-25 17:09:46,173 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 67 treesize of output 30 [2022-11-25 17:09:46,190 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-25 17:09:46,207 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:09:46,208 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-25 17:09:46,220 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-25 17:10:52,520 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:10:52,575 INFO L321 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2022-11-25 17:10:52,575 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 77 treesize of output 58 [2022-11-25 17:10:52,618 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:10:52,619 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2022-11-25 17:10:52,668 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:10:52,674 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:10:52,760 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-11-25 17:10:52,760 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 33 [2022-11-25 17:10:52,780 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:10:52,781 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2022-11-25 17:11:00,856 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-25 17:11:00,856 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 2 case distinctions, treesize of input 206 treesize of output 143 [2022-11-25 17:11:00,906 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:11:00,907 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 27 [2022-11-25 17:11:00,936 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 120 treesize of output 100 [2022-11-25 17:11:02,066 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-25 17:11:02,067 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-11-25 17:11:02,089 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-25 17:11:02,168 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 17:11:02,168 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 117 treesize of output 103 [2022-11-25 17:11:03,071 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 17:11:03,071 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 117 treesize of output 103 [2022-11-25 17:11:03,112 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:11:03,113 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-25 17:11:03,689 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-11-25 17:11:03,712 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-25 17:11:04,281 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2022-11-25 17:11:04,306 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-25 17:11:05,302 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 9 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-25 17:11:05,302 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 17:11:06,926 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_4562 (Array Int Int)) (v_ArrVal_4563 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_4562) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 12) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_4563) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (forall ((v_ArrVal_4562 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_4562) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8)))) is different from false [2022-11-25 17:11:27,591 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1412307086] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:11:27,591 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 17:11:27,591 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 34] total 65 [2022-11-25 17:11:27,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687945238] [2022-11-25 17:11:27,591 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 17:11:27,592 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2022-11-25 17:11:27,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:11:27,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2022-11-25 17:11:27,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=283, Invalid=5681, Unknown=46, NotChecked=152, Total=6162 [2022-11-25 17:11:27,595 INFO L87 Difference]: Start difference. First operand 104 states and 112 transitions. Second operand has 66 states, 62 states have (on average 1.5483870967741935) internal successors, (96), 57 states have internal predecessors, (96), 5 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-11-25 17:11:29,638 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 17:11:37,939 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.51s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 17:11:41,044 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 17:11:46,241 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.74s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 17:11:49,793 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 17:11:52,060 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 17:11:55,210 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 17:11:59,555 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 17:12:04,511 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 17:12:10,067 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.13s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 17:12:15,259 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.65s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 17:12:20,054 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 17:12:26,016 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.71s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 17:12:31,313 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.73s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 17:12:36,463 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 17:12:38,742 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 17:12:41,098 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.18s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 17:12:45,248 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.15s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 17:12:47,934 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 17:12:50,542 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.14s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 17:12:53,070 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.19s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 17:12:55,422 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 17:12:56,975 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 17:12:59,422 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 17:13:01,990 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 17:13:05,496 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 17:13:08,426 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 17:13:12,277 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 17:13:14,612 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 17:13:18,993 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 17:13:21,390 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.15s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 17:13:24,027 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 17:13:26,199 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 17:13:29,498 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 17:13:31,911 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 17:13:34,136 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 17:13:36,352 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 17:13:39,391 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.75s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 17:13:42,118 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.32s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 17:13:44,560 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 17:13:47,024 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.20s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 17:13:49,192 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 17:13:52,251 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.50s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 17:13:54,392 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 17:13:58,314 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.51s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 17:14:00,997 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 17:14:04,215 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.45s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 17:14:06,374 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 17:14:09,166 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.69s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 17:14:11,863 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 17:14:14,382 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.26s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 17:14:16,846 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 17:14:19,762 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.73s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 17:14:21,947 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 17:14:24,153 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 17:14:26,379 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 17:14:29,189 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.44s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 17:14:31,386 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 17:14:34,826 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 17:14:37,166 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.31s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 17:14:39,723 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.28s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 17:14:43,377 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.31s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 17:14:45,732 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 17:14:49,118 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.86s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 17:14:51,655 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 17:14:54,907 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 17:14:57,038 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 17:14:59,145 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 17:15:01,771 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.53s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 17:15:02,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:15:02,094 INFO L93 Difference]: Finished difference Result 223 states and 240 transitions. [2022-11-25 17:15:02,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-11-25 17:15:02,095 INFO L78 Accepts]: Start accepts. Automaton has has 66 states, 62 states have (on average 1.5483870967741935) internal successors, (96), 57 states have internal predecessors, (96), 5 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 57 [2022-11-25 17:15:02,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:15:02,097 INFO L225 Difference]: With dead ends: 223 [2022-11-25 17:15:02,097 INFO L226 Difference]: Without dead ends: 223 [2022-11-25 17:15:02,102 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 30 SyntacticMatches, 6 SemanticMatches, 99 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1919 ImplicationChecksByTransitivity, 138.9s TimeCoverageRelationStatistics Valid=728, Invalid=9130, Unknown=46, NotChecked=196, Total=10100 [2022-11-25 17:15:02,102 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 965 mSDsluCounter, 1307 mSDsCounter, 0 mSdLazyCounter, 2849 mSolverCounterSat, 81 mSolverCounterUnsat, 67 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 173.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 965 SdHoareTripleChecker+Valid, 1344 SdHoareTripleChecker+Invalid, 2997 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 2849 IncrementalHoareTripleChecker+Invalid, 67 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 184.9s IncrementalHoareTripleChecker+Time [2022-11-25 17:15:02,103 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [965 Valid, 1344 Invalid, 2997 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 2849 Invalid, 67 Unknown, 0 Unchecked, 184.9s Time] [2022-11-25 17:15:02,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2022-11-25 17:15:02,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 106. [2022-11-25 17:15:02,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 83 states have (on average 1.3012048192771084) internal successors, (108), 101 states have internal predecessors, (108), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-25 17:15:02,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 114 transitions. [2022-11-25 17:15:02,116 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 114 transitions. Word has length 57 [2022-11-25 17:15:02,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:15:02,117 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 114 transitions. [2022-11-25 17:15:02,117 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 66 states, 62 states have (on average 1.5483870967741935) internal successors, (96), 57 states have internal predecessors, (96), 5 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-11-25 17:15:02,117 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 114 transitions. [2022-11-25 17:15:02,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-25 17:15:02,118 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:15:02,119 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:15:02,131 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88e7b293-1926-49ea-8916-68815ea6b012/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-11-25 17:15:02,331 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88e7b293-1926-49ea-8916-68815ea6b012/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-11-25 17:15:02,331 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-11-25 17:15:02,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:15:02,331 INFO L85 PathProgramCache]: Analyzing trace with hash -1157560249, now seen corresponding path program 1 times [2022-11-25 17:15:02,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:15:02,332 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669078796] [2022-11-25 17:15:02,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:15:02,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:15:02,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:02,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:15:02,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:03,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-25 17:15:03,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:03,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-25 17:15:03,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:03,081 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-11-25 17:15:03,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:15:03,081 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669078796] [2022-11-25 17:15:03,081 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1669078796] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:15:03,082 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1306706533] [2022-11-25 17:15:03,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:15:03,082 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:15:03,082 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88e7b293-1926-49ea-8916-68815ea6b012/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:15:03,087 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88e7b293-1926-49ea-8916-68815ea6b012/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:15:03,097 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88e7b293-1926-49ea-8916-68815ea6b012/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-11-25 17:15:03,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:03,556 INFO L263 TraceCheckSpWp]: Trace formula consists of 527 conjuncts, 28 conjunts are in the unsatisfiable core [2022-11-25 17:15:03,559 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:15:03,871 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 17:15:04,879 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 17:15:05,092 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-11-25 17:15:05,355 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-25 17:15:05,355 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 17:15:05,356 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1306706533] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:15:05,356 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-25 17:15:05,356 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [7] total 17 [2022-11-25 17:15:05,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608066982] [2022-11-25 17:15:05,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:15:05,357 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-25 17:15:05,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:15:05,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-25 17:15:05,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=232, Unknown=0, NotChecked=0, Total=272 [2022-11-25 17:15:05,359 INFO L87 Difference]: Start difference. First operand 106 states and 114 transitions. Second operand has 11 states, 9 states have (on average 5.0) internal successors, (45), 10 states have internal predecessors, (45), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-25 17:15:08,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:15:08,491 INFO L93 Difference]: Finished difference Result 167 states and 178 transitions. [2022-11-25 17:15:08,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-25 17:15:08,492 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 5.0) internal successors, (45), 10 states have internal predecessors, (45), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 58 [2022-11-25 17:15:08,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:15:08,494 INFO L225 Difference]: With dead ends: 167 [2022-11-25 17:15:08,494 INFO L226 Difference]: Without dead ends: 167 [2022-11-25 17:15:08,495 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=73, Invalid=389, Unknown=0, NotChecked=0, Total=462 [2022-11-25 17:15:08,496 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 206 mSDsluCounter, 455 mSDsCounter, 0 mSdLazyCounter, 475 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 544 SdHoareTripleChecker+Invalid, 476 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 475 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-11-25 17:15:08,496 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [206 Valid, 544 Invalid, 476 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 475 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2022-11-25 17:15:08,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2022-11-25 17:15:08,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 107. [2022-11-25 17:15:08,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 84 states have (on average 1.3095238095238095) internal successors, (110), 102 states have internal predecessors, (110), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-25 17:15:08,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 116 transitions. [2022-11-25 17:15:08,502 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 116 transitions. Word has length 58 [2022-11-25 17:15:08,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:15:08,503 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 116 transitions. [2022-11-25 17:15:08,503 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 5.0) internal successors, (45), 10 states have internal predecessors, (45), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-25 17:15:08,503 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 116 transitions. [2022-11-25 17:15:08,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-25 17:15:08,504 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:15:08,505 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:15:08,513 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88e7b293-1926-49ea-8916-68815ea6b012/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-11-25 17:15:08,713 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88e7b293-1926-49ea-8916-68815ea6b012/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-11-25 17:15:08,714 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-11-25 17:15:08,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:15:08,714 INFO L85 PathProgramCache]: Analyzing trace with hash -1157560248, now seen corresponding path program 1 times [2022-11-25 17:15:08,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:15:08,715 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973846163] [2022-11-25 17:15:08,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:15:08,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:15:08,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:09,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:15:09,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:09,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-25 17:15:09,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:09,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-25 17:15:09,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:09,489 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-11-25 17:15:09,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:15:09,489 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973846163] [2022-11-25 17:15:09,489 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1973846163] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:15:09,490 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [735676015] [2022-11-25 17:15:09,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:15:09,490 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:15:09,490 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88e7b293-1926-49ea-8916-68815ea6b012/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:15:09,492 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88e7b293-1926-49ea-8916-68815ea6b012/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:15:09,499 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88e7b293-1926-49ea-8916-68815ea6b012/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-11-25 17:15:09,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:09,976 INFO L263 TraceCheckSpWp]: Trace formula consists of 527 conjuncts, 26 conjunts are in the unsatisfiable core [2022-11-25 17:15:09,978 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:15:10,002 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-25 17:15:10,260 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_5117 Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_5117))) (not (= |node_create_~temp~0#1.base| 0)))) is different from true [2022-11-25 17:15:10,413 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-25 17:15:10,491 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_5118 Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_5118))) (not (= |node_create_~temp~0#1.base| 0)))) is different from true [2022-11-25 17:15:10,643 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-25 17:15:10,800 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (not (= |node_create_~temp~0#1.base| 0)) (exists ((v_ArrVal_5119 Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_5119))))) is different from true [2022-11-25 17:15:10,953 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-25 17:15:10,996 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-25 17:15:11,152 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-25 17:15:11,153 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-11-25 17:15:11,184 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 21 not checked. [2022-11-25 17:15:11,185 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 17:15:14,117 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-11-25 17:15:14,117 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [735676015] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 17:15:14,118 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 17:15:14,118 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 7] total 17 [2022-11-25 17:15:14,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193847670] [2022-11-25 17:15:14,118 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 17:15:14,119 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-11-25 17:15:14,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:15:14,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-11-25 17:15:14,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=159, Unknown=3, NotChecked=84, Total=306 [2022-11-25 17:15:14,120 INFO L87 Difference]: Start difference. First operand 107 states and 116 transitions. Second operand has 18 states, 18 states have (on average 4.888888888888889) internal successors, (88), 15 states have internal predecessors, (88), 2 states have call successors, (9), 3 states have call predecessors, (9), 5 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-11-25 17:15:15,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:15:15,498 INFO L93 Difference]: Finished difference Result 82 states and 88 transitions. [2022-11-25 17:15:15,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-25 17:15:15,499 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 4.888888888888889) internal successors, (88), 15 states have internal predecessors, (88), 2 states have call successors, (9), 3 states have call predecessors, (9), 5 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 58 [2022-11-25 17:15:15,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:15:15,499 INFO L225 Difference]: With dead ends: 82 [2022-11-25 17:15:15,500 INFO L226 Difference]: Without dead ends: 82 [2022-11-25 17:15:15,500 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 106 SyntacticMatches, 7 SemanticMatches, 20 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=104, Invalid=247, Unknown=3, NotChecked=108, Total=462 [2022-11-25 17:15:15,500 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 266 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 266 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 462 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 231 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-25 17:15:15,501 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [266 Valid, 246 Invalid, 462 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 209 Invalid, 0 Unknown, 231 Unchecked, 1.0s Time] [2022-11-25 17:15:15,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-11-25 17:15:15,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2022-11-25 17:15:15,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 63 states have (on average 1.3015873015873016) internal successors, (82), 77 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-11-25 17:15:15,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 88 transitions. [2022-11-25 17:15:15,511 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 88 transitions. Word has length 58 [2022-11-25 17:15:15,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:15:15,511 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 88 transitions. [2022-11-25 17:15:15,512 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.888888888888889) internal successors, (88), 15 states have internal predecessors, (88), 2 states have call successors, (9), 3 states have call predecessors, (9), 5 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-11-25 17:15:15,512 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 88 transitions. [2022-11-25 17:15:15,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-11-25 17:15:15,513 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:15:15,513 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:15:15,520 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88e7b293-1926-49ea-8916-68815ea6b012/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-11-25 17:15:15,718 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88e7b293-1926-49ea-8916-68815ea6b012/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:15:15,719 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-11-25 17:15:15,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:15:15,719 INFO L85 PathProgramCache]: Analyzing trace with hash -1796531691, now seen corresponding path program 1 times [2022-11-25 17:15:15,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:15:15,719 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892912833] [2022-11-25 17:15:15,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:15:15,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:15:15,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:25,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:15:25,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:26,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-25 17:15:26,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:27,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-25 17:15:27,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:30,338 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 21 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-25 17:15:30,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:15:30,338 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892912833] [2022-11-25 17:15:30,338 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1892912833] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:15:30,338 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1759834303] [2022-11-25 17:15:30,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:15:30,338 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:15:30,339 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88e7b293-1926-49ea-8916-68815ea6b012/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:15:30,340 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88e7b293-1926-49ea-8916-68815ea6b012/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:15:30,341 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88e7b293-1926-49ea-8916-68815ea6b012/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-11-25 17:15:30,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:15:30,802 INFO L263 TraceCheckSpWp]: Trace formula consists of 535 conjuncts, 159 conjunts are in the unsatisfiable core [2022-11-25 17:15:30,808 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:15:30,838 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 17:15:31,286 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-25 17:15:32,539 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-25 17:15:32,539 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-25 17:15:33,630 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 17:15:34,272 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 17:15:35,332 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:15:35,444 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-25 17:15:35,445 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 29 [2022-11-25 17:15:36,691 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 17:15:36,750 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2022-11-25 17:15:37,521 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 17:15:37,521 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 53 treesize of output 48 [2022-11-25 17:15:37,563 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-25 17:15:38,966 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 17:15:38,966 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 46 treesize of output 43 [2022-11-25 17:15:38,980 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-25 17:15:39,678 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:15:39,679 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-25 17:15:39,757 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:15:39,758 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 39 treesize of output 30 [2022-11-25 17:15:41,209 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-25 17:15:41,210 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 32 [2022-11-25 17:15:41,230 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:15:41,231 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-25 17:15:41,245 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-25 17:15:41,257 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-25 17:15:44,708 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:15:44,760 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-25 17:15:44,760 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 77 treesize of output 65 [2022-11-25 17:15:44,868 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-11-25 17:15:44,869 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 28 [2022-11-25 17:15:44,883 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-25 17:15:44,965 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:15:44,970 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:15:45,056 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-11-25 17:15:45,057 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 33 [2022-11-25 17:15:45,123 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:15:45,124 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-11-25 17:15:51,339 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-25 17:15:51,340 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 2 case distinctions, treesize of input 127 treesize of output 94 [2022-11-25 17:15:51,368 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 35 treesize of output 30 [2022-11-25 17:15:51,399 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:15:51,400 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 27 treesize of output 27 [2022-11-25 17:15:51,416 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 20 [2022-11-25 17:15:52,258 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:15:52,259 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 43 treesize of output 39 [2022-11-25 17:15:52,286 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 18 treesize of output 20 [2022-11-25 17:15:52,405 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:15:52,406 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-11-25 17:15:52,454 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:15:52,455 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 43 treesize of output 39 [2022-11-25 17:15:52,494 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 18 treesize of output 20 [2022-11-25 17:15:52,518 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:15:52,518 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-11-25 17:15:53,225 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 33 [2022-11-25 17:15:53,249 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-25 17:15:53,273 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-25 17:15:53,926 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-11-25 17:15:53,938 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-25 17:15:54,976 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-25 17:15:55,527 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 9 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-25 17:15:55,527 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 17:15:56,495 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5446 (Array Int Int)) (v_ArrVal_5445 (Array Int Int)) (v_ArrVal_5447 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_5445) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_5447) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ 8 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_5446) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) is different from false [2022-11-25 17:15:59,897 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5442 (Array Int Int)) (v_ArrVal_5444 (Array Int Int)) (v_ArrVal_5438 Int) (v_ArrVal_5443 (Array Int Int)) (v_ArrVal_5446 (Array Int Int)) (v_ArrVal_5445 (Array Int Int)) (v_ArrVal_5437 (Array Int Int)) (v_ArrVal_5436 (Array Int Int)) (v_ArrVal_5447 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|) |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset| v_ArrVal_5438)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_5444) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_5445) (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_5436) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_5442) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_5447) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_5437) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_5443) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_5446) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8)))) is different from false [2022-11-25 17:16:00,005 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5442 (Array Int Int)) (v_ArrVal_5444 (Array Int Int)) (v_ArrVal_5438 Int) (v_ArrVal_5443 (Array Int Int)) (v_ArrVal_5446 (Array Int Int)) (v_ArrVal_5445 (Array Int Int)) (v_ArrVal_5437 (Array Int Int)) (v_ArrVal_5436 (Array Int Int)) (v_ArrVal_5447 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|) |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset| v_ArrVal_5438)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_5444) |c_ULTIMATE.start_dll_circular_insert_#t~mem11#1.base| v_ArrVal_5445) (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_5436) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_5442) |c_ULTIMATE.start_dll_circular_insert_#t~mem11#1.base| v_ArrVal_5447) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_5437) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_5443) |c_ULTIMATE.start_dll_circular_insert_#t~mem11#1.base| v_ArrVal_5446) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8)))) is different from false [2022-11-25 17:16:00,035 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5442 (Array Int Int)) (v_ArrVal_5444 (Array Int Int)) (v_ArrVal_5438 Int) (v_ArrVal_5443 (Array Int Int)) (v_ArrVal_5446 (Array Int Int)) (v_ArrVal_5445 (Array Int Int)) (v_ArrVal_5437 (Array Int Int)) (v_ArrVal_5436 (Array Int Int)) (v_ArrVal_5447 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset|))) (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|) |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset| v_ArrVal_5438)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_5444) .cse0 v_ArrVal_5445) (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_5436) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_5442) .cse0 v_ArrVal_5447) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ 8 (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_5437) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_5443) .cse0 v_ArrVal_5446) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) is different from false [2022-11-25 17:16:02,062 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5442 (Array Int Int)) (v_ArrVal_5444 (Array Int Int)) (v_ArrVal_5438 Int) (v_ArrVal_5443 (Array Int Int)) (v_ArrVal_5446 (Array Int Int)) (v_ArrVal_5445 (Array Int Int)) (v_ArrVal_5437 (Array Int Int)) (v_ArrVal_5436 (Array Int Int)) (v_ArrVal_5447 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset|))) (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset| v_ArrVal_5438)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_5444) .cse0 v_ArrVal_5445) (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_5436) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_5442) .cse0 v_ArrVal_5447) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_5437) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_5443) .cse0 v_ArrVal_5446) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8))))) is different from false [2022-11-25 17:16:25,307 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5442 (Array Int Int)) (v_ArrVal_5444 (Array Int Int)) (v_ArrVal_5438 Int) (v_ArrVal_5443 (Array Int Int)) (v_ArrVal_5446 (Array Int Int)) (v_ArrVal_5445 (Array Int Int)) (v_ArrVal_5437 (Array Int Int)) (v_ArrVal_5436 (Array Int Int)) (v_ArrVal_5447 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|)) (.cse1 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| .cse0) .cse1))) (select (select (store (store (store |c_#memory_int| .cse0 (store (select |c_#memory_int| .cse0) .cse1 v_ArrVal_5438)) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_5444) .cse2 v_ArrVal_5445) (select (select (store (store (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_5436) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_5442) .cse2 v_ArrVal_5447) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_5437) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_5443) .cse2 v_ArrVal_5446) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8)))))) is different from false [2022-11-25 17:16:25,850 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5438 Int) (v_ArrVal_5460 (Array Int Int)) (v_ArrVal_5462 (Array Int Int)) (v_ArrVal_5461 (Array Int Int)) (v_ArrVal_5442 (Array Int Int)) (v_ArrVal_5444 (Array Int Int)) (v_ArrVal_5443 (Array Int Int)) (v_ArrVal_5446 (Array Int Int)) (v_ArrVal_5445 (Array Int Int)) (v_ArrVal_5437 (Array Int Int)) (v_ArrVal_5436 (Array Int Int)) (v_ArrVal_5447 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_31| Int)) (or (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse5 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_31| v_ArrVal_5462)) (.cse4 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_31| v_ArrVal_5461))) (let ((.cse1 (select (select .cse4 |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|)) (.cse2 (select (select .cse5 |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|))) (let ((.cse3 (select (select .cse4 .cse1) .cse2))) (select (select (store (store (let ((.cse0 (store |c_#memory_int| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_31| v_ArrVal_5460))) (store .cse0 .cse1 (store (select .cse0 .cse1) .cse2 v_ArrVal_5438))) |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_31| v_ArrVal_5444) .cse3 v_ArrVal_5445) (select (select (store (store (store .cse4 .cse1 v_ArrVal_5436) |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_31| v_ArrVal_5442) .cse3 v_ArrVal_5447) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store (store (store .cse5 .cse1 v_ArrVal_5437) |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_31| v_ArrVal_5443) .cse3 v_ArrVal_5446) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8)))))) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_31|))) (not (< |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_31| |c_#StackHeapBarrier|)))) is different from false [2022-11-25 17:16:25,859 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1759834303] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:16:25,860 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 17:16:25,860 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 36] total 72 [2022-11-25 17:16:25,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80729853] [2022-11-25 17:16:25,860 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 17:16:25,861 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 72 states [2022-11-25 17:16:25,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:16:25,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2022-11-25 17:16:25,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=5481, Unknown=123, NotChecked=1092, Total=6972 [2022-11-25 17:16:25,864 INFO L87 Difference]: Start difference. First operand 82 states and 88 transitions. Second operand has 72 states, 68 states have (on average 1.5294117647058822) internal successors, (104), 63 states have internal predecessors, (104), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-25 17:17:09,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:17:09,009 INFO L93 Difference]: Finished difference Result 101 states and 107 transitions. [2022-11-25 17:17:09,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-11-25 17:17:09,010 INFO L78 Accepts]: Start accepts. Automaton has has 72 states, 68 states have (on average 1.5294117647058822) internal successors, (104), 63 states have internal predecessors, (104), 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-11-25 17:17:09,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:17:09,010 INFO L225 Difference]: With dead ends: 101 [2022-11-25 17:17:09,010 INFO L226 Difference]: Without dead ends: 101 [2022-11-25 17:17:09,012 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 36 SyntacticMatches, 2 SemanticMatches, 106 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 1785 ImplicationChecksByTransitivity, 87.2s TimeCoverageRelationStatistics Valid=737, Invalid=9260, Unknown=131, NotChecked=1428, Total=11556 [2022-11-25 17:17:09,013 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 820 mSDsluCounter, 1169 mSDsCounter, 0 mSdLazyCounter, 2428 mSolverCounterSat, 61 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 820 SdHoareTripleChecker+Valid, 1201 SdHoareTripleChecker+Invalid, 2491 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 2428 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.3s IncrementalHoareTripleChecker+Time [2022-11-25 17:17:09,013 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [820 Valid, 1201 Invalid, 2491 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 2428 Invalid, 2 Unknown, 0 Unchecked, 13.3s Time] [2022-11-25 17:17:09,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2022-11-25 17:17:09,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 82. [2022-11-25 17:17:09,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 63 states have (on average 1.2857142857142858) internal successors, (81), 77 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-11-25 17:17:09,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 87 transitions. [2022-11-25 17:17:09,016 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 87 transitions. Word has length 59 [2022-11-25 17:17:09,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:17:09,016 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 87 transitions. [2022-11-25 17:17:09,016 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 72 states, 68 states have (on average 1.5294117647058822) internal successors, (104), 63 states have internal predecessors, (104), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-25 17:17:09,017 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 87 transitions. [2022-11-25 17:17:09,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-11-25 17:17:09,017 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:17:09,018 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:17:09,026 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88e7b293-1926-49ea-8916-68815ea6b012/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-11-25 17:17:09,227 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88e7b293-1926-49ea-8916-68815ea6b012/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:17:09,227 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-11-25 17:17:09,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:17:09,227 INFO L85 PathProgramCache]: Analyzing trace with hash -1760535007, now seen corresponding path program 1 times [2022-11-25 17:17:09,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:17:09,227 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26720728] [2022-11-25 17:17:09,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:17:09,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:17:09,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:17:16,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:17:16,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:17:17,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-25 17:17:17,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:17:18,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-25 17:17:18,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:17:20,663 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 7 proven. 17 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-25 17:17:20,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:17:20,664 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26720728] [2022-11-25 17:17:20,664 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [26720728] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:17:20,664 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2100718458] [2022-11-25 17:17:20,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:17:20,665 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:17:20,665 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88e7b293-1926-49ea-8916-68815ea6b012/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:17:20,666 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88e7b293-1926-49ea-8916-68815ea6b012/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:17:20,669 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88e7b293-1926-49ea-8916-68815ea6b012/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-11-25 17:17:21,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:17:21,131 INFO L263 TraceCheckSpWp]: Trace formula consists of 559 conjuncts, 135 conjunts are in the unsatisfiable core [2022-11-25 17:17:21,138 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:17:21,158 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 17:17:21,203 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-25 17:17:22,427 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-25 17:17:22,427 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-25 17:17:23,369 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 17:17:24,479 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:17:24,566 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-25 17:17:24,567 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 29 [2022-11-25 17:17:25,722 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 17:17:26,482 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 17:17:26,482 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 43 treesize of output 40 [2022-11-25 17:17:27,878 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 17:17:27,878 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 36 treesize of output 35 [2022-11-25 17:17:28,434 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:17:28,435 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 39 treesize of output 30 [2022-11-25 17:17:29,776 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-25 17:17:29,776 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 58 treesize of output 25 [2022-11-25 17:17:29,797 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:17:29,798 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-25 17:17:29,812 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-25 17:17:32,974 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:17:33,029 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-25 17:17:33,029 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 66 treesize of output 56 [2022-11-25 17:17:33,099 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:17:33,104 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:17:33,280 INFO L321 Elim1Store]: treesize reduction 72, result has 37.4 percent of original size [2022-11-25 17:17:33,280 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 39 treesize of output 65 [2022-11-25 17:17:33,368 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:17:33,369 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-11-25 17:17:39,469 INFO L321 Elim1Store]: treesize reduction 32, result has 25.6 percent of original size [2022-11-25 17:17:39,469 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 4 new quantified variables, introduced 4 case distinctions, treesize of input 128 treesize of output 72 [2022-11-25 17:17:39,528 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:17:39,529 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 33 treesize of output 33 [2022-11-25 17:17:40,364 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:17:40,367 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-11-25 17:17:40,434 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:17:40,485 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-25 17:17:40,485 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 52 treesize of output 52 [2022-11-25 17:17:40,692 INFO L321 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-11-25 17:17:40,692 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 109 treesize of output 82 [2022-11-25 17:17:40,788 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:17:40,789 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-11-25 17:17:41,547 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-25 17:17:41,548 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 87 treesize of output 69 [2022-11-25 17:17:41,608 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-11-25 17:17:42,513 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-11-25 17:17:44,211 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-25 17:17:44,212 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 92 treesize of output 39 [2022-11-25 17:17:45,754 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 16 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-25 17:17:45,754 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 17:17:47,110 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5765 (Array Int Int)) (v_ArrVal_5764 (Array Int Int)) (v_ArrVal_5767 (Array Int Int)) (v_ArrVal_5766 (Array Int Int))) (= (select |c_#valid| (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_5764) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_5767))) (select .cse0 (select (select .cse0 |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_circular_insert_~new_node~0#1.base| v_ArrVal_5765) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_5766) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) 1)) is different from false [2022-11-25 17:17:48,620 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5761 (Array Int Int)) (v_ArrVal_5765 (Array Int Int)) (v_ArrVal_5764 (Array Int Int)) (v_ArrVal_5767 (Array Int Int)) (v_ArrVal_5766 (Array Int Int))) (= (select |c_#valid| (select (let ((.cse0 (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|) |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_5764) |c_ULTIMATE.start_dll_circular_insert_#t~mem11#1.base| v_ArrVal_5767))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_5761) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_5765) |c_ULTIMATE.start_dll_circular_insert_#t~mem11#1.base| v_ArrVal_5766) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) 1)) is different from false [2022-11-25 17:17:48,663 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5761 (Array Int Int)) (v_ArrVal_5765 (Array Int Int)) (v_ArrVal_5764 (Array Int Int)) (v_ArrVal_5767 (Array Int Int)) (v_ArrVal_5766 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset|))) (select (let ((.cse0 (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|) |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_5764) .cse1 v_ArrVal_5767))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_5761) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_5765) .cse1 v_ArrVal_5766) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) 1)) is different from false [2022-11-25 17:17:50,316 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5761 (Array Int Int)) (v_ArrVal_5765 (Array Int Int)) (v_ArrVal_5764 (Array Int Int)) (v_ArrVal_5767 (Array Int Int)) (v_ArrVal_5766 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_#t~mem10#1.base|))) (let ((.cse2 (select .cse1 |c_ULTIMATE.start_dll_circular_insert_#t~mem10#1.offset|))) (select (let ((.cse0 (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_#t~mem10#1.base| (store .cse1 |c_ULTIMATE.start_dll_circular_insert_#t~mem10#1.offset| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_5764) .cse2 v_ArrVal_5767))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_insert_#t~mem10#1.base| v_ArrVal_5761) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_5765) .cse2 v_ArrVal_5766) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) 1)) is different from false [2022-11-25 17:17:50,385 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5761 (Array Int Int)) (v_ArrVal_5765 (Array Int Int)) (v_ArrVal_5764 (Array Int Int)) (v_ArrVal_5767 (Array Int Int)) (v_ArrVal_5766 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|))) (let ((.cse2 (select |c_#memory_$Pointer$.base| .cse1)) (.cse3 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|))) (let ((.cse4 (select .cse2 .cse3))) (select (let ((.cse0 (store (store (store |c_#memory_$Pointer$.base| .cse1 (store .cse2 .cse3 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_5764) .cse4 v_ArrVal_5767))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_5761) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_5765) .cse4 v_ArrVal_5766) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) 1)) is different from false [2022-11-25 17:17:52,407 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5761 (Array Int Int)) (v_ArrVal_5765 (Array Int Int)) (v_ArrVal_5764 (Array Int Int)) (v_ArrVal_5767 (Array Int Int)) (v_ArrVal_5766 (Array Int Int))) (= 1 (select |c_#valid| (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|))) (let ((.cse2 (select |c_#memory_$Pointer$.base| .cse1)) (.cse3 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|))) (let ((.cse4 (select .cse2 .cse3))) (select (let ((.cse0 (store (store (store |c_#memory_$Pointer$.base| .cse1 (store .cse2 .cse3 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|)) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_5764) .cse4 v_ArrVal_5767))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_5761) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_5765) .cse4 v_ArrVal_5766) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))))) is different from false [2022-11-25 17:17:52,880 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5761 (Array Int Int)) (v_ArrVal_5765 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_34| Int) (v_ArrVal_5764 (Array Int Int)) (v_ArrVal_5778 (Array Int Int)) (v_ArrVal_5767 (Array Int Int)) (v_ArrVal_5777 (Array Int Int)) (v_ArrVal_5766 (Array Int Int))) (or (not (< |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_34| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_34|) 0)) (= (select (store |c_#valid| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_34| 1) (let ((.cse1 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_34| v_ArrVal_5777))) (let ((.cse6 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_34| v_ArrVal_5778)) (.cse2 (select (select .cse1 |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|))) (let ((.cse3 (select .cse1 .cse2)) (.cse4 (select (select .cse6 |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|))) (let ((.cse5 (select .cse3 .cse4))) (select (let ((.cse0 (store (store (store .cse1 .cse2 (store .cse3 .cse4 |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_34|)) |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_34| v_ArrVal_5764) .cse5 v_ArrVal_5767))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (store (store .cse6 .cse2 v_ArrVal_5761) |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_34| v_ArrVal_5765) .cse5 v_ArrVal_5766) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))))) 1))) is different from false [2022-11-25 17:17:52,887 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2100718458] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:17:52,887 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 17:17:52,887 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 35] total 70 [2022-11-25 17:17:52,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395310577] [2022-11-25 17:17:52,887 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 17:17:52,888 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 71 states [2022-11-25 17:17:52,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:17:52,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2022-11-25 17:17:52,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=275, Invalid=5013, Unknown=142, NotChecked=1050, Total=6480 [2022-11-25 17:17:52,890 INFO L87 Difference]: Start difference. First operand 82 states and 87 transitions. Second operand has 71 states, 67 states have (on average 1.671641791044776) internal successors, (112), 62 states have internal predecessors, (112), 5 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-11-25 17:18:27,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:18:27,251 INFO L93 Difference]: Finished difference Result 139 states and 148 transitions. [2022-11-25 17:18:27,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-11-25 17:18:27,252 INFO L78 Accepts]: Start accepts. Automaton has has 71 states, 67 states have (on average 1.671641791044776) internal successors, (112), 62 states have internal predecessors, (112), 5 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 63 [2022-11-25 17:18:27,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:18:27,253 INFO L225 Difference]: With dead ends: 139 [2022-11-25 17:18:27,253 INFO L226 Difference]: Without dead ends: 139 [2022-11-25 17:18:27,255 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 45 SyntacticMatches, 3 SemanticMatches, 98 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 1720 ImplicationChecksByTransitivity, 53.6s TimeCoverageRelationStatistics Valid=689, Invalid=7751, Unknown=144, NotChecked=1316, Total=9900 [2022-11-25 17:18:27,255 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 1297 mSDsluCounter, 911 mSDsCounter, 0 mSdLazyCounter, 2267 mSolverCounterSat, 64 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1297 SdHoareTripleChecker+Valid, 940 SdHoareTripleChecker+Invalid, 2333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 2267 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.2s IncrementalHoareTripleChecker+Time [2022-11-25 17:18:27,256 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1297 Valid, 940 Invalid, 2333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 2267 Invalid, 2 Unknown, 0 Unchecked, 13.2s Time] [2022-11-25 17:18:27,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2022-11-25 17:18:27,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 86. [2022-11-25 17:18:27,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 67 states have (on average 1.2985074626865671) internal successors, (87), 81 states have internal predecessors, (87), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-25 17:18:27,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 93 transitions. [2022-11-25 17:18:27,260 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 93 transitions. Word has length 63 [2022-11-25 17:18:27,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:18:27,260 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 93 transitions. [2022-11-25 17:18:27,261 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 71 states, 67 states have (on average 1.671641791044776) internal successors, (112), 62 states have internal predecessors, (112), 5 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-11-25 17:18:27,261 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 93 transitions. [2022-11-25 17:18:27,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-11-25 17:18:27,261 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:18:27,262 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:18:27,275 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88e7b293-1926-49ea-8916-68815ea6b012/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-11-25 17:18:27,475 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88e7b293-1926-49ea-8916-68815ea6b012/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2022-11-25 17:18:27,475 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-11-25 17:18:27,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:18:27,476 INFO L85 PathProgramCache]: Analyzing trace with hash -1760535006, now seen corresponding path program 1 times [2022-11-25 17:18:27,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:18:27,476 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506376731] [2022-11-25 17:18:27,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:18:27,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:18:27,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:18:35,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:18:35,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:18:36,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-25 17:18:36,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:18:37,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-25 17:18:37,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:18:41,798 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 4 proven. 20 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-25 17:18:41,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:18:41,799 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506376731] [2022-11-25 17:18:41,799 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1506376731] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:18:41,799 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [522154842] [2022-11-25 17:18:41,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:18:41,799 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:18:41,799 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88e7b293-1926-49ea-8916-68815ea6b012/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:18:41,800 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88e7b293-1926-49ea-8916-68815ea6b012/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:18:41,807 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88e7b293-1926-49ea-8916-68815ea6b012/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-11-25 17:18:42,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:18:42,272 INFO L263 TraceCheckSpWp]: Trace formula consists of 559 conjuncts, 144 conjunts are in the unsatisfiable core [2022-11-25 17:18:42,277 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:18:42,298 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 17:18:42,341 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-25 17:18:43,634 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-25 17:18:43,634 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-25 17:18:44,592 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 17:18:45,695 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:18:45,783 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-25 17:18:45,783 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 29 [2022-11-25 17:18:47,020 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 17:18:47,812 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 17:18:47,813 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 43 treesize of output 40 [2022-11-25 17:18:49,334 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 17:18:49,334 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 36 treesize of output 35 [2022-11-25 17:18:49,940 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:18:49,941 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 30 [2022-11-25 17:18:51,259 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-25 17:18:51,260 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 58 treesize of output 25 [2022-11-25 17:18:51,279 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:18:51,280 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-25 17:18:51,293 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-25 17:18:54,492 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:18:54,493 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-25 17:18:54,529 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:18:54,581 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-25 17:18:54,581 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 66 treesize of output 56 [2022-11-25 17:18:54,656 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:18:54,662 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:18:54,747 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-11-25 17:18:54,748 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 33 [2022-11-25 17:19:00,535 INFO L321 Elim1Store]: treesize reduction 32, result has 25.6 percent of original size [2022-11-25 17:19:00,535 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 4 new quantified variables, introduced 4 case distinctions, treesize of input 119 treesize of output 71 [2022-11-25 17:19:00,567 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:19:00,568 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 36 [2022-11-25 17:19:01,389 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:19:01,441 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-25 17:19:01,441 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 54 treesize of output 54 [2022-11-25 17:19:01,483 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:19:01,489 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:19:01,489 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-11-25 17:19:01,732 INFO L321 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-11-25 17:19:01,732 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 121 treesize of output 92 [2022-11-25 17:19:01,773 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:19:01,778 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:19:01,779 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 56 treesize of output 55 [2022-11-25 17:19:02,654 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-25 17:19:02,654 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 99 treesize of output 79 [2022-11-25 17:19:02,697 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:19:02,698 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 0 case distinctions, treesize of input 48 treesize of output 47 [2022-11-25 17:19:05,283 INFO L321 Elim1Store]: treesize reduction 17, result has 15.0 percent of original size [2022-11-25 17:19:05,283 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 103 treesize of output 53 [2022-11-25 17:19:05,302 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:19:05,330 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-25 17:19:05,330 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 23 [2022-11-25 17:19:06,617 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 9 proven. 17 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-25 17:19:06,617 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 17:19:09,915 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_6083 (Array Int Int)) (v_ArrVal_6082 (Array Int Int))) (<= 0 (+ (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_6082))) (select (select .cse0 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_6083) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) 8))) (forall ((v_ArrVal_6083 (Array Int Int)) (v_ArrVal_6082 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_6082)) (.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_6083))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (<= (+ (select (select .cse1 .cse2) .cse3) 12) (select |c_#length| (select (select .cse4 .cse2) .cse3))))))) is different from false [2022-11-25 17:19:21,518 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 17:19:21,519 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 633 treesize of output 637 [2022-11-25 17:19:25,155 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [522154842] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:19:25,156 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 17:19:25,156 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 36] total 71 [2022-11-25 17:19:25,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171465089] [2022-11-25 17:19:25,156 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 17:19:25,156 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 72 states [2022-11-25 17:19:25,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:19:25,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2022-11-25 17:19:25,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=277, Invalid=7013, Unknown=24, NotChecked=168, Total=7482 [2022-11-25 17:19:25,158 INFO L87 Difference]: Start difference. First operand 86 states and 93 transitions. Second operand has 72 states, 68 states have (on average 1.6470588235294117) internal successors, (112), 63 states have internal predecessors, (112), 5 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-11-25 17:20:09,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:20:09,762 INFO L93 Difference]: Finished difference Result 155 states and 165 transitions. [2022-11-25 17:20:09,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-11-25 17:20:09,762 INFO L78 Accepts]: Start accepts. Automaton has has 72 states, 68 states have (on average 1.6470588235294117) internal successors, (112), 63 states have internal predecessors, (112), 5 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 63 [2022-11-25 17:20:09,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:20:09,764 INFO L225 Difference]: With dead ends: 155 [2022-11-25 17:20:09,764 INFO L226 Difference]: Without dead ends: 155 [2022-11-25 17:20:09,766 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 40 SyntacticMatches, 2 SemanticMatches, 106 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2070 ImplicationChecksByTransitivity, 74.0s TimeCoverageRelationStatistics Valid=748, Invalid=10574, Unknown=24, NotChecked=210, Total=11556 [2022-11-25 17:20:09,766 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 1750 mSDsluCounter, 1041 mSDsCounter, 0 mSdLazyCounter, 2714 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1750 SdHoareTripleChecker+Valid, 1070 SdHoareTripleChecker+Invalid, 2773 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 2714 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.6s IncrementalHoareTripleChecker+Time [2022-11-25 17:20:09,767 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1750 Valid, 1070 Invalid, 2773 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 2714 Invalid, 0 Unknown, 0 Unchecked, 15.6s Time] [2022-11-25 17:20:09,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2022-11-25 17:20:09,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 88. [2022-11-25 17:20:09,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 69 states have (on average 1.289855072463768) internal successors, (89), 83 states have internal predecessors, (89), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-25 17:20:09,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 95 transitions. [2022-11-25 17:20:09,771 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 95 transitions. Word has length 63 [2022-11-25 17:20:09,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:20:09,771 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 95 transitions. [2022-11-25 17:20:09,771 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 72 states, 68 states have (on average 1.6470588235294117) internal successors, (112), 63 states have internal predecessors, (112), 5 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-11-25 17:20:09,772 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 95 transitions. [2022-11-25 17:20:09,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-11-25 17:20:09,772 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:20:09,772 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:20:09,780 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88e7b293-1926-49ea-8916-68815ea6b012/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-11-25 17:20:09,980 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88e7b293-1926-49ea-8916-68815ea6b012/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:20:09,980 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-11-25 17:20:09,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:20:09,981 INFO L85 PathProgramCache]: Analyzing trace with hash 1257988692, now seen corresponding path program 1 times [2022-11-25 17:20:09,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:20:09,981 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20157268] [2022-11-25 17:20:09,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:20:09,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:20:10,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:20:20,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:20:20,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:20:21,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-25 17:20:21,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:20:22,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-25 17:20:22,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:20:27,689 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 11 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-25 17:20:27,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:20:27,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20157268] [2022-11-25 17:20:27,690 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [20157268] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:20:27,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1226211784] [2022-11-25 17:20:27,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:20:27,690 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:20:27,690 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88e7b293-1926-49ea-8916-68815ea6b012/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:20:27,691 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88e7b293-1926-49ea-8916-68815ea6b012/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:20:27,693 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88e7b293-1926-49ea-8916-68815ea6b012/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-11-25 17:20:28,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:20:28,174 INFO L263 TraceCheckSpWp]: Trace formula consists of 563 conjuncts, 135 conjunts are in the unsatisfiable core [2022-11-25 17:20:28,179 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:20:28,206 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 17:20:28,607 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-25 17:20:29,954 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-25 17:20:29,955 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-25 17:20:31,061 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 17:20:32,262 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:20:32,350 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-25 17:20:32,350 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 29 [2022-11-25 17:20:33,596 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 17:20:34,393 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 17:20:34,394 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 43 treesize of output 40 [2022-11-25 17:20:35,848 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 17:20:35,848 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 36 treesize of output 35 [2022-11-25 17:20:36,563 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:20:36,564 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 39 treesize of output 30 [2022-11-25 17:20:38,041 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-25 17:20:38,041 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 58 treesize of output 25 [2022-11-25 17:20:38,056 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-25 17:20:38,075 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:20:38,076 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-25 17:20:41,474 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:20:41,475 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-25 17:20:41,503 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:20:41,560 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-25 17:20:41,560 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 66 treesize of output 56 [2022-11-25 17:20:41,610 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:20:41,615 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:20:41,703 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-11-25 17:20:41,704 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 33 [2022-11-25 17:20:47,587 INFO L321 Elim1Store]: treesize reduction 32, result has 25.6 percent of original size [2022-11-25 17:20:47,588 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 4 new quantified variables, introduced 4 case distinctions, treesize of input 106 treesize of output 62 [2022-11-25 17:20:47,631 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:20:47,632 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 33 treesize of output 33 [2022-11-25 17:20:48,382 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:20:48,383 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-11-25 17:20:48,451 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:20:48,524 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-25 17:20:48,524 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 43 treesize of output 45 [2022-11-25 17:20:48,735 INFO L321 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-11-25 17:20:48,735 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 87 treesize of output 68 [2022-11-25 17:20:48,788 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:20:48,789 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-11-25 17:20:49,617 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-25 17:20:49,617 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 65 treesize of output 55 [2022-11-25 17:20:49,665 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-11-25 17:20:50,428 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-25 17:20:53,114 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-25 17:20:53,114 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 57 treesize of output 24 [2022-11-25 17:20:53,126 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 9 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-25 17:20:53,126 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 17:20:54,134 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6397 (Array Int Int)) (v_ArrVal_6396 (Array Int Int)) (v_ArrVal_6395 (Array Int Int)) (v_ArrVal_6394 (Array Int Int))) (not (let ((.cse1 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_6394) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_6397))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse0 (select (select .cse1 .cse0) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_6395) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_6396) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))))) is different from false [2022-11-25 17:20:54,171 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6397 (Array Int Int)) (v_ArrVal_6396 (Array Int Int)) (v_ArrVal_6390 (Array Int Int)) (v_ArrVal_6395 (Array Int Int)) (v_ArrVal_6394 (Array Int Int))) (not (let ((.cse1 (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|) |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_6394) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_6397))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse0 (select (select .cse1 .cse0) (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_6390) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_6395) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_6396) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))))) is different from false [2022-11-25 17:20:54,218 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6397 (Array Int Int)) (v_ArrVal_6396 (Array Int Int)) (v_ArrVal_6390 (Array Int Int)) (v_ArrVal_6395 (Array Int Int)) (v_ArrVal_6394 (Array Int Int))) (not (let ((.cse0 (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|) |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_6394) |c_ULTIMATE.start_dll_circular_insert_#t~mem11#1.base| v_ArrVal_6397))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select .cse0 .cse1) (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_6390) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_6395) |c_ULTIMATE.start_dll_circular_insert_#t~mem11#1.base| v_ArrVal_6396) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1))))) is different from false [2022-11-25 17:20:54,244 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6397 (Array Int Int)) (v_ArrVal_6396 (Array Int Int)) (v_ArrVal_6390 (Array Int Int)) (v_ArrVal_6395 (Array Int Int)) (v_ArrVal_6394 (Array Int Int))) (not (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset|))) (let ((.cse0 (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|) |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_6394) .cse2 v_ArrVal_6397))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select .cse0 .cse1) (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_6390) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_6395) .cse2 v_ArrVal_6396) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1)))))) is different from false [2022-11-25 17:20:54,277 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6397 (Array Int Int)) (v_ArrVal_6396 (Array Int Int)) (v_ArrVal_6390 (Array Int Int)) (v_ArrVal_6395 (Array Int Int)) (v_ArrVal_6394 (Array Int Int))) (not (let ((.cse3 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|))) (let ((.cse2 (select .cse3 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset|))) (let ((.cse0 (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| (store .cse3 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_6394) .cse2 v_ArrVal_6397))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select .cse0 .cse1) (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_6390) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_6395) .cse2 v_ArrVal_6396) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1))))))) is different from false [2022-11-25 17:20:54,316 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6397 (Array Int Int)) (v_ArrVal_6396 (Array Int Int)) (v_ArrVal_6390 (Array Int Int)) (v_ArrVal_6395 (Array Int Int)) (v_ArrVal_6394 (Array Int Int))) (not (let ((.cse3 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_#t~mem10#1.base|))) (let ((.cse2 (select .cse3 |c_ULTIMATE.start_dll_circular_insert_#t~mem10#1.offset|))) (let ((.cse0 (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_#t~mem10#1.base| (store .cse3 |c_ULTIMATE.start_dll_circular_insert_#t~mem10#1.offset| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_6394) .cse2 v_ArrVal_6397))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select .cse0 .cse1) (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_insert_#t~mem10#1.base| v_ArrVal_6390) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_6395) .cse2 v_ArrVal_6396) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1))))))) is different from false [2022-11-25 17:20:56,361 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6397 (Array Int Int)) (v_ArrVal_6396 (Array Int Int)) (v_ArrVal_6390 (Array Int Int)) (v_ArrVal_6395 (Array Int Int)) (v_ArrVal_6394 (Array Int Int))) (not (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|))) (let ((.cse4 (select |c_#memory_$Pointer$.base| .cse2)) (.cse5 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|))) (let ((.cse3 (select .cse4 .cse5))) (let ((.cse0 (store (store (store |c_#memory_$Pointer$.base| .cse2 (store .cse4 .cse5 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|)) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_6394) .cse3 v_ArrVal_6397))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select .cse0 .cse1) (select (select (store (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_6390) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_6395) .cse3 v_ArrVal_6396) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1)))))))) is different from false [2022-11-25 17:20:56,780 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6397 (Array Int Int)) (v_ArrVal_6396 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_40| Int) (v_ArrVal_6407 (Array Int Int)) (v_ArrVal_6406 (Array Int Int)) (v_ArrVal_6390 (Array Int Int)) (v_ArrVal_6395 (Array Int Int)) (v_ArrVal_6394 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_40|) 0)) (not (let ((.cse5 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_40| v_ArrVal_6406))) (let ((.cse2 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_40| v_ArrVal_6407)) (.cse3 (select (select .cse5 |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|))) (let ((.cse6 (select .cse5 .cse3)) (.cse7 (select (select .cse2 |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|))) (let ((.cse4 (select .cse6 .cse7))) (let ((.cse1 (store (store (store .cse5 .cse3 (store .cse6 .cse7 |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_40|)) |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_40| v_ArrVal_6394) .cse4 v_ArrVal_6397))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse0 (select (select .cse1 .cse0) (select (select (store (store (store .cse2 .cse3 v_ArrVal_6390) |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_40| v_ArrVal_6395) .cse4 v_ArrVal_6396) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))))))) (not (< |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_40| |c_#StackHeapBarrier|)))) is different from false [2022-11-25 17:20:56,787 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1226211784] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:20:56,787 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 17:20:56,787 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 37] total 73 [2022-11-25 17:20:56,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293673962] [2022-11-25 17:20:56,788 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 17:20:56,788 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 73 states [2022-11-25 17:20:56,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:20:56,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2022-11-25 17:20:56,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=242, Invalid=5230, Unknown=110, NotChecked=1224, Total=6806 [2022-11-25 17:20:56,791 INFO L87 Difference]: Start difference. First operand 88 states and 95 transitions. Second operand has 73 states, 69 states have (on average 1.6231884057971016) internal successors, (112), 64 states have internal predecessors, (112), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-25 17:21:46,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:21:46,224 INFO L93 Difference]: Finished difference Result 109 states and 115 transitions. [2022-11-25 17:21:46,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-11-25 17:21:46,224 INFO L78 Accepts]: Start accepts. Automaton has has 73 states, 69 states have (on average 1.6231884057971016) internal successors, (112), 64 states have internal predecessors, (112), 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 64 [2022-11-25 17:21:46,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:21:46,225 INFO L225 Difference]: With dead ends: 109 [2022-11-25 17:21:46,225 INFO L226 Difference]: Without dead ends: 109 [2022-11-25 17:21:46,227 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 48 SyntacticMatches, 2 SemanticMatches, 107 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 1938 ImplicationChecksByTransitivity, 68.5s TimeCoverageRelationStatistics Valid=724, Invalid=9290, Unknown=118, NotChecked=1640, Total=11772 [2022-11-25 17:21:46,227 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 779 mSDsluCounter, 1071 mSDsCounter, 0 mSdLazyCounter, 2716 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 779 SdHoareTripleChecker+Valid, 1101 SdHoareTripleChecker+Invalid, 2774 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 2716 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.4s IncrementalHoareTripleChecker+Time [2022-11-25 17:21:46,228 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [779 Valid, 1101 Invalid, 2774 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 2716 Invalid, 0 Unknown, 0 Unchecked, 15.4s Time] [2022-11-25 17:21:46,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2022-11-25 17:21:46,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 88. [2022-11-25 17:21:46,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 69 states have (on average 1.2753623188405796) internal successors, (88), 83 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-11-25 17:21:46,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 94 transitions. [2022-11-25 17:21:46,232 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 94 transitions. Word has length 64 [2022-11-25 17:21:46,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:21:46,232 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 94 transitions. [2022-11-25 17:21:46,233 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 73 states, 69 states have (on average 1.6231884057971016) internal successors, (112), 64 states have internal predecessors, (112), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-25 17:21:46,233 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 94 transitions. [2022-11-25 17:21:46,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-11-25 17:21:46,234 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:21:46,234 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:21:46,244 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88e7b293-1926-49ea-8916-68815ea6b012/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-11-25 17:21:46,443 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88e7b293-1926-49ea-8916-68815ea6b012/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:21:46,444 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-11-25 17:21:46,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:21:46,444 INFO L85 PathProgramCache]: Analyzing trace with hash 342976484, now seen corresponding path program 1 times [2022-11-25 17:21:46,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:21:46,444 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388670104] [2022-11-25 17:21:46,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:21:46,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:21:46,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat